summaryrefslogtreecommitdiff
path: root/test/benchmarking/TreeSetInsert.scala
Commit message (Collapse)AuthorAgeFilesLines
* Fix some issues in parallel Ctrie.Aleksandar Prokopec2012-02-031-0/+2
| | | | | | | | | | | | | | | | | | | | | | This change resolves some issues with ParCtrie splitters and their `remaining` method, which currently evaluates the size of the Ctrie. Since this is still not done lazily, nor in parallel, it has a certain cost, which is unacceptable. Change #1: The `shouldSplitFurther` method is by default implemented by calling the `remaining` method. This method now forwards the call to the same method in the splitter which is by default implemented in the same way as before, but can be overridden by custom collections such as the ParCtrie. Change #2: ParCtrie splitter now has a `level` member which just counts how many times the method has been split. This information is used to override the default `shouldSplitFurther` implementation. Change #3: The tasks and splitters rely heavily on the `remaining` method in the splitter for most operations. There is an additional method called `isRemainingCheap` which returns true by default, but can be overridden by custom collections such as the `Ctrie`.
* Fixed the benchmarks a bit.aleksandar2012-01-301-6/+9
|
* Added benchmarking files, in order to easily compare variousLucien Pereira2012-01-281-0/+65
implementations performances.