chaindb

Discussions related to Visual Prolog
drspro2
VIP Member
Posts: 78
Joined: 28 Apr 2006 12:03

chaindb

Unread post by drspro2 » 18 May 2012 8:23

in case of a btree with allowed duplicates,

where i insert a key with *key_insert,

and this same key was already present in the btree,

so this *key_insert is the same key inserted for the second time
( with a different Ref ofcourse)


- then my question;

will *key_search (starting from the first key of the btree ) allways find the Last
inserted key?

- in other words
*key_insert always places the key as first in case of duplicates ?




Thankyou
R

Post Reply