say i have nodes text of "parcel 1", "parcel 2" ... "parcel 100" (not in
order). if i run the normal sort it gives "parcel 1", "parcel 10", "parcel
11"... "parcel 2", "parcel 21", i noticed microsoft windows xp and vista sort
their listview (such as the folder browser) ok. but windows 2000 didn't do it
, did it just like my treeview. what's the easiest way to build a icomparer
to deal with this? do i have to compare characters? if someone done something
like this would be great. using vb.net. but you can post other lauguage, i
just need the algorithm.
Jeff Johnson - 03 Oct 2008 19:06 GMT
> if someone done something
> like this would be great. using vb.net. but you can post other lauguage, i
> just need the algorithm.
Well, are you looking for a .NET solution or ANY solution? Because this
group is for VB6 and earlier, i.e., pre-.NET.
muscleking - 03 Oct 2008 21:16 GMT
oh, i am using vb.net. didn't notice there is a seperate location. but the
algorithm is the same. i found it to be called 'natural sort'. do you have a
vb example? vb and vb.net are close enough.
> > if someone done something
> > like this would be great. using vb.net. but you can post other lauguage, i
> > just need the algorithm.
>
> Well, are you looking for a .NET solution or ANY solution? Because this
> group is for VB6 and earlier, i.e., pre-.NET.