TStrings.IndexOfName / TStringList

[marcodor]

JuhaManninen, thanks for THashedStringList  hint, just checked implementation, will go with this class.

Marcov, it should not break any Delphi compatibility, if function runs faster it's about optimization, not compatibility. So less arrogance please.

Jc99, thanks for code. Anyway, instead having this already in THashedStringList it can also be improved in TStringList.

If items are sorted, why not use it? Just 5 lines of code optimizations.

[jc99]

[...]
Jc99, thanks for code. Anyway, instead having this already in THashedStringList it can also be improved in TStringList.

If items are sorted, why not use it? Just 5 lines of code optimizations.

+1
and hey You did it in 5 lines ? Cool, please share.

BTW, TStringList.find always does a binary search even in an unsorted list. Is this really supposed to be that way ?
[Edit]
Could someone verify this ?
--> [...] <---

Plz have a look at this.
you put three strings in a stringlist and find does not find the last one (somtimes, when unsorted)

[typo]

I admit the class name is misleading. I realized it only afterwards. If somebody comes up with a better name, we can still change it.

TMappedStringList.

[howardpc]

TUnsortedLookupStringList

[jc99]

@JuhaManninen:
Since you say in the wiki:
It's a

[...] TStringList with a fast lookup feature.

TFastLookupStringList

[typo]

jc99, you could take a look at TStringToStringTree.

TDictionaryStringList is the best solution possible to deduplicate an unsorted list of strings. But I think you could use TStringToStringTree directly instead of using a TStringList for IndexOfName.

If you want to know the index in order to get the value, with a map you get the value directly and the index does not matter.

[jc99]

jc99, you could take a look at TStringToStringTree.

Yes:
http://wiki.lazarus.freepascal.org/AVL_Tree
But what's your point ?

An AVL-Tree is an automatic balanced binary tree. I learned about/implemented these in the early 90's.   

[jc99]

TDictionaryStringList is the best solution possible to deduplicate an unsorted list of strings. But I think you could use TStringToStringTree directly instead of using a TStringList for IndexOfName.

If you want to know the index in order to get the value, with a map you get the value directly and the index does not matter.

That depends how the map(ping) is implemented. If it is an AVL-Tree, than you get to the Data-node in O(log(n)) that's exactly the same as a binary search through a sorted list.
The sorting of the list is normaly done in O(n log (n)). But building the Tree also takes O(n log(n)).

Much worse is that Valuelist-editor uses TStringlist -> TStrings linear search to get to the value. That's quite a showstopper, if you use larger lists.
With the new code you only have to sort the list, and then you can access the values nearly optimal. Without changing the code of the VLE-component.
   
And the thing with the Index is only because TStrings is implemented that way.

[JuhaManninen]

I finally renamed TDictionaryStringList  -> TLookupStringList.
Thanks for the suggestions. Typo's TMappedStringList was good except that it raised a question "mapped to what?" at least in my head. The others were too long IMO.
Typo, if you know people who use the class, you can advertise the name change.

Patches for ValueListEditor are welcome. It belongs to a different project than TStringList, Bart or myself can commit changes for it.

[typo]

Thanks.

[typo]

Patches for ValueListEditor are welcome. It belongs to a different project than TStringList, Bart or myself can commit changes for it.

Where is the source?

[jc99]

Where is the source?

! ?

[typo]

What is the problem?

[jc99]

What is the problem?

Exactly !?
What do you mean by where is the source ?
In the trunk ?! In the repository ?! ???
So I was a little bit puzzled.

--------
Dude, what's on my back ? - Sweet, what's on my back ? - DUDE, what's on my back ? - SWEET ......
 

[typo]

The question was not addressed to you. Take care of your life.