between/2 | Extracts elements between delimeter elements, using an empty list when two delimeters are adjacent. |
big_endian_to_integer/1 | Converts a big-endian list to an integer. |
big_endian_to_integer/3 | Converts a big-endian segment of a list to an integer. |
delete/2 | Returns a list of all but the nth element of a given list. |
diff/2 | Calculates the differences between two ordered lists. |
factor/1 | Factors a list, returning all combinations of sublists. |
find_first/2 | Finds the first occurance of the given term in the given list and returns the 1-based index of where it was found. |
grep/2 | Searches through a list for an element matching the given regexp. |
integer_to_big_endian/2 | Converts an integer to a big-endian list. |
integer_to_little_endian/2 | Converts an integer to a little-endian list. |
is_homogenous/1 | Determines whether the given list is homogenous or not. |
little_endian_to_integer/1 | Converts a little-endian list to an integer. |
little_endian_to_integer/3 | Converts a little-endian segment of a list to an integer. |
pairsearch/3 | Equivalent to pairsearch(term(), 1, [term()], term()). |
pairsearch/4 | Searches for a key in a list of {Key, Value} tuples. |
partition/2 | Splits a list into two sublists at a given point. |
replace/3 | Returns a list with the nth element replaced by a new term. |
replace_all/3 | Returns a list with the all elements equal to the first argument replaced with the second argument. |
split/2 | Splits a list into two based on a predicate. |
trunc/1 | Returns a list of all but the last element of a given list. |
zip/2 | Creates a list of pairs from corresponding elements of two lists. |
zipn/1 | Creates a list of tuples from corresponding elements of a list of lists. |
between(D::term(), L::[term()]) -> [term()]
Extracts elements between delimeter elements, using an empty list when two delimeters are adjacent. Can be used for parsing comma-seperated text where two adjacent commas indicates a significant null value in-between.
big_endian_to_integer(List::[integer()]) -> integer()
Converts a big-endian list to an integer.
big_endian_to_integer(List::[integer()], Start::integer(), Length::integer()) -> integer()
Converts a big-endian segment of a list to an integer.
delete(X::integer(), T::[term()]) -> [term()]
Returns a list of all but the nth element of a given list.
diff(List1::[term()], List2::[term()]) -> [diff()]
Calculates the differences between two ordered lists. The differences are expresses in terms of a list of tags which indicate which elements were inserted or deleted at what positions within the first list. Note that this by no means claims to provide a minimal set of differences!
factor(L::[term() | [term()]]) -> [[term()]]
Factors a list, returning all combinations of sublists.
e.g. factor([[a,b],c,[d,e]) ->
[[a,c,d],[a,c,e],[b,c,d],[b,c,e]]
find_first(X::term(), L::[term()]) -> {ok, integer()} | {error, not_found}
Finds the first occurance of the given term in the given list and returns the 1-based index of where it was found.
grep(P::regexp(), L::list()) -> string()
Searches through a list for an element matching the given regexp.
integer_to_big_endian(Integer::integer(), Size::integer()) -> [integer()]
Converts an integer to a big-endian list.
integer_to_little_endian(Integer::integer(), Size::integer()) -> [integer()]
Converts an integer to a little-endian list.
is_homogenous(Tail::[term()]) -> true | false
Determines whether the given list is homogenous or not. If all of the terms of the list are equal, the list is considered homogenous.
little_endian_to_integer(List::[integer()]) -> integer()
Converts a little-endian list to an integer.
little_endian_to_integer(List::[integer()], Start::integer(), Length::integer()) -> integer()
Converts a little-endian segment of a list to an integer.
pairsearch(Term::term(), List::[term()], Else::term()) -> term()
Equivalent to pairsearch(term(), 1, [term()], term()).
pairsearch(Term::term(), Pos::integer(), List::[term()], Else::term()) -> term()
Searches for a key in a list of {Key, Value} tuples. Returns the value if found, or the Else argument if not found.
partition(List::[term()], N::integer()) -> {[term()], [term()]}
Splits a list into two sublists at a given point.
replace(X::integer(), T::[term()], G::term()) -> [term()]
Returns a list with the nth element replaced by a new term.
replace_all(A::term(), B::term(), L::[term()]) -> [term()]
Returns a list with the all elements equal to the first argument replaced with the second argument.
split(Fun::function(), List::[term()]) -> {[term()], [term()]}
Splits a list into two based on a predicate. The first list returned consists of all the elements for which the predicate returns true, the second, all for which it returns false. The returned lists are both in the same order as the given one.
trunc(T::[term()]) -> [term()]
Returns a list of all but the last element of a given list.
zip(A::[term()], B::[term()]) -> [tuple()]
Creates a list of pairs from corresponding elements of two lists. Thanks to Heinz Eriksson for this code.
zipn(Ls::[[term()]]) -> [tuple()]
Creates a list of tuples from corresponding elements of a list of lists. Thanks to Vladimir Sekissov for this code.
Generated by EDoc, Feb 18 2008, 06:47:53.