Home
last modified time | relevance | path

Searched refs:blocks_map (Results 1 – 4 of 4) sorted by relevance

/dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/
H A Dcovariance_impl.cc100 map<T, vector<int>> blocks_map; in CheckForDuplicates() local
102 blocks_map[blocks[i]].push_back(i); in CheckForDuplicates()
108 for (int i = 0; i < blocks_map[*it].size() - 1; ++i) { in CheckForDuplicates()
109 duplicates << blocks_map[*it][i] << ", "; in CheckForDuplicates()
111 duplicates << blocks_map[*it].back() << ")"; in CheckForDuplicates()
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/
H A Dcovariance_impl.cc100 map<T, vector<int> > blocks_map; in CheckForDuplicates() local
102 blocks_map[blocks[i]].push_back(i); in CheckForDuplicates()
108 for (int i = 0; i < blocks_map[*it].size() - 1; ++i) { in CheckForDuplicates()
109 duplicates << blocks_map[*it][i] << ", "; in CheckForDuplicates()
111 duplicates << blocks_map[*it].back() << ")"; in CheckForDuplicates()
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/
H A Dcovariance_impl.cc91 std::map<T, std::vector<int>> blocks_map; in CheckForDuplicates() local
93 blocks_map[blocks[i]].push_back(i); in CheckForDuplicates()
99 for (int i = 0; i < blocks_map[*it].size() - 1; ++i) { in CheckForDuplicates()
100 duplicates << blocks_map[*it][i] << ", "; in CheckForDuplicates()
102 duplicates << blocks_map[*it].back() << ")"; in CheckForDuplicates()
/dports/security/py-angr/angr-9.0.5405/angr/analyses/decompiler/
H A Dclinic.py350 blocks_map = defaultdict(set)
354 blocks_map[node.addr].add(node)
362 a = analysis(self.function, blocks=blocks_map, graph=ail_graph)