D.J.Peters wrote:I can't believe I never was run in to this pitfall before, I use FB since 2005. :-)

That's the disadvantage of a clean programming style. <grin>

I'm not quite sure if I've got you right, but with it works.

From my experience indexed string access is the fastest way to access single bytes in a bunch of data. In many cases it's even worth the efford to convert the data to a string, compute it and convert it back. For example this is the function I use to amplify .wav files in 32bit float format: Functio...

I'm impressed, especially by the rollercoaster sim.

@leopardpm

A little hint: The Sub/Function declarations in your code are completely needless. A procedure has only to be declared if it is called before it's defined in the source code.

Yes, it was a lot of work, and it took a lot of brainpower - when I coded the template of this a few years ago: A search tree list to maintain my music collection <smile>. This time it was not so hard. If you have a closer look at the code you will see that most of the procedures are quite similar, ...

Alright, here's my 2nd attempt, a 5 level binary tree. Not completed yet, but already enough to play around with: Type tEndNode As Integer frontX = 0 As Integer frontY = 0 As Boolean valid = FALSE End Type Type tPathNode As tPathNode Ptr child(0 To 255) End Type Type tPreEndNode As tEndNode Ptr chil...

Another question: Are there negative values?

Like I said, my posted code is only a 1st approach (quick and dirty). I once implemented a search tree for strings, including a fast search function. Please give me some time to recode.

What do you want to get fast: A certain index or a certain value?

Maybe you should DIM 'ContentNew' as a ZString Ptr instead of a String Ptr, as well as the return value of ReplaceAllJ. Furthermore you're submitting different pointer types to SaveFilePtr (String Ptr as Any Ptr). You should only use ZString pointers when you're working with the WinAPI.

IMHO the fastest way to get a sorted list is to implement it as a chained list of UDTs. I've already done something similar, but for strings, not for integers. To give you an idea what I'm talking of, here a quick and dirty 1st approach: Type tFrontier prevNode As Any Ptr nextNode As Any Ptr frontCo...

@jj2007: You used the wrong value to calculate 'diff' : Function ReplaceAllJ(ByRef s1 As String, ByRef s2 As Const String, ByRef s3 As Const String) As ZString Ptr ' in <s1> replace all occurrences of <s2> by <s3> Dim As Integer posx=0, posPrevious, ct=0, diff, l2=Len(s2), l3=Len(s3) Dim As Any Ptr ...

dodicat wrote:I would volunteer to help with nasty members North of the border (The English border) if you like, in the form of home visits.

Could it be you *slightly* misunderstood the tasks of a moderator? <grin>

@grindstone Works great except for the delete key. To replicate the problem type abcdefg, left key to 'd' and press delete. The 'd' is replaced by 'abc'. Adding 'Locate ze, co, 0' on line 198 after the text is rebuilt, fixes the problem. That is the same line used in the backspace code. Thank you, ...

Added a password mode. stringmod.bi: Type tJoyBack up_ As String right_ As String down_ As String left_ As String End Type Dim Shared tJoyBackZero As tJoyBack Declare Operator = (jr1 As tJoyBack, jr2 As tJoyBack) As Integer Operator = (r1 As tJoyBack, r2 As tJoyBack) As Integer If r1.up_ <> r2.up_ T...