Home
last modified time | relevance | path

Searched refs:f_count (Results 1 – 25 of 368) sorted by relevance

12345678910>>...15

/dports/graphics/sswf/sswf-1.8.4/src/lib/
H A Dlibsswf_vectors.c++64 f_count = 0; in Vectors()
81 SetSize(f_count = vectors.f_count); in Vectors()
82 if(f_count > 0) { in Vectors()
101 SetSize(f_count = vectors.f_count); in operator =()
102 if(f_count > 0) { in operator =()
186 f_count = 0; in SetSize()
201 if(f_count > size) { in SetSize()
202 f_count = size; in SetSize()
240 index = f_count; in Set()
267 index = f_count; in Insert()
[all …]
H A Dlibsswf_tag_font.c++265 f_count = 0; in TagFont()
433 f_count = 0; in PreSave2ndPass()
463 f_offsets[f_count] = f_save_glyphs.ByteSize(); in PreSave2ndPass()
466 f_count++; in PreSave2ndPass()
469 f_offsets[f_count] = f_save_glyphs.ByteSize(); in PreSave2ndPass()
470 f_count++; in PreSave2ndPass()
510 for(idx = 0; (unsigned int) idx < f_count; idx++) { in PreSave2ndPass()
520 for(idx = 0; (unsigned int) idx < f_count; idx++) { in PreSave2ndPass()
633 sub_data.PutShort((short) (f_count - 1)); in Save()
769 sub_data.Write(f_offsets, f_count == 1 ? 2 : (f_count - 1) * 2); in Save()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/tests/
H A Dtest-47.cs9 static int f_count = 0; field in X
14 f_count++; in f()
28 f_count--; in Main()
34 if (f_count != -1) in Main()
37 f_count = 0; in Main()
46 if (f_count != 2) in Main()
52 if (f_count != 3) in Main()
63 t_count = f_count = 0; in Main()
72 if (f_count != 0) in Main()
82 if (f_count != 2) in Main()
[all …]
H A Dtest-244.cs4 static int t_count = 0, f_count = 0; field in Foo
11 if (f_count != 1) in Main()
17 if (f_count != 1) in Main()
24 static MyBool f { get { Console.WriteLine ("f"); f_count++; return new MyBool (false); }}
/dports/math/eprover/eprover-E-2.0/TERMS/
H A Dcte_signature.c126 handle->f_count = 0; in SigAlloc()
316 assert(f_code <= sig->f_count); in SigIsPredicate()
345 assert(f_code <= sig->f_count); in SigIsFunction()
549 for(i=1; i<=sig->f_count; i++) in SigSetAllSpecial()
599 sig->f_count++; in SigInsertId()
600 sig->f_info[sig->f_count].name in SigInsertId()
614 return sig->f_count; in SigInsertId()
656 sig->f_count, sig->size); in SigPrint()
659 for(i=1; i<=sig->f_count; i++) in SigPrint()
683 for(i=1; i<=sig->f_count; i++) in SigPrintSpecial()
[all …]
/dports/math/mdal/MDAL-release-0.9.0/tests/
H A Dtest_esri_tin.cpp30 int f_count = MDAL_M_faceCount( m ); in TEST() local
31 EXPECT_EQ( f_count, 7 ); in TEST()
44 for ( size_t i = 0; i < static_cast<size_t>( f_count ); ++i ) in TEST()
48 for ( int i = 0; i < f_count; ++i ) in TEST()
72 int f_count = MDAL_M_faceCount( m ); in TEST() local
73 EXPECT_EQ( f_count, 528 ); in TEST()
98 int f_count = MDAL_M_faceCount( m ); in TEST() local
99 EXPECT_EQ( f_count, 773 ); in TEST()
124 int f_count = MDAL_M_faceCount( m ); in TEST() local
125 EXPECT_EQ( f_count, 462 ); in TEST()
H A Dtest_ply.cpp57 int f_count = MDAL_M_faceCount( m ); in TEST() local
58 EXPECT_EQ( 2, f_count ); in TEST()
331 int f_count = MDAL_M_faceCount( m ); in TEST() local
332 EXPECT_EQ( 2, f_count ); in TEST()
599 EXPECT_EQ( 76294, f_count ); in TEST()
644 for ( int i = 0; i < f_count; i++ ) in TEST()
719 for ( int i = 0; i < f_count; i++ ) in TEST()
743 std::vector<int> lc( f_count, 0 ); in TEST()
744 std::vector<int> f2V( f_count, 0 ); in TEST()
770 std::vector<int> lc2( f_count, 0 ); in TEST()
[all …]
H A Dtest_sww.cpp51 int f_count = MDAL_M_faceCount( m ); in TEST() local
52 EXPECT_EQ( 4962, f_count ); in TEST()
172 int f_count = MDAL_M_faceCount( m ); in TEST() local
173 EXPECT_EQ( 4962, f_count ); in TEST()
198 int f_count = MDAL_M_faceCount( m ); in TEST() local
199 EXPECT_EQ( 6388, f_count ); in TEST()
241 int f_count = MDAL_M_faceCount( m ); in TEST() local
242 EXPECT_EQ( 7200, f_count ); in TEST()
266 int f_count = MDAL_M_faceCount( m ); in TEST() local
267 EXPECT_EQ( 4802, f_count ); in TEST()
H A Dtest_flo2d.cpp34 size_t f_count = 521; in TEST() local
143 ASSERT_EQ( f_count, count ); in TEST()
173 ASSERT_EQ( f_count, count ); in TEST()
200 size_t f_count = 521; in TEST() local
313 ASSERT_EQ( f_count, count ); in TEST()
349 ASSERT_EQ( f_count, count ); in TEST()
413 int f_count = MDAL_M_faceCount( m ); in TEST() local
414 EXPECT_EQ( 521, f_count ); in TEST()
595 EXPECT_EQ( 9, f_count ); in TEST()
758 EXPECT_EQ( 9, f_count ); in TEST()
[all …]
H A Dtest_2dm.cpp60 int f_count = MDAL_M_faceCount( m ); in TEST() local
61 EXPECT_EQ( 1, f_count ); in TEST()
80 int f_count = MDAL_M_faceCount( m ); in TEST() local
81 EXPECT_EQ( 2, f_count ); in TEST()
233 int f_count = MDAL_M_faceCount( m ); in TEST() local
234 EXPECT_EQ( 2, f_count ); in TEST()
315 EXPECT_EQ( 6, f_count ); in TEST()
359 EXPECT_EQ( 0, f_count ); in TEST()
439 EXPECT_EQ( 1875, f_count ); in TEST()
474 EXPECT_EQ( 77, f_count ); in TEST()
[all …]
H A Dtest_ugrid.cpp69 int f_count = MDAL_M_faceCount( m ); in TEST() local
70 EXPECT_EQ( 1824, f_count ); in TEST()
170 int f_count = MDAL_M_faceCount( m ); in TEST() local
171 EXPECT_EQ( 810, f_count ); in TEST()
253 int f_count = MDAL_M_faceCount( m ); in TEST() local
254 EXPECT_EQ( 11987, f_count ); in TEST()
337 int f_count = MDAL_M_faceCount( m ); in TEST() local
338 EXPECT_EQ( 11987, f_count ); in TEST()
454 EXPECT_EQ( 4, f_count ); in TEST()
478 EXPECT_EQ( 23860, f_count ); in TEST()
[all …]
/dports/math/eprover/eprover-E-2.0/HEURISTICS/
H A Dche_to_weightgen.c110 for(i = 1; i<=ocb->sig->f_count; i++) in print_weight_array()
181 long size = ocb->sig->f_count+1; in generate_precrank_weights()
187 for(i=1; i<=ocb->sig->f_count; i++) in generate_precrank_weights()
576 for(i=SIG_TRUE_CODE+1; i<= ocb->sig->f_count; i++) in generate_freq_weights()
603 for(i=SIG_TRUE_CODE+1; i<= ocb->sig->f_count; i++) in generate_invfreq_weights()
608 for(i=SIG_TRUE_CODE+1; i<= ocb->sig->f_count; i++) in generate_invfreq_weights()
680 for(i=ocb->sig->f_count; i>=SIG_TRUE_CODE+1; i--) in generate_invfreqrank_weights()
723 for(i=SIG_TRUE_CODE+1; i<=ocb->sig->f_count ;i++) in generate_invconjfreqrank_weights()
804 for(i=ocb->sig->f_count; i>=SIG_TRUE_CODE+1; i--) in generate_invfreqranksq_weights()
843 for(i=ocb->sig->f_count; i>=SIG_TRUE_CODE+1; i--) in generate_inv_modfreqrank_weights()
[all …]
H A Dche_to_precgen.c85 for(i = sig->f_count; i > 0; i--) in print_prec_array()
168 for(i=1; i<= ocb->sig->f_count; i++) in generate_unary_first_precedence()
207 for(i=1; i<= ocb->sig->f_count; i++) in generate_unary_first_freq_precedence()
250 for(i=1; i<= ocb->sig->f_count; i++) in generate_arity_precedence()
280 for(i=1; i<= ocb->sig->f_count; i++) in generate_invarity_precedence()
310 for(i=1; i<= ocb->sig->f_count; i++) in generate_const_max_precedence()
344 for(i=1; i<= ocb->sig->f_count; i++) in generate_const_min_precedence()
379 for(i=1; i<= ocb->sig->f_count; i++) in generate_freq_precedence()
410 for(i=1; i<= ocb->sig->f_count; i++) in generate_invfreq_precedence()
442 for(i=1; i<= ocb->sig->f_count; i++) in generate_invconjfreq_precedence()
[all …]
H A Dche_fcode_featurearrays.c104 long array_size = sizeof(long)*(sig->f_count+1); in FCodeFeatureArrayAlloc()
111 handle->size = sig->f_count+1; in FCodeFeatureArrayAlloc()
114 for(i=1; i<= sig->f_count; i++) in FCodeFeatureArrayAlloc()
123 for(i=1; i<= sig->f_count; i++) in FCodeFeatureArrayAlloc()
/dports/www/p5-CGI-Minimal/CGI-Minimal-1.30/lib/CGI/Minimal/
H A DMisc.pm128 for (my $f_count=0;$f_count < $data_entries;$f_count++) {
129 $record->{'filename'}->[$f_count] = '';
130 $record->{'mime_type'}->[$f_count] = 'text/plain';
H A DMultipart.pm131 my $f_count = $record->{'count'};
133 $record->{'value'}->[$f_count] = $data;
134 $record->{'filename'}->[$f_count] = $filename;
135 $record->{'mime_type'}->[$f_count] = $mime_type;
/dports/graphics/sswf/sswf-1.8.4/src/libas/
H A Dnode.c++660 f_count = 0; in Init()
727 AS_ASSERT(index < f_count); in DeleteChild()
731 --f_count; in DeleteChild()
732 while(index < f_count) { in DeleteChild()
736 f_children[f_count].ClearNode(); in DeleteChild()
750 if(f_count >= f_max) { in AddChild()
761 f_children[f_count] = child; in AddChild()
763 ++f_count; in AddChild()
770 AS_ASSERT(index <= f_count); in InsertChild()
778 if(f_count >= f_max) { in InsertChild()
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/layers/pubsub/
H A Dpubsub_orig.py159 f_count = tr[key_for_feed_subscriber_count(feed)]
162 if f_count == None or i_count == None:
169 struct.pack('>Q', struct.unpack('>Q', f_count + '')[0] + 1)
202 f_count = tr[key_for_feed_message_count(feed)]
204 struct.pack('>Q', struct.unpack('>Q', f_count + '')[0] + 1)
243 f_count = tr[countKey]
244 print 'Messages in feed', feed, ':', struct.unpack('>Q', f_count + '')[0]
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/lockd/
H A Dsvcsubs.c128 dprintk("lockd: found file %p (count %d)\n", file, file->f_count); in nlm_lookup_file()
130 file->f_count++; in nlm_lookup_file()
232 if (file->f_count || !list_empty(&file->f_blocks) || file->f_shares) in nlm_file_inuse()
265 file->f_count++; in nlm_traverse_files()
274 file->f_count--; in nlm_traverse_files()
277 && !file->f_shares && !file->f_count) { in nlm_traverse_files()
301 file, file->f_count); in nlm_release_file()
307 if (--file->f_count == 0 && !nlm_file_inuse(file)) in nlm_release_file()
/dports/multimedia/libv4l/linux-5.13-rc2/fs/lockd/
H A Dsvcsubs.c128 dprintk("lockd: found file %p (count %d)\n", file, file->f_count); in nlm_lookup_file()
130 file->f_count++; in nlm_lookup_file()
232 if (file->f_count || !list_empty(&file->f_blocks) || file->f_shares) in nlm_file_inuse()
265 file->f_count++; in nlm_traverse_files()
274 file->f_count--; in nlm_traverse_files()
277 && !file->f_shares && !file->f_count) { in nlm_traverse_files()
301 file, file->f_count); in nlm_release_file()
307 if (--file->f_count == 0 && !nlm_file_inuse(file)) in nlm_release_file()
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/lockd/
H A Dsvcsubs.c128 dprintk("lockd: found file %p (count %d)\n", file, file->f_count); in nlm_lookup_file()
130 file->f_count++; in nlm_lookup_file()
232 if (file->f_count || !list_empty(&file->f_blocks) || file->f_shares) in nlm_file_inuse()
265 file->f_count++; in nlm_traverse_files()
274 file->f_count--; in nlm_traverse_files()
277 && !file->f_shares && !file->f_count) { in nlm_traverse_files()
301 file, file->f_count); in nlm_release_file()
307 if (--file->f_count == 0 && !nlm_file_inuse(file)) in nlm_release_file()
/dports/graphics/sswf/sswf-1.8.4/samples/showfont/
H A Dshowfont.c++235 f_count = 0; in Chars()
262 f_count++; in Add()
269 return f_count; in Count()
335 unsigned long f_count; member in Chars
347 f_count = 0; in Text()
359 i = f_count; in Empty()
364 f_count = 0; in Empty()
372 if(f_count >= f_max) { in Add()
385 f_count++; in Add()
390 return f_count; in Count()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DHDF5_IO.hpp581 hsize_t f_count[2] = {1, hsize_t(num_cols)}; in store_matrix() local
621 hsize_t f_count[2] = {hsize_t(num_cols), 1}; in store_matrix() local
740 f_count[0] = 1; f_count[1] = len; in set_vector()
743 f_count[0] = len; f_count[1] = 1; in set_vector()
746 f_space.selectHyperslab(H5S_SELECT_SET, f_count, f_start); in set_vector()
831 hsize_t f_count[3] = {1, 1, hsize_t(num_cols)}; in set_matrix() local
924 hsize_t f_count[4] = {1, 1, 1, hsize_t(num_cols)}; in set_vector_matrix() local
1261 hsize_t f_count[3] = {1, dims[1], dims[2]}; in get_matrix() local
1262 f_dataspace.selectHyperslab(H5S_SELECT_SET, f_count, f_start); in get_matrix()
1311 hsize_t f_count[4] = {1, 1, dims[2], dims[3]}; in get_vector_matrix() local
[all …]
/dports/devel/papilio-loader/Papilio-Loader-dd111c4/xc3sprog/trunk/
H A Djedecfile.cpp563 void JedecFile::setLength(unsigned int f_count) in setLength() argument
565 if(f_count > jed.fuse_count) in setLength()
569 jed.fuse_list = new byte[f_count/8 + ((f_count%8)?1:0)]; in setLength()
570 memset(jed.fuse_list, 0xff, f_count/8 + ((f_count%8)?1:0)); in setLength()
574 for (unsigned int i = f_count; i < jed.fuse_count; i++) in setLength()
577 jed.fuse_count = f_count; in setLength()
/dports/devel/xc3sprog/xc3sprog-r769/
H A Djedecfile.cpp564 void JedecFile::setLength(unsigned int f_count) in setLength() argument
566 if(f_count > jed.fuse_count) in setLength()
570 jed.fuse_list = new byte[f_count/8 + ((f_count%8)?1:0)]; in setLength()
571 memset(jed.fuse_list, 0xff, f_count/8 + ((f_count%8)?1:0)); in setLength()
575 for (unsigned int i = f_count; i < jed.fuse_count; i++) in setLength()
578 jed.fuse_count = f_count; in setLength()

12345678910>>...15