| /dports/security/tor-devel/tor-0.4.7.2-alpha/src/test/ |
| H A D | failing_routerdescs.inc | 7 "identity-ed25519\n"
13 "signing-key\n"
20 "onion-key\n"
31 "k4lxJJAT6wE=\n"
41 "proto Link=5\n"
42 "reject *:*\n"
59 "signing-key\n"
66 "onion-key\n"
90 "reject *:*\n"
131 "onion-key\n"
[all …]
|
| /dports/math/p5-Bit-Vector/Bit-Vector-7.4/t/ |
| H A D | 07_____compare.t | 27 $n = 1;
30 $n++;
33 $n++;
36 $n++;
39 $n++;
42 $n++;
45 $n++;
48 $n++;
51 $n++;
54 $n++;
[all …]
|
| H A D | 03__operations.t | 26 $n = 1;
71 {print "ok $n\n";} else {print "not ok $n\n";}
72 $n++;
75 $n++;
78 $n++;
81 $n++;
84 $n++;
87 $n++;
90 $n++;
93 $n++;
[all …]
|
| /dports/math/py-sympy/sympy-1.9/sympy/solvers/tests/ |
| H A D | test_recurr.py | 26 solution = rsolve_ratio([-2*n**3 + n**2 + 2*n - 1, 2*n**3 + n**2 - 6*n,
27 -2*n**3 - 11*n**2 - 18*n - 9, 2*n**3 + 13*n**2 + 22*n + 8], 0, n)
55 [2*n*(n + 1), -n**2 - 3*n + 2, n - 1], 0, n) == C1*factorial(n) + C0*2**n
58 [n + 2, -(2*n + 3)*(17*n**2 + 51*n + 39), n + 1], 0, n) == None
85 funcs = [ n, n + 1, n**2, n**3, n**4, n + n**2, 27*n + 52*n**2 - 3*
118 f = (n - 1)*y(n + 2) - (n**2 + 3*n - 2)*y(n + 1) + 2*n*(n + 1)*y(n)
163 f = (n - 1)*(n - 2)*y(n + 2) - (n + 1)*(n + 2)*y(n)
177 f = (-16*n**2 + 32*n - 12)*y(n - 1) + (4*n**2 - 12*n + 9)*y(n)
191 assert rsolve(y(n) + y(n + 1) + 2**n + 3**n, y(n)) == (-1)**n*C0 - 2**n/3 - 3**n/4
219 assert rsolve(y(n+3) - y(n+2) - y(n+1) + y(n), y(n)) == (-1)**n*C0+C1+C2*n
[all …]
|
| /dports/www/py-postorius/postorius-1.3.5/src/postorius/static/postorius/libs/bootstrap/css/ |
| H A D | bootstrap.min.css.map | 1 …n * Bootstrap v4.0.0 (https://getbootstrap.com)\n * Copyright 2011-2018 The Bootstrap Authors\n * …
|
| /dports/math/maxima/maxima-5.43.2/share/solve_rec/ |
| H A D | rtest_solve_rec.mac | 14 test_solve_rec(a[n]=n/(n+1)*a[n-1], a[n]);
20 test_solve_rec((n+1)*(2*n+1)*a[n+1]-(n+3)*(2*n-1)*a[n], a[n]);
25 test_solve_rec(a[n+1]=n*a[n]/(n-3) + 1/(n-5), a[n]);
28 test_solve_rec(a[n]=a[n-1]-a[n-2]+(n^2-1)/4^n, a[n]);
40 test_solve_rec(a[n]=3*a[n-1]-3*a[n-2]+a[n-3]+n+n*2^n, a[n]);
43 test_solve_rec(a[n+4]-a[n+3]-13*a[n+2]+a[n+1]+12*a[n]+n^2+2^(2*n+1)-1, a[n]);
67 test_solve_rec((-n-5)*s[n+3]+(6*n+22)*s[n+2]+(-9*n-17)*s[n+1]+4*n*s[n],s[n]);
76 test_solve_rec(n*(n+1)*a[n+2]-2*n*(n+k+1)*a[n+1]+(n+k)*(n+k+1)*a[n], a[n]);
82 test_solve_rec((n^2-n-2)*f[n+2]+(-n^3-3*n^2+2*n+8)*f[n+1]+(2*n^3+4*n^2-2*n-4)*f[n], f[n]);
85 …_solve_rec((n^5+8*n^4+23*n^3+29*n^2+16*n+4)*f[n+2]+(-n^6-9*n^5-32*n^4-61*n^3-65*n^2-36*n-8)*f[n+1]…
[all …]
|
| H A D | solve_rec.dem | 5 solve_rec(a[n]=n/(n+1)*a[n-1], a[n]);
6 solve_rec(a[n]=n/(n+1)*a[n-1], a[n], a[1]=1);
7 solve_rec((n+1)*(2*n+1)*a[n+1]-(n+3)*(2*n-1)*a[n], a[n]);
8 solve_rec(a[n]=n*a[n-1]/(n-2)+1, a[n]);
9 solve_rec(a[n+1]=n*a[n]/(n-3) + 1/(n-5), a[n]);
17 solve_rec(a[n]=3*a[n-1]-3*a[n-2]+a[n-3]+n+n*2^n, a[n]);
31 solve_rec(n*(n+1)*a[n+2]-2*n*(n+k+1)*a[n+1]+(n+k)*(n+k+1)*a[n], a[n]);
33 solve_rec((n^2-n-2)*f[n+2]+(-n^3-3*n^2+2*n+8)*f[n+1]+(2*n^3+4*n^2-2*n-4)*f[n], f[n]);
34 solve_rec((n^5+8*n^4+23*n^3+29*n^2+16*n+4)*f[n+2]+(-n^6-9*n^5-32*n^4-61*n^3-65*n^2-36*n-8)*f[n+1]+(…
36 …n^6+18*n^5+57*n^4+74*n^3+32*n^2-3*n)*f[n+3]+(-2*n^7-24*n^6-115*n^5-285*n^4-386*n^3-275*n^2-95*n-18…
[all …]
|
| /dports/www/nextcloud/nextcloud/apps-pkg/text/js/highlight/ |
| H A D | sql.js.map | 1 …n * @param {string} value\n * @returns {RegExp}\n * */\n\n/**\n * @param {RegExp | string } re\n *…
|
| /dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/cznic/mathutil/ |
| H A D | primes.go | 13 return n > 0 && primes16[n-1] == 1
20 return n + uint16(primes16[n]), n < 65521
28 case n&1 == 0:
29 return n == 2
64 mod := ModPowUint32(2, (n+1)/2, n)
183 n++
196 p = n + d0
228 n++
241 p = n + d0
321 n *= p
[all …]
|
| /dports/misc/perkeep/perkeep-0.11/vendor/github.com/cznic/mathutil/ |
| H A D | primes.go | 13 return n > 0 && primes16[n-1] == 1
20 return n + uint16(primes16[n]), n < 65521
28 case n&1 == 0:
29 return n == 2
64 mod := ModPowUint32(2, (n+1)/2, n)
183 n++
196 p = n + d0
228 n++
241 p = n + d0
321 n *= p
[all …]
|
| /dports/math/p5-Bit-ShiftReg/Bit-ShiftReg-2.0/t/ |
| H A D | f005.t | 17 $n = 1;
21 $n++;
24 $n++;
29 $n++;
32 $n++;
37 $n++;
40 $n++;
45 $n++;
48 $n++;
51 $n++;
[all …]
|
| H A D | f003.t | 17 $n = 1;
21 $n++;
24 $n++;
29 $n++;
32 $n++;
37 $n++;
40 $n++;
45 $n++;
48 $n++;
51 $n++;
[all …]
|
| H A D | f004.t | 17 $n = 1;
21 $n++;
24 $n++;
29 $n++;
32 $n++;
37 $n++;
40 $n++;
45 $n++;
48 $n++;
51 $n++;
[all …]
|
| H A D | f006.t | 17 $n = 1;
21 $n++;
24 $n++;
29 $n++;
32 $n++;
37 $n++;
40 $n++;
45 $n++;
48 $n++;
51 $n++;
[all …]
|
| /dports/devel/p5-Date-Calc/Date-Calc-6.4/t/ |
| H A D | f012.t | 17 $n = 1;
19 $n++;
21 $n++;
23 $n++;
25 $n++;
27 $n++;
32 $n++;
34 $n++;
36 $n++;
38 $n++;
[all …]
|
| /dports/science/simint/simint-v0.8/simint/ostei/gen/ |
| H A D | vrr_I_p_s_f_s.c | 15 int n = 0; in VRR_I_p_s_f_s() local
21 for(n = 0; n < num_n; ++n) // loop over orders of auxiliary function in VRR_I_p_s_f_s()
25 …PRIM_INT__p_s_f_s[n * 30 + 0] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 0], PRIM_I… in VRR_I_p_s_f_s()
29 …PRIM_INT__p_s_f_s[n * 30 + 1] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 1], PRIM_I… in VRR_I_p_s_f_s()
33 …PRIM_INT__p_s_f_s[n * 30 + 2] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 2], PRIM_I… in VRR_I_p_s_f_s()
37 …PRIM_INT__p_s_f_s[n * 30 + 3] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 3], PRIM_I… in VRR_I_p_s_f_s()
41 …PRIM_INT__p_s_f_s[n * 30 + 4] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 4], PRIM_I… in VRR_I_p_s_f_s()
45 …PRIM_INT__p_s_f_s[n * 30 + 5] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 5], PRIM_I… in VRR_I_p_s_f_s()
49 …PRIM_INT__p_s_f_s[n * 30 + 6] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 6], PRIM_I… in VRR_I_p_s_f_s()
52 …PRIM_INT__p_s_f_s[n * 30 + 7] = SIMINT_FMADD( aop_PQ[0], PRIM_INT__s_s_f_s[(n+1) * 10 + 7], PRIM_I… in VRR_I_p_s_f_s()
[all …]
|
| H A D | vrr_K_f_s_p_s.c | 15 int n = 0; in VRR_K_f_s_p_s() local
21 for(n = 0; n < num_n; ++n) // loop over orders of auxiliary function in VRR_K_f_s_p_s()
25 …PRIM_INT__f_s_p_s[n * 30 + 0] = SIMINT_FMADD( aoq_PQ[0], PRIM_INT__f_s_s_s[(n+1) * 10 + 0], PRIM_I… in VRR_K_f_s_p_s()
29 …PRIM_INT__f_s_p_s[n * 30 + 1] = SIMINT_FMADD( aoq_PQ[1], PRIM_INT__f_s_s_s[(n+1) * 10 + 0], PRIM_I… in VRR_K_f_s_p_s()
32 …PRIM_INT__f_s_p_s[n * 30 + 2] = SIMINT_FMADD( aoq_PQ[2], PRIM_INT__f_s_s_s[(n+1) * 10 + 0], PRIM_I… in VRR_K_f_s_p_s()
35 …PRIM_INT__f_s_p_s[n * 30 + 3] = SIMINT_FMADD( aoq_PQ[0], PRIM_INT__f_s_s_s[(n+1) * 10 + 1], PRIM_I… in VRR_K_f_s_p_s()
39 …PRIM_INT__f_s_p_s[n * 30 + 4] = SIMINT_FMADD( aoq_PQ[1], PRIM_INT__f_s_s_s[(n+1) * 10 + 1], PRIM_I… in VRR_K_f_s_p_s()
43 …PRIM_INT__f_s_p_s[n * 30 + 5] = SIMINT_FMADD( aoq_PQ[2], PRIM_INT__f_s_s_s[(n+1) * 10 + 1], PRIM_I… in VRR_K_f_s_p_s()
46 …PRIM_INT__f_s_p_s[n * 30 + 6] = SIMINT_FMADD( aoq_PQ[0], PRIM_INT__f_s_s_s[(n+1) * 10 + 2], PRIM_I… in VRR_K_f_s_p_s()
50 …PRIM_INT__f_s_p_s[n * 30 + 7] = SIMINT_FMADD( aoq_PQ[1], PRIM_INT__f_s_s_s[(n+1) * 10 + 2], PRIM_I… in VRR_K_f_s_p_s()
[all …]
|
| /dports/devel/ragel/ragel-6.10/test/ |
| H A D | strings2.rl | 21 "cerr\n" |
31 "_init\n" |
41 "_fini\n" |
50 "cout\n" |
77 "exit\n" |
79 "atoi\n" |
83 "free\n" |
86 "_end\n" |
89 "PTRh\n" |
90 "QVhL\n" |
[all …]
|
| /dports/math/py-heyoka/heyoka.py-0.16.0/doc/notebooks/ |
| H A D | The Maxwell-Boltzmann distribution.ipynb | 9 "\n",
11 "\n",
13 "\n",
15 "\n",
28 "\n",
31 "\n",
34 "\n",
45 "\n",
54 "\n",
66 "\n",
[all …]
|
| /dports/devel/py-nbconvert/nbconvert-6.2.0/nbconvert/exporters/tests/files/ |
| H A D | svg.ipynb | 37 "z\n",
46 "z\n",
73 "z\n",
83 "z\n",
111 "z\n",
150 "z\n",
197 "z\n",
217 "z\n",
229 "z\n",
268 "z\n",
[all …]
|
| /dports/textproc/p5-WordNet-Similarity/WordNet-Similarity-2.07/t/keys/0.06/ |
| H A D | edgetrace.key | 1 …#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 animal#n#1 chordate#n#1 vertebrate#n#1 ma…
2 …#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 animal#n#1 chordate#n#1 vertebrate#n#1 ma…
7 …ee: *Root*#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 person#n#1 ruler#n#2 sovereign#…
8 HyperTree: *Root*#n#1 entity#n#1 causal_agent#n#1 person#n#1 ruler#n#2 sovereign#n#1 Emperor#n#1 Ro…
9 …n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 person#n#1 communicator#n#1 negotiator#n#1…
10 …n#1 entity#n#1 causal_agent#n#1 person#n#1 communicator#n#1 negotiator#n#1 representative#n#1 head…
16 …: *Root*#n#1 act#n#2 activity#n#1 diversion#n#1 sport#n#1 athletic_game#n#1 outdoor_game#n#1 field…
17 …perTree: *Root*#n#1 act#n#2 activity#n#1 game#n#2 athletic_game#n#1 outdoor_game#n#1 field_game#n#…
18 HyperTree: *Root*#n#1 act#n#2 activity#n#1 diversion#n#1 sport#n#1 contact_sport#n#1 football#n#1 p…
20 HyperTree: *Root*#n#1 act#n#2 activity#n#1 music#n#3 vocal_music#n#1 singing#n#1 scat#n#1
[all …]
|
| H A D | lchtrace.key | 1 …#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 animal#n#1 chordate#n#1 vertebrate#n#1 ma…
2 …#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 animal#n#1 chordate#n#1 vertebrate#n#1 ma…
7 …ee: *Root*#n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 person#n#1 ruler#n#2 sovereign#…
8 HyperTree: *Root*#n#1 entity#n#1 causal_agent#n#1 person#n#1 ruler#n#2 sovereign#n#1 Emperor#n#1 Ro…
9 …n#1 entity#n#1 object#n#1 living_thing#n#1 organism#n#1 person#n#1 communicator#n#1 negotiator#n#1…
10 …n#1 entity#n#1 causal_agent#n#1 person#n#1 communicator#n#1 negotiator#n#1 representative#n#1 head…
16 …: *Root*#n#1 act#n#2 activity#n#1 diversion#n#1 sport#n#1 athletic_game#n#1 outdoor_game#n#1 field…
17 …perTree: *Root*#n#1 act#n#2 activity#n#1 game#n#2 athletic_game#n#1 outdoor_game#n#1 field_game#n#…
18 HyperTree: *Root*#n#1 act#n#2 activity#n#1 diversion#n#1 sport#n#1 contact_sport#n#1 football#n#1 p…
20 HyperTree: *Root*#n#1 act#n#2 activity#n#1 music#n#3 vocal_music#n#1 singing#n#1 scat#n#1
[all …]
|
| /dports/net-im/climm/climm-0.7.1/lang/ |
| H A D | ru.i18n | 499 1595:\nСписок контактов.\n============================================\n%d Контактов\n
520 1634:ок.\n
560 1704:Группы:\n
649 1877.хорошо.\n
712 1961:URL: %s\n
799 2080:Отклик сервера о посылке SMS:\n%s\n
906 2218:UIN: %s\n
1878 3595:\nСписок сусликов.\n============================================\n%d сусликов\n
1899 3634:окэ.\n
2026 3877.клёво.\n
[all …]
|
| /dports/www/wt/wt-4.6.1/resources/themes/bootstrap/5/css/ |
| H A D | bootstrap.rtl.min.css.map | 1 …n * Bootstrap v5.1.3 (https://getbootstrap.com/)\n * Copyright 2011-2021 The Bootstrap Authors\n *…
|
| /dports/www/tikiwiki/tiki-21.2/vendor_bundled/vendor/twbs/bootstrap/dist/css/ |
| H A D | bootstrap.min.css.map | 1 …n * Bootstrap v4.5.0 (https://getbootstrap.com/)\n * Copyright 2011-2020 The Bootstrap Authors\n *…
|