diff options
| author | Jason Zaugg <jzaugg@gmail.com> | 2014-01-31 13:23:33 +0100 |
|---|---|---|
| committer | Adriaan Moors <adriaan.moors@typesafe.com> | 2014-02-10 14:34:35 -0800 |
| commit | db9fd559ec70f033b475b0d91c6049b68955e095 (patch) | |
| tree | 45d7fcaf69c92b5cd16c9e7b6f52a6162db4b819 /test/benchmarking/AVL-insert.scala | |
| parent | 59fc37ade773f66eb05c7b2cfebe03abaf767c51 (diff) | |
| download | scala-db9fd559ec70f033b475b0d91c6049b68955e095.tar.gz scala-db9fd559ec70f033b475b0d91c6049b68955e095.tar.bz2 scala-db9fd559ec70f033b475b0d91c6049b68955e095.zip | |
SI-7475 Refactor findMember computation into a class
This affords us:
- a better chance to share code with `findMembers` again
- the ability to break up the logic into smaller methods for
scrutability and JIT-tability.
The cost is the use of the heap rather than the stack for the
working area of the computation. But I didn't notice a difference
between `locker.lib` and `quick.lib` after this change.
I've left the old implementation in place with an assertion to
verify identical results. In the next commit, this stepping stone
will be removed, and we'll update `findMembers` to share the code.
Some problem areas have been highlighted and will be addressed
after the refactoring phase is complete.
Diffstat (limited to 'test/benchmarking/AVL-insert.scala')
0 files changed, 0 insertions, 0 deletions