Home
last modified time | relevance | path

Searched refs:p_map (Results 1 – 25 of 282) sorted by relevance

12345678910>>...12

/dports/multimedia/vlc/vlc-3.0.16/modules/control/globalhotkeys/
H A Dxcb.c75 hotkey_mapping_t *p_map; member
131 if( p_sys->p_map ) in Open()
164 free( p_sys->p_map ); in Close()
188 if( !p_map ) in GetModifier()
290 p_sys->p_map = NULL; in Mapping()
321 hotkey_mapping_t *p_map = realloc( p_sys->p_map, in Mapping() local
323 if( !p_map ) in Mapping()
328 p_sys->p_map = p_map; in Mapping()
349 const hotkey_mapping_t *p_map = &p_sys->p_map[i]; in Register() local
353 p_map->i_modifier, p_map->p_keys[j], in Register()
[all …]
/dports/emulators/kcemu/KCemu-0.5.1/src/libdbg/
H A Ddbg.cc26 p_map::p_map(const char *name, bool allow_subkeys) in p_map() function in p_map
32 p_map::~p_map(void) in ~p_map()
39 p_map::get_name(void) in get_name()
47 p_map::set_allow_subkeys(bool allow_subkeys) in set_allow_subkeys()
53 p_map::get_allow_subkeys(void) in get_allow_subkeys()
60 _map = new p_map("", false); in p_tree()
71 p_map *m; in add()
82 p_map::const_iterator m_it = m->find(ptr); in add()
86 p_map *new_map = new p_map(tmp, false); in add()
103 p_map *m; in check_path()
[all …]
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/D3dB/
H A Dgenerate_map_indexes.F16 integer p_map(*) local
77 p_map(j+(k-1)*ny) = p
165 integer p_map(*) local
208 i = p_map(j+(k-1)*ny)+1
211 p_map(j+(k-1)*ny) = p
236 integer p_map(*) local
256 p_map(j+(k-1)*ny) = p
271 p1 = p_map(1+(i-1)*ny)
273 p2 = p_map(1+(j-1)*ny)
280 p = p_map(jj+(kk-1)*ny)
[all …]
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/D3dB/
H A Dgenerate_map_indexes.F16 integer p_map(*) local
77 p_map(j+(k-1)*ny) = p
165 integer p_map(*) local
208 i = p_map(j+(k-1)*ny)+1
211 p_map(j+(k-1)*ny) = p
236 integer p_map(*) local
256 p_map(j+(k-1)*ny) = p
271 p1 = p_map(1+(i-1)*ny)
273 p2 = p_map(1+(j-1)*ny)
280 p = p_map(jj+(kk-1)*ny)
[all …]
/dports/misc/kgeography/kgeography-21.12.3/src/
H A Dkgeography.cpp45 p_map = 0; in kgeography()
152 delete p_map; in ~kgeography()
209 if (!p_map) in showEvent()
306 i = askQuestionNumber(p_map -> count(division::eClick), &ok); in askMap()
344 i = askQuestionNumber(p_map -> count(division::eFlag), &ok); in askFlagDivisions()
360 i = askQuestionNumber(p_map -> count(division::eFlag), &ok); in askDivisionFlags()
415 delete p_map; in setMap()
416 p_map = m; in setMap()
419 QString mapName = p_map -> getName(); in setMap()
420 QString divisionType = p_map->getDivisionsString(); in setMap()
[all …]
H A Dmapasker.cpp127 correctRgb = p_map -> getColor(correctDivision).rgb(); in handleMapClick()
139 aux = p_map -> getWhatIs(c, !p_asker); in handleMapClick()
140 …he author and tell the %1 map has nothing associated to color %2,%3,%4.", p_map -> getFile(), qRed… in handleMapClick()
148 const division *vDivision = p_map -> getDivision(aux); in handleMapClick()
177 vDivision = p_map->getDivision(origColor); in handleMapClick()
181 vDivision = p_map->getDivision(vColorRgb); in handleMapClick()
203 QString divisionType = p_map->getDivisionsString(); in getQuestionHook()
214 image.load(p_map->getMapFile()); in showEvent()
223 QList<const division*> divisions = p_map->getAllDivisionsOrdered(); in showEvent()
/dports/editors/libreoffice/libreoffice-7.2.6.2/vcl/unx/generic/app/
H A Di18n_keysym.cxx345 keymap_t const* p_map = nullptr; in KeysymToUnicode() local
347 p_map = p_keymap[n_byte3]; in KeysymToUnicode()
349 p_map = &keymap255; in KeysymToUnicode()
351 if ((p_map != nullptr) && (n_byte4 >= p_map->first) && (n_byte4 <= p_map->last) ) in KeysymToUnicode()
352 return p_map->map[n_byte4 - p_map->first]; in KeysymToUnicode()
/dports/editors/libreoffice6/libreoffice-6.4.7.2/vcl/unx/generic/app/
H A Di18n_keysym.cxx341 keymap_t const* p_map = nullptr; in KeysymToUnicode() local
343 p_map = p_keymap[n_byte3]; in KeysymToUnicode()
345 p_map = &keymap255; in KeysymToUnicode()
347 if ((p_map != nullptr) && (n_byte4 >= p_map->first) && (n_byte4 <= p_map->last) ) in KeysymToUnicode()
348 return p_map->map[n_byte4 - p_map->first]; in KeysymToUnicode()
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/K1dB/
H A DK1dB.F58 value=value.and.BA_alloc_get(mt_int,nz,'p_map',p_map(2),p_map(1))
74 int_mb(p_map(1)+k-1) = p
103 int_mb(p_map(1)+k-1) = p
113 if (int_mb(p_map(1)+k-1) .eq. taskid) then
138 value = value.and.BA_free_heap(p_map(2))
179 p = int_mb(p_map(1)+k-1)
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/K1dB/
H A DK1dB.F58 value=value.and.BA_alloc_get(mt_int,nz,'p_map',p_map(2),p_map(1))
74 int_mb(p_map(1)+k-1) = p
103 int_mb(p_map(1)+k-1) = p
113 if (int_mb(p_map(1)+k-1) .eq. taskid) then
138 value = value.and.BA_free_heap(p_map(2))
179 p = int_mb(p_map(1)+k-1)
/dports/emulators/kcemu/KCemu-0.5.1/include/libdbg/
H A Ddbg.h38 class p_map : public std::map<const char *, p_map *, str_cmp_func>
45 p_map(const char *name, bool allow_subkeys);
46 virtual ~p_map(void);
56 p_map *_map;
59 void clear(p_map *map);
60 void dump(std::ostream& os, p_map *map, int level) const;
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/C1dB/
H A DC1dB.F80 value = value.and.BA_alloc_get(mt_int,nz(nb),'p_map',p_map(2,nb),
81 > p_map(1,nb))
98 int_mb(p_map(1,nb)+k-1) = p
127 int_mb(p_map(1,nb)+k-1) = p
137 if (int_mb(p_map(1,nb)+k-1) .eq. taskid) then
163 value = value.and.BA_free_heap(p_map(2,nb))
206 p = int_mb(p_map(1,nb)+k-1)
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/D1dB/
H A DD1dB.F81 value = value.and.BA_alloc_get(mt_int,nz(nb),'p_map',p_map(2,nb),
82 > p_map(1,nb))
99 int_mb(p_map(1,nb)+k-1) = p
128 int_mb(p_map(1,nb)+k-1) = p
138 if (int_mb(p_map(1,nb)+k-1) .eq. taskid) then
164 value = value.and.BA_free_heap(p_map(2,nb))
207 p = int_mb(p_map(1,nb)+k-1)
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/D1dB/
H A DD1dB.F81 value = value.and.BA_alloc_get(mt_int,nz(nb),'p_map',p_map(2,nb),
82 > p_map(1,nb))
99 int_mb(p_map(1,nb)+k-1) = p
128 int_mb(p_map(1,nb)+k-1) = p
138 if (int_mb(p_map(1,nb)+k-1) .eq. taskid) then
164 value = value.and.BA_free_heap(p_map(2,nb))
207 p = int_mb(p_map(1,nb)+k-1)
/dports/audio/festival/speech_tools/speech_class/
H A DEST_TrackMap.cc50 p_map[i]=NO_SUCH_CHANNEL; in clear()
56 p_map[i]=from.p_map[i]; in copy()
126 if (p_map[i] == channel) in channel_type()
139 if (p_map[i]> last) in last_channel()
140 last = p_map[i]; in last_channel()
/dports/graphics/mapserver/mapserver-7.6.4/mapscript/python/
H A Dpymodule.i261 self.p_map = None
263 self.p_map = map%}
289 args[1].p_map=args[0]
297 layer.p_map=args[0]
299 layer.p_map=None
307 layer.p_map=args[0]
309 layer.p_map=None
/dports/audio/festival/speech_tools/include/
H A DEST_TrackMap.h92 short p_map[num_channel_types];
134 { p_map[(int)type] = pos; } in set()
138 { short c = p_map[(int)type]; in get()
146 { return p_map[(int)type] != NO_SUCH_CHANNEL in has_channel()
/dports/astro/opencpn/OpenCPN-5.2.4/libs/glshim/src/gl/
H A Deval.c108 #define p_map(d, name, func, code) { \ macro
123 p_map(d, color4, glColor4f, code); \
124 p_map(d, index, glIndexf, code); \
125 p_map(d, normal, glNormal3f, code); \
126 p_map(d, texture1, glTexCoord1f, code); \
127 p_map(d, texture2, glTexCoord2f, code); \
128 p_map(d, texture3, glTexCoord3f, code); \
129 p_map(d, texture4, glTexCoord4f, code); \
130 p_map(d, vertex3, glVertex3f, code); \
131 p_map(d, vertex4, glVertex4f, code);
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dprim_minimum_spanning_tree.hpp69 PredecessorMap p_map, in prim_minimum_spanning_tree() argument
75 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
81 (const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
84 (g, *vertices(g).first, predecessor_map(p_map). in prim_minimum_spanning_tree()
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dprim_minimum_spanning_tree.hpp65 PredecessorMap p_map, const bgl_named_params< P, T, R >& params) in prim_minimum_spanning_tree() argument
69 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
75 const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
78 predecessor_map(p_map).weight_map(get(edge_weight, g)), in prim_minimum_spanning_tree()
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/
H A Dprim_minimum_spanning_tree.hpp69 PredecessorMap p_map, in prim_minimum_spanning_tree() argument
75 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
81 (const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
84 (g, *vertices(g).first, predecessor_map(p_map). in prim_minimum_spanning_tree()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dprim_minimum_spanning_tree.hpp69 PredecessorMap p_map, in prim_minimum_spanning_tree() argument
75 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
81 (const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
84 (g, *vertices(g).first, predecessor_map(p_map). in prim_minimum_spanning_tree()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dprim_minimum_spanning_tree.hpp65 PredecessorMap p_map, const bgl_named_params< P, T, R >& params) in prim_minimum_spanning_tree() argument
69 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
75 const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
78 predecessor_map(p_map).weight_map(get(edge_weight, g)), in prim_minimum_spanning_tree()
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dprim_minimum_spanning_tree.hpp65 PredecessorMap p_map, const bgl_named_params< P, T, R >& params)
69 params.predecessor_map(p_map),
75 const VertexListGraph& g, PredecessorMap p_map)
78 predecessor_map(p_map).weight_map(get(edge_weight, g)),
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dprim_minimum_spanning_tree.hpp69 PredecessorMap p_map, in prim_minimum_spanning_tree() argument
75 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
81 (const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
84 (g, *vertices(g).first, predecessor_map(p_map). in prim_minimum_spanning_tree()

12345678910>>...12