schtroumpf
Get flash to fully experience Pearltrees
After my last post discussing dictionary lookups in JavaScript the unanimous consensus seemed to be that utilizing Trie would result in additional space savings and yield performance benefits. A Trie is a relatively simple data structure. At its simplest form you’re building a tree-like structure where each final leaf results in a complete word.
JavaScript Trie Performance Analysis
Solved! http://wiki.github.com/madrobby/scripta … eter-local ^^ That takes care of client side. I also figured out how to populate other fields via some dom manipulation and a hash of hashes representing my objects.
Client-Side Autocomplete [SOLVED] (Page 1) - AJAX and RJS
Yesterday we released a new people selector widget (which we’ve been calling Bo Selecta internally). This widget downloads a list of all of your contacts, in JavaScript, in under 200ms (this is true even for members with 10,000+ contacts). In order to get this level of performance, we had to completely rethink how we send data from the server to the client. Server Side: Cache Everything To make this data available quickly from the server, we maintain and update a per-member cache in our database, where we store each member’s contact list in a text blob — this way it’s a single quick DB query to retrieve it. We can format this blob in any way we want: XML, JSON, etc.
Building Fast Client-side Searches
Reverse autocomplete
Back to my homepage This is a proposal for a small improvement on the autocomplete feature, commonly found in many applications. To my knowledge, it hasn't been described or implemented elsewhere. If you know otherwise, or have some comments or suggestions, drop me a line to the address below. [ note ]
Schtroumpf, Quel beau nom de code ! by alexdana Nov 29