arf, 32bytes not 32bit!
it seem to work now, good new :)
I apologize
2008/8/8 Henri Gourvest <[EMAIL PROTECTED]>:
> this limit depend on the max size of a "set of" data type
> because I store the enumerator stack in an Integer value.
> TAvlBitArray = set of 0..AVL_MAX_DEPTH - 1;
> unfortunally on
this limit depend on the max size of a "set of" data type
because I store the enumerator stack in an Integer value.
TAvlBitArray = set of 0..AVL_MAX_DEPTH - 1;
unfortunally on FPC 2.2.0 64:
if TAvlBitArray = set of 0..63;
sizeof(TAvlBitArray) is still 32
I don't know if it will be changed late
On Fri, 8 Aug 2008 14:57:36 +0200
"Henri Gourvest" <[EMAIL PROTECTED]> wrote:
> > Because of this:
> > AVL_MAX_DEPTH = sizeof(longint) * 8;
>
> = 32 in all cases, I know and It is not a problem.
At least not now. But eventually it should be changed to
AVL_MAX_DEPTH = sizeof(PtrInt) * 8;
Mattia
> Because of this:
> AVL_MAX_DEPTH = sizeof(longint) * 8;
= 32 in all cases, I know and It is not a problem.
henri
___
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
Zitat von Henri Gourvest <[EMAIL PROTECTED]>:
> 2008/8/8 Mattias Gärtner <[EMAIL PROTECTED]>:
> > Correct me if I'm wrong, but this seems not very comfortable.
> > - No custom sort function (unless you override)
> ...
>
> > - A node does not know its parent. So with First or Search you can not get
2008/8/8 Mattias Gärtner <[EMAIL PROTECTED]>:
> Correct me if I'm wrong, but this seems not very comfortable.
> - No custom sort function (unless you override)
...
> - A node does not know its parent. So with First or Search you can not get to
> the next node. You need always an iterator (iterator
Zitat von Henri Gourvest <[EMAIL PROTECTED]>:
> I made 2 AVL tree for different kind of problems
>
> this one is generic (32/64+all platformes)
> http://uib.svn.sourceforge.net/viewvc/uib/trunk/source/uibavl.pas?view=markup
> it is based on http://www.geocities.com/wkaras/gen_c/cavl_tree.html
Cor
I just found another one, I made long time ago, I stopped to use it
because it is based on libavl and licence is GPL.
unit libavl;
interface
{$ALIGN ON}
{$MINENUMSIZE 4}
const
MAX_STACK = 32;
type
TBranchDir = (bLeft, bRight);
PIndexSlot = ^TIndexSlot;
TIndexSlot = record
FData: Poin
I made 2 AVL tree for different kind of problems
this one is generic (32/64+all platformes)
http://uib.svn.sourceforge.net/viewvc/uib/trunk/source/uibavl.pas?view=markup
it is based on http://www.geocities.com/wkaras/gen_c/cavl_tree.html
this one only index string and use both Hash and AVL tree f
Zitat von Marc Weustink <[EMAIL PROTECTED]>:
> Marco van de Voort wrote:
> >> Marco van de Voort wrote:
> Inoussa OUEDRAOGO wrote:
> > - TAVLManagedTree that uses a node mem manager provided in the
> constructor.
> >The developer using this one is _aware_ of the thread safety iss
Marco van de Voort wrote:
Marco van de Voort wrote:
Inoussa OUEDRAOGO wrote:
- TAVLManagedTree that uses a node mem manager provided in the constructor.
The developer using this one is _aware_ of the thread safety issue and can
then provide a thread safe node mem manager for an instance
> Marco van de Voort wrote:
> >> Inoussa OUEDRAOGO wrote:
> >>> - TAVLManagedTree that uses a node mem manager provided in the
> >>> constructor.
> >>>The developer using this one is _aware_ of the thread safety issue and
> >>> can
> >>>then provide a thread safe node mem manager for an
Marco van de Voort wrote:
Inoussa OUEDRAOGO wrote:
- TAVLManagedTree that uses a node mem manager provided in the constructor.
The developer using this one is _aware_ of the thread safety issue and can
then provide a thread safe node mem manager for an instance exposed
What is exactly th
> Inoussa OUEDRAOGO wrote:
> > - TAVLManagedTree that uses a node mem manager provided in the constructor.
> >The developer using this one is _aware_ of the thread safety issue and
> > can
> >then provide a thread safe node mem manager for an instance exposed
>
> What is exactly the add-
On Thu, 07 Aug 2008 18:04:32 +0200
Micha Nelissen <[EMAIL PROTECTED]> wrote:
> Inoussa OUEDRAOGO wrote:
> > - TAVLManagedTree that uses a node mem manager provided in the
> > constructor. The developer using this one is _aware_ of the thread
> > safety issue and can then provide a thread safe nod
2008/8/7 Micha Nelissen <[EMAIL PROTECTED]>:
> Inoussa OUEDRAOGO wrote:
>>
>> - TAVLManagedTree that uses a node mem manager provided in the
>> constructor.
>> The developer using this one is _aware_ of the thread safety issue and
>> can
>> then provide a thread safe node mem manager for an in
Inoussa OUEDRAOGO wrote:
- TAVLManagedTree that uses a node mem manager provided in the constructor.
The developer using this one is _aware_ of the thread safety issue and can
then provide a thread safe node mem manager for an instance exposed
What is exactly the add-on value for the nod
Second proposition :
Another proposition is to introduce a base avl class say TBaseAVLTree
that defines two abstract virtual methods "NewNode()" and "FreeNode()"
and then define :
- TAVLTree : that _do not_ use a node mem manager, then thread safe.
- TAVLManagedTree that uses a node mem manager
18 matches
Mail list logo
