|
|
|
Source code for classes here is not avalible if its not stated bellow them. Most of the items here are new, so its not documented well yet, but the documentation will first show up in the Einhugur Developers Network Library (on-line)
| CExpression 2.0 (Updated 6. Jul 1999) |
| A runtime expression evaluation class |
|
|
| |
CStack - Not avalible any more - its been replaced !! |
A stack is a container of objects that are inserted and removed according to the last-in first out (LIFO) principle. Objects can be into a stack at any time, but only the most recently inserted (last) object can can be removed and addressed at any time.
This implementation of a stack operates on Variants. Dependencies: none
Methods:
push(o as Variant)
pop() as Variant
top() as Variant
isEmpty as Boolean
size as Integer
|
|
This class has been discontinued because it was replaced by a Einhugur plugin class defined in the CoreClasses plugin
|
| |
| CQueue 1.0.1 (Updated 6. Mar 2000) |
| A queue is similar to a stack, its a container of objects, but a queue is based on the first-in first out (FIFO) principle. That is, elements can be inserted at any time, but only the element that has been in the queue the longest can be removed and addressed at any time.
This implementation of a queue operates on Variants. Dependencies: none
Methods:
- enqueue(o as Variant)
- dequeue() as Variant
- front() as Variant
- isEmpty as Boolean
- size as Integer
|
|
|
| |
| CLinkedList |
| A Linked list is a commonly known structure. In a linked list objects cannot be randomly accessed, but it is possible to iterate thru the list in forward direction, and address the objects, as well as insert and delete anywhere on the way
LinkedList ups and downs:
+ Very fast Insert if you know the location
+ Can Iterate in forward direction
- No random access
- Slow delete
This implementation of a linked list operates on classes Derived from CNode. Dependencies: CNode (Included with this download)
Methods of CNode:
- geNext() as CNode
- getPrevious() as CNode (always returns nil in CLinkedList)
Methods of CLinkedList:
- insert(oAfter as CNode,Item as CNode) (oAfter = nil = InsertFirst)
- getFirst() as CNode
- remove(Item as CNode)
- clear()
- size() as Integer
- isEmpty() as Boolean
|
|
|
| |
| CDoubleLinkedList |
| A Double linked list is similar to a linked list except the objects are back and forward linked together, which enables fast deletion as well as ability to iterate in both directions
LinkedList ups and downs:
+ Very fast Insert if you know the location
+ Can Iterate inboth directions
- No random access
+ Very fast delete if you know the location
This implementation of a linked list operates on classes Derived from CNode. Dependencies: CNode (Included with this download)
Methods of CNode:
- getNext() as CNode
- getPrevious() as CNode
Methods of CLinkedList:
- insertBefore(oBefore as CNode,Item as CNode)
- insertAfter(oAfter as CNode,Item as CNode)
- getFirst() as CNode
- getLast() as CNode
- remove(Item as CNode)
- clear()
- size() as Integer
- isEmpty() as Boolean
|
|
|
| |
|
|
REALbasic classes and other reusable REALbasic code
(Encrypted for registered users)
|
 e-Help Engine 1.0
CExpression 2.0
CDoubleLinkedList
CLinkedList
CQueue 1.0.1
CStack
CStyledTableControl 3.0.1
CStyledTableControl 2.6
|
Pre Releases and code which has never been officially released
(Those all come 100% unsupported as they have not officially been released)
|
Advanced SMTP 1.0b3
e-Script Engine 1.0b1
|
|
Click here to get info on
