Home
last modified time | relevance | path

Searched refs:vals2 (Results 1 – 25 of 370) sorted by relevance

12345678910>>...15

/dports/net/kamailio/kamailio-5.4.5/src/modules/p_usrloc/
H A Ducontact.c919 vals2[0].nul = 0; in db_update_ucontact_addr()
923 vals2[1].nul = 0; in db_update_ucontact_addr()
927 vals2[2].nul = 0; in db_update_ucontact_addr()
931 vals2[3].nul = 0; in db_update_ucontact_addr()
935 vals2[4].nul = 0; in db_update_ucontact_addr()
939 vals2[5].nul = 0; in db_update_ucontact_addr()
944 vals2[6].nul = 1; in db_update_ucontact_addr()
946 vals2[6].nul = 0; in db_update_ucontact_addr()
952 vals2[7].nul = 1; in db_update_ucontact_addr()
954 vals2[7].nul = 0; in db_update_ucontact_addr()
[all …]
/dports/net/kamailio/kamailio-5.4.5/src/modules/usrloc/
H A Ducontact.c1014 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1020 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1026 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1032 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1038 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1044 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1089 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1095 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1112 vals2[n2].nul = 0; in db_update_ucontact_ruid()
1118 vals2[n2].nul = 0; in db_update_ucontact_ruid()
[all …]
/dports/devel/p5-Date-Manip/Date-Manip-6.85/internal/
H A Dtranslate151 my($utf,$label,$vals,$vals2) = @_;
159 my @vals2;
160 if (ref($vals2)) {
161 @vals2 = @$vals2;
162 } elsif ($vals2) {
163 @vals2 = ($vals2);
182 if (@vals2) {
183 $val2 = encode_utf8(lc(shift(@vals2)));
/dports/security/heaan/HEAAN-2.1-40-g48a1ed0/HEAAN/src/
H A DStringUtils.cpp74 void StringUtils::compare(double* vals1, double* vals2, long size, string prefix) { in compare() argument
78 cout << "d" + prefix + ": " << i << " :" << vals2[i] << endl; in compare()
79 cout << "e" + prefix + ": " << i << " :" << (vals1[i]-vals2[i]) << endl; in compare()
88 cout << "d" + prefix + ": " << i << " :" << vals2[i] << endl; in compare()
89 cout << "e" + prefix + ": " << i << " :" << (vals1[i]-vals2[i]) << endl; in compare()
115 void StringUtils::compare(double val1, double* vals2, long size, string prefix) { in compare() argument
119 cout << "d" + prefix + ": " << i << " :" << vals2[i] << endl; in compare()
120 cout << "e" + prefix + ": " << i << " :" << val1-vals2[i] << endl; in compare()
125 void StringUtils::compare(complex<double> val1, complex<double>* vals2, long size, string prefix) { in compare() argument
129 cout << "d" + prefix + ": " << i << " :" << vals2[i] << endl; in compare()
[all …]
H A DStringUtils.h45 static void compare(double* vals1, double* vals2, long size, string prefix);
47 static void compare(complex<double>* vals1, complex<double>* vals2, long size, string prefix);
53 static void compare(double val1, double* vals2, long size, string prefix);
55 static void compare(complex<double> val1, complex<double>* vals2, long size, string prefix);
/dports/math/gap/gap-4.11.0/lib/
H A Dsparsevectorsorted.gi128 vals2 := s2![SL_VALS];
130 len2 := Length(vals2);
179 vals2 := s2![SL_VALS];
181 len2 := Length(vals2);
230 vals2 := s2![SL_VALS];
232 len2 := Length(vals2);
312 vals2 := v2![SL_VALS];
314 len2 := Length(vals2);
365 vals2 := s2![SL_VALS];
367 len2 := Length(vals2);
[all …]
/dports/devel/cvsdadm/cvsdadm/
H A Dcvsdadm819 @vals2 = split(/:/, pop @users);
820 if ($vals2[1] =~ /\*.*/) {
823 $vals2[1] =~ s/$vals[1]/\*$vals2[1]/;
826 if($vals2[2]) {
827 $userentry = "$vals2[0]:$vals2[1]:$vals2[2]";
831 $userentry = "$vals2[0]:$vals2[1]";
857 @vals2 = split(/:/, pop @users);
858 $vals2[1] =~ s/\*(.*)/$1/;
859 if($vals2[2]) {
860 $userentry = "$vals2[0]:$vals2[1]:$vals2[2]";
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_nmod_mpoly/test/
H A Dt-compose_fq_nmod_mpoly.c260 fq_nmod_struct ** vals2, ** vals3; in main() local
301 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
302 fq_nmod_randtest(vals2[v], state, ctx1->fqctx); in main()
347 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
348 flint_free(vals2[v]); in main()
350 flint_free(vals2); in main()
377 fq_nmod_struct ** vals2; in main() local
410 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
442 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
443 flint_free(vals2[v]); in main()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fq_nmod_mpoly/test/
H A Dt-compose_fq_nmod_mpoly.c260 fq_nmod_struct ** vals2, ** vals3; in main() local
301 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
302 fq_nmod_randtest(vals2[v], state, ctx1->fqctx); in main()
347 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
348 flint_free(vals2[v]); in main()
350 flint_free(vals2); in main()
377 fq_nmod_struct ** vals2; in main() local
410 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
442 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
443 flint_free(vals2[v]); in main()
[all …]
/dports/math/flint2/flint-2.8.4/fq_nmod_mpoly/test/
H A Dt-compose_fq_nmod_mpoly.c260 fq_nmod_struct ** vals2, ** vals3; in main() local
301 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
302 fq_nmod_randtest(vals2[v], state, ctx1->fqctx); in main()
347 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
348 flint_free(vals2[v]); in main()
350 flint_free(vals2); in main()
377 fq_nmod_struct ** vals2; in main() local
410 fq_nmod_init(vals2[v], ctx1->fqctx); in main()
442 fq_nmod_clear(vals2[v], ctx1->fqctx); in main()
443 flint_free(vals2[v]); in main()
[all …]
/dports/lang/gnustep-base/libs-base-base-1_27_0/Tests/base/NSArchiver/
H A Dgeneral.m14 NSArray *vals1, *vals2;
22 vals2 = [vals1 arrayByAddingObject:val2];,
25 data1 = [NSArchiver archivedDataWithRootObject:vals2];
29 PASS([NSArchiver archiveRootObject:vals2 toFile:val1],
33 PASS((a != nil && [a isKindOfClass:[NSArray class]] && [a isEqual:vals2]),
37 PASS((a != nil && [a isKindOfClass:[NSArray class]] && [a isEqual:vals2]),
/dports/math/vtk6/VTK-6.2.0/Filters/FlowPaths/
H A DvtkTemporalInterpolatedVelocityField.cxx44 this->vals2[0] = this->vals2[1] = this->vals2[2] = 0.0; in vtkTemporalInterpolatedVelocityField()
188 this->ivf[0]->FastCompute(this->ivf[1]->Cache, vals2); in TestPoint()
191 this->LastGoodVelocity[i] = this->OneMinusWeight*vals1[i] + this->CurrentWeight*vals2[i]; in TestPoint()
196 if (!this->ivf[1]->FunctionValues(x, vals2)) in TestPoint()
208 this->LastGoodVelocity[i] = this->OneMinusWeight*vals1[i] + this->CurrentWeight*vals2[i]; in TestPoint()
221 if (this->ivf[1]->FunctionValues(x, vals2)) in TestPoint()
226 this->LastGoodVelocity[i] = vals2[i]; in TestPoint()
293 if (!this->ivf[1]->FunctionValues(x, vals2)) in FunctionValuesAtT()
299 this->LastGoodVelocity[i] = u[i] = vals2[i]; in FunctionValuesAtT()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/filter/particleadvection/
H A DBoundsMap.h127 std::vector<vtkm::Float64> vals2(vals.size()); in Build()
146 MPI_Allreduce(vals.data(), vals2.data(), vals.size(), MPI_DOUBLE, MPI_SUM, mpiComm); in Build()
148 vals2 = vals; in Build()
156 block = vtkm::Bounds(vals2[idx + 0], in Build()
157 vals2[idx + 1], in Build()
158 vals2[idx + 2], in Build()
159 vals2[idx + 3], in Build()
160 vals2[idx + 4], in Build()
161 vals2[idx + 5]); in Build()
/dports/lang/gnustep-base/libs-base-base-1_27_0/Tests/base/NSKeyedArchiver/
H A Dgeneral.m18 NSArray *vals1, *vals2;
52 vals2 = [vals1 arrayByAddingObject: val2];,
55 PASS([NSKeyedArchiver archiveRootObject:vals2 toFile:val1],
58 data1 = [NSKeyedArchiver archivedDataWithRootObject:vals2];
63 NSLog(@"From data: original array %@, decoded array %@",vals2, a);
64 PASS((a != nil && [a isKindOfClass:[NSArray class]] && [a isEqual:vals2]),
68 NSLog(@"From file: original array %@, decoded array %@",vals2, a);
69 PASS((a != nil && [a isKindOfClass:[NSArray class]] && [a isEqual:vals2]),
/dports/math/py-pandas/pandas-1.2.5/pandas/tests/reshape/concat/
H A Dtest_append_common.py79 vals2 = vals1
86 exp_data = vals1 + vals2
103 i2 = Index(vals2, name="y")
110 i2 = Index(vals2, name="x")
117 Index(vals1).append(vals2)
148 s2 = Series(vals2, name="y")
158 s2 = Series(vals2, name="x")
172 Series(vals1).append(vals2)
188 vals3 = vals2
217 exp_data = vals1 + vals2
[all …]
/dports/x11/lxhotkey/lxhotkey-0.1.1/src/
H A Dlxhotkey.h62 static gboolean values_equal(GList *vals1, GList *vals2) in values_equal() argument
64 while (vals1 && vals2) { in values_equal()
65 if (g_strcmp0(vals1->data, vals2->data) != 0) in values_equal()
68 vals2 = vals2->next; in values_equal()
70 return (vals1 == NULL && vals2 == NULL); in values_equal()
/dports/lang/gnustep-base/libs-base-base-1_27_0/Tests/base/NSMutableSet/
H A Dgeneral.m9 NSMutableSet *vals1, *vals2, *vals3, *vals4;
17 vals2 = [vals1 setByAddingObject: val2];
25 PASS(YES == [vals2 containsObject: val2], "-containsObject: works");
26 PASS(nil != [vals2 member: @"A Goodbye"], "-member: finds present object");
27 PASS(nil == [vals2 member: @"not there"], "-member: doesn't find missing");
31 [obj unionSet: vals2];
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dcons_orbisack.c549 lhs += vals2[i]; in separateOrbisackCovers()
556 lhs = lhs + vals2[i]; in separateOrbisackCovers()
690 lhs = - vals1[0] + vals2[0]; in separateOrbisack()
696 lhs += - vals1[1] + vals2[1]; in separateOrbisack()
727 lhs -= vals2[basement++]; in separateOrbisack()
749 lhs += vals2[basement]; in separateOrbisack()
991 assert( vals2 != NULL ); in separateInequalities()
1195 SCIP_Real* vals2; in SCIP_DECL_CONSSEPALP() local
1257 SCIP_Real* vals2; in SCIP_DECL_CONSSEPASOL() local
1320 SCIP_Real* vals2; in SCIP_DECL_CONSENFOLP() local
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpq_mpoly/test/
H A Dt-compose_fmpq_mpoly.c231 fmpq ** vals2, ** vals3; in main() local
264 vals2 = (fmpq **) flint_malloc(nvars2*sizeof(fmpq*)); in main()
267 vals2[v] = (fmpq *) flint_malloc(sizeof(fmpq)); in main()
268 fmpq_init(vals2[v]); in main()
269 fmpq_randbits(vals2[v], state, 4); in main()
277 if (!fmpq_mpoly_evaluate_all_fmpq(vals3[v], vals1[v], vals2, ctx2)) in main()
296 !fmpq_mpoly_evaluate_all_fmpq(ge, g, vals2, ctx2)) in main()
319 fmpq_clear(vals2[v]); in main()
320 flint_free(vals2[v]); in main()
322 flint_free(vals2); in main()
/dports/math/flint2/flint-2.8.4/fmpq_mpoly/test/
H A Dt-compose_fmpq_mpoly.c231 fmpq ** vals2, ** vals3; in main() local
264 vals2 = (fmpq **) flint_malloc(nvars2*sizeof(fmpq*)); in main()
267 vals2[v] = (fmpq *) flint_malloc(sizeof(fmpq)); in main()
268 fmpq_init(vals2[v]); in main()
269 fmpq_randbits(vals2[v], state, 4); in main()
277 if (!fmpq_mpoly_evaluate_all_fmpq(vals3[v], vals1[v], vals2, ctx2)) in main()
296 !fmpq_mpoly_evaluate_all_fmpq(ge, g, vals2, ctx2)) in main()
319 fmpq_clear(vals2[v]); in main()
320 flint_free(vals2[v]); in main()
322 flint_free(vals2); in main()
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpq_mpoly/test/
H A Dt-compose_fmpq_mpoly.c231 fmpq ** vals2, ** vals3; in main() local
264 vals2 = (fmpq **) flint_malloc(nvars2*sizeof(fmpq*)); in main()
267 vals2[v] = (fmpq *) flint_malloc(sizeof(fmpq)); in main()
268 fmpq_init(vals2[v]); in main()
269 fmpq_randbits(vals2[v], state, 4); in main()
277 if (!fmpq_mpoly_evaluate_all_fmpq(vals3[v], vals1[v], vals2, ctx2)) in main()
296 !fmpq_mpoly_evaluate_all_fmpq(ge, g, vals2, ctx2)) in main()
319 fmpq_clear(vals2[v]); in main()
320 flint_free(vals2[v]); in main()
322 flint_free(vals2); in main()
/dports/www/tikiwiki/tiki-21.2/lib/search/
H A Dreport_string_in_db.php31 $vals2 = array_values($val2); variable
32 $colum = $vals2[0];
33 $type = $vals2[1];
94 $vals2 = array_values($val2);
95 $colum = $vals2[0];
96 $type = $vals2[1];
/dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/parameterized-utils-2.1.3.0/test/Test/
H A DContext.hs219 Some y <- return $ mkSAsgn vals2
221 Just Refl -> vals1 === vals2
222 Nothing -> vals1 /== vals2
227 Some y <- return $ mkUAsgn vals2
229 Just Refl -> vals1 === vals2
230 Nothing -> vals1 /== vals2
237 Some x <- return $ mkUAsgn vals2
248 Some x <- return $ mkUAsgn vals2
260 Some x <- return $ mkUAsgn vals2
270 Some x <- return $ mkUAsgn vals2
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boxm2/volm/tests/
H A Dtest_volm_wr3db_ind.cxx64 std::vector<unsigned char> vals2(layer_size); in test_volm_wr3db_ind() local
65 TEST("getting the first index", ind2->get_next(vals2), true); in test_volm_wr3db_ind()
66 TEST("test index 0", vals2[0] == 'a', true); in test_volm_wr3db_ind()
67 TEST("test index 0", vals2[3] == 'c', true); in test_volm_wr3db_ind()
69 ind2->get_next(vals2); in test_volm_wr3db_ind()
70 ind2->get_next(vals2); in test_volm_wr3db_ind()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/algo/tests/
H A Dtest_sparse_lu.cxx12 std::vector<double> vals0(2), vals1(3), vals2(3), vals3(2); in test_sparse_lu() local
20 vals2[0]=-1.0; vals2[1]=3.0; vals2[2]=-1.0; in test_sparse_lu()
21 A.set_row(2, cols2, vals2); in test_sparse_lu()

12345678910>>...15