Home
last modified time | relevance | path

Searched refs:upto (Results 1 – 25 of 4308) sorted by last modified time

12345678910>>...173

/dports/www/apache24/httpd-2.4.53/modules/ssl/
H A Dssl_engine_io.c1728 apr_bucket *e, *upto; in ssl_io_filter_coalesce() local
1823 upto = e; in ssl_io_filter_coalesce()
1843 || (upto == APR_BRIGADE_SENTINEL(bb) in ssl_io_filter_coalesce()
1863 while (e != upto) { in ssl_io_filter_coalesce()
/dports/textproc/clucene/clucene-core-2.3.3.4/src/core/CLucene/index/
H A DDocumentsWriter.cpp815 upto = 0; in appendPostings()
1375 this->upto = 0; in BufferedNorms()
1380 upto++; in add()
1384 upto = 0; in reset()
1394 upto = docID; in fill()
1467 upto = 0; in ByteSliceReader()
1510 if (upto == limit) in readByte()
1520 out->writeBytes(buffer+upto, limit-upto); in writeTo()
1524 out->writeBytes(buffer+upto, limit-upto); in writeTo()
1569 upto += len; in readBytes()
[all …]
H A DDocumentsWriterThreadState.cpp154 assert ( bn->upto <= docID ); in writeDocument()
464 int32_t upto = 0; in trimFields() local
493 allFieldDataArray.values[upto++] = fp; in trimFields()
509 for ( size_t i=upto;i<allFieldDataArray.length;i++ ){ in trimFields()
517 if (n != NULL && n->upto == 0) in trimFields()
524 numAllFieldData = upto; in trimFields()
762 int32_t upto = 0; in compactPostings() local
765 postingsHash.values[upto++] = postingsHash[i]; in compactPostings()
767 assert (upto == numPostings); in compactPostings()
975 const int32_t upto = threadState->vectorsPool->newSlice(firstSize); in addNewVector() local
[all …]
/dports/sysutils/dvdisaster/dvdisaster-0.79.5/locale/
H A Dpt_BR.po644 msgid " --read-attempts n-m - attempts n upto m reads of a defective sector\n"
1938 …ithout success, dvdisaster might choose to perform additional reading attempts upto this number.\n"
2010 …main after reading the medium from start to end, the medium is read again upto he given number of …
6453 #~ " --read-attempts n-m - attempts n upto m reads of a defective sector\n"
6472 …ted to 2GB per file, e.g. FAT from Windows. Created files are spread over upto 100 segments called…
H A Dru.po643 msgid " --read-attempts n-m - attempts n upto m reads of a defective sector\n"
1941 …ithout success, dvdisaster might choose to perform additional reading attempts upto this number.\n"
2013 …main after reading the medium from start to end, the medium is read again upto he given number of …
6514 #~ " --read-attempts n-m - attempts n upto m reads of a defective sector\n"
6531 …ted to 2GB per file, e.g. FAT from Windows. Created files are spread over upto 100 segments called…
6577 #~ " --read-attempts n-m - attempts n upto m reads of a defective sector\n"
/dports/sysutils/e2fsprogs/e2fsprogs-1.46.5/lib/ext2fs/
H A Dalloc.c93 ext2_ino_t i, ino_in_group, upto, first_zero; in ext2fs_new_inode() local
118 upto = i + (EXT2_INODES_PER_GROUP(fs->super) - ino_in_group); in ext2fs_new_inode()
119 if (i < start_inode && upto >= start_inode) in ext2fs_new_inode()
120 upto = start_inode - 1; in ext2fs_new_inode()
121 if (upto > fs->super->s_inodes_count) in ext2fs_new_inode()
122 upto = fs->super->s_inodes_count; in ext2fs_new_inode()
124 retval = ext2fs_find_first_zero_inode_bitmap2(map, i, upto, in ext2fs_new_inode()
132 i = upto + 1; in ext2fs_new_inode()
/dports/print/psutils/psutils/
H A Dpsutil.c163 static int fcopy(long upto) in fcopy() argument
166 while (here < upto) { in fcopy()
/dports/misc/e2fsprogs-libuuid/e2fsprogs-1.46.5/lib/ext2fs/
H A Dalloc.c93 ext2_ino_t i, ino_in_group, upto, first_zero; in ext2fs_new_inode() local
118 upto = i + (EXT2_INODES_PER_GROUP(fs->super) - ino_in_group); in ext2fs_new_inode()
119 if (i < start_inode && upto >= start_inode) in ext2fs_new_inode()
120 upto = start_inode - 1; in ext2fs_new_inode()
121 if (upto > fs->super->s_inodes_count) in ext2fs_new_inode()
122 upto = fs->super->s_inodes_count; in ext2fs_new_inode()
124 retval = ext2fs_find_first_zero_inode_bitmap2(map, i, upto, in ext2fs_new_inode()
132 i = upto + 1; in ext2fs_new_inode()
/dports/misc/e2fsprogs-libblkid/e2fsprogs-1.46.5/lib/ext2fs/
H A Dalloc.c93 ext2_ino_t i, ino_in_group, upto, first_zero; in ext2fs_new_inode() local
118 upto = i + (EXT2_INODES_PER_GROUP(fs->super) - ino_in_group); in ext2fs_new_inode()
119 if (i < start_inode && upto >= start_inode) in ext2fs_new_inode()
120 upto = start_inode - 1; in ext2fs_new_inode()
121 if (upto > fs->super->s_inodes_count) in ext2fs_new_inode()
122 upto = fs->super->s_inodes_count; in ext2fs_new_inode()
124 retval = ext2fs_find_first_zero_inode_bitmap2(map, i, upto, in ext2fs_new_inode()
132 i = upto + 1; in ext2fs_new_inode()
/dports/math/gap/gap-4.11.0/lib/
H A Donecohom.gi759 # upto j - 1 over matrices[i]^k for j = 1 ... p.
800 # upto j - 1 over matrices[i]^k for j = 1 ... p.
H A Dpcgsind.gi1046 minSublist := function( list, upto )
1048 if upto = 0 then return 1; fi;
1050 for i in [ 2 .. upto ] do
H A Dstraight.gi1100 aep,bep, # upto this generator index, entries are known.
/dports/math/gap/gap-4.11.0/extern/gmp/demos/calc/
H A Dcalcread.c94 static size_t upto = 0; in calc_input() local
97 if (upto >= line_size) in calc_input()
114 upto = 0; in calc_input()
117 copy_size = MIN (line_size-upto, max_size); in calc_input()
118 memcpy (buf, line+upto, copy_size); in calc_input()
119 upto += copy_size; in calc_input()
/dports/math/gap/gap-4.11.0/pkg/simpcomp/doc/figures/
H A Dflowchart.mp13 for i = 0 upto sides - 1:
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/lib/
H A Dfpf.gi640 ## this irreducible fpf representation is unique (upto equivalence)
1176 ## this irreducible fpf representation is unique (upto equivalence)
1402 ## In this case we obtain one unique (upto equivalence) irreducible fpf
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/ref/
H A Dfpf.tex351 irreducible, fpf representations of $\Phi$ upto equivalence.
411 are all irreducible, fpf representations of $\Phi$ upto equivalence.
461 are all irreducible, fpf representations of $\Phi$ upto equivalence.
/dports/math/gap/gap-4.11.0/pkg/fining/lib/
H A Dorbits-stabilisers.gi119 local orbs, set2, x, o, upto, newupto;
123 upto := 0;
130 if newupto <> upto then
131 upto:=newupto;
132 Print(upto, "%..\c");
/dports/math/gap/gap-4.11.0/pkg/ace-5.3/doc/
H A Dotheroptions.tex317 This option attempts upto <attempts> (or, in the first and second
/dports/math/gap/gap-4.11.0/pkg/hecke-1.5.3/gap/
H A Dtableaux.gi176 #F FillTableau adds upto <n>nodes of weight <i> into the tableau <t> on
/dports/math/gap/gap-4.11.0/pkg/Modules-2019.09.02/gap/
H A DBasicFunctors.gi1902 ## <Item>If <A>str</A>=<Q>t</Q> then the exact triangle upto cohomological degree <A>c</A> w…
1955 ## <Item>If <A>str</A>=<Q>t</Q> then the exact triangle upto cohomological degree <A>c</A> w…
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/ewahboolarray/
H A Dboolarray.h215 size_t upto = out.buffer.size() < ba.buffer.size() ? out.buffer.size() in logicalandnot() local
217 for (size_t i = 0; i < upto; ++i) in logicalandnot()
219 for (size_t i = upto; i < out.buffer.size(); ++i) in logicalandnot()
235 size_t upto = in inplace_logicalandnot() local
237 for (size_t i = 0; i < upto; ++i) in inplace_logicalandnot()
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/
H A Dfmpz_lll.rst111 vectors upto ``cur_kappa``, \textbf{not} ``kappa - 1``.
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mat/
H A Dcol_partition.c52 slong start = 0, new_start = 0, upto = 1, p = 0, i, count; in fmpz_mat_col_partition() local
98 for (upto = start + 1; upto < M->c && col_h[upto].hash == col_h[start].hash; upto++) in fmpz_mat_col_partition()
100 if (part[col_h[upto].col] == -WORD(1)) in fmpz_mat_col_partition()
102 if (!fmpz_mat_col_equal(M, col_h[start].col, col_h[upto].col)) in fmpz_mat_col_partition()
105 new_start = upto; in fmpz_mat_col_partition()
107 part[col_h[upto].col] = p; in fmpz_mat_col_partition()
111 start = start == new_start ? upto : new_start; in fmpz_mat_col_partition()
/dports/mail/mimedefang/mimedefang-2.84/
H A Dmimedefang.pl.in716 my %blacklisted = map { $_ => 1 } qw(mask upto pri makepri fac);
/dports/lang/python310/Python-3.10.1/Lib/test/
H A Dtest_pyexpat.py486 self.assertTrue(self.upto < len(self.expected_list),
488 expected = self.expected_list[self.upto]
491 self.upto += 1
497 self.upto = 0

12345678910>>...173