• XS is a Perl foreign function interface through which a program can call a C or C++ subroutine. XS or xsub is an abbreviation of "eXtendable Subroutine"...
    6 KB (657 words) - 08:01, 28 September 2023
  • television series XS: The Opera Opus (1984-6) no wave opera XS (Perl), an interface through which computer programs written in Perl can call C language...
    1 KB (183 words) - 05:55, 4 March 2024
  • Thumbnail for Perl
    Perl is a high-level, general-purpose, interpreted, dynamic programming language. Though Perl is not officially an acronym, there are various backronyms...
    99 KB (9,767 words) - 21:45, 19 June 2025
  • Perl environment; however, certain modules (XS modules) require a working C compiler and development environment to install successfully. Most Perl distributions...
    3 KB (340 words) - 14:40, 6 January 2025
  • Append (category Articles with example Perl code)
    :: [a] -> [a] -> [a] append xs ys = foldr (:) ys xs This is essentially a reimplementation of Haskell's ++ operator. In Perl, the push function is equivalent...
    6 KB (717 words) - 01:54, 27 June 2024
  • vectorization of simple C snippets and interfaces them with the Perl host language via Perl's XS compiler. Some modules are written in Fortran, with a C/PP...
    8 KB (964 words) - 07:45, 3 December 2023
  • (x:xs) = quickSort [a | a <- xs, a < x] -- Sort the left part of the list ++ [x] ++ -- Insert pivot between two sorted parts quickSort [a | a <- xs, a...
    50 KB (4,584 words) - 23:45, 3 June 2025
  • <xs:element name="cardsuit"> <xs:simpleType> <xs:restriction base="xs:string"> <xs:enumeration value="Clubs"/> <xs:enumeration value="Diamonds"/> <xs:enumeration...
    36 KB (4,369 words) - 16:54, 20 June 2025
  • Thumbnail for Merge sort
    xs = merge (mergeSort l, mergeSort r) where (l, r) = splitAt (length xs `div` 2) xs merge :: Ord a => ([a], [a]) -> [a] merge ([], xs) = xs merge (xs...
    49 KB (6,727 words) - 08:25, 21 May 2025
  • Kotlin. "Lua 5.3 Reference Manual". www.lua.org. "goto - perldoc.perl.org". perldoc.perl.org. "baruchel/tco". GitHub. 29 March 2022. Rossum, Guido Van (22...
    41 KB (4,334 words) - 10:00, 1 June 2025
  • Objective-C OAPromise OCaml Lazy Perl Future Perl Promises Perl Reflex Perl Promise::ES6 "Promise::XS – Fast promises in Perl – metacpan.org". metacpan.org...
    44 KB (4,638 words) - 13:07, 9 February 2025
  • tool for the XS programmer". "B::C - Perl compiler's C backend". "Acme::Perl::VM - A Perl5 Virtual Machine in Pure Perl (APVM)". The Perl internals: running...
    7 KB (930 words) - 22:05, 25 May 2025
  • where n = |xs| + |ys|. *) fun merge cmp (xs, []) = xs | merge cmp (xs, y :: ys) = let fun loop (a, acc) (xs, []) = List.revAppend (a :: acc, xs) | loop (a...
    32 KB (3,714 words) - 19:30, 27 February 2025
  • Thumbnail for Cuneiform (programming language)
    The example below shows the definition of a variable xs being a file list with three elements. let xs : [File] = ['a.txt', 'b.txt', 'c.txt' : File]; Lists...
    19 KB (1,834 words) - 07:27, 4 April 2025
  • Data Structures: longest common substring Perl/XS implementation of the dynamic programming algorithm Perl/XS implementation of the suffix tree algorithm...
    8 KB (1,072 words) - 16:32, 25 May 2025
  • (x:y:xs) = foldl1 f (f x y : xs) foldr1 f [x] = x foldr1 f (x:xs) = f x (foldr1 f xs) foldt1 f [x] = x foldt1 f (x:y:xs) = foldt1 f (f x y : pairs f xs) foldi1...
    39 KB (2,787 words) - 17:28, 5 December 2024
  • Generator (computer programming) (category Articles with example Perl code)
    standard adaptor function, takeWhile p [] = [] takeWhile p (x:xs) | p x = x : takeWhile p xs | otherwise = [] which walks down the list and stops on the...
    26 KB (3,106 words) - 18:54, 27 March 2025
  • two variants, Nil for an empty list and Cons x xs for the combination of a new element x with a list xs to create a new list. Here is an example of how...
    17 KB (2,092 words) - 17:16, 24 May 2025
  • the line immediately following an XS record does not begin with ^ or X, that is considered a continuation of the XS record. All the fields in detail items...
    21 KB (1,712 words) - 05:05, 19 January 2025
  • existing list. In Haskell syntax: [] -- an empty list x:xs -- an element x constructed on a list xs The structure for a list with some elements is thus element:list...
    22 KB (2,581 words) - 19:44, 12 May 2025
  • Thumbnail for Serialization
    Serialization (section Perl)
    configured by a flag. Several Perl modules available from CPAN provide serialization mechanisms, including Storable , JSON::XS and FreezeThaw. Storable includes...
    42 KB (4,974 words) - 07:49, 28 April 2025
  • -> Vect m a -> Vect (n + m) a append Nil ys = ys append (x :: xs) ys = x :: append xs ys The function append appends a vector of m elements of type a...
    10 KB (899 words) - 12:44, 15 November 2024
  • partition([X|Xs], Pivot, Smalls, Bigs) :- ( X @< Pivot -> Smalls = [X|Rest], partition(Xs, Pivot, Rest, Bigs) ; Bigs = [X|Rest], partition(Xs, Pivot, Smalls...
    72 KB (8,098 words) - 08:09, 15 June 2025
  • Thumbnail for Pure (programming language)
    s::stack; top s::stack; end; type stack []; push xs@[] x | push xs@(_:_) x = x:xs; pop (x:xs) = xs; top (x:xs) = x; As a language based on term rewriting,...
    9 KB (957 words) - 15:26, 9 February 2025
  • order compared to the given list. fun reverse [] = [] | reverse (x :: xs) = (reverse xs) @ [x] This implementation of reverse, while correct and clear, is...
    13 KB (1,461 words) - 18:17, 29 April 2025
  • implemented as: map :: (a -> b) -> [a] -> [b] map _ [] = [] map f (x : xs) = f x : map f xs In Haskell, the polymorphic function map :: (a -> b) -> [a] -> [b]...
    23 KB (1,572 words) - 22:24, 25 February 2025
  • PMC 3278762. PMID 22199392. Pratas, D; Pinho, A. J.; Rodrigues, J. M. (2014). "XS: A FASTQ read simulator". BMC Research Notes. 7: 40. doi:10.1186/1756-0500-7-40...
    31 KB (3,685 words) - 13:54, 1 May 2025
  • language Haskell: map :: (a -> b) -> [a] -> [b] map f [] = [] map f (x:xs) = f x : map f xs Languages where functions are not first-class often still allow one...
    28 KB (2,524 words) - 08:59, 28 April 2025
  • of a set of numbers subsets [] = [[]] subsets (x:xs) = [[x] ++ y | y <- ys] ++ ys where ys = subsets xs and this is a literate script for a function primes...
    15 KB (1,759 words) - 19:43, 3 April 2025
  • (define-syntax-rule (top . x) 'x) (define-syntax-rule (app f . xs) (if (hash? f) (hash-ref f . xs) (f . xs))) This language: provides everything from the racket...
    26 KB (3,502 words) - 23:58, 7 January 2024