| /third_party/glib/glib/deprecated/ |
| D | grel.c | 215 GRelation *relation = user_data; in relation_delete_value_tuple() local
217 g_slice_free1 (relation->fields * sizeof (gpointer), tuple); in relation_delete_value_tuple()
237 g_relation_destroy (GRelation *relation) in g_relation_destroy() argument
241 if (relation) in g_relation_destroy()
243 for (i = 0; i < relation->fields; i += 1) in g_relation_destroy()
245 if (relation->hashed_tuple_tables[i]) in g_relation_destroy()
247 g_hash_table_foreach (relation->hashed_tuple_tables[i], g_relation_free_array, NULL); in g_relation_destroy()
248 g_hash_table_destroy (relation->hashed_tuple_tables[i]); in g_relation_destroy()
252 g_hash_table_foreach (relation->all_tuples, relation_delete_value_tuple, relation); in g_relation_destroy()
253 g_hash_table_destroy (relation->all_tuples); in g_relation_destroy()
[all …]
|
| D | grel.h | 70 void g_relation_destroy (GRelation *relation);
72 void g_relation_index (GRelation *relation,
77 void g_relation_insert (GRelation *relation,
80 gint g_relation_delete (GRelation *relation,
84 GTuples* g_relation_select (GRelation *relation,
88 gint g_relation_count (GRelation *relation,
92 gboolean g_relation_exists (GRelation *relation,
95 void g_relation_print (GRelation *relation);
|
| /third_party/glib/tests/ |
| D | relation-test.c | 64 GRelation *relation; in main() local
69 relation = g_relation_new (2); in main()
71 g_relation_index (relation, 0, g_int_hash, g_int_equal); in main()
72 g_relation_index (relation, 1, g_int_hash, g_int_equal); in main()
79 g_relation_insert (relation, data + i, data + i + 1); in main()
80 g_relation_insert (relation, data + i, data + i - 1); in main()
85 g_assert (! g_relation_exists (relation, data + i, data + i)); in main()
86 g_assert (! g_relation_exists (relation, data + i, data + i + 2)); in main()
87 g_assert (! g_relation_exists (relation, data + i, data + i - 2)); in main()
92 g_assert (g_relation_exists (relation, data + i, data + i + 1)); in main()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 48 EquivalenceRelation<uint32_t, UInt32Hash, UInt32Equals> relation; in TEST() local
49 ASSERT_TRUE(relation.GetAllKnownValues().empty()); in TEST()
52 relation.Register(element); in TEST()
56 relation.MakeEquivalent(0, element); in TEST()
57 relation.MakeEquivalent(element - 1, element + 1); in TEST()
61 relation.MakeEquivalent(80, element); in TEST()
62 relation.MakeEquivalent(element - 1, element + 1); in TEST()
65 relation.MakeEquivalent(78, 80); in TEST()
69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 48 EquivalenceRelation<uint32_t, UInt32Hash, UInt32Equals> relation; in TEST() local
49 ASSERT_TRUE(relation.GetAllKnownValues().empty()); in TEST()
52 relation.Register(element); in TEST()
56 relation.MakeEquivalent(0, element); in TEST()
57 relation.MakeEquivalent(element - 1, element + 1); in TEST()
61 relation.MakeEquivalent(80, element); in TEST()
62 relation.MakeEquivalent(element - 1, element + 1); in TEST()
65 relation.MakeEquivalent(78, 80); in TEST()
69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
[all …]
|
| /third_party/spirv-tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 48 EquivalenceRelation<uint32_t, UInt32Hash, UInt32Equals> relation; in TEST() local
49 ASSERT_TRUE(relation.GetAllKnownValues().empty()); in TEST()
52 relation.Register(element); in TEST()
56 relation.MakeEquivalent(0, element); in TEST()
57 relation.MakeEquivalent(element - 1, element + 1); in TEST()
61 relation.MakeEquivalent(80, element); in TEST()
62 relation.MakeEquivalent(element - 1, element + 1); in TEST()
65 relation.MakeEquivalent(78, 80); in TEST()
69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
[all …]
|
| /third_party/gettext/gettext-tools/src/ |
| D | cldr-plural-exp.c | 75 cldr_plural_relation_free (condition->value.relation); in cldr_plural_condition_free()
80 cldr_plural_relation_free (struct cldr_plural_relation_ty *relation) in cldr_plural_relation_free() argument
82 free (relation->expression); in cldr_plural_relation_free()
83 cldr_plural_range_list_free (relation->ranges); in cldr_plural_relation_free()
84 free (relation); in cldr_plural_relation_free()
128 eval_relation (struct cldr_plural_relation_ty *relation) in eval_relation() argument
130 switch (relation->expression->operand) in eval_relation()
136 for (i = 0; i < relation->ranges->nitems; i++) in eval_relation()
138 struct cldr_plural_range_ty *range = relation->ranges->items[i]; in eval_relation()
153 relation->expression->operand = 'i'; in eval_relation()
[all …]
|
| /third_party/boost/boost/bimap/relation/detail/ |
| D | to_mutable_relation_functor.hpp | 27 namespace relation { namespace
36 operator()(const BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support:: in operator ()()
45 Tag,::boost::bimaps::relation::mutant_relation<TA,TB,Info,true> >
47 typedef ::boost::bimaps::relation::mutant_relation<TA,TB,Info,true> Relation;
50 operator()( BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support:: in operator ()()
53 return ::boost::bimaps::relation::detail::mutate<Relation>(p); in operator ()()
57 operator()( const BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support:: in operator ()()
60 return ::boost::bimaps::relation::detail::mutate<Relation>(p); in operator ()()
78 struct get_mutable_relation_functor< ::boost::bimaps::relation::mutant_relation<TA,TB,Info,true> >
80 typedef ::boost::bimaps::relation::mutant_relation<TA,TB,Info,true> Relation;
[all …]
|
| D | access_builder.hpp | 110 ::boost::bimaps::relation::member_at::left,TP_SYMMETRIC \
114 NAME( ::boost::bimaps::relation::member_at::left, \
123 ::boost::bimaps::relation::member_at::right,TP_SYMMETRIC \
127 NAME( ::boost::bimaps::relation::member_at::right, \
157 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support:: \
|
| /third_party/boost/libs/geometry/doc/generated/ |
| D | relation.qbk | 16 [section:relation_3_with_strategy relation (with strategy)]
18 '''<indexterm><primary>relation</primary></indexterm>'''
19 Calculates the relation between a pair of geometries as defined in DE-9IM.
23 de9im::matrix relation(Geometry1 const & geometry1, Geometry2 const & geometry2, Strategy const & s…
31 …elation Strategy Concept ] [strategy] [The strategy which will be used for relation calculations ]]
36 The DE-9IM matrix expressing the relation between geometries.
46 `#include <boost/geometry/algorithms/relation.hpp>`
48 [include reference/algorithms/relation.qbk]
53 [section:relation_2 relation]
55 '''<indexterm><primary>relation</primary></indexterm>'''
[all …]
|
| /third_party/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/ |
| D | TestUtilities.java | 104 int relation = CollectionUtilities.getContainmentRelation(a, b); in TestCollectionUtilities() local
105 resultMask |= (1 << relation); in TestCollectionUtilities()
106 switch (relation) { in TestCollectionUtilities()
108 checkContainment(a.size() == 0 && b.size() == 0, a, relation, b); in TestCollectionUtilities() local
111 checkContainment(a.size() == 0 && b.size() != 0, a, relation, b); in TestCollectionUtilities() local
114 checkContainment(a.equals(b) && a.size() != 0, a, relation, b); in TestCollectionUtilities() local
117 checkContainment(a.size() != 0 && b.size() == 0, a, relation, b); in TestCollectionUtilities() local
120 checkContainment(b.containsAll(a) && !a.equals(b), a, relation, b); in TestCollectionUtilities() local
123 …ainment(!CollectionUtilities.containsSome(a, b) && a.size() != 0 && b.size() != 0, a, relation, b); in TestCollectionUtilities()
126 checkContainment(a.containsAll(b) && !a.equals(b), a, relation, b); in TestCollectionUtilities() local
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/util/ |
| D | TestUtilities.java | 107 int relation = CollectionUtilities.getContainmentRelation(a, b); in TestCollectionUtilities() local
108 resultMask |= (1 << relation); in TestCollectionUtilities()
109 switch (relation) { in TestCollectionUtilities()
111 checkContainment(a.size() == 0 && b.size() == 0, a, relation, b); in TestCollectionUtilities() local
114 checkContainment(a.size() == 0 && b.size() != 0, a, relation, b); in TestCollectionUtilities() local
117 checkContainment(a.equals(b) && a.size() != 0, a, relation, b); in TestCollectionUtilities() local
120 checkContainment(a.size() != 0 && b.size() == 0, a, relation, b); in TestCollectionUtilities() local
123 checkContainment(b.containsAll(a) && !a.equals(b), a, relation, b); in TestCollectionUtilities() local
126 …ainment(!CollectionUtilities.containsSome(a, b) && a.size() != 0 && b.size() != 0, a, relation, b); in TestCollectionUtilities()
129 checkContainment(a.containsAll(b) && !a.equals(b), a, relation, b); in TestCollectionUtilities() local
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/relation/ |
| D | interface.hpp | 42 struct relation struct
67 struct relation<boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2> struct
81 return relation<Geometry1, Geometry2> in operator ()()
97 struct relation<Geometry1, boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)> > struct
111 return relation<Geometry1, Geometry2> in operator ()()
131 struct relation struct
149 return relation<Geometry1, Geometry2> in operator ()()
182 inline de9im::matrix relation(Geometry1 const& geometry1, in relation() function
186 return resolve_variant::relation in relation()
206 inline de9im::matrix relation(Geometry1 const& geometry1, in relation() function
[all …]
|
| /third_party/boost/libs/math/doc/internals/ |
| D | recurrence.qbk | 33 All of the tools in this header require a description of the recurrence relation: this takes the fo…
34 …ctor that returns a tuple containing the 3 coefficients, specifically, given a recurrence relation:
45 For example, the recurrence relation for the Bessel J and Y functions when written in this form is:
50 Therefore, given local variables /x/ and /v/ of type `double` the recurrence relation for Bessel J …
55 Similarly, the Bessel I and K recurrence relation differs just by the sign of the final term:
69 Given a functor `r` which encodes the recurrence relation for function `F` at some location /n/, th…
75 is for the dominant solution (in the backwards direction) of the recurrence relation, if there are …
79 the recurrence relation, and should be no smaller than machine epsilon. Argument /max_iter/ sets
85 Given a functor `r` which encodes the recurrence relation for function F at some location /n/, then…
91 is for the dominant solution (in the forwards direction) of the recurrence relation, if there are m…
[all …]
|
| /third_party/boost/boost/bimap/detail/ |
| D | bimap_core.hpp | 105 ::boost::bimaps::relation::member_at::left
112 ::boost::bimaps::relation::member_at::right
149 typedef ::boost::bimaps::relation::mutant_relation
196 > relation; typedef in boost::bimaps::detail::bimap_core
200 typedef BOOST_DEDUCED_TYPENAME relation::left_pair left_value_type;
201 typedef BOOST_DEDUCED_TYPENAME relation::right_pair right_value_type;
209 typedef BOOST_DEDUCED_TYPENAME relation::storage_base relation_storage_base;
292 relation
383 ::boost::bimaps::relation::support::both_keys_extractor<relation>,
406 relation,
[all …]
|
| D | map_view_base.hpp | 68 ::boost::bimaps::relation::detail:: \
69 pair_to_relation_functor<TAG,BOOST_DEDUCED_TYPENAME BIMAP::relation>, \
70 ::boost::bimaps::relation::support:: \
71 get_pair_functor<TAG, BOOST_DEDUCED_TYPENAME BIMAP::relation > \
103 typedef ::boost::bimaps::relation::detail::
105 BOOST_DEDUCED_TYPENAME BimapType::relation> value_to_base_;
113 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support::
115 BOOST_DEDUCED_TYPENAME BimapType::relation>::type value_type_;
136 ::boost::bimaps::relation::detail:: in replace_key()
148 ::boost::bimaps::relation::detail:: in replace_data()
[all …]
|
| D | set_view_base.hpp | 53 return ::boost::bimaps::relation::detail::mutate<MutantRelationStorage>(k); in operator ()()
92 ::boost::bimaps::relation::detail:: \
95 ::boost::bimaps::relation::support:: \
136 ::boost::bimaps::relation::detail:: \
139 ::boost::bimaps::relation::support:: \
202 ::boost::bimaps::relation::detail::copy_with_left_replaced(*position,l) in replace_left()
212 ::boost::bimaps::relation::detail::copy_with_right_replaced(*position,r) in replace_right()
|
| /third_party/boost/boost/bimap/relation/ |
| D | mutant_relation.hpp | 47 namespace relation { namespace
100 ::boost::bimaps::relation::detail::relation_storage<TA,TB,force_mutable>
102 typedef ::boost::bimaps::relation::detail::
156 public ::boost::bimaps::relation::detail::relation_storage<TA,TB,force_mutable>
158 typedef ::boost::bimaps::relation::detail::
228 ::boost::bimaps::relation::detail::
231 typedef ::boost::bimaps::relation::detail::
239 typedef ::boost::bimaps::relation::detail::
306 return ::boost::bimaps::relation::detail::mutate<left_pair>(*this); in get_left_pair()
311 return ::boost::bimaps::relation::detail::mutate<left_pair>(*this); in get_left_pair()
[all …]
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | ASSERT_RELATION.rst | 11 #define BOOST_MPL_ASSERT_RELATION( x, relation, y ) \\
21 a compilation error when the condition ``( x relation y )``
39 | ``x`` | An integral constant | Left operand of the checked relation. …
41 | ``y`` | An integral constant | Right operand of the checked relation. …
43 | ``relation`` | A C++ operator token | An operator token for the relation being …
66 the error message will include a name of the relation being checked,
|
| /third_party/boost/boost/bimap/relation/support/ |
| D | get.hpp | 34 namespace relation { namespace
59 namespace relation { namespace
115 ::boost::bimaps::relation::member_at::info, SymmetricType >::type
116 get(::boost::bimaps::relation::member_at::info, SymmetricType & rel) in get()
|
| /third_party/boost/libs/bimap/test/ |
| D | test_bimap_assign.cpp | 45 bm_type bm = ba::list_of< bm_type::relation >(1,0.1)(2,0.2)(3,0.3); in test_bimap_assign()
55 bm_type bm = ba::list_of< bm_type::relation >(1,0.1)(2,0.2)(3,0.3); in test_bimap_assign()
64 bm_type bm = ba::list_of< bm_type::relation >(1,0.1)(2,0.2)(3,0.3); in test_bimap_assign()
73 bm_type bm = ba::list_of< bm_type::relation >(1,0.1)(2,0.2)(3,0.3); in test_bimap_assign()
|
| D | test_relation.hpp | 45 using namespace boost::bimaps::relation::support; in test_relation_with_default_tags()
46 using namespace boost::bimaps::relation; in test_relation_with_default_tags()
84 using namespace boost::bimaps::relation::support; in test_relation_with_user_tags()
85 using namespace boost::bimaps::relation; in test_relation_with_user_tags()
123 using namespace boost::bimaps::relation::support; in test_relation()
124 using namespace boost::bimaps::relation; in test_relation()
|
| /third_party/boost/boost/bimap/views/ |
| D | list_map_view.hpp | 53 ::boost::bimaps::relation::detail::
54 pair_to_relation_functor<Tag, BOOST_DEDUCED_TYPENAME BimapType::relation >,
55 ::boost::bimaps::relation::support::
56 get_pair_functor<Tag, BOOST_DEDUCED_TYPENAME BimapType::relation >,
58 BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support::data_extractor
61 BOOST_DEDUCED_TYPENAME BimapType::relation
|
| /third_party/boost/boost/geometry/index/detail/ |
| D | distance_predicates.hpp | 64 struct relation struct
73 struct relation< to_nearest<T> > struct
82 struct relation< to_centroid<T> > struct
91 struct relation< to_furthest<T> > struct
245 typedef detail::relation<PointRelation> relation; typedef
248 typename relation::value_type,
257 result = call_type::apply(relation::value(p.point_or_relation), i, s); in apply()
|
| /third_party/boost/libs/iterator/doc/ |
| D | InteroperableIterator.rst | 23 |``x == y`` |convertible to ``bool``|``==`` is an equivalence relation over its domain. |
25 |``y == x`` |convertible to ``bool``|``==`` is an equivalence relation over its domain. |
38 |``x < y`` |convertible to ``bool``|``y - x > 0`` |``<`` is a total ordering relation |
40 |``y < x`` |convertible to ``bool``|``x - y > 0`` |``<`` is a total ordering relation |
42 |``x > y`` |convertible to ``bool``|``y < x`` |``>`` is a total ordering relation |
44 |``y > x`` |convertible to ``bool``|``x < y`` |``>`` is a total ordering relation |
|