> This hashing is done in O(num of children), and then you get back a
> HashConsed structure, that is shared for all hash consed instances
> of the same tree. It can be used to test equality O(1), with
> identical?,
> and not O(size of the tree).
I've seen this referred to as interning -- indee
>
> I don't know anything about hash consing. Based on my
> limited understanding of the description I am just wondering
> if this is different from structural sharing that Clojure collections
> have.
The sharing only concerns data structure having the same creation
point.
6.2009 um 13:11 schrieb Parth:
> On Jun 29, 3:09 pm, Nicolas Oury wrote:
>> Dear all,
>>
>> I am coding a (very) small hash consing library for clojure.
>>
>> For those we don't happen to know what hash consing is, it is a way
>> of
>> allowing eq
Hi,
I'm interested in knowing how you solve garbage collection issues ?
2009/6/29 Nicolas Oury :
>
> Dear all,
>
> I am coding a (very) small hash consing library for clojure.
>
> For those we don't happen to know what hash consing is, it is a way of
> allow
ote:
> Dear all,
>
> I am coding a (very) small hash consing library for clojure.
>
> For those we don't happen to know what hash consing is, it is a way of
> allowing equal data structures to be shared in memory.
> This leverages the purity (as in "immutability")
On Jun 29, 3:09 pm, Nicolas Oury wrote:
> Dear all,
>
> I am coding a (very) small hash consing library for clojure.
>
> For those we don't happen to know what hash consing is, it is a way of
> allowing equal data structures to be shared in memory.
> This l
Dear all,
I am coding a (very) small hash consing library for clojure.
For those we don't happen to know what hash consing is, it is a way of
allowing equal data structures to be shared in memory.
This leverages the purity (as in "immutability") of data structures to
reduce memor
