Skip to content
This repository was archived by the owner on Oct 18, 2022. It is now read-only.

Added Intersection of k ranges over T[0..n]. #5

Open
mpetri wants to merge 1 commit intofclaude:masterfrom
mpetri:intersection
Open

Added Intersection of k ranges over T[0..n]. #5
mpetri wants to merge 1 commit intofclaude:masterfrom
mpetri:intersection

Conversation

@mpetri
Copy link
Contributor

@mpetri mpetri commented Aug 17, 2011

Added Intersection of k ranges over T[0..n]. based on

"New Algorithms on Wavelet Trees and Applications to Information Retrieval"
by Travis Gagie, Gonzalo Navarro, Simon J. Puglisi.

works for both the WaveletTree (any shape) and WaveletTreeNoPtr.

Example:

A [7,2,11,13,11,15,7,2]

ranges A[0,2] , A[4,6] -> WaveletTree::intersection(ranges) returns 7,11.

testIntersection.cpp included.

"New Algorithms on Wavelet Trees and Applications to Information Retrieval"
by Travis Gagie, Gonzalo Navarro, Simon J. Puglisi.
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

Comments