Home
last modified time | relevance | path

Searched refs:rrs1 (Results 1 – 10 of 10) sorted by relevance

/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/retrie-0.1.1.1/tests/
H A DGroundTerms.hs88 terms = HashSet.fromList $ map groundTerms rrs1
95 [ ("apply", apply rrs1, terms)
96 , ("apply twice", apply rrs1 >> apply rrs2, terms)
97 , ("query", () <$ query rrs1, terms)
98 , ("focus", focus rrs1, terms)
102 , ("iterateR 0", iterateR 0 (apply rrs1), HashSet.empty)
104 , ("iterateR 5", iterateR 5 (apply rrs1), terms)
107 , ("addImports", addImports mempty >> apply rrs1, terms)
108 , ("ifChanged normal", ifChanged (apply rrs1) (apply rrs2), terms)
110 , ("ifChanged weird", ifChanged (addImports mempty) (apply rrs1), terms)
[all …]
/dports/dns/knot3-lib/knot-3.1.5/src/libknot/
H A Drdataset.c207 bool knot_rdataset_eq(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2) in knot_rdataset_eq() argument
209 if (rrs1 == NULL || rrs2 == NULL || rrs1->count != rrs2->count) { in knot_rdataset_eq()
213 knot_rdata_t *rr1 = rrs1->rdata; in knot_rdataset_eq()
215 for (uint16_t i = 0; i < rrs1->count; ++i) { in knot_rdataset_eq()
250 int knot_rdataset_merge(knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2, in knot_rdataset_merge() argument
253 if (rrs1 == NULL || rrs2 == NULL) { in knot_rdataset_merge()
259 int ret = knot_rdataset_add(rrs1, rr2, mm); in knot_rdataset_merge()
270 int knot_rdataset_intersect(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2, in knot_rdataset_intersect() argument
273 if (rrs1 == NULL || rrs2 == NULL || out == NULL) { in knot_rdataset_intersect()
278 knot_rdata_t *rr1 = rrs1->rdata; in knot_rdataset_intersect()
[all …]
H A Drdataset.h124 bool knot_rdataset_eq(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2);
147 int knot_rdataset_merge(knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2,
160 int knot_rdataset_intersect(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2,
/dports/dns/knot3/knot-3.1.5/src/libknot/
H A Drdataset.c207 bool knot_rdataset_eq(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2) in knot_rdataset_eq() argument
209 if (rrs1 == NULL || rrs2 == NULL || rrs1->count != rrs2->count) { in knot_rdataset_eq()
213 knot_rdata_t *rr1 = rrs1->rdata; in knot_rdataset_eq()
215 for (uint16_t i = 0; i < rrs1->count; ++i) { in knot_rdataset_eq()
250 int knot_rdataset_merge(knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2, in knot_rdataset_merge() argument
253 if (rrs1 == NULL || rrs2 == NULL) { in knot_rdataset_merge()
259 int ret = knot_rdataset_add(rrs1, rr2, mm); in knot_rdataset_merge()
270 int knot_rdataset_intersect(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2, in knot_rdataset_intersect() argument
273 if (rrs1 == NULL || rrs2 == NULL || out == NULL) { in knot_rdataset_intersect()
278 knot_rdata_t *rr1 = rrs1->rdata; in knot_rdataset_intersect()
[all …]
H A Drdataset.h124 bool knot_rdataset_eq(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2);
147 int knot_rdataset_merge(knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2,
160 int knot_rdataset_intersect(const knot_rdataset_t *rrs1, const knot_rdataset_t *rrs2,
/dports/dns/py-dnspython2/dnspython-2.1.0/tests/
H A Dtest_message.py244 rrs1 = a.find_rrset(a.answer, n, dns.rdataclass.IN, dns.rdatatype.SOA)
247 self.assertEqual(rrs1, rrs2)
253 rrs1 = a.find_rrset(a.answer, n, dns.rdataclass.IN, dns.rdatatype.SOA)
256 self.assertEqual(rrs1, rrs2)
262 rrs1 = a.get_rrset(a.answer, n, dns.rdataclass.IN, dns.rdatatype.SOA)
265 self.assertEqual(rrs1, rrs2)
271 rrs1 = a.get_rrset(a.answer, n, dns.rdataclass.IN, dns.rdatatype.TXT)
274 self.assertTrue(rrs1 is None)
275 self.assertEqual(rrs1, rrs2)
/dports/dns/py-dnspython/dnspython-1.16.0/tests/
H A Dtest_message.py207 rrs1 = a.find_rrset(a.answer, n, dns.rdataclass.IN, dns.rdatatype.SOA)
210 self.failUnless(rrs1 == rrs2)
/dports/dns/unbound/unbound-1.14.0/validator/
H A Dval_sigcrypt.c1100 struct canon_rr *rrs1, *rrs2, *p1, *p2; in rrset_canonical_equal() local
1133 rrs1 = regional_alloc(region, sizeof(struct canon_rr)*d1->count); in rrset_canonical_equal()
1135 if(!rrs1 || !rrs2) return 1; /* alloc failure */ in rrset_canonical_equal()
1138 canonical_sort(k1, d1, &sortree1, rrs1); in rrset_canonical_equal()
/dports/net/kea/kea-2.0.1/src/lib/dns/tests/
H A Dmessage_unittest.cc342 RRsetPtr rrs1(new RRset(test_name, RRClass::IN(), RRType::A(), RRTTL(60))); in TEST_F() local
343 EXPECT_TRUE(message_render.hasRRset(Message::SECTION_ANSWER, rrs1)); in TEST_F()
344 EXPECT_FALSE(message_render.hasRRset(Message::SECTION_ADDITIONAL, rrs1)); in TEST_F()
359 EXPECT_THROW(message_render.hasRRset(bogus_section, rrs1), OutOfRange); in TEST_F()
/dports/science/mpqc/mpqc-2.3.1/src/lib/math/isosurf/
H A Dshape.cc299 double rrs1 = r+s1.radius(); in newUncappedTorusHoleShape() local
303 if (sqrt(rrs1*rrs1-r*r) + sqrt(rrs2*rrs2-r*r) < r12) in newUncappedTorusHoleShape()