Loading [MathJax]/extensions/tex2jax.js
LSST Applications 28.0.0,g1653933729+a8ce1bb630,g1a997c3884+a8ce1bb630,g28da252d5a+5bd70b7e6d,g2bbee38e9b+638fca75ac,g2bc492864f+638fca75ac,g3156d2b45e+07302053f8,g347aa1857d+638fca75ac,g35bb328faa+a8ce1bb630,g3a166c0a6a+638fca75ac,g3e281a1b8c+7bbb0b2507,g4005a62e65+17cd334064,g414038480c+5b5cd4fff3,g41af890bb2+4ffae9de63,g4e1a3235cc+0f1912dca3,g6249c6f860+3c3976f90c,g80478fca09+46aba80bd6,g82479be7b0+77990446f6,g858d7b2824+78ba4d1ce1,g89c8672015+f667a5183b,g9125e01d80+a8ce1bb630,ga5288a1d22+2a6264e9ca,gae0086650b+a8ce1bb630,gb58c049af0+d64f4d3760,gc22bb204ba+78ba4d1ce1,gc28159a63d+638fca75ac,gcf0d15dbbd+32ddb6096f,gd6b7c0dfd1+3e339405e9,gda3e153d99+78ba4d1ce1,gda6a2b7d83+32ddb6096f,gdaeeff99f8+1711a396fd,gdd5a9049c5+b18c39e5e3,ge2409df99d+a5e4577cdc,ge33fd446bb+78ba4d1ce1,ge79ae78c31+638fca75ac,gf0baf85859+64e8883e75,gf5289d68f6+e1b046a8d7,gfa443fc69c+91d9ed1ecf,gfda6b12a05+8419469a56
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
AliasMap.cc
Go to the documentation of this file.
1// -*- lsst-c++ -*-
2/*
3 * LSST Data Management System
4 * Copyright 2008-2014 LSST Corporation.
5 *
6 * This product includes software developed by the
7 * LSST Project (http://www.lsst.org/).
8 *
9 * This program is free software: you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation, either version 3 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the LSST License Statement and
20 * the GNU General Public License along with this program. If not,
21 * see <http://www.lsstcorp.org/LegalNotices/>.
22 */
23
24#include <algorithm>
25#include <string>
26
28
29#include "lsst/pex/exceptions.h"
32
33namespace lsst {
34namespace afw {
35namespace table {
36
37void AliasMap::_apply(std::string& name) const {
38 // Loop in order to keep replacing as long as we keep finding matches,
39 // but we count how many replacements we've made to avoid an infinite loop
40 // due to a cycle between aliases. That's not the most efficient way to
41 // find cycles, but since a cycle represents a bug in some other code that
42 // should be rare, we don't really care.
43 for (std::size_t count = 0; count <= _internal.size(); ++count) {
44 Iterator i = _internal.lower_bound(name);
45 if (i != _internal.end() && i->first.size() == name.size() && i->first == name) {
46 // We have a complete match: alias matches the full name we were given
47 name = i->second;
48 } else if (i != _internal.begin()) {
49 // Might still have a partial match: in this case, the iterator
50 // lower_bound returns will be one past the best match, since
51 // smaller strings are considered "less than" longer strings
52 // that they share the same initial charaters with.
53 --i;
54 if (i->first.size() < name.size() && name.compare(0, i->first.size(), i->first) == 0) {
55 name.replace(0, i->first.size(), i->second);
56 } else {
57 return; // no match; exit
58 }
59 } else {
60 return; // no match; exit
61 }
62 }
63 throw LSST_EXCEPT(pex::exceptions::RuntimeError,
64 (boost::format("Cycle detected in schema aliases involving name '%s'") % name).str());
65}
66
68 std::string result(name);
69 _apply(result);
70 return result;
71}
72
74 Iterator i = _internal.find(name);
75 if (i == _internal.end()) {
77 (boost::format("Alias '%s' not found") % name).str());
78 }
79 return i->second;
80}
81
82void AliasMap::set(std::string const& alias, std::string const& target) {
83 _internal[alias] = target;
84 auto table = _table.lock();
85 if (table) {
86 table->handleAliasChange(alias);
87 }
88}
89
90bool AliasMap::erase(std::string const& alias) {
91 bool result = _internal.erase(alias);
92 auto table = _table.lock();
93 if (table) {
94 table->handleAliasChange(alias);
95 }
96 return result;
97}
98
99bool AliasMap::operator==(AliasMap const& other) const { return _internal == other._internal; }
100
102 // Warning: this algorithm will be invalid if _internal is replaced by an unsorted map
103 // Completely arbitrary seed
104 std::size_t result = 42;
105 for (const auto& entry : _internal) {
106 result = cpputils::hashCombine(result, entry.first, entry.second);
107 }
108 return result;
109}
110
111bool AliasMap::contains(AliasMap const& other) const {
112 return std::includes(begin(), end(), other.begin(), other.end());
113}
114} // namespace table
115} // namespace afw
116} // namespace lsst
py::object result
Definition _schema.cc:429
Key< Flag > const & target
#define LSST_EXCEPT(type,...)
Create an exception with a given type.
Definition Exception.h:48
T begin(T... args)
Mapping class that holds aliases for a Schema.
Definition AliasMap.h:36
bool contains(AliasMap const &other) const
Return true if all aliases in this are also in other (with the same targets).
Definition AliasMap.cc:111
std::string apply(std::string const &name) const
Apply any aliases that match the given field name and return a de-aliased name.
Definition AliasMap.cc:67
Iterator begin() const
Return a iterator to the beginning of the map.
Definition AliasMap.h:60
std::map< std::string, std::string >::const_iterator Iterator
An iterator over alias->target pairs.
Definition AliasMap.h:57
bool erase(std::string const &alias)
Remove an alias from the schema if it is present.
Definition AliasMap.cc:90
std::string get(std::string const &alias) const
Return the target of the given alias.
Definition AliasMap.cc:73
std::size_t hash_value() const noexcept
Return a hash of this object.
Definition AliasMap.cc:101
void set(std::string const &alias, std::string const &target)
Add an alias to the schema or replace an existing one.
Definition AliasMap.cc:82
bool operator==(AliasMap const &other) const
Equality comparison.
Definition AliasMap.cc:99
Iterator end() const
Return a iterator to one past the end of the map.
Definition AliasMap.h:63
Reports attempts to access elements using an invalid key.
Definition Runtime.h:151
T end(T... args)
T erase(T... args)
T find(T... args)
T includes(T... args)
T lower_bound(T... args)
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition hashCombine.h:35
T size(T... args)