Home
last modified time | relevance | path

Searched refs:i_map (Results 1 – 25 of 75) sorted by relevance

123

/dports/multimedia/kodi/xbmc-19.3-Matrix/lib/libUPnP/Neptune/Source/Tests/Maps1/
H A DMapsTest1.cpp190 NPT_Map<int,int> i_map; in TestMap() local
191 i_map[5] = 6; in TestMap()
192 i_map[6] = 7; in TestMap()
193 i_map[9] = 0; in TestMap()
194 CHECK(i_map[0] == 0 || i_map[0] != 0); // unknown value (will cause a valgrind warning) in TestMap()
195 CHECK(i_map.GetEntryCount() == 4); in TestMap()
289 NPT_HashMap<int,int> i_map; in TestHashMap() local
290 i_map[5] = 6; in TestHashMap()
291 i_map[6] = 7; in TestHashMap()
292 i_map[9] = 0; in TestHashMap()
[all …]
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/metadyn_tools/
H A Dgraph.F410 ALLOCATE (i_map(ndim), stat=stat)
412 i_map = 0
415 i_map(idw(id)) = id
419 IF (i_map(id) == 0) THEN
421 i_map(id) = ix
427 i_map = ndim - i_map + 1
431 iperd(i_map(iprd(id))) = 1
440 ngrid(i_map(i)) = tmp(i)
565 dp_grid(i_map(i)) = tmpr(i)
585 j = MINLOC((i_map - i)**2, 1)
[all …]
/dports/science/cp2k-data/cp2k-7.1.0/src/metadyn_tools/
H A Dgraph.F410 ALLOCATE (i_map(ndim), stat=stat)
412 i_map = 0
415 i_map(idw(id)) = id
419 IF (i_map(id) == 0) THEN
421 i_map(id) = ix
427 i_map = ndim - i_map + 1
431 iperd(i_map(iprd(id))) = 1
440 ngrid(i_map(i)) = tmp(i)
565 dp_grid(i_map(i)) = tmpr(i)
585 j = MINLOC((i_map - i)**2, 1)
[all …]
/dports/graphics/p5-Imager/Imager-1.012/t/300-transform/
H A D060-map.t23 ok(i_map($imbase, [ [], [], \@map1 ]), "map1 in ch 3");
24 ok(i_map($imbase, [ \@map1, \@map1, \@map1 ]), "map1 in ch1-3");
26 ok(i_map($imbase, [ \@map1, \@map2, \@map3 ]), "map1-3 in ch 1-3");
28 ok(i_map($imbase, [ \@maps, \@mapl, \@map3 ]), "incomplete maps");
/dports/multimedia/vlc/vlc-3.0.16/modules/control/globalhotkeys/
H A Dxcb.c74 int i_map; member
162 for( int i = 0; i < p_sys->i_map; i++ ) in Close()
289 p_sys->i_map = 0; in Mapping()
322 sizeof(*p_sys->p_map) * (p_sys->i_map+1) ); in Mapping()
329 p_map += p_sys->i_map; in Mapping()
330 p_sys->i_map++; in Mapping()
347 for( int i = 0; i < p_sys->i_map; i++ ) in Register()
397 for( int i = 0; i < p_sys->i_map; i++ ) in Thread()
/dports/devel/hyperscan/hyperscan-5.4.0/src/rose/
H A Drose_in_dump.cpp70 map<RoseInVertex, u32> i_map; in dumpPreRoseGraph() local
73 i_map[v] = id; in dumpPreRoseGraph()
103 u32 u = i_map[source(e, ig)]; in dumpPreRoseGraph()
104 u32 v = i_map[target(e, ig)]; in dumpPreRoseGraph()
/dports/games/dhewm3/dhewm3-1.5.1/neo/sys/linux/runner/
H A Drunner_lib.py125 self.status[ self.maps[ self.i_map ] ] = ( self.state, time.time() )
126 self.i_map += 1
127 if ( self.i_map >= len( self.maps ) ):
174 name = self.maps[ self.i_map ]
198 self.i_map = 0
/dports/databases/pgrouting/pgrouting-3.2.0/include/coloring/
H A Dpgr_sequentialVertexColoring.hpp84 auto i_map = boost::get(boost::vertex_index, graph.graph); in sequentialVertexColoring() local
90 auto color_map = boost::make_iterator_property_map(colors.begin(), i_map); in sequentialVertexColoring()
/dports/devel/libfirm/libfirm-1.21.0/ir/lower/
H A Dlower_intrinsics.c52 i_instr_record **i_map; /**< The intrinsic instruction map. */ member
79 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) { in call_mapper()
80 const i_instr_record *r = wenv->i_map[op->code]; in call_mapper()
99 i_instr_record **i_map; in lower_intrinsics() local
104 NEW_ARR_A(i_instr_record *, i_map, n_ops); in lower_intrinsics()
105 memset((void *)i_map, 0, sizeof(*i_map) * n_ops); in lower_intrinsics()
113 assert(op->code < (unsigned) ARR_LEN(i_map)); in lower_intrinsics()
115 list[i].i_instr.link = i_map[op->code]; in lower_intrinsics()
116 i_map[op->code] = &list[i].i_instr; in lower_intrinsics()
121 wenv.i_map = i_map; in lower_intrinsics()
/dports/math/gecode/gecode-0916a1a/gecode/int/extensional/
H A Dlayered-graph.hpp349 StateIdx* i_map = r.alloc<StateIdx>(max_states); in initialize() local
368 i_map[j]=i_n++; in initialize()
373 i_map[j] = 0; in initialize()
389 std::swap(o_map,i_map); i_n=0; in initialize()
394 i_map[j]=i_n++; in initialize()
782 StateIdx* i_map = r.alloc<StateIdx>(max_states); in copy() local
794 i_map[j]=i_n++; in copy()
805 s.edges[d].i_state = i_map[s.edges[d].i_state]; in copy()
811 std::swap(o_map,i_map); i_n=0; in copy()
818 i_map[j]=i_n++; in copy()
[all …]
/dports/databases/pgrouting/pgrouting-3.2.0/include/traversal/
H A Dpgr_depthFirstSearch.hpp134 auto i_map = boost::get(boost::vertex_index, graph.graph); in depthFirstSearch_single_vertex() local
137 auto vertex_color_map = boost::make_iterator_property_map(colors.begin(), i_map); in depthFirstSearch_single_vertex()
/dports/graphics/p5-Imager/Imager-1.012/
H A Dmap.c38 i_map(i_img *im, unsigned char (*maps)[256], unsigned int mask) { in i_map() function
/dports/devel/boost-docs/boost_1_72_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/devel/hyperscan/boost_1_75_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/databases/percona57-server/boost_1_59_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/databases/percona57-client/boost_1_59_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/devel/boost-libs/boost_1_72_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/distributed/
H A Ddehne_gotz_min_spanning_tree.hpp603 OutputIterator out, VertexIndex i_map)
612 (g, weight_map, out, i_map,
613 make_iterator_property_map(ranks.begin(), i_map),
614 make_iterator_property_map(parents.begin(), i_map),
615 make_iterator_property_map(supervertices.begin(), i_map));

123