-login:
user: password:
āŠŸsettings:
huginn - programming language with no quirks, so simple every child can master it.
Fork me on GitHub
git clone https://codestation.org/repo/huginn.git
git clone https://github.com/AmokHuginnsson/huginn.git
git clone https://bitbucket.org/huginn/huginn.git
The Algorithms package contains basic low-level algorithms.
Members
  • AlgorithmsException( message ) - create instance of AlgorithmsException with given message
  • chain( iterable1, iterable2, ... ) - create iterable view of a chained set of iterables
  • enumerate( iterable[, start] ) - create Enumerator object that counts elements from iterable when iterated over
  • filter( iterable, callable ) - create Filter object that iterates over iterable and returns only elements for which callable returns boolean equal true
  • iterator( iterable ) - create manual iterator object for given iterable
  • map( iterable, callable ) - create Mapper object that maps elements from iterable transforming each of them with callable when iterated over
  • materialize( iterable, colType ) - copy elements from iterable to newly created instance of colType
  • max( iterable ) - find maximum element from given iterable set
  • min( iterable ) - find minimum element from given iterable set
  • permutation( coll ) - list all permutations of a given uniform collection coll
  • product( iterable1, iterable2, ... ) - create iterable view of a Cartesian product of a set of iterables
  • range( [from,] until [, step] ) - produce iterable sequence of integer values ranging from from up until until using step increments
  • reduce( iterable, callable [, init] ) - iteratively combine all elements from iterable using callable(x,y) and starting value of init
  • reversed( coll ) - create reversed iterable view of a coll materialized collection
  • slice( iterable, [from,] until [, step] ) - produce an iterable view for selecting elements from a sequence ranging from from up until until using step increments
  • sorted( iterable [, callable] ) - return content of iterable as sorted list, using callable to retrieve keys for element comparison
  • zip( iterable1, iterable2, ... ) - create zipped iterable view of a set of iterables
The AlgorithmsException exception type for Algorithms package.
The Algorithms.Iterator class provides forward iterator view over an iterable.
Members
  • is_valid() - check if this Iterator is in valid (dereferencable) state
  • next() - move this Iterator to next position
  • value() - get value pointed by this Iterator
The Algorithms.Range class represents lazyiterable range of integer values.
Members
  • contains( num ) - test if a num is part of this Range
The Algorithms.Mapper class represent lazy transformation of one iterable into another. Resulting iterable produces values from original iterable transformed by user supplied unary function.
The Algorithms.Filter class represents a lazy filtering transformation of one iterable into another. Resulting iterable produces only values matching supplied predicate.
The Algorithms.Enumerator class allows counting elements of iterable that are iterated over.
The Algorithms.Zip class represents a lazy zipping of set of iterables into another. Resulting iterable produces number of tuples equal to minimum length of source iterables.
The Algorithms.Chain class represents a lazy chained view of set of iterables.
The Algorithms.Slice class represents lazyiterableRanged selection of elements from another iterable.
The Algorithms.Product class represents a lazy view of a Cartesian product of a set of iterables.
The Algorithms.Permutation class represents a lazy view of a list of all permutations of a given data set.