/*============================================================================ CMake - Cross Platform Makefile Generator Copyright 2000-2009 Kitware, Inc., Insight Software Consortium Distributed under the OSI-approved BSD License (the "License"); see accompanying file Copyright.txt for details. This software is distributed WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the License for more information. ============================================================================*/ #include "cmDefinitions.h" //---------------------------------------------------------------------------- cmDefinitions::Def cmDefinitions::NoDef; //---------------------------------------------------------------------------- cmDefinitions::cmDefinitions(cmDefinitions* parent) : Up(parent) { } //---------------------------------------------------------------------------- cmDefinitions::Def const& cmDefinitions::GetInternal(const std::string& key) { MapType::const_iterator i = this->Map.find(key); if(i != this->Map.end()) { return i->second; } if(cmDefinitions* up = this->Up) { // Query the parent scope and store the result locally. Def def = up->GetInternal(key); return this->Map.insert(MapType::value_type(key, def)).first->second; } return this->NoDef; } //---------------------------------------------------------------------------- const char* cmDefinitions::Get(const std::string& key) { Def const& def = this->GetInternal(key); return def.Exists? def.c_str() : 0; } //---------------------------------------------------------------------------- void cmDefinitions::Set(const std::string& key, const char* value) { Def def(value); this->Map[key] = def; } void cmDefinitions::Erase(const std::string& key) { this->Map.erase(key); } //---------------------------------------------------------------------------- std::vector cmDefinitions::LocalKeys() const { std::vector keys; keys.reserve(this->Map.size()); // Consider local definitions. for(MapType::const_iterator mi = this->Map.begin(); mi != this->Map.end(); ++mi) { if (mi->second.Exists) { keys.push_back(mi->first); } } return keys; } //---------------------------------------------------------------------------- cmDefinitions cmDefinitions::MakeClosure( std::list::const_reverse_iterator rbegin, std::list::const_reverse_iterator rend) { std::set undefined; cmDefinitions closure; closure.MakeClosure(undefined, rbegin, rend); return closure; } //---------------------------------------------------------------------------- void cmDefinitions::MakeClosure(std::set& undefined, std::list::const_reverse_iterator rbegin, std::list::const_reverse_iterator rend) { for (std::list::const_reverse_iterator it = rbegin; it != rend; ++it) { // Consider local definitions. for(MapType::const_iterator mi = it->Map.begin(); mi != it->Map.end(); ++mi) { // Use this key if it is not already set or unset. if(this->Map.find(mi->first) == this->Map.end() && undefined.find(mi->first) == undefined.end()) { if(mi->second.Exists) { this->Map.insert(*mi); } else { undefined.insert(mi->first); } } } } } //---------------------------------------------------------------------------- std::vector cmDefinitions::ClosureKeys() const { std::vector defined; std::set bound; cmDefinitions const* up = this; while (up) { // Consider local definitions. for(MapType::const_iterator mi = up->Map.begin(); mi != up->Map.end(); ++mi) { // 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); } } up = up->Up; } return defined; }