My Two Cents
tl;dr
I'd like to thank the Plone Summit organizers for inviting me to the summit, even though I decided not to go (I just got back from a week in Japan, and boy are my arms tired).
I'd like to thank the Plone Summit organizers for inviting me to the summit, even though I decided not to go (I just got back from a week in Japan, and boy are my arms tired).
I have released version 0.2 of a setuptools plugin to the Cheeseshop.
When installed, the plugin extends the .egg-info
generation done by many
setup commands to create a new file, test_info.txt
, which captures the
data used by the setup.py test
command.
thrashcatcher
is a Zope2 product which adds log records to thetrace log showing the number of objects loaded and stored in each request. It should help in tracking down which parts of your application are thrashing the ZODB connection cache.
http://agendaless.com/Members/tseaver/software/thrashcatcher/
This is the keynote I gave to the 2007 DZUG Tagung in Potsdam, Monday, June 4th.
In the talk, I addressed the issue of the identity / audience / brand ambiguities which have always plagued Zope. I referenced Jim Fulton's "Two Visions" speech, and then proposed another alternative, using the analogy of the early game show, "Let's Make a Deal".
The product is a simple add-on for CMF 2.0, exposing views for exporting / importing folderish content as tarballs.
Given that the word "Zope" turns out to be a common name in German-speaking countries for a variety of carp (ballerus ballerus) I found the following note [1] strangely appealing, as well as appropriate.
I mused yesterday that I needed to create eggs for the various ZODB-related packages: I was wrong.
Building on Nathan Yergler's work from PyCon, I have just finished a big pile of eggs for both ZopeX3.0.0 and Zope 3.2.0.
Basically, it behaves like a dictionary, but ... TSTs are a lot smarter than dictionaries when it comes to:
Prefix-matching (find the longest entry in the TST which is a prefix to a given string)
Scanning (using the Aho-Corasick algorithm, you can implement pretty efficient scanners with a TST, scaling up to tens of thousands of entries)
Spelling correctors (find a set of entries which spelling is close to a given string. The distance used is the Levenshtein distance).
Stumped as to the encoding used in a given file or bit of string data? Mark Pilgrim strikes again with a Python library "as smart as your browser." The result includes confidence, which is a big win in my eyes.