Top all-time · #7122
kmike.ru
Personal blog · kmike.ruprogrammingdata
kmike.ru is a personal blog at kmike.ru about programming and data. Since 2012, 11 different Hacker News readers have linked it 13 times, most often “Fast Non-Standard Data Structures for Python ”. No feed was found, so read it on the site itself.
Too few sampled comments (7) to say how often HN recommends it.?
Why HN links it
Linked by HN commenters as a reference on non-standard Python data structures, including tries, with memory usage benchmarks of Python trie libraries.
Summarised by Claude from a sample of 7 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Most-linked posts?
- Fast Non-Standard Data Structures for Python 10 people · 11 mentions · first linked 2012-09-01
- /python-with-strings-attached/2 people · 2 mentions · first linked 2013-05-21
What Hacker News says?
Interesting question. For some discussion of (among other ADTs) "actual" trees in python, see: http://kmike.ru/python-data-structures/ And: http://pythonhosted.org/BTrees/
Comment linking /python-data-structures/
on “The Lost Art of C Structure Packing”Submitted Fast Non-Standard Data Structures for Python as a story · 156 points
HN discussionThis is not a major problem for data science. We usually use numpy arrays (or scipy sparse arrays), which are memory efficient. There are also some other efficient data structures for python: http://kmike.ru/python-data-structures/ For preprocessing you can usually work on a line-by-line basis (e.g. don't keep the entire dataset in memory). This is a bigger problem for web apps, imo. But there you usually just throw…
Comment linking /python-data-structures/
on “How Python became the language of choice for data science”Submitted Fast Non-Standard Data Structures for Python (2013) as a story · 107 points
HN discussionHere are some sources on non-standard python data structures (including a text trie) that I've found very useful: http://kmike.ru/python-data-structures/ Also I've used this C implementation of the Levenshtein distance which much success as well: https://code.google.com/p/pylevenshtein/
Comment linking /python-data-structures/
on “Fast and easy Levenshtein distance using a trie (2011)”Submitted High-performance data structures for Python as a story · 9 points
HN discussion> There is also an advice for encoding __repr__ and __str__ results to utf8 under Python 2.x in the article; this is fine (other approaches are not better), but it has some non-obvious consequences (like breaking REPL in some setups) that developers should be aware of, see http://kmike.ru/python-with-strings-attached/ I don't see `__repr__` mentioned there, but `__repr__` should basically always be ascii (which a qu…
Comment linking /python-with-strings-attached/
on “Porting to Python 3 Redux”Submitted Fast Non-Standard Data Structures for Python as a story · 3 points
HN discussionGreat writeup (and a cool metaclass workaround!) However, I think that "Drop 2.5, 3.1 and 3.2" advice is bad - dropping 2.5 and 3.1 is the way to go (hey, drop 2.5 even if you're not porting to 3.x), but dropping 3.2 is not necessary in most cases. In my experience (porting and maintaining 20 open-source packages that work with Python 2 and Python 3 using a single codebase, including NLTK) Python 3.2 has never been…
Comment linking /python-with-strings-attached/
on “Porting to Python 3 Redux”Submitted Fast Non-Standard Data Structures for Python as a story · 2 points
HN discussionThe compression of a trie may not be the best because of the node storage requirement. I've benchmarked the memory usage of some Python trie libraries here: http://kmike.ru/python-data-structures/ I also tried to compress "/usr/share/dict/words" with https://github.com/kmike/DAWG and https://github.com/kmike/marisa-trie Python libraries: import dawg import marisa_trie words = open('/usr/share/dict/words', 'r').read(…
Comment linking /python-data-structures/
on “A Spellchecker Used to Be a Major Feat of Software Engineering”Submitted Fast Non-Standard Data Structures for Python as a story · 1 points
HN discussionGood call! Apparently it's a static, not dynamic, data structure. http://kmike.ru/python-data-structures/
Comment linking /python-data-structures/
on “Marisa-Trie – Matching Algorithm with Recursively Implemented Storage”
