Merge topic 'clean-up-cmDefinitions'

f170985e cmDefinitions: Make the ClosureKeys method static.
98c5c903 cmDefinitions: Centralize knowledge of iterator type.
7872201b cmDefinitions: Remove internal MakeClosure method.
This commit is contained in:
Brad King 2015-05-19 11:09:28 -04:00 committed by CMake Topic Stage
commit 2d1d8af9b1
3 changed files with 40 additions and 61 deletions

View File

@ -18,32 +18,29 @@ cmDefinitions::Def cmDefinitions::NoDef;
//---------------------------------------------------------------------------- //----------------------------------------------------------------------------
cmDefinitions::Def const& cmDefinitions::GetInternal( cmDefinitions::Def const& cmDefinitions::GetInternal(
const std::string& key, const std::string& key, StackIter begin, StackIter end)
std::list<cmDefinitions>::reverse_iterator rbegin,
std::list<cmDefinitions>::reverse_iterator rend)
{ {
assert(rbegin != rend); assert(begin != end);
MapType::const_iterator i = rbegin->Map.find(key); MapType::const_iterator i = begin->Map.find(key);
if (i != rbegin->Map.end()) if (i != begin->Map.end())
{ {
return i->second; return i->second;
} }
std::list<cmDefinitions>::reverse_iterator rit = rbegin; StackIter it = begin;
++rit; ++it;
if (rit == rend) if (it == end)
{ {
return cmDefinitions::NoDef; return cmDefinitions::NoDef;
} }
Def const& def = cmDefinitions::GetInternal(key, rit, rend); Def const& def = cmDefinitions::GetInternal(key, it, end);
return rbegin->Map.insert(MapType::value_type(key, def)).first->second; return begin->Map.insert(MapType::value_type(key, def)).first->second;
} }
//---------------------------------------------------------------------------- //----------------------------------------------------------------------------
const char* cmDefinitions::Get(const std::string& key, const char* cmDefinitions::Get(const std::string& key,
std::list<cmDefinitions>::reverse_iterator rbegin, StackIter begin, StackIter end)
std::list<cmDefinitions>::reverse_iterator rend)
{ {
Def const& def = cmDefinitions::GetInternal(key, rbegin, rend); Def const& def = cmDefinitions::GetInternal(key, begin, end);
return def.Exists? def.c_str() : 0; return def.Exists? def.c_str() : 0;
} }
@ -77,36 +74,24 @@ std::vector<std::string> cmDefinitions::LocalKeys() const
} }
//---------------------------------------------------------------------------- //----------------------------------------------------------------------------
cmDefinitions cmDefinitions::MakeClosure( cmDefinitions cmDefinitions::MakeClosure(StackConstIter begin,
std::list<cmDefinitions>::const_reverse_iterator rbegin, StackConstIter end)
std::list<cmDefinitions>::const_reverse_iterator rend)
{ {
std::set<std::string> undefined;
cmDefinitions closure; cmDefinitions closure;
closure.MakeClosure(undefined, rbegin, rend); std::set<std::string> undefined;
return closure; for (StackConstIter it = begin; it != end; ++it)
}
//----------------------------------------------------------------------------
void
cmDefinitions::MakeClosure(std::set<std::string>& undefined,
std::list<cmDefinitions>::const_reverse_iterator rbegin,
std::list<cmDefinitions>::const_reverse_iterator rend)
{
for (std::list<cmDefinitions>::const_reverse_iterator it = rbegin;
it != rend; ++it)
{ {
// Consider local definitions. // Consider local definitions.
for(MapType::const_iterator mi = it->Map.begin(); for(MapType::const_iterator mi = it->Map.begin();
mi != it->Map.end(); ++mi) mi != it->Map.end(); ++mi)
{ {
// Use this key if it is not already set or unset. // Use this key if it is not already set or unset.
if(this->Map.find(mi->first) == this->Map.end() && if(closure.Map.find(mi->first) == closure.Map.end() &&
undefined.find(mi->first) == undefined.end()) undefined.find(mi->first) == undefined.end())
{ {
if(mi->second.Exists) if(mi->second.Exists)
{ {
this->Map.insert(*mi); closure.Map.insert(*mi);
} }
else else
{ {
@ -115,22 +100,29 @@ cmDefinitions::MakeClosure(std::set<std::string>& undefined,
} }
} }
} }
return closure;
} }
//---------------------------------------------------------------------------- //----------------------------------------------------------------------------
std::vector<std::string> std::vector<std::string>
cmDefinitions::ClosureKeys(std::set<std::string>& bound) const cmDefinitions::ClosureKeys(StackConstIter begin, StackConstIter end)
{ {
std::set<std::string> bound;
std::vector<std::string> defined; std::vector<std::string> defined;
defined.reserve(this->Map.size());
for(MapType::const_iterator mi = this->Map.begin(); for (StackConstIter it = begin; it != end; ++it)
mi != this->Map.end(); ++mi)
{ {
// Use this key if it is not already set or unset. defined.reserve(defined.size() + it->Map.size());
if(bound.insert(mi->first).second && mi->second.Exists) for(MapType::const_iterator mi = it->Map.begin();
mi != it->Map.end(); ++mi)
{ {
defined.push_back(mi->first); // Use this key if it is not already set or unset.
if(bound.insert(mi->first).second && mi->second.Exists)
{
defined.push_back(mi->first);
}
} }
} }
return defined; return defined;
} }

View File

@ -28,12 +28,13 @@
*/ */
class cmDefinitions class cmDefinitions
{ {
typedef std::list<cmDefinitions>::reverse_iterator StackIter;
typedef std::list<cmDefinitions>::const_reverse_iterator StackConstIter;
public: public:
/** Get the value associated with a key; null if none. /** Get the value associated with a key; null if none.
Store the result locally if it came from a parent. */ Store the result locally if it came from a parent. */
static const char* Get(const std::string& key, static const char* Get(const std::string& key,
std::list<cmDefinitions>::reverse_iterator rbegin, StackIter begin, StackIter end);
std::list<cmDefinitions>::reverse_iterator rend);
/** Set (or unset if null) a value associated with a key. */ /** Set (or unset if null) a value associated with a key. */
void Set(const std::string& key, const char* value); void Set(const std::string& key, const char* value);
@ -43,12 +44,10 @@ public:
/** Get the set of all local keys. */ /** Get the set of all local keys. */
std::vector<std::string> LocalKeys() const; std::vector<std::string> LocalKeys() const;
std::vector<std::string> static std::vector<std::string> ClosureKeys(StackConstIter begin,
ClosureKeys(std::set<std::string>& bound) const; StackConstIter end);
static cmDefinitions MakeClosure( static cmDefinitions MakeClosure(StackConstIter begin, StackConstIter end);
std::list<cmDefinitions>::const_reverse_iterator rbegin,
std::list<cmDefinitions>::const_reverse_iterator rend);
private: private:
// String with existence boolean. // String with existence boolean.
@ -74,11 +73,7 @@ private:
MapType Map; MapType Map;
static Def const& GetInternal(const std::string& key, static Def const& GetInternal(const std::string& key,
std::list<cmDefinitions>::reverse_iterator rbegin, StackIter begin, StackIter end);
std::list<cmDefinitions>::reverse_iterator rend);
void MakeClosure(std::set<std::string>& undefined,
std::list<cmDefinitions>::const_reverse_iterator rbegin,
std::list<cmDefinitions>::const_reverse_iterator rend);
}; };
#endif #endif

View File

@ -94,16 +94,8 @@ public:
std::vector<std::string> ClosureKeys() const std::vector<std::string> ClosureKeys() const
{ {
std::vector<std::string> closureKeys; return cmDefinitions::ClosureKeys(this->VarStack.rbegin(),
std::set<std::string> bound; this->VarStack.rend());
for (std::list<cmDefinitions>::const_reverse_iterator it =
this->VarStack.rbegin(); it != this->VarStack.rend(); ++it)
{
std::vector<std::string> const& localKeys = it->ClosureKeys(bound);
closureKeys.insert(closureKeys.end(),
localKeys.begin(), localKeys.end());
}
return closureKeys;
} }
void PopDefinitions() void PopDefinitions()