b417f1861e
* OPT: Great overhaul of List algorithms. Beware: Still buggy. * OPT: Make list chunks carry multiple Variants to improve cache locality. * OPT: Don't traverse List forwards/backwards when the absolute value of index is past the half of Count. * NEW: Introduce List.Backwards - a virtual object to enumerate backwards * NEW: Don't use List.Current as enumeration pointer. * NEW: Begin enumeration at the first/last node. * NEW: Traverse backwards when given negative index to _get. * NEW: Make Current invalid by default. * NEW: Assign first/last element when MoveNext()/MovePrev() is issued on an invalid Current. * NEW: Use List.Current as pointer for the Find*() methods, too. * NEW: Assign first/last element when FindNext()/FindPrev() is issued on an invalid Current. * NEW: Don't return an index from Find*() methods because it is not the way linked list are dealt with. * NEW: Make insertion and removal of elements safe in enumerations. * NEW: When Current (or enumerator) is removed, the pointer remains relative to the beginning of the List but it never wraps around the end. * BUG: Correctly *cycle* with {Move,Find}{Next,Prev}() git-svn-id: svn://localhost/gambas/trunk@5302 867c0c6c-44f3-4631-809d-bfa615b0a4ec |
||
---|---|---|
.. | ||
gbc | ||
gbx | ||
lib | ||
mime | ||
share | ||
acinclude.m4 | ||
AUTHORS | ||
ChangeLog | ||
compile | ||
component.am | ||
configure.ac | ||
COPYING | ||
depcomp | ||
INSTALL | ||
m4 | ||
Makefile.am | ||
missing | ||
NEWS | ||
README | ||
reconf | ||
TODO |