Home
last modified time | relevance | path

Searched refs:urs (Results 1 – 25 of 656) sorted by relevance

12345678910>>...27

/dports/dns/knot3/knot-3.1.5/src/knot/common/
H A Dunreachable.c40 init_list(&res->urs); in knot_unreachables_init()
47 if (urs == NULL) { in knot_unreachables_ttl()
63 if (urs != NULL && *urs != NULL) { in knot_unreachables_deinit()
65 WALK_LIST_DELSAFE(ur, nxt, (*urs)->urs) { in knot_unreachables_deinit()
70 free(*urs); in knot_unreachables_deinit()
71 *urs = NULL; in knot_unreachables_deinit()
90 assert(urs != NULL); in get_ur()
94 WALK_LIST_DELSAFE(ur, nxt, urs->urs) { in get_ur()
112 if (urs == NULL) { in knot_unreachable_is()
131 if (urs == NULL) { in knot_unreachable_add()
[all …]
H A Dunreachable.h36 list_t urs; member
53 void knot_unreachables_deinit(knot_unreachables_t **urs);
63 uint32_t knot_unreachables_ttl(knot_unreachables_t *urs, uint32_t new_ttl_ms);
74 bool knot_unreachable_is(knot_unreachables_t *urs,
85 void knot_unreachable_add(knot_unreachables_t *urs,
/dports/dns/knot3-lib/knot-3.1.5/src/knot/common/
H A Dunreachable.c40 init_list(&res->urs); in knot_unreachables_init()
47 if (urs == NULL) { in knot_unreachables_ttl()
63 if (urs != NULL && *urs != NULL) { in knot_unreachables_deinit()
65 WALK_LIST_DELSAFE(ur, nxt, (*urs)->urs) { in knot_unreachables_deinit()
70 free(*urs); in knot_unreachables_deinit()
71 *urs = NULL; in knot_unreachables_deinit()
90 assert(urs != NULL); in get_ur()
94 WALK_LIST_DELSAFE(ur, nxt, urs->urs) { in get_ur()
112 if (urs == NULL) { in knot_unreachable_is()
131 if (urs == NULL) { in knot_unreachable_add()
[all …]
H A Dunreachable.h36 list_t urs; member
53 void knot_unreachables_deinit(knot_unreachables_t **urs);
63 uint32_t knot_unreachables_ttl(knot_unreachables_t *urs, uint32_t new_ttl_ms);
74 bool knot_unreachable_is(knot_unreachables_t *urs,
85 void knot_unreachable_add(knot_unreachables_t *urs,
/dports/math/4ti2/4ti2-Release_1_6_9/src/groebner/
H A DSaturationGenSet.cpp105 *out << "Saturating " << urs.get_size()-urs.count() << " variable(s).\n"; in compute_bounded()
110 saturate(gens, sat, urs); in compute_bounded()
120 urs.get_size()-urs.count()-sat.count(), index); in compute_bounded()
133 saturate(gens, sat, urs); in compute_bounded()
151 urs.get_size()-urs.count()-sat.count(), index); in compute_bounded()
216 const BitSet& urs) in saturate_zero_columns() argument
237 const BitSet& urs) in is_saturated() argument
251 const BitSet& urs, in saturate() argument
281 const BitSet& urs) in saturate() argument
314 const BitSet& urs) in next_saturation() argument
[all …]
H A DMaxMinGenSet.cpp135 BitSet::extend(urs, ext_urs); in compute_bounded()
200 const BitSet& urs, in compute_saturations() argument
211 while (!is_saturated(tmp_sat, urs)) in compute_saturations()
218 saturate(gens, tmp_sat, urs); in compute_saturations()
228 const BitSet& urs) in saturate_zero_columns() argument
244 const BitSet& urs) in is_saturated() argument
258 const BitSet& urs) in saturate() argument
286 const BitSet& urs) in next_saturation() argument
290 assert(!is_saturated(sat, urs)); in next_saturation()
330 const BitSet& urs) in add_support() argument
[all …]
H A DWeightAlgorithm.cpp31 const BitSet& urs, in check_weights() argument
60 const BitSet& urs, in get_weights() argument
68 if (urs[i] == 1) { all_ones[i] = 0; } in get_weights()
81 while (mask.count()<mask.get_size()-urs.count() && in get_weights()
82 get_weights(matrix,urs,mask,weights)); in get_weights()
93 const BitSet& urs, in get_weights() argument
101 if (is_candidate(matrix[i], urs, mask)) in get_weights()
123 const BitSet& urs, in is_candidate() argument
138 const BitSet& urs) in violates_urs() argument
140 assert(v.get_size() == urs.get_size()); in violates_urs()
[all …]
H A DBounded.cpp52 const BitSet& urs,
57 const BitSet& urs,
62 const BitSet& urs,
66 const BitSet& urs,
70 const BitSet& urs,
74 const BitSet& urs,
312 if (!urs[i]) in add_positive_support()
337 if (!urs[i]) in add_negative_support()
532 BitSet rs(urs); in lp_bounded()
796 BitSet rs(urs); in bounded_projection()
[all …]
H A DFeasible.cpp57 urs = new BitSet(dim); in Feasible()
67 if (_urs != 0) { *urs = *_urs; } in Feasible()
93 if (*urs == _urs) { return; } in Feasible()
107 if (!BitSet::set_subset(*urs, _urs)) { in Feasible()
113 *urs = _urs; in Feasible()
123 urs = new BitSet(*feasible.urs); in operator =()
163 delete urs; in ~Feasible()
193 *urs, cost, in bounded()
237 const BitSet& urs = feasible.get_urs();
238 BitSet ext_urs(urs.get_size()+1);
[all …]
H A DSaturationGenSet.h54 const BitSet& urs);
59 const BitSet& urs,
65 const BitSet& urs);
69 const BitSet& urs,
75 const BitSet& urs);
80 const BitSet& urs);
85 const BitSet& urs,
92 const BitSet& urs);
H A DMaxMinGenSet.h54 const BitSet& urs);
59 const BitSet& urs,
65 const BitSet& urs);
70 const BitSet& urs);
75 const BitSet& urs);
80 const BitSet& urs,
87 const BitSet& urs);
H A DBounded.h33 const BitSet& urs,
41 const BitSet& urs,
52 const BitSet& urs,
58 const BitSet& urs,
64 const BitSet& urs,
81 const BitSet& urs,
H A DWeightAlgorithm.h40 const BitSet& urs,
46 const BitSet& urs,
52 const BitSet& urs);
57 const BitSet& urs,
64 const BitSet& urs,
H A DFeasible.h37 const BitSet* urs = 0,
42 Feasible(const Feasible& feasible, const BitSet& urs);
74 BitSet* urs; variable
113 assert(urs != 0); in get_urs()
114 return *urs; in get_urs()
H A DHybridGenSet.cpp92 const BitSet& urs = feasible.get_urs(); in compute_bounded() local
104 bounded_projection(feasible.get_matrix(), feasible.get_basis(), urs, rhs, fin); in compute_bounded()
107 assert(BitSet::set_disjoint(fin, urs)); in compute_bounded()
109 BitSet::set_union(fin, urs, fin_union_urs); in compute_bounded()
129 BitSet::set_union(fin, urs, fin_union_urs); in compute_bounded()
/dports/news/tin/tin-2.4.5/doc/
H A DTODO11 [20141230 Urs Janssen <urs@tin.org>]
45 [Urs Janssen <urs@tin.org>]
52 [Urs Janssen <urs@tin.org>]
300 [Urs Janssen <urs@tin.org>]
481 [Urs Janssen <urs@tin.org>]
513 [Urs Janssen <urs@tin.org>]
518 [Urs Janssen <urs@tin.org>]
581 [Urs Janssen <urs@tin.org>]
669 [Urs Janssen <urs@tin.org>]
759 [20050805 <urs@tin.org>]
[all …]
/dports/chinese/tin/tin-2.4.5/doc/
H A DTODO11 [20141230 Urs Janssen <urs@tin.org>]
45 [Urs Janssen <urs@tin.org>]
52 [Urs Janssen <urs@tin.org>]
300 [Urs Janssen <urs@tin.org>]
481 [Urs Janssen <urs@tin.org>]
513 [Urs Janssen <urs@tin.org>]
518 [Urs Janssen <urs@tin.org>]
581 [Urs Janssen <urs@tin.org>]
669 [Urs Janssen <urs@tin.org>]
759 [20050805 <urs@tin.org>]
[all …]
/dports/science/siconos/siconos-4.4.0/externals/numeric_bindings/libs/numeric/bindings/atlas/
H A Dublas_symm2syr.cc70 ursymm_t urs (n, n); in main() local
75 init_symm (urs, 'u'); in main()
82 print_m (urs, "urs"); in main()
94 blas::spr (1.0, vx, urs); in main()
95 print_m (urs, "urs += x x^T"); in main()
108 blas::spr2 (1.0, vx, vy, urs); in main()
109 print_m (urs, "urs += x y^T + y x^T"); in main()
H A Dublas_symm32.cc52 ursymm_t urs (ur); in main() local
58 init_symm (urs, 'u'); in main()
71 print_m (urs, "a == urs"); in main()
73 print_m_data (urs, "urs"); in main()
102 blas::symm (tag::left(), 1., urs, rbl, 0., rcl); in main()
131 blas::symm (tag::right(), 1., urs, rbr, 0., rcr); in main()
H A Dublas_herm3.cc52 urhemm_t urs (ur); in main() local
58 init_symm (urs, 'u'); in main()
71 print_m (urs, "a == urs"); in main()
73 print_m_data (urs, "urs"); in main()
102 blas::hemm ( tag::left(), 1.0, urs, rbl, 0.0, rcl); in main()
131 blas::hemm ( tag::right(), 1.0, urs, rbr, 0.0, rcr); in main()
H A Dublas_symm3.cc50 ursymm_t urs (ur); in main() local
56 init_symm (urs, 'u'); in main()
69 print_m (urs, "a == urs"); in main()
71 print_m_data (urs, "urs"); in main()
100 blas::symm ( tag::left(), 1, urs, rbl, 0, rcl); in main()
129 blas::symm ( tag::right(), 1, urs, rbr, 0, rcr); in main()
H A Dublas_symmc3.cc52 ursymm_t urs (ur); in main() local
58 init_symm (urs, 'u'); in main()
71 print_m (urs, "a == urs"); in main()
73 print_m_data (urs, "urs"); in main()
102 blas::symm ( tag::left(), 1.0, urs, rbl, 0.0, rcl); in main()
131 blas::symm (tag::right(), 1.0, urs, rbr, 0.0, rcr); in main()
H A Dublas_symm2.cc88 ursymm_t urs (n, n); in main() local
93 init_symm (urs, 'u'); in main()
106 print_m (urs, "urs"); in main()
108 print_m_data (urs, "urs"); in main()
123 blas::spmv (1., urs, vx, 0., vy); in main()
140 blas::gemv (urs, vx, vy); in main()
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkLagrangeTetra.cxx101 double urs = ur * s, urt = ur * t, ust = us * t, rst = rs * t; in InterpolateFunctions() local
102 double urst = urs * t; in InterpolateFunctions()
104 weights[0] = u - 2.0 * (ur + us + ut) + 3.0 * (urs + urt + ust) - 4.0 * urst; in InterpolateFunctions()
105 weights[1] = r - 2.0 * (ur + rs + rt) + 3.0 * (urs + urt + rst) - 4.0 * urst; in InterpolateFunctions()
106 weights[2] = s - 2.0 * (rs + us + st) + 3.0 * (urs + rst + ust) - 4.0 * urst; in InterpolateFunctions()
108 weights[4] = 4.0 * ur - 12.0 * (urs + urt) + 32.0 * urst; in InterpolateFunctions()
109 weights[5] = 4.0 * rs - 12.0 * (urs + rst) + 32.0 * urst; in InterpolateFunctions()
110 weights[6] = 4.0 * us - 12.0 * (urs + ust) + 32.0 * urst; in InterpolateFunctions()
114 weights[10] = 27.0 * urs - 108.0 * urst; in InterpolateFunctions()
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/influxdata/influxdb-client-go/v2/api/
H A Dusers.go271 func userResponseStatusToUserStatus(urs *domain.UserResponseStatus) *domain.UserStatus {
272 if urs == nil {
275 us := domain.UserStatus(*urs)
279 func userResponsesToUsers(urs *[]domain.UserResponse) *[]domain.User {
280 if urs == nil {
283 us := make([]domain.User, len(*urs))
284 for i, ur := range *urs {

12345678910>>...27