Home
last modified time | relevance | path

Searched refs:map_t (Results 1 – 25 of 763) sorted by relevance

12345678910>>...31

/dports/games/senken/senken-0.3.0/lib/
H A Dmap.h27 typedef struct map_s map_t; typedef
69 int map_get_sizex(map_t *map);
70 int map_get_sizey(map_t *map);
87 int map_islevel(map_t *map, int x, int y);
104 int map_temporary_reset(map_t *map);
106 int map_randomize(map_t *map);
126 int map_unrent(map_t *map, int x, int y);
151 int map_clear_patronige(map_t *map);
188 int map_vacancies(map_t *map);
190 int map_positions_avail(map_t *map);
[all …]
H A Dmap.c78 map_t *ret; in map_init()
83 ret = malloc(sizeof(map_t)); in map_init()
85 memset(ret, 0, sizeof(map_t)); in map_init()
226 int map_get_sizex(map_t *map) in map_get_sizex()
231 int map_get_sizey(map_t *map) in map_get_sizey()
949 int map_temporary_reset(map_t *map) in map_temporary_reset()
1271 map_t *map;
1427 iter(map_t *map, int x, int y, in iter()
1527 int map_vacancies(map_t *map) in map_vacancies()
1679 map_find_vacant_list(map_t *map) in map_find_vacant_list()
[all …]
/dports/math/yices/yices-2.6.2/src/model/
H A Dfun_maps.h56 } map_t; typedef
74 extern map_t *new_map(uint32_t n);
80 extern void free_map(map_t *map);
105 extern void normalize_map(map_t *map);
122 static inline particle_t map_default_value(map_t *map) { in map_default_value()
129 static inline uint32_t map_num_elems(map_t *map) { in map_num_elems()
141 extern particle_t eval_map(map_t *map, particle_t k);
152 extern bool equal_maps(map_t *map1, map_t *map2);
162 extern particle_t disagreement_point(map_t *map1, map_t *map2);
171 extern particle_t distinguishing_point(map_t *map1, map_t *map2);
[all …]
H A Dfun_maps.c44 map_t *new_map(uint32_t n) { in new_map()
45 map_t *map; in new_map()
54 map = (map_t *) safe_malloc(sizeof(map_t)); in new_map()
68 void free_map(map_t *map) { in free_map()
77 static void extend_map(map_t *map) { in extend_map()
249 static bool map_is_normal(map_t *map) { in map_is_normal()
302 void normalize_map(map_t *map) { in normalize_map()
345 particle_t eval_map(map_t *map, particle_t k) { in eval_map()
367 bool equal_maps(map_t *map1, map_t *map2) { in equal_maps()
385 particle_t disagreement_point(map_t *map1, map_t *map2) { in disagreement_point()
[all …]
/dports/games/cdogs-sdl/cdogs-sdl-1.0.1/src/cdogs/c_hashmap/
H A Dhashmap.h33 typedef struct hashmap_map *map_t; typedef
38 map_t hashmap_new(void);
40 map_t hashmap_copy(const map_t in, any_t (*callback)(any_t));
49 int hashmap_iterate(map_t in, PFany f, any_t item);
50 int hashmap_iterate_keys(map_t in, PFany f, any_t item);
66 int hashmap_remove(map_t in, char* key);
71 int hashmap_get_one(map_t m, any_t *arg);
72 int hashmap_get_one_key(map_t m, any_t *arg);
78 void hashmap_clear(map_t in, void(*callback)(any_t));
83 void hashmap_free(map_t in);
[all …]
H A Dhashmap.c34 map_t hashmap_new(void) in hashmap_new()
36 map_t m = malloc(sizeof(struct hashmap_map)); in hashmap_new()
57 map_t dst;
58 const map_t src;
62 map_t hashmap_copy(const map_t in, any_t (*callback)(any_t)) in hashmap_copy()
64 map_t m = hashmap_new(); in hashmap_copy()
262 static int hashmap_rehash(map_t m) in hashmap_rehash()
447 int hashmap_get_one(map_t m, any_t *arg) in hashmap_get_one()
468 int hashmap_remove(map_t m, char *key) in hashmap_remove()
522 void hashmap_free(map_t m) in hashmap_free()
[all …]
/dports/science/vipster/vipster-1.19.1b-14-g7168a1b/vipster/
H A Dstaticmap.h12 using map_t = std::map<Key, Value>;
14 using map_t::begin;
15 using map_t::end;
16 using map_t::at;
17 using map_t::find;
18 using map_t::erase;
19 using map_t::size;
21 using typename map_t::iterator;
23 using typename map_t::key_type;
26 using typename map_t::reference;
[all …]
/dports/mail/avenger/avenger-0.8.5/libasync/
H A Dbitvec.h35 typedef unsigned long map_t; typedef
38 map_t *map;
65 map_t *const intp;
74 *intp |= map_t (1) << bitpos;
87 map[sp] |= (map_t (-1) << sb) & ~(map_t (-1) << eb); in range_set()
90 map[sp] |= (map_t (-1) << sb); in range_set()
92 map[ep] |= ~(map_t (-1) << eb); in range_set()
102 map[sp] &= ~(map_t (-1) << sb) | (map_t (-1) << eb); in range_clr()
105 map[sp] &= ~(map_t (-1) << sb); in range_clr()
107 map[ep] &= (map_t (-1) << eb); in range_clr()
[all …]
/dports/dns/knot-resolver/knot-resolver-5.4.3/lib/generic/
H A Dmap.h69 } map_t; typedef
72 static inline map_t map_make(struct knot_mm *pool) in map_make()
74 return (map_t){ .root = NULL, .pool = pool }; in map_make()
78 int map_contains(map_t *map, const char *str);
81 void *map_get(map_t *map, const char *str);
84 int map_set(map_t *map, const char *str, void *val);
87 int map_del(map_t *map, const char *str);
90 void map_clear(map_t *map);
108 int map_walk_prefixed(map_t *map, const char *prefix,
/dports/biology/iqtree/IQ-TREE-2.0.6/booster/
H A Dhashmap.h59 typedef any_t map_t; typedef
64 extern map_t hashmap_new();
73 extern int hashmap_iterate(map_t in, PFany f, any_t item);
78 extern int hashmap_put(map_t in, char* key, any_t value);
83 extern int hashmap_get(map_t in, char* key, any_t *arg);
88 extern int hashmap_remove(map_t in, char* key);
94 extern int hashmap_get_one(map_t in, any_t *arg, int remove);
99 extern void hashmap_free(map_t in);
104 extern int hashmap_length(map_t in);
/dports/devel/cccc/cccc-3.1.6/cccc/
H A Dcccc_tbl.cc33 iter_ = map_t::end(); in CCCC_Table()
69 typename map_t::iterator value_iterator=map_t::find(name); in find()
70 if(value_iterator!=map_t::end()) in find()
84 typename map_t::value_type new_pair(new_key,new_item_ptr); in find_or_insert()
85 map_t::insert(new_pair); in find_or_insert()
96 typename map_t::iterator value_iterator=map_t::find(old_item_ptr->key()); in remove()
97 if(value_iterator!=map_t::end()) in remove()
115 iter_=map_t::begin(); in reset_iterator()
127 if(iter_!=map_t::end()) in next_item()
137 return map_t::size(); in records()
/dports/devel/gdb/gdb-11.1/gdb/testsuite/gdb.python/
H A Dpy-nested-maps.c36 struct map_t struct
50 struct map_t **values; argument
56 struct map_t *
59 struct map_t *m = (struct map_t *) malloc (sizeof (struct map_t)); in create_map()
69 add_map_element (struct map_t *m, struct my_key_t k, struct my_value_t v) in add_map_element()
93 add_map_map_element (struct map_map_t *mm, struct map_t *map) in add_map_map_element()
96 mm->values = (struct map_t **) malloc (sizeof (struct map_t *) * FIXED_MAP_SIZE); in add_map_map_element()
105 struct map_t *m1 = create_map ("m1"); in main()
122 struct map_t *m2 = create_map ("m2"); in main()
/dports/ports-mgmt/pkgcompare/pkg-compare-418295d/
H A Dmap_lib.c38 struct map_t *map_create() { in map_create()
39 struct map_t *m; in map_create()
40 m=(struct map_t *)malloc(sizeof(struct map_t)); in map_create()
48 void map_set(struct map_t *m,char *name,char *value) { in map_set()
49 struct map_t *map; in map_set()
69 map->nxt=(struct map_t *)malloc(sizeof(struct map_t)); in map_set()
81 char *map_get(struct map_t *m,char *name) { in map_get()
82 struct map_t *map; in map_get()
H A Dmap_lib.h35 struct map_t { struct
36 struct map_t *nxt; argument
42 struct map_t *map_create(); argument
43 void map_set(struct map_t *m,char *name,char *value);
44 char *map_get(struct map_t *m,char *name);
/dports/games/senken/senken-0.3.0/server/
H A Dpopulation.h58 int population_exigrate(population_t *pop, map_t *map, int);
60 int population_age1year(population_t *pop, map_t *map);
63 int population_movehousing(population_t *pop, map_t *map);
64 int population_changejobs(population_t *pop, map_t *map);
65 void population_investment(population_t *pop, map_t *map, int, int);
67 int population_paysalaries(population_t *pop, map_t *map);
68 int population_payrent(population_t *pop, map_t *map);
69 int population_patronize(population_t *pop, map_t *map);
70 void population_payupkeep(population_t *pop, map_t *map);
71 void population_revenue(population_t *pop, map_t *map);
H A Dgovernment.c39 circle_iterate(map_t *map, int x, int y, int radius, in circle_iterate()
68 fill(map_t *map, int startx, int starty, int startheight, in fill()
100 fill_iterate(map_t *map, int x, int y, int radius, in fill_iterate()
170 valid_farm_pos(map_t *map, int x, int y) in valid_farm_pos()
183 valid_farm_spot(map_t *map, int x, int y) in valid_farm_spot()
204 set_farm(map_t *map, int x, int y) in set_farm()
227 add_farms(map_t *map, int amount) in add_farms()
617 add_river(map_t *map) in add_river()
708 add_lake(map_t *map) in add_lake()
747 set_types(map_t *map) in set_types()
[all …]
/dports/math/viennacl/ViennaCL-1.7.1/viennacl/device_specific/builtin_database/
H A Dcommon.hpp50 …t expression_t{ typedef std::map<scheduler::statement_node_numeric_type, ParamT> map_t; map_t d; }; typedef
51 struct device_name_t{ typedef std::map<device_name_type, expression_t> map_t; map_t d; }; typedef
52 …architecture_t{ typedef std::map<ocl::device_architecture_family, device_name_t> map_t; map_t d; }; typedef
53 struct device_type_t{ typedef std::map<device_type, device_architecture_t> map_t; map_t d; }; typedef
54 struct type{ typedef std::map<vendor_id_type, device_type_t> map_t; map_t d; }; typedef
160 …typename database_type<ParamT>::type::map_t::const_iterator vendor_it = database.map.d.find(vendor… in get_parameters()
167 …typename database_type<ParamT>::device_type_t::map_t::const_iterator device_type_it = vendor_it->s… in get_parameters()
174 …typename database_type<ParamT>::device_architecture_t::map_t::const_iterator architecture_it = dev… in get_parameters()
178 …typename database_type<ParamT>::device_architecture_t::map_t::const_iterator current_it = device_t… in get_parameters()
196 …typename database_type<ParamT>::device_name_t::map_t::const_iterator device_name_it = architecture… in get_parameters()
[all …]
/dports/biology/sra-tools/sra-tools-2.11.0/tools/bam-loader/
H A Dmate-distance-stats.hpp8 typedef std::map<distance_t, count_t> map_t; typedef in MateDistanceStats
9 map_t map;
10 static bool compare_count_descending(map_t::const_iterator a, map_t::const_iterator b) { in compare_count_descending()
13 static bool compare_distance(map_t::const_iterator a, map_t::const_iterator b) { in compare_distance()
/dports/net/arataga/oess-2.2.3/dev/test/opt_attr_flag/with_subclassing_by_extension/
H A Dmain.cpp176 map_t m_data;
184 operator()( const map_t::value_type & a ) in operator ()()
191 value_destroyer( const map_t::value_type & a ) in value_destroyer()
196 static map_t::value_type
197 cloner( const map_t::value_type & from ) in cloner()
457 map_t m_data;
477 static map_t::value_type
695 map_t m_data;
715 static map_t::value_type
866 map_t m_data;
[all …]
/dports/games/cdogs-sdl/cdogs-sdl-1.0.1/src/cdogs/draw/
H A Dchar_sprites.h43 map_t Frame[BODY_PART_COUNT + MAX_BARRELS - 1];
50 map_t classes;
51 map_t customClasses;
58 void CharSpriteClassesLoadDir(map_t classes, const char *path);
59 void CharSpriteClassesClear(map_t classes);
63 const map_t offsets, const char *anim, const int frame);
/dports/math/dune-alugrid/dune-alugrid-08c6496d4d4a33df6456c3b402182f353dc2e76d/dune/alugrid/3d/
H A Dmappings.hh231 typedef FieldVector< ctype, 2 > map_t; typedef in Dune::BilinearMapping
257 void world2map ( const world_t &, map_t & ) const;
261 ctype det ( const map_t & ) const;
275 void inverse ( const map_t & ) const;
290 typedef FieldVector< ctype, mydim > map_t; typedef in Dune::LinearMapping
326 ctype det(const map_t&) const;
329 void world2map(const world_t &, map_t &) const;
333 void map2world(const map_t &, world_t &) const ;
337 void inverse (const map_t&) const;
340 void inverseCodimOne (const map_t&) const;
[all …]
/dports/net/kamailio/kamailio-5.4.5/src/modules/tls/
H A Dtls_map.h29 #define map_t(T)\ macro
70 typedef map_t(void*) map_void_t;
71 typedef map_t(char*) map_str_t;
72 typedef map_t(int) map_int_t;
73 typedef map_t(char) map_char_t;
74 typedef map_t(float) map_float_t;
75 typedef map_t(double) map_double_t;
/dports/games/cdogs-sdl/cdogs-sdl-1.0.1/src/cdogs/
H A Dpic_manager.h36 map_t pics; // of NamedPic
37 map_t sprites; // of NamedSprites
38 map_t customPics; // of NamedPic
39 map_t customSprites; // of NamedSprites
55 map_t pics, map_t sprites);
/dports/x11/mlterm/mlterm-3.9.1/encodefilter/src/
H A Def_ucs4_map.c31 } map_t; typedef
35 static map_t map_table[] = {
109 map_t *map; in ef_map_ucs4_to_cs()
110 static map_t *cached_map; in ef_map_ucs4_to_cs()
125 for (count = 0; count < sizeof(map_table) / sizeof(map_t); count++) { in ef_map_ucs4_to_cs()
188 map_t *map; in ef_map_ucs4_to()
189 static map_t *cached_map; in ef_map_ucs4_to()
241 map_t *map; in ef_map_ucs4_to_iso2022cs()
242 static map_t *cached_map; in ef_map_ucs4_to_iso2022cs()
278 map_t *map; in ef_map_to_ucs4()
[all …]
/dports/games/quetoo/quetoo-0.6.1/src/vanctf/
H A Dcycle.c7 map_t *newmapt; in cycle_get_next_map()
8 map_t *walk; in cycle_get_next_map()
9 map_t *maphead = NULL; in cycle_get_next_map()
10 map_t *maptail = NULL; in cycle_get_next_map()
27 newmapt = gi.TagMalloc(sizeof(map_t), TAG_LEVEL); in cycle_get_next_map()

12345678910>>...31