in reply to Re^3: Bidirectional lookup algorithm? (Judy)
in thread Bidirectional lookup algorithm? (Updated: further info.)

... ought to work on strawberry provided you have msys ...

Thanks for your efforts.

Unfortunately, getting a completely different version and flavour of perl + mingw + msys into my customer's set up is a fight I just don't need.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked
  • Comment on Re^4: Bidirectional lookup algorithm? (Judy)

Replies are listed 'Best First'.
Re^5: Bidirectional lookup algorithm? (Judy)
by Anonymous Monk on Jan 12, 2015 at 02:04 UTC
    FWIW these are the memory savings as reported by pslist 
    it begins      0.734375  WVM: 21976 { WS: 5948 VM: 3164 } 
after perl add      2.078125  WVM: 157152 { WS: 120132 VM: 117276 } 
after perl get      0.75  WVM: 157152 { WS: 120140 VM: 117276 } 
after free perl      1.5  WVM: 153184 { WS: 74936 VM: 72072 } 


it begins      0.4375  WVM: 21976 { WS: 5948 VM: 3164 } 
after jAdd      3.734375  WVM: 50648 { WS: 35500 VM: 32644 } 
after jGet      3.84375  WVM: 50648 { WS: 35512 VM: 32644 } 
after jFree      1.171875  WVM: 50716 { WS: 7988 VM: 5092 }

    [download]

    And the Judy code

    Read more... (1510 Bytes)
[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom