Home
last modified time | relevance | path

Searched refs:TNodeMap (Results 1 – 16 of 16) sorted by relevance

/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/util/
H A Ditree.hpp112 typedef CLinkedMultiset<TNodeMapValue> TNodeMap; typedef in CIntervalTreeTraits
113 typedef TNodeMap::iterator TNodeMapI;
114 typedef TNodeMap::const_iterator TNodeMapCI;
188 typedef typename TTraits::TNodeMap TNodeMap; typedef
198 static void Delete(TNodeMap& m, const TNodeMapValue& v);
200 TNodeMap m_ByX;
201 TNodeMap m_ByY;
H A Ditree.inl189 void SIntervalTreeNodeIntervals<Traits>::Delete(TNodeMap& m,
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/
H A Ditree.hpp112 typedef CLinkedMultiset<TNodeMapValue> TNodeMap; typedef in CIntervalTreeTraits
113 typedef TNodeMap::iterator TNodeMapI;
114 typedef TNodeMap::const_iterator TNodeMapCI;
188 typedef typename TTraits::TNodeMap TNodeMap; typedef
198 static void Delete(TNodeMap& m, const TNodeMapValue& v);
200 TNodeMap m_ByX;
201 TNodeMap m_ByY;
H A Ditree.inl189 void SIntervalTreeNodeIntervals<Traits>::Delete(TNodeMap& m,
/dports/math/cvc4/CVC4-1.7/src/preprocessing/passes/
H A Dunconstrained_simplifier.h54 using TNodeMap = std::unordered_map<TNode, TNode, TNodeHashFunction>; variable
58 TNodeMap d_visitedOnce;
/dports/math/cvc4/CVC4-1.7/src/preprocessing/util/
H A Dite_utilities.h338 typedef std::unordered_map<TNode, Node, TNodeHashFunction> TNodeMap; typedef
413 Node substitute(TNode e, TNodeMap& substTable, TNodeMap& cache);
H A Dite_utilities.cpp1704 TNodeMap& substTable, in substitute()
1705 TNodeMap& cache) in substitute()
1707 TNodeMap::iterator it = cache.find(e), iend = cache.end(); in substitute()
1751 TNodeMap substTable; in simplifyWithCare()
1895 TNodeMap cache; in simplifyWithCare()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/misc/discrepancy/
H A Dsesame_street.cpp284 static void AddObjsToReport(const string& diagnosis, CReportNode::TNodeMap& all_objs, const string&… in AddObjsToReport()
332 CReportNode::TNodeMap& the_map = m_Objs.GetMap(); in DISCREPANCY_SUMMARIZE()
351 CReportNode::TNodeMap& sub = it.second->GetMap(); in DISCREPANCY_SUMMARIZE()
H A Ddiscrepancy_core.hpp183 typedef map<string, CRef<CReportNode>> TNodeMap; typedef in CReportNode
206 TNodeMap& GetMap() { return m_Map; } in GetMap()
218 TNodeMap m_Map;
H A Dsequence_tests.cpp502 CReportNode::TNodeMap& the_map = m_Objs.GetMap(); in DISCREPANCY_SUMMARIZE()
892 CReportNode::TNodeMap::iterator it = m_Objs.GetMap().begin(); in DISCREPANCY_SUMMARIZE()
993 CReportNode::TNodeMap::iterator it = m_Objs.GetMap().begin(); in DISCREPANCY_SUMMARIZE()
/dports/biology/seqan1/seqan-1.3.1/seqan/graph_types/
H A Dgraph_drawing.h112 template<typename TAlphabet, typename TCargo, typename TSpec, typename TPosition, typename TNodeMap>
116 TNodeMap& nodeMap) in _createTrieNodeAttributes()
H A Dgraph_types_generated_forwards.h358 …name TNodeMap> inline void _createTrieNodeAttributes(Graph<Automaton<TAlphabet, TCargo, TSpec> > c…
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_types/
H A Dgraph_drawing.h109 template<typename TAlphabet, typename TCargo, typename TSpec, typename TPosition, typename TNodeMap>
113 TNodeMap& nodeMap) in _createTrieNodeAttributes()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_types/
H A Dgraph_drawing.h109 template<typename TAlphabet, typename TCargo, typename TSpec, typename TPosition, typename TNodeMap>
113 TNodeMap& nodeMap) in _createTrieNodeAttributes()
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_types/
H A Dgraph_drawing.h113 template<typename TAlphabet, typename TCargo, typename TSpec, typename TPosition, typename TNodeMap>
117 TNodeMap& nodeMap) in _createTrieNodeAttributes()
/dports/math/cvc4/CVC4-1.7/src/theory/
H A Dtheory_engine.h221 typedef std::unordered_map<TNode, Node, TNodeHashFunction> TNodeMap; typedef