Boolean Chart Redesign

[Max Kanat-Alexander]

On 07/19/2010 08:21 PM, David Marshall wrote:
> I currently use these trees for putting Boolean charts into a data structure
> and then express them in SQL.  I have interesting ideas about evaluating the
> trees with methods other than the database, caching the results of the
> evaluation of some nodes, and so on.

	I would be interested to know a bit about the data structures that
you're using now in the actual code. I'm thinking about using either
nested arrays or arrays of hashrefs (where the hashrefs describe each
tree node).

	Also, I think I might start using the word "node" in the Search.pm code
if we stop using charts. That's a really good word. :-) Right now, the
word "chart" is used super-ambiguously in the Search.pm code.

	I'd also be interested in hearing your thoughts about pre-evaluation of
trees.

	-Max
-- 
http://www.everythingsolved.com/
Competent, Friendly Bugzilla and Perl Services. Everything Else, too.