-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 deque is a collection type that is used to represent and operate on deque of values. It supports basic subscript and range operators. It also supports efficient operations of addition and removal of its elements at its both ends.
Members
  • append( other ) - append all elements from other collection at the end of deque
  • clear() - erase deque's content, deque becomes empty
  • find( elem[, start[, stop]] ) - get index of first element of the deque not before start and before stop, return -1 if not found
  • insert( index, elem ) - insert given element at given index
  • pop() - remove last element from the deque, deque shrinks by 1
  • pop_front() - remove first element from the deque, deque shrinks by 1
  • prepend( other ) - prepend all elements from other collection in front of deque
  • push( elem ) - add new elem at the (right/back) end of the deque, deque grows in size by 1
  • push_front( elem ) - add new elem at the (left/front) beginning of the deque, deque grows in size by 1