/dports/games/libretro-2048/libretro-2048-35a299c/cairo/src/ |
H A D | cairo-hash.c | 123 const cairo_hash_table_arrangement_t *arrangement; member 213 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup_unique_key() 266 tmp.arrangement = hash_table->arrangement + 1; in _cairo_hash_table_resize() 268 assert (tmp.arrangement - hash_table_arrangements < in _cairo_hash_table_resize() 276 tmp.arrangement = hash_table->arrangement - 1; in _cairo_hash_table_resize() 279 new_size = tmp.arrangement->size; in _cairo_hash_table_resize() 293 hash_table->arrangement = tmp.arrangement; in _cairo_hash_table_resize() 316 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup() 375 table_size = hash_table->arrangement->size; in _cairo_hash_table_random_entry() 384 step = hash % hash_table->arrangement->rehash; in _cairo_hash_table_random_entry() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/cairo/cairo/src/ |
H A D | cairo-hash.c | 123 const cairo_hash_table_arrangement_t *arrangement; member 213 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup_unique_key() 266 tmp.arrangement = hash_table->arrangement + 1; in _cairo_hash_table_resize() 268 assert (tmp.arrangement - hash_table_arrangements < in _cairo_hash_table_resize() 276 tmp.arrangement = hash_table->arrangement - 1; in _cairo_hash_table_resize() 279 new_size = tmp.arrangement->size; in _cairo_hash_table_resize() 293 hash_table->arrangement = tmp.arrangement; in _cairo_hash_table_resize() 316 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup() 375 table_size = hash_table->arrangement->size; in _cairo_hash_table_random_entry() 384 step = hash % hash_table->arrangement->rehash; in _cairo_hash_table_random_entry() [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/cairo/cairo/src/ |
H A D | cairo-hash.c | 123 const cairo_hash_table_arrangement_t *arrangement; member 213 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup_unique_key() 266 tmp.arrangement = hash_table->arrangement + 1; in _cairo_hash_table_resize() 268 assert (tmp.arrangement - hash_table_arrangements < in _cairo_hash_table_resize() 276 tmp.arrangement = hash_table->arrangement - 1; in _cairo_hash_table_resize() 279 new_size = tmp.arrangement->size; in _cairo_hash_table_resize() 293 hash_table->arrangement = tmp.arrangement; in _cairo_hash_table_resize() 316 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup() 375 table_size = hash_table->arrangement->size; in _cairo_hash_table_random_entry() 384 step = hash % hash_table->arrangement->rehash; in _cairo_hash_table_random_entry() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/cairo/cairo/src/ |
H A D | cairo-hash.c | 123 const cairo_hash_table_arrangement_t *arrangement; member 213 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup_unique_key() 266 tmp.arrangement = hash_table->arrangement + 1; in _cairo_hash_table_resize() 268 assert (tmp.arrangement - hash_table_arrangements < in _cairo_hash_table_resize() 276 tmp.arrangement = hash_table->arrangement - 1; in _cairo_hash_table_resize() 279 new_size = tmp.arrangement->size; in _cairo_hash_table_resize() 293 hash_table->arrangement = tmp.arrangement; in _cairo_hash_table_resize() 316 table_size = hash_table->arrangement->size; in _cairo_hash_table_lookup() 375 table_size = hash_table->arrangement->size; in _cairo_hash_table_random_entry() 384 step = hash % hash_table->arrangement->rehash; in _cairo_hash_table_random_entry() [all …]
|
/dports/graphics/cairo/cairo-1.17.4/util/cairo-script/ |
H A D | cairo-script-hash.c | 175 table_size = hash_table->arrangement->size; in _csi_hash_table_lookup_unique_key() 183 step = key->hash % hash_table->arrangement->rehash; in _csi_hash_table_lookup_unique_key() 229 tmp.arrangement = hash_table->arrangement + 1; in _csi_hash_table_manage() 235 tmp.arrangement = hash_table->arrangement - 1; in _csi_hash_table_manage() 240 for (i = 0; i < hash_table->arrangement->size; ++i) { in _csi_hash_table_manage() 259 tmp.entries = calloc (tmp.arrangement->size, in _csi_hash_table_manage() 285 hash_table->arrangement = tmp.arrangement; in _csi_hash_table_manage() 309 table_size = hash_table->arrangement->size; in _csi_hash_table_lookup() 320 step = key->hash % hash_table->arrangement->rehash; in _csi_hash_table_lookup() 393 table_size = hash_table->arrangement->size; in _csi_hash_table_lookup_exact_key() [all …]
|
/dports/java/jfreechart/jfreechart-1.0.17/source/org/jfree/chart/block/ |
H A D | BlockContainer.java | 79 private Arrangement arrangement; field in BlockContainer 94 public BlockContainer(Arrangement arrangement) { in BlockContainer() argument 95 ParamChecks.nullNotPermitted(arrangement, "arrangement"); in BlockContainer() 96 this.arrangement = arrangement; in BlockContainer() 106 return this.arrangement; in getArrangement() 114 public void setArrangement(Arrangement arrangement) { in setArrangement() argument 116 this.arrangement = arrangement; in setArrangement() 156 this.arrangement.add(block, key); in add() 164 this.arrangement.clear(); in clear() 178 return this.arrangement.arrange(this, g2, constraint); in arrange() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
H A D | ModelArrange.hpp | 12 using arrangement::ArrangePolygon; 13 using arrangement::ArrangePolygons; 14 using arrangement::ArrangeParams; 15 using arrangement::InfiniteBed; 16 using arrangement::CircleBed; 19 using VirtualBedFn = std::function<void(arrangement::ArrangePolygon&)>; 21 [[noreturn]] inline void throw_if_out_of_bed(arrangement::ArrangePolygon&) in throw_if_out_of_bed() 41 arrangement::arrange(input, bed, params); in arrange_objects() 54 arrangement::arrange(copies, bed, params); in duplicate()
|
H A D | ModelArrange.cpp | 8 arrangement::ArrangePolygons get_arrange_polys(const Model &model, ModelInstancePtrs &instances) in get_arrange_polys() 39 Slic3r::arrangement::ArrangePolygon get_arrange_poly(const Model &model) in get_arrange_poly() 56 void duplicate(Model &model, Slic3r::arrangement::ArrangePolygons &copies, VirtualBedFn vfn) in duplicate() 63 for (arrangement::ArrangePolygon &ap : copies) { in duplicate()
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/slic3r/GUI/Jobs/ |
H A D | ArrangeJob.hpp | 15 using ArrangePolygon = arrangement::ArrangePolygon; 16 using ArrangePolygons = arrangement::ArrangePolygons; 49 std::optional<arrangement::ArrangePolygon> get_wipe_tower_arrangepoly(const Plater &); 64 arrangement::ArrangePolygon get_arrange_polygon() const in get_arrange_polygon() 77 arrangement::ArrangePolygon get_arrange_poly(T obj, const Plater *plater) in get_arrange_poly() 79 using ArrangePolygon = arrangement::ArrangePolygon; in get_arrange_poly()
|
H A D | FillBedJob.cpp | 52 ap.bed_idx = arrangement::UNARRANGED; in prepare() 85 ap.bed_idx = arrangement::UNARRANGED; in prepare() 112 arrangement::ArrangeParams params; in process() 130 arrangement::arrange(m_selected, m_unselected, m_bedpts, params); in process() 151 if (ap.bed_idx != arrangement::UNARRANGED && (ap.priority != 0 || ap.bed_idx == 0)) in finalize()
|
/dports/sysutils/gnome-control-center/gnome-control-center-41.2/panels/display/ |
H A D | display-arrangement.css | 2 .display-arrangement.monitor { 9 .display-arrangement.monitor.primary { 13 .display-arrangement.monitor:selected { 17 .display-arrangement.monitor-label {
|
/dports/x11/squeekboard/squeekboard-d49ce45de0956432cef9b957f806d9377fee4bc0/src/data/ |
H A D | loading.rs | 97 fn _get_arrangement_names(name: &str, arrangement: ArrangementKind) in _get_arrangement_names() 100 let name_with_arrangement = match arrangement { in _get_arrangement_names() 107 ret.push((arrangement, name_with_arrangement)); in _get_arrangement_names() 200 .map(move |(arrangement, name)| in to_layout_paths() 201 (arrangement, format!("{}{}", prepend_directory, name)) in to_layout_paths() 211 layout_paths.flat_map(move |(arrangement, layout_path)| { in to_layout_sources() 215 arrangement, in to_layout_sources() 222 sources.push((arrangement, DataSource::Resource(layout_path.clone()))); in to_layout_sources() 232 arrangement: ArrangementKind, in iter_layout_sources() 237 let names = get_preferred_names(name, arrangement); in iter_layout_sources()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Arr_face_index_map.h | 83 Base (const_cast<Arrangement_2&> (*(other.arrangement()))) in Arr_face_index_map() 95 this->attach (const_cast<Arrangement_2&> (*(other.arrangement()))); 228 n_faces = static_cast<unsigned int>(this->arrangement()->number_of_faces()); in _init() 243 for (fit = this->arrangement()->faces_begin(); in _init() 244 fit != this->arrangement()->faces_end(); ++fit, ++index) in _init()
|
H A D | Arr_vertex_index_map.h | 84 Base (const_cast<Arrangement_2&> (*(other.arrangement()))) in Arr_vertex_index_map() 96 this->attach (const_cast<Arrangement_2&> (*(other.arrangement()))); 235 n_vertices = static_cast<unsigned int>(this->arrangement()->number_of_vertices()); in _init() 250 for (vit = this->arrangement()->vertices_begin(); in _init() 251 vit != this->arrangement()->vertices_end(); ++vit, ++index) in _init()
|
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/tests/ |
H A D | TutHokkaido3.cocoa5 | 8 // What is a hyperplane arrangement? 46 -- An arrangement can be used also with its defining equation: 56 -- An arrangement A is CENTRAL if every hyperplane of A contains the origin. 70 -- An arrangement A in K^l is ESSENTIAL if 96 -- The POSET OF INTERSECTION L(A) of an arrangement A is the set of all 152 -- The CHARACTERISTIC POLYNOMIAL of an arrangement A is the polynomial 161 -- The TUTTE POLYNOMIAL of an arrangement A the polynomial 191 -- The operation of CONING allows to transform any arrangement in K^l with 223 -- If A is a real arrangement then 227 -- If A is a real arrangement then [all …]
|
H A D | TutHokkaido5.cocoa5 | 11 -- A MULTIARRANGEMENT (A,m) is a pair of an arrangement A and a multiplicity map m. 27 -- If m(f) = 1 for all f, we can see the multiarrangement as an arrangement. 35 -- Given a multiarrangement we can easily recover the underlying arrangement. 40 -- Similarly, given an arrangement we can constuct a multiarrangement 50 -- Given an arrangement A and one of its hyperplane H, 70 -- Let A be a central arrangement. The multiarrangement (A,m) is FREE if D(A,m) 137 -- If a central arrangement A is free with ArrExponents(A) = [ 1,e2,...,el ], then 167 -- Let A be a central arrangement and fix a hyperplane H of A. 182 -- Let A be an arrangement in K^l and f in S = K[x1,...xl] homogeneous. 207 -- Let A be a free arrangement in K^l with ArrExponents(A) = [ e1,...,el ] and [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/ |
H A D | TutHokkaido3.cocoa5 | 8 // What is a hyperplane arrangement? 46 -- An arrangement can be used also with its defining equation: 56 -- An arrangement A is CENTRAL if every hyperplane of A contains the origin. 70 -- An arrangement A in K^l is ESSENTIAL if 96 -- The POSET OF INTERSECTION L(A) of an arrangement A is the set of all 152 -- The CHARACTERISTIC POLYNOMIAL of an arrangement A is the polynomial 161 -- The TUTTE POLYNOMIAL of an arrangement A the polynomial 191 -- The operation of CONING allows to transform any arrangement in K^l with 223 -- If A is a real arrangement then 227 -- If A is a real arrangement then [all …]
|
H A D | TutHokkaido5.cocoa5 | 11 -- A MULTIARRANGEMENT (A,m) is a pair of an arrangement A and a multiplicity map m. 27 -- If m(f) = 1 for all f, we can see the multiarrangement as an arrangement. 35 -- Given a multiarrangement we can easily recover the underlying arrangement. 40 -- Similarly, given an arrangement we can constuct a multiarrangement 50 -- Given an arrangement A and one of its hyperplane H, 70 -- Let A be a central arrangement. The multiarrangement (A,m) is FREE if D(A,m) 137 -- If a central arrangement A is free with ArrExponents(A) = [ 1,e2,...,el ], then 167 -- Let A be a central arrangement and fix a hyperplane H of A. 182 -- Let A be an arrangement in K^l and f in S = K[x1,...xl] homogeneous. 207 -- Let A be a free arrangement in K^l with ArrExponents(A) = [ e1,...,el ] and [all …]
|
/dports/audio/csound/csound-6.15.0/interfaces/ |
H A D | CsoundFile.cpp | 260 if(arrangement.size() > 0) in save() 629 arrangement.erase(arrangement.begin(), arrangement.end()); in removeAll() 1096 return arrangement.size(); in getArrangementCount() 1101 arrangement.erase(arrangement.begin(), arrangement.end()); in removeArrangement() 1106 arrangement.push_back(instrumentName); in addArrangement() 1111 return arrangement[index]; in getArrangement() 1136 it != arrangement.end(); in exportArrangement() 1165 if(arrangement.size() > 0) in exportArrangementForPerformance() 1220 arrangement.insert(arrangement.begin() + index, instrument); in insertArrangement() 1225 arrangement.erase(arrangement.begin() + index); in removeArrangement() [all …]
|
/dports/mail/roundcube-calendar-kolab/roundcubemail-plugins-kolab-3.5.5/plugins/calendar/localization/ |
H A D | da_DK.inc | 43 $labels['new_event'] = 'Nyt arrangement'; 44 $labels['edit_event'] = 'Redigér arrangement'; 101 $labels['createfrommail'] = 'Gem som arrangement'; 102 $labels['importevents'] = 'Importér arrangement'; 169 $labels['eventupdatesubjectempty'] = 'Et arrangement der vedrører dig er blevet opdateret'; 180 $labels['itipdeclineevent'] = 'Sikker på at du vil afvise dette arrangement?'; 184 $labels['notanattendee'] = 'Du er ikke opført som deltager for dette arrangement'; 205 $labels['deleteobjectconfirm'] = 'Sikker på at du vil slette dette arrangement?'; 206 $labels['deleteventconfirm'] = 'Sikker på at du vil slette dette arrangement?'; 234 $labels['changeeventconfirm'] = 'Tilpas arrangement'; [all …]
|
/dports/java/jfreechart/jfreechart-1.0.17/source/org/jfree/chart/title/ |
H A D | LegendItemBlockContainer.java | 101 public LegendItemBlockContainer(Arrangement arrangement, int datasetIndex, in LegendItemBlockContainer() argument 103 super(arrangement); in LegendItemBlockContainer() 117 public LegendItemBlockContainer(Arrangement arrangement, Dataset dataset, in LegendItemBlockContainer() argument 119 super(arrangement); in LegendItemBlockContainer()
|
/dports/audio/vst3sdk/vst3sdk-3.7.1_build_50-1-g8199057/public.sdk/source/vst/testsuite/bus/ |
H A D | checkaudiobusarrangement.cpp | 78 SpeakerArrangement arrangement; in run() local 79 if (audioEffect->getBusArrangement (dir, busIndex, arrangement) == kResultTrue) in run() 81 if (busInfo.channelCount != SpeakerArr::getChannelCount (arrangement)) in run()
|
/dports/misc/vxl/vxl-3.3.2/core/vidl/ |
H A D | vidl_pixel_format.cxx | 50 t.arrangement = vidl_pixel_traits_of<pix_type>::arrangement(); in traits() 80 t.arrangement = vidl_pixel_traits_of<VIDL_PIXEL_FORMAT_UNKNOWN>::arrangement(); in traits()
|
/dports/x11/plasma5-plasma-desktop/plasma-desktop-5.23.5/containments/desktop/plugins/folder/ |
H A D | viewpropertiesmenu.h | 26 Q_PROPERTY(int arrangement READ arrangement WRITE setArrangement NOTIFY arrangementChanged) 51 int arrangement() const; 52 void setArrangement(int arrangement);
|
/dports/x11-toolkits/p5-Prima/Prima-1.63/Prima/ |
H A D | FrameSet.pm | 384 arrangement => fra::Horizontal, # Vertical or horizontal insertion of frames. 462 vertical => $me-> {arrangement} == fra::Horizontal, 534 if ($me-> {arrangement} == fra::Vertical) { 580 my $idx = $me-> {arrangement} == fra::Horizontal ? 0 : 1; 663 if ($me-> {arrangement} == fra::Horizontal) { 689 if ($me-> {arrangement} == fra::Horizontal) { 715 sub arrangement subroutine 719 my $haveIt = exists($me-> {arrangement}); 720 return if $haveIt && ($me-> {arrangement} == $_[0]); 721 $me-> {arrangement} = $_[0]; [all …]
|