[Date Prev][Date Next][Thread Prev][Thread Next][Author Index][Date Index][Thread Index]

*To*: <us>*Subject*: partial orgl problem*From*: Eric Dean Tribble <tribble>*Date*: Thu, 7 Sep 89 02:08:22 PDT

Markm (with help from me) sketched an implementation to the case of partial orgls that stumped me at the planning meeting. It was based on his insight that log to the base 2 of infinity is 64. Thus, If you have a potentially infinite space, a tree to represent it (at least till later versions of our system) would only have to be 64 deep. This gave an upper bound on the height of newly created partial orgls. >From there we came up with a solution that doesn't have wierd numbers like 64 in it. I'll be working out the real algorithms (and checking our burden of assumption) in the next few days. dean PS Yes, a group of assumptions that simultaneously interact is called a burden (as of now). dean :-)

- Prev by Date:
**yawn...** - Next by Date:
**Re: Multiple font editor** - Previous by thread:
**yawn...** - Next by thread:
**storage management** - Index(es):