| /dports/graphics/swftools/swftools-0.9.2/src/ |
| H A D | swfc.c | 3100 static int c_blur(map_t*args) in c_blur()
3241 static int c_play(map_t*args) in c_play()
3260 static int c_stop(map_t*args) in c_stop()
3685 static int c_put(map_t*args) in c_put()
3752 static int c_del(map_t*args) in c_del()
3758 static int c_end(map_t*args) in c_end()
3861 static int c_swf(map_t*args) in c_swf()
3950 int fakechar(map_t*args) in fakechar()
4274 map_t result; in parseArguments()
4429 map_t args; in parseArgumentsForCommand()
[all …]
|
| /dports/games/spring/spring_98.0/rts/Map/ |
| H A D | MapInfo.h | 63 struct map_t { struct
|
| /dports/games/fightorperish/fop-0.5/src/ |
| H A D | fop.c | 40 } map_t; typedef
116 map_t * loadmap(int level);
117 void freemap(map_t * * map);
119 int bomb(map_t * map, int plyx, int plyy);
120 void opendoor(map_t * map, int x, int y);
195 map_t * map; in game()
1288 void opendoor(map_t * map, int x, int y) in opendoor()
1458 void freemap(map_t * * map) in freemap()
1473 map_t * loadmap(int level) in loadmap()
1478 map_t * map; in loadmap()
[all …]
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/include/o3tl/ |
| H A D | lru_map.hxx | 47 typedef std::unordered_map<Key, list_iterator_t, KeyHash, KeyEqual> map_t; typedef in o3tl::lru_map
48 typedef typename map_t::iterator map_iterator_t;
49 typedef typename map_t::const_iterator map_const_iterator_t;
52 map_t mLruMap;
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/forms/source/xforms/ |
| H A D | NameContainer.hxx | 40 typedef std::map<OUString,T> map_t; typedef in NameContainer
41 map_t maItems;
44 typename map_t::const_iterator findItem( const OUString& rName ) in findItem()
100 typename map_t::const_iterator aIter = findItem( rName ); in getByName()
|
| /dports/math/GiNaC/ginac-1.8.2/check/ |
| H A D | check_cra.cpp | 94 typedef std::map<cln::cl_I, std::size_t> map_t; in main() typedef
95 map_t the_map; in main()
108 for (map_t::const_iterator i = the_map.begin(); i != the_map.end(); ++i) in main()
|
| /dports/science/afni/afni-AFNI_21.3.16/src/SUMA/gts/src/ |
| H A D | stripe.c | 33 } map_t; typedef
36 map_t * map;
43 const map_t * map);
45 const map_t * map);
205 const map_t * map) in tri_data_num_unused_neighbors2()
262 const map_t * map) in tri_data_unused_neighbors2()
307 map_t * map = data; in triangle_priority()
323 map_t * map = user_data; in print_heap_element()
475 map_t * map; in map_new()
477 map = g_malloc (sizeof (map_t)); in map_new()
[all …]
|
| /dports/devel/level-zero/level-zero-1.7.4/source/inc/ |
| H A D | ze_singleton.h | 23 using map_t = std::unordered_map < key_t, ptr_t >; variable
26 map_t map; ///< single instance of singleton for each unique key
|
| /dports/emulators/qemu/qemu-6.2.0/roms/openbios/include/arch/ppc/ |
| H A D | residual.h | 79 typedef struct map_t { struct
83 } map_t; typedef
110 map_t maps[MAX_SEGS];
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/sort/common/ |
| H A D | scheduler.hpp | 65 equal_t, scoped_alloc> map_t; typedef
66 typedef typename map_t::iterator it_map;
71 map_t mp;
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | hash_illegal_resize.cc | 95 map_t; in main() typedef
97 map_t g; in main()
|
| H A D | hash_initial_size.cc | 90 map_t; in main() typedef
95 map_t g(int_hash(), in main()
|
| H A D | hash_mod.cc | 73 map_t; in main() typedef
75 map_t r_c; in main()
|
| H A D | hash_resize.cc | 83 map_t; in main() typedef
85 map_t g; in main()
|
| H A D | hash_resize_neg.cc | 52 typedef cc_hash_table< int, char> map_t; in main() typedef
55 map_t h; in main()
|
| H A D | hash_find_neg.cc | 53 typedef cc_hash_table<int, char> map_t; in main() typedef
56 map_t h; in main()
65 map_t::iterator it = h.find(1); // { dg-error "conversion from" } in main()
|
| H A D | priority_queue_xref.cc | 103 typedef cc_hash_table< int, pq_t::point_iterator> map_t; typedef in mapped_priority_queue
106 map_t m_map;
151 map_t::point_iterator map_it = m_map.find(r_str); in erase()
|
| H A D | store_hash.cc | 87 map_t; in main() typedef
89 map_t h; in main()
|
| H A D | tree_join.cc | 61 typedef tree<int, char, less<int>, splay_tree_tag> map_t; in main() typedef
64 map_t h0, h1; in main()
84 map_t h2, h3; in main()
|
| H A D | hash_load_set_change.cc | 90 map_t; in main() typedef
99 map_t r_c(int_hash(), in main()
|
| H A D | hash_shift_mask.cc | 97 map_t; in main() typedef
99 map_t h; in main()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/ext/vstring/hash/wchar_t/ |
| H A D | 1.cc | 29 typedef std::unordered_map<vstring_t, int> map_t; in test01() typedef
31 map_t mymap; in test01()
38 map_t::const_iterator imap1 = mymap.begin(); in test01()
39 map_t::const_iterator imap2 = mymap.begin(); in test01()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/ext/vstring/hash/char/ |
| H A D | 1.cc | 29 typedef std::unordered_map<vstring_t, int> map_t; in test01() typedef
31 map_t mymap; in test01()
38 map_t::const_iterator imap1 = mymap.begin(); in test01()
39 map_t::const_iterator imap2 = mymap.begin(); in test01()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/ |
| H A D | ChangeLog-2005 | 1890 Change map_t to map_type.
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | ggc-common.c | 1080 typedef hash_map<const void *, std::pair<ggc_usage *, size_t > > map_t; in ggc_prune_overhead_list() typedef
1082 map_t::iterator it = ggc_mem_desc.m_reverse_object_map->begin (); in ggc_prune_overhead_list()
|