Repository navigation
Optimize ColorMap - #1648
Merged
lossyrob merged 10 commits intoOct 5, 2016
Merged
Optimize ColorMap#1648
Conversation
- Memoize the results of `map` in a `TrieMap` for faster subsequent lookups. A more involved custom binary search could be employed for faster lookups in `DoubleColorMap`, as it can't take advantage of `TrieMap` in the same way.
- A generalized binary search with a custom "target test" predicate.
- Also, `BTree` can print itself now. Should convert to returning a `String` instead.
Contributor
Author
|
Bonus, └── 4
├── 6
│ ├── 7
│ │ ├── ∅
│ │ └── ∅
│ └── 5
│ ├── ∅
│ └── ∅
└── 2
├── 3
│ ├── ∅
│ └── ∅
└── 1
├── ∅
└── ∅ |
Contributor
Author
|
Don't merge yet: I still need to run benchmarks. |
Contributor
Author
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
TODO
Let:
kbe the number of pixels to colour, andnthe number of colour breaks, where usuallyk > nby several orders of magnitudeTrieMapto memoizeIntColorMap.mapresultsO(kn)O(k + n)BTree[T]BTreeforDoubleColorMapO(nlogn + klogn) == O((n + k)logn) ~= O(klogn)BTree.prettyshould returnStringBTreeforIntColorMapMotivation
This addresses #1489 . Currently every call to
IntColorMap.maporDoubleColorMap.mapperforms aO(n)search for the correct colour ramp value, given some raster's pixel value. The total cost to colour a raster is thenO(kn).Next Steps
Use Spire to generalize over
IntandDouble?