Allan, team, I was wondering if anyone can help me. I'm intrigued by the implementation of textmate's incremental search feature for file. What intrigues me most is the fact that it's partially ordered, though it works on any set of characters that appear within a name.
Most incremental searches are implemented using trie structures, but I'm not seeing how that can be used to implement partial ordered searches, or I don't believe that data structure is the most efficient way of doing so.
I'm wondering if someone can share a bit info on how this is implemented. Are you using some known tree algorithm/structure, or is the search performed by regex? I'm hoping the earlier and that you can point me in the right direction.
I really appreciate any information.
Thanks.
Ilya Sterin
On Aug 22, 2007, at 4:33 PM, Ilya Sterin wrote:
Allan, team, I was wondering if anyone can help me. I'm intrigued by the implementation of textmate's incremental search feature for file. What intrigues me most is the fact that it's partially ordered, though it works on any set of characters that appear within a name.
I don’t understand this. And I don’t use any fancy data structures for the search -- only fancy thing is the way the searching is abstracted from data storage.
Allan, thanks for the response.
So do you just use regex on a set of files?
Ilya
On 8/24/07, Allan Odgaard throw-away-1@macromates.com wrote:
On Aug 22, 2007, at 4:33 PM, Ilya Sterin wrote:
Allan, team, I was wondering if anyone can help me. I'm intrigued by the implementation of textmate's incremental search feature for file. What intrigues me most is the fact that it's partially ordered, though it works on any set of characters that appear within a name.
I don't understand this. And I don't use any fancy data structures for the search -- only fancy thing is the way the searching is abstracted from data storage.
For new threads USE THIS: textmate@lists.macromates.com (threading gets destroyed and the universe will collapse if you don't) http://lists.macromates.com/mailman/listinfo/textmate
On Aug 24, 2007, at 11:23 PM, Ilya Sterin wrote:
Allan, thanks for the response.
So do you just use regex on a set of files?
I still don’t really understand the question being asked -- but if you are talking about doing regexp find in project, yes, regexp is used to search the files…
On 8/24/07, Allan Odgaard throw-away-1@macromates.com wrote:
On Aug 22, 2007, at 4:33 PM, Ilya Sterin wrote:
Allan, team, I was wondering if anyone can help me. I'm intrigued by the implementation of textmate's incremental search feature for file. What intrigues me most is the fact that it's partially ordered, though it works on any set of characters that appear within a name.
I don't understand this. And I don't use any fancy data structures for the search -- only fancy thing is the way the searching is abstracted from data storage.
_ For new threads USE THIS: textmate@lists.macromates.com (threading gets destroyed and the universe will collapse if you don't) http://lists.macromates.com/mailman/listinfo/textmate
For new threads USE THIS: textmate@lists.macromates.com (threading gets destroyed and the universe will collapse if you don't) http://lists.macromates.com/mailman/listinfo/textmate
-
Allan Odgaard -
Ilya Sterin