Home
last modified time | relevance | path

Searched refs:minrep (Results 1 – 16 of 16) sorted by relevance

/dports/math/gap/gap-4.11.0/pkg/rds-1.7/lib/
H A DReducedStartsets.gi85 conjugate_indices, index, minrep, pos;
105 minrep:=Reversed(Minimum(List(conjugates,i->Reversed(i.pds))));
106 if Reversed(set.pds)<minrep
110 pos:=PositionSet(Set(conjugates,i->i.pds),minrep);
/dports/devel/p5-Parse-RecDescent/Parse-RecDescent-1.967015/lib/Parse/
H A DRecDescent.pm786 my ( $self, $line, $minrep, $maxrep ) = @_;
816 $op->{type}, $minrep, $maxrep, splice(@{$self->{"items"}}, -3));
1730 my ($class, $type, $minrep, $maxrep, $leftarg, $op, $rightarg) = @_;
1737 "min" => $minrep,
2222 my ($minrep,$maxrep) = (1,$MAXREP);
2228 { ($minrep, $maxrep) = (0,1) }
2230 { $minrep = 0 }
2232 { ($minrep, $maxrep) = ($1,$1) }
2234 { ($minrep, $maxrep) = ($1,$2) }
2236 { $minrep = $1 }
[all …]
/dports/science/py-ase/ase-3.22.0/ase/vibrations/
H A Dresonant_raman.py106 minrep=0.8, argument
169 self.minrep = minrep
333 select = np.where(rep0_p > self.minrep)[0]
/dports/math/gap/gap-4.11.0/lib/
H A Dgrppc.gi2107 minrep:=one;
2111 minrep:=o;
2119 while minrep<>1 do
2124 minrep:=(minrep-1) mod abc[o]+1;
2130 minrep:=te;
2157 # minrep:=one;
2167 # minrep:=o;
2175 # minrep:=one;
2189 # minrep:=o;
2197 ce:=ce*minrep;
[all …]
/dports/lang/gawk/gawk-5.1.1/support/
H A Ddfa.c438 int minrep, maxrep; /* Repeat counts for {m,n}. */ member
1341 dfa->lex.minrep = dfa->lex.maxrep = -1; in lex()
1343 dfa->lex.minrep = (dfa->lex.minrep < 0 in lex()
1350 dfa->lex.maxrep = dfa->lex.minrep; in lex()
1353 if (dfa->lex.minrep < 0) in lex()
1354 dfa->lex.minrep = 0; in lex()
1365 && 0 <= dfa->lex.minrep in lex()
1367 || dfa->lex.minrep <= dfa->lex.maxrep))) in lex()
1905 if (dfa->parse.tok == REPMN && (dfa->lex.minrep || dfa->lex.maxrep)) in closure()
1911 if (dfa->lex.minrep == 0) in closure()
[all …]
/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/lib/
H A Ddfa.c438 int minrep, maxrep; /* Repeat counts for {m,n}. */ member
1341 dfa->lex.minrep = dfa->lex.maxrep = -1; in lex()
1343 dfa->lex.minrep = (dfa->lex.minrep < 0 in lex()
1350 dfa->lex.maxrep = dfa->lex.minrep; in lex()
1353 if (dfa->lex.minrep < 0) in lex()
1354 dfa->lex.minrep = 0; in lex()
1365 && 0 <= dfa->lex.minrep in lex()
1367 || dfa->lex.minrep <= dfa->lex.maxrep))) in lex()
1905 if (dfa->parse.tok == REPMN && (dfa->lex.minrep || dfa->lex.maxrep)) in closure()
1911 if (dfa->lex.minrep == 0) in closure()
[all …]
/dports/textproc/gnugrep/grep-3.7/lib/
H A Ddfa.c438 int minrep, maxrep; /* Repeat counts for {m,n}. */ member
1341 dfa->lex.minrep = dfa->lex.maxrep = -1; in lex()
1343 dfa->lex.minrep = (dfa->lex.minrep < 0 in lex()
1350 dfa->lex.maxrep = dfa->lex.minrep; in lex()
1353 if (dfa->lex.minrep < 0) in lex()
1354 dfa->lex.minrep = 0; in lex()
1365 && 0 <= dfa->lex.minrep in lex()
1367 || dfa->lex.minrep <= dfa->lex.maxrep))) in lex()
1905 if (dfa->parse.tok == REPMN && (dfa->lex.minrep || dfa->lex.maxrep)) in closure()
1911 if (dfa->lex.minrep == 0) in closure()
[all …]
/dports/textproc/gsed/sed-4.8/lib/
H A Ddfa.c407 int minrep, maxrep; /* Repeat counts for {m,n}. */ member
1368 dfa->lex.minrep = dfa->lex.maxrep = -1; in lex()
1370 dfa->lex.minrep = (dfa->lex.minrep < 0 in lex()
1377 dfa->lex.maxrep = dfa->lex.minrep; in lex()
1380 if (dfa->lex.minrep < 0) in lex()
1381 dfa->lex.minrep = 0; in lex()
1392 && 0 <= dfa->lex.minrep in lex()
1394 || dfa->lex.minrep <= dfa->lex.maxrep))) in lex()
1919 if (dfa->parse.tok == REPMN && (dfa->lex.minrep || dfa->lex.maxrep)) in closure()
1925 if (dfa->lex.minrep == 0) in closure()
[all …]
/dports/lang/awka/awka-0.7.5/regexp/
H A Ddfa.c354 static int minrep, maxrep; /* Repeat counts for {m,n}. */ variable
555 minrep = maxrep = 0; in lex()
564 minrep = c - '0'; in lex()
570 minrep = 10 * minrep + c - '0'; in lex()
584 maxrep = minrep; in lex()
901 if (minrep == 0) in closure()
903 for (i = 1; i < minrep; ++i) in closure()
/dports/japanese/gawk/gawk-3.0.6/
H A Ddfa.c364 static int minrep, maxrep; /* Repeat counts for {m,n}. */ variable
628 minrep = maxrep = 0; in lex()
637 minrep = c - '0'; in lex()
643 minrep = 10 * minrep + c - '0'; in lex()
657 maxrep = minrep; in lex()
1133 if (minrep == 0) in closure()
1135 for (i = 1; i < minrep; ++i) in closure()
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Dtypes.h317 node_t *minrep; /* set leaders for min and max rank */ member
393 #define GD_minrep(g) (((Agraphinfo_t*)AGDATA(g))->minrep)
/dports/lang/racket/racket-8.3/collects/racket/match/
H A Dcompiler.rkt416 (for/list ([repvar reps] [minrep mins] #:when minrep)
417 #`[(< #,repvar #,minrep) (fail)])]
/dports/lang/racket-minimal/racket-8.3/collects/racket/match/
H A Dcompiler.rkt416 (for/list ([repvar reps] [minrep mins] #:when minrep)
417 #`[(< #,repvar #,minrep) (fail)])]
/dports/print/ghostscript8-x11/ghostscript-8.71/base/
H A Dgswts.c280 double minrep = pow(2, memw) * 50 / pow(2, 7.5); in wts_cell_calc_h() local
288 for (uacc = (int)ceil(minrep * inc); uacc <= floor(2 * minrep * inc); uacc++) { in wts_cell_calc_h()
/dports/print/ghostscript8-base/ghostscript-8.71/base/
H A Dgswts.c280 double minrep = pow(2, memw) * 50 / pow(2, 7.5); in wts_cell_calc_h() local
288 for (uacc = (int)ceil(minrep * inc); uacc <= floor(2 * minrep * inc); uacc++) { in wts_cell_calc_h()
/dports/lang/gawk/gawk-5.1.1/
H A DChangeLog.02771 (lex): Set it if `minrep == maxrep && minrep == 0'.