luisgulo/gambas-source-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
gambas-source-code/main/lib/data/main.c

58 lines
1.1 KiB
C
Raw Normal View History

[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
/*
[GB.DATA] * NEW: Update copyright years. * NEW: Have a stripped-down version of gb_common_string_temp.h to provide STRING_compare() without producing compilation problems. * NEW: AvlTree is a new Collection-like class implementing a balanced binary search tree. It does _not_ utilise hashing in order to maintain an order of the literal key strings given by the user (For Each thus traverses from smallest to greatest key). * NEW: Carry in a stripped-down version of Bob Jenkins' lookup3 hash algorithm from the Public Domain. It was a last-minute decision to not use it in AvlTree to maintain the literal key order. git-svn-id: svn://localhost/gambas/trunk@5812 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-20 00:48:29 +02:00
* main.c - gb.data glue
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
*
[GB.DATA] * NEW: Update copyright years. * NEW: Have a stripped-down version of gb_common_string_temp.h to provide STRING_compare() without producing compilation problems. * NEW: AvlTree is a new Collection-like class implementing a balanced binary search tree. It does _not_ utilise hashing in order to maintain an order of the literal key strings given by the user (For Each thus traverses from smallest to greatest key). * NEW: Carry in a stripped-down version of Bob Jenkins' lookup3 hash algorithm from the Public Domain. It was a last-minute decision to not use it in AvlTree to maintain the literal key order. git-svn-id: svn://localhost/gambas/trunk@5812 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-20 00:48:29 +02:00
* Copyright (C) 2012/3 Tobias Boege <tobias@gambas-buch.de>
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*/
#define __MAIN_C
#include "c_list.h"
#include "c_deque.h"
#include "c_circular.h"
[GB.DATA] * NEW: Update copyright years. * NEW: Have a stripped-down version of gb_common_string_temp.h to provide STRING_compare() without producing compilation problems. * NEW: AvlTree is a new Collection-like class implementing a balanced binary search tree. It does _not_ utilise hashing in order to maintain an order of the literal key strings given by the user (For Each thus traverses from smallest to greatest key). * NEW: Carry in a stripped-down version of Bob Jenkins' lookup3 hash algorithm from the Public Domain. It was a last-minute decision to not use it in AvlTree to maintain the literal key order. git-svn-id: svn://localhost/gambas/trunk@5812 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-20 00:48:29 +02:00
#include "c_avltree.h"
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
#include "main.h"
GB_INTERFACE GB EXPORT;
GB_DESC *GB_CLASSES[] EXPORT = {
[GB.DATA] * BUG: Fix possible bugs when updating an invalid Current. * BUG: Really erase old elements instead of just marking them as Null to prevent (potential) information leaks. * OPT: Current and the enumerators (internally) carry list global indices (LGI) which can be used as anchor points together with List.Count to speed up traversals (always taking the shortest way through the list). * OPT: Remove workaround code related to an enumerator bug fixed in #5749. * NEW: Expose List.Current as a virtual object representing the current list element which has Append() and Prepend() methods to manipulate the list not only around its head. This breaks backwards compatibility. * NEW: List.Value is what List.Current has meant formerly. * NEW: Add List.Current.Index and List.Index which are an absolute index of the current element into the list. These are guaranteed to be in bounds of [-List.Count; List.Count - 1]. Note that each non-negative index has an associated negative equivalent and vice versa. They work like the indices given to List._get(). * NEW: Add a List.AutoNormalize property which instructs the list to automatically make indices (like resulting from a calculation) fit into the List bounds preserving the sign of the given index. This effectively prevents any "Out of bounds" errors. * NEW: Add List.MoveTo() to point Current to an index. * NEW: List.Current.Is{First,Last,Valid} can be used to determine if Current is the first or last element of the list or if it is valid, respectively. git-svn-id: svn://localhost/gambas/trunk@5778 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-09 20:31:20 +02:00
CList,
CListBackwards,
CListItem,
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
[GB.DATA] * BUG: Fix possible bugs when updating an invalid Current. * BUG: Really erase old elements instead of just marking them as Null to prevent (potential) information leaks. * OPT: Current and the enumerators (internally) carry list global indices (LGI) which can be used as anchor points together with List.Count to speed up traversals (always taking the shortest way through the list). * OPT: Remove workaround code related to an enumerator bug fixed in #5749. * NEW: Expose List.Current as a virtual object representing the current list element which has Append() and Prepend() methods to manipulate the list not only around its head. This breaks backwards compatibility. * NEW: List.Value is what List.Current has meant formerly. * NEW: Add List.Current.Index and List.Index which are an absolute index of the current element into the list. These are guaranteed to be in bounds of [-List.Count; List.Count - 1]. Note that each non-negative index has an associated negative equivalent and vice versa. They work like the indices given to List._get(). * NEW: Add a List.AutoNormalize property which instructs the list to automatically make indices (like resulting from a calculation) fit into the List bounds preserving the sign of the given index. This effectively prevents any "Out of bounds" errors. * NEW: Add List.MoveTo() to point Current to an index. * NEW: List.Current.Is{First,Last,Valid} can be used to determine if Current is the first or last element of the list or if it is valid, respectively. git-svn-id: svn://localhost/gambas/trunk@5778 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-09 20:31:20 +02:00
CDeque,
CStack,
CQueue,
CPrioQueue,
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
[GB.DATA] * BUG: Fix possible bugs when updating an invalid Current. * BUG: Really erase old elements instead of just marking them as Null to prevent (potential) information leaks. * OPT: Current and the enumerators (internally) carry list global indices (LGI) which can be used as anchor points together with List.Count to speed up traversals (always taking the shortest way through the list). * OPT: Remove workaround code related to an enumerator bug fixed in #5749. * NEW: Expose List.Current as a virtual object representing the current list element which has Append() and Prepend() methods to manipulate the list not only around its head. This breaks backwards compatibility. * NEW: List.Value is what List.Current has meant formerly. * NEW: Add List.Current.Index and List.Index which are an absolute index of the current element into the list. These are guaranteed to be in bounds of [-List.Count; List.Count - 1]. Note that each non-negative index has an associated negative equivalent and vice versa. They work like the indices given to List._get(). * NEW: Add a List.AutoNormalize property which instructs the list to automatically make indices (like resulting from a calculation) fit into the List bounds preserving the sign of the given index. This effectively prevents any "Out of bounds" errors. * NEW: Add List.MoveTo() to point Current to an index. * NEW: List.Current.Is{First,Last,Valid} can be used to determine if Current is the first or last element of the list or if it is valid, respectively. git-svn-id: svn://localhost/gambas/trunk@5778 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-09 20:31:20 +02:00
CCircular,
[GB.DATA] * NEW: Update copyright years. * NEW: Have a stripped-down version of gb_common_string_temp.h to provide STRING_compare() without producing compilation problems. * NEW: AvlTree is a new Collection-like class implementing a balanced binary search tree. It does _not_ utilise hashing in order to maintain an order of the literal key strings given by the user (For Each thus traverses from smallest to greatest key). * NEW: Carry in a stripped-down version of Bob Jenkins' lookup3 hash algorithm from the Public Domain. It was a last-minute decision to not use it in AvlTree to maintain the literal key order. git-svn-id: svn://localhost/gambas/trunk@5812 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2013-08-20 00:48:29 +02:00
CAvlTree,
[CONFIGURATION] * NEW: Add gb.adt component [GB.ADT] * NEW: gb.adt is a component to provide abstract datatypes. * NEW: Add List and ListRoot classes for circular double-linked lists which can be embedded into other classes or used standalone. * NEW: Add Deque class as a base for new Stack, Queue and PrioQueue classes on top of linked lists (thus different from related Variant[] semantics). * NEW: Add Circular class for ring buffers. git-svn-id: svn://localhost/gambas/trunk@5052 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-08-18 13:07:14 +02:00
NULL
};
int EXPORT GB_INIT()
{
return 0;
}
void EXPORT GB_EXIT()
{
}
Reference in a new issue Copy permalink