-
Notifications
You must be signed in to change notification settings - Fork 710
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Craig Wittenberg
committed
Apr 6, 2018
1 parent
b25c342
commit f24f776
Showing
33 changed files
with
3,756 additions
and
976 deletions.
There are no files selected for viewing
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,121 @@ | ||
| /******************************************************************** | ||
| BagOValues.h | ||
| Copyright (c) Microsoft Corporation. All rights reserved. | ||
| Licensed under the MIT License. | ||
| ********************************************************************/ | ||
|
|
||
| #include <map> | ||
| #include <vector> | ||
| #include <algorithm> | ||
|
|
||
| #include "spinlock.h" | ||
|
|
||
| using namespace std; | ||
|
|
||
| template <class TValue> | ||
| class BagOValues | ||
| { | ||
| typedef pair<wstring, TValue> TPair; | ||
| typedef vector<TPair> TVector; | ||
| typedef typename TVector::const_iterator TItr; | ||
|
|
||
| SpinLock m_spinlock; | ||
| TVector m_Values; | ||
| wstring m_lastStr; | ||
| TItr m_LastItr; | ||
|
|
||
| public: | ||
| BagOValues() | ||
| { | ||
| } | ||
|
|
||
| // copies the value, but doesn't assume any memory mangement needs be done | ||
| void Add(wstring key, TValue value) | ||
| { | ||
| this->m_spinlock.Lock(); | ||
| wstring lowered; | ||
| lowered.resize(key.size()); | ||
| transform(key.begin(), key.end(), lowered.begin(), ::tolower); | ||
| m_Values.insert(m_Values.end(), make_pair(lowered, value)); | ||
|
|
||
| m_lastStr.resize(0); // clear this after new data added | ||
| this->m_spinlock.Unlock(); | ||
| } | ||
|
|
||
| void Sort() | ||
| { | ||
| this->m_spinlock.Lock(); | ||
| sort(m_Values.begin(), m_Values.end()); | ||
| this->m_spinlock.Unlock(); | ||
| } | ||
|
|
||
| // Retrieve with fPrefix = true means return values for the tree at the point of the query matched; | ||
| // we must consume the whole query for anything to be returned | ||
| // fPrefix = false means that we only return values when an entire key matches and we match substrings of the query | ||
| // | ||
| // NOTE: returns a newly allocated vector; must delete it | ||
| vector<TValue> *Retrieve(const wstring& query, bool fPrefix = true, unsigned maxResults = ULONG_MAX) | ||
| { | ||
| wstring lowered; | ||
| lowered.resize(query.size()); | ||
| transform(query.begin(), query.end(), lowered.begin(), ::tolower); | ||
|
|
||
| vector<TValue> *results = NULL; | ||
| TValue val = TValue(); | ||
| TPair laspair = make_pair(lowered, val); | ||
|
|
||
| this->m_spinlock.Lock(); | ||
|
|
||
| // if last saved string/iterator is a prefix of the new string, start there | ||
| TVector::const_iterator itr; | ||
| if (m_lastStr.size() != 0 && lowered.compare(0, m_lastStr.size(), m_lastStr) == 0) | ||
| itr = m_LastItr; | ||
| else | ||
| { | ||
| itr = lower_bound(m_Values.begin(), m_Values.end(), laspair, CompareFirst); | ||
|
|
||
| m_lastStr = lowered; | ||
| m_LastItr = itr; | ||
| } | ||
|
|
||
| for (; itr != m_Values.end(); itr++) | ||
| { | ||
| const wstring& key = itr->first; | ||
| int cmp = key.compare(0, lowered.size(), lowered); | ||
| if (cmp == 0) | ||
| { | ||
| if (!fPrefix && key.size() != lowered.size()) | ||
| { | ||
| // need exact match (not just prefix); skip | ||
| continue; | ||
| } | ||
|
|
||
| if (results == NULL) | ||
| results = new vector<TValue>(); | ||
|
|
||
| if (results->size() >= maxResults) | ||
| break; | ||
|
|
||
| results->insert(results->end(), itr->second); | ||
| } | ||
| else if (cmp > 0) | ||
| { | ||
| // iterated past the strings which match on the prefix | ||
| break; | ||
| } | ||
| } | ||
|
|
||
| this->m_spinlock.Unlock(); | ||
| return results; | ||
| } | ||
|
|
||
| private: | ||
| static bool CompareFirst(const TPair& a, const TPair& b) | ||
| { | ||
| return a.first < b.first; | ||
| } | ||
| }; | ||
|
|
This file contains 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
This file contains 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
This file contains 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
Oops, something went wrong.