With the closing of Google Code, I will be moving my projects, a priori to BitBucket.
The new URL is https://bitbucket.org/egrange/dwscript
If you have Issues in the Google Code Issue Tracker that matter to you, please copy-paste them to the BitBucket Issue Tracker.
Hash, IndexOf, Lookup, Performance, Search, Sorted, String
As a followup to the previous String Lookup: Hash, Sorted or Unsorted here is a look at what happens for longer strings.
When the string you’re searching have more than a dozen characters, and you only have a few hundreds of them, a clear winner emerges.
When looking up a string, what is the fastest strategy?
A hash map, a sorted list or an unsorted list?
Of course it depends on how many strings you have, but where are the cutoff points?
Here is a quick test, and an interesting tidbit is uncovered…
(more…)
A trivial way to turn a case-sensitive String hash function into a case-insensitive one is to to pass a lower-case (or upper-case) version of the String.
However, in our days of Unicode strings, this is not innocuous…
A new version 2014.10.15 of the DWS Web Server 
is available.
This version contains a variety of improvements and fixes, along with a new sample for JS libraries.
The pre-compiled 2014.10.13 version of the DWScript WebServer is now available!
This version includes the Pascal to JavaScript CodeGen!
Below is a quick summary of changes in the SVN since the last post.
There is also a mini-sneak peek of things to come!
Here is a summary of recent DWScript changes, the major one is a change in operator precedence to something similar to Delphi and FreePascal.
Other changes are related to sets and bug fixes.
Following a recent post by A. Bouchez about an optimized CRC32 hash, I took it as an opportunity to re-run a small String Hashing Shootout on the worst hash function collision torture test I know: ZIP codes in UTF-16 (Delphi’s default String format).
Long time, no post here, but not no happenings on the DWScript front 🙂
Behold a “cleaned up old logo” for DWScript, which will replace the old one until a better one is made
