pike.git / lib / modules / ADT.pmod / Stack.pike

version» Context lines:

pike.git/lib/modules/ADT.pmod/Stack.pike:1:   #pike __REAL_VERSION__    - // $Id: Stack.pike,v 1.6 2002/03/25 22:39:07 nilsson Exp $ + // $Id: Stack.pike,v 1.7 2002/03/26 11:40:18 nilsson Exp $      //! This class implements a simple stack. Instead of adding and removing   //! elements to an array, and thus making it vary in size for every push   //! and pop operation, this stack tries to keep the stack size constant.   //! If however the stack risks to overflow, it will allocate double its   //! current size, i.e. pushing an element on an full 32 slot stack will   //! result in a 64 slot stack with 33 elements.      int ptr;   array arr;
pike.git/lib/modules/ADT.pmod/Stack.pike:95:   }      //! An initial stack size can be given when   //! a stack is cloned. The default value is   //! 32.   void create(int|void initial_size)   {    arr = allocate(initial_size || 32);   }    - //! + //! Sets the stacks content to the provided array. + void set_stack(array stack) { +  arr = stack; +  ptr = sizeof(arr); + } +  + //! @[sizeof] on a stack returns the number of entries + //! in the stack.   int _sizeof() {    return ptr;   } -  +  + //! @[values] on a stack returns all the entries in + //! the stack, in order. + array _values() { +  return arr[..ptr-1]; + } +  + //! A stack added with another stack yields a third + //! a third stack will all the stack elements from + //! the two first stacks. + ADT.Stack `+(ADT.Stack s) { +  array elem = arr[..ptr-1]+values(s); +  ADT.Stack ns = ADT.Stack(1); +  ns->set_stack(elem); +  return ns; + } +  + string _sprintf(int t) { +  if(t=='t') return "ADT.Stack"; +  if(t=='O') return sprintf("ADT.Stack%O", _values()); +  error("Can't display ADT.Stack as %c.", t); + }