GitHub - burantino/IntervalMap: interval_map<K,V> is a data structure that efficiently associates intervals of keys of type K with values of type V

burantino / IntervalMap Public

Notifications You must be signed in to change notification settings
Fork 1
Star 0

interval_map<K,V> is a data structure that efficiently associates intervals of keys of type K with values of type V

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitattributes		.gitattributes
.gitignore		.gitignore
IntervalMap.vcxproj		IntervalMap.vcxproj
IntervalMap.vcxproj.filters		IntervalMap.vcxproj.filters
ReadMe.txt		ReadMe.txt
interval_map.cpp		interval_map.cpp
main.cpp		main.cpp
stdafx.cpp		stdafx.cpp
stdafx.h		stdafx.h
targetver.h		targetver.h

Repository files navigation

interval_map<K,V> is a data structure that efficiently associates intervals of keys of type K with values of type V. 

interval_map<K, V> is implemented on top of std::map. 

Each key-value-pair (k,v) in the m_map member means that the value v is associated to the interval from k (including) to the next key (excluding) 
in m_map.

Example: the std::map (0,'A'), (3,'B'), (5,'A') represents the mapping

0 -> 'A'
1 -> 'A'
2 -> 'A'
3 -> 'B'
4 -> 'B'
5 -> 'A'
6 -> 'A'
7 -> 'A'
... all the way to numeric_limits<key>::max()