/dports/security/keepass/KeePass-2.49-Source/KeePass/Forms/ |
H A D | FieldPickerForm.cs | 115 foreach(FpField fpf in m_lFields) in OnFormLoad() 117 if(fpf == null) { Debug.Assert(false); continue; } in OnFormLoad() 119 ListViewItem lvi = new ListViewItem(fpf.Name); in OnFormLoad() 121 StrUtil.MultiToSingleLine(fpf.Value.ReadString())); in OnFormLoad() 122 lvi.Tag = fpf; in OnFormLoad() 126 if(fpf.Group.Length > 0) in OnFormLoad() 128 if(fpf.Group != strGroup) in OnFormLoad() 130 strGroup = fpf.Group; in OnFormLoad() 164 FpField fpf = (lvi.Tag as FpField); in ProcessItemSelection() 165 if(fpf == null) { Debug.Assert(false); return; } in ProcessItemSelection() [all …]
|
/dports/science/kst2/kst-plot-38eddb5322a1d557f9d86ea95d456d76272941e3/tests/dirfile_maker/ |
H A D | dirfile_maker.c | 52 FILE *fpf; in main() local 76 fpf = fopen(tmpstr,"w"); in main() 85 fprintf(fpf,"%s RAW %c %d\n", df[i].field, df[i].type, df[i].spf); in main() 86 fflush(fpf); in main() 94 fprintf(fpf,"META cos metaC CONST FLOAT64 3.291882\n" in main() 97 fprintf(fpf, "cos/units STRING ^o\ncos/quantity STRING Angle\n"); in main() 100 fprintf(fpf, "namearray SARRAY "); in main() 102 fprintf(fpf, " LABEL%02d", i); in main() 104 fprintf(fpf, "\n"); in main() 106 fprintf(fpf, "label SINDIR stridx namearray\n"); in main() [all …]
|
H A D | dirfile_maker_new.c | 26 FILE *fpf; in main() local 82 fpf = fopen(tmpstr,"w"); in main() 85 fprintf(fpf,"%s RAW f %d\n", dfList[i].field, dfList[i].spf); in main() 93 fclose(fpf); in main() 96 fpf = fopen("dm.cur", "w"); in main() 97 fprintf(fpf,"%s", dirfilename); in main() 98 fclose(fpf); in main()
|
/dports/graphics/dssim/dssim-3.1.2/cargo-crates/libaom-sys-0.9.1/vendor/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/aom/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/www/firefox/firefox-99.0/third_party/aom/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/aom/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libaom/source/libaom/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/multimedia/aom/aom-3.2.0/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 59 --fpf=$f.fpf \ 80 --fpf=$f.fpf \
|
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/aom/test/ |
H A D | best_encode.sh | 24 if [[ -e $f.fpf ]]; then 31 --fpf=$f.fpf \ 60 --fpf=$f.fpf \ 81 --fpf=$f.fpf \
|
/dports/science/kst2/kst-plot-38eddb5322a1d557f9d86ea95d456d76272941e3/old_tests/dirfile_maker/ |
H A D | dirfile_maker.c | 32 FILE *fpf; in main() local 51 fpf = fopen(tmpstr,"w"); in main() 54 fprintf(fpf,"%s RAW f %d\n", df[i].field, df[i].spf); in main() 58 fclose(fpf); in main() 61 fpf = fopen("dm.cur", "w"); in main() 62 fprintf(fpf,"%s", dirfilename); in main() 63 fclose(fpf); in main()
|
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/ref/ |
H A D | fpf.tex | 31 $\Phi$ is fpf on $G$, iff the semidirect product of 73 fpf automorphism group <phi> of <G> with the multiplication 188 All irreducible fpf representations of this group 226 is irreducible and fpf. 228 representations up to equivalence; each irreducible fpf 234 is fpf. The number of nonequivalent faithful irreducible 288 is metacyclic and fpf and has size $mn$. 340 $q^{-1}a q = a^k, q^{-1}b q = b^l$ is fpf 503 The generators, <as>, of the $2$ nonconjugate cyclic fpf 560 fpf automorphism groups isomorphic to the generalized [all …]
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/graphics/tests/unit_tests/ |
H A D | xset_xget.tst | 13 // fpf 14 out = xget("fpf"); 16 xset("fpf", "%s.%s"); 17 out = xget("fpf"); 21 ierr = execstr("xset(""fpf"");","errcatch");
|
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/ |
H A D | GModelIO_CELUM.cpp | 21 FILE *fpf = Fopen(namef.c_str(), "w"); in writeCELUM() local 22 if(!fpf) { in writeCELUM() 31 fclose(fpf); in writeCELUM() 79 fprintf(fpf, "%d\n\n", numf); in writeCELUM() 87 fprintf(fpf, "%d \"face %d\"", idf++, f->tag()); in writeCELUM() 104 fprintf(fpf, " %ld", v->getIndex()); in writeCELUM() 106 fprintf(fpf, "\n\n"); in writeCELUM() 121 fclose(fpf); in writeCELUM()
|
/dports/net/ntp/ntp-4.2.8p15/libntp/ |
H A D | dolfptoa.c | 142 u_int32 fpf, in mfptoa() argument 150 M_NEG(fpi, fpf); in mfptoa() 153 return dolfptoa(fpi, fpf, (isneg?'-':'+'), ndec, FALSE); in mfptoa() 160 u_int32 fpf, in mfptoms() argument 168 M_NEG(fpi, fpf); in mfptoms() 171 return dolfptoa(fpi, fpf, (isneg?'-':'+'), ndec, TRUE); in mfptoms()
|
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/tut/ |
H A D | plnr.tex | 34 First we have to find a fixed-point-free (fpf) automorphism group of 38 First of all we ask for the existence of an fpf automorphism group 48 if there is a metacyclic fpf automorphism group, then it has a cyclic normal 51 If the upper bound for the size of an fpf automorphism group on some group 52 is $1$, we know that there is no nontrivial fpf automorphism group, no 56 order $25$ has an fpf automorphism group of order $4$. 57 However, we can be sure that all fpf automorphism groups are cyclic and that 67 There might even exist an fpf automorphism group of order $24$. (In fact 80 fpf automorphism groups on `AbelianGroup([5,5])' with generators $p,q$ 85 The first is not the list of fpf groups up to conjugacy but the list of [all …]
|
/dports/science/libmsym/libmsym-0.2.3-paper/src/ |
H A D | symmetrize.c | 147 struct _fpf {int i; int j;} fpf = {.i = 0, .j = 0}; in symmetrizeWavefunctions() local 157 for(int i = 0;i < o && !fpf.j;i++){ in symmetrizeWavefunctions() 160 fpf.i = i; in symmetrizeWavefunctions() 161 fpf.j = j; in symmetrizeWavefunctions() 167 if(fpf.j){ in symmetrizeWavefunctions() 168 for(int i = 1; i < fpf.j;i++){ in symmetrizeWavefunctions() 169 pf[pf[fpf.i][i]][0]--; in symmetrizeWavefunctions() 171 pf[o][0] -= fpf.j; in symmetrizeWavefunctions()
|
/dports/science/v_sim/v_sim-3.8.0/lib/plug-ins/msym/libmsym/src/ |
H A D | symmetrize.c | 147 struct _fpf {int i; int j;} fpf = {.i = 0, .j = 0}; in symmetrizeWavefunctions() local 157 for(int i = 0;i < o && !fpf.j;i++){ in symmetrizeWavefunctions() 160 fpf.i = i; in symmetrizeWavefunctions() 161 fpf.j = j; in symmetrizeWavefunctions() 167 if(fpf.j){ in symmetrizeWavefunctions() 168 for(int i = 1; i < fpf.j;i++){ in symmetrizeWavefunctions() 169 pf[pf[fpf.i][i]][0]--; in symmetrizeWavefunctions() 171 pf[o][0] -= fpf.j; in symmetrizeWavefunctions()
|
/dports/security/vault/vault-1.8.2/vendor/go.etcd.io/etcd/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/security/certmgr/certmgr-3.0.3/vendor/github.com/google/certificate-transparency-go/certificate-transparency-go-1.0.21/vendor/github.com/coreos/etcd/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/coreos/etcd/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/net-im/nextcloud-spreed-signaling/nextcloud-spreed-signaling-0.2.0/vendor/src/go.etcd.io/etcd/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/devel/etcd32/etcd-3.2.32/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/devel/etcd33/etcd-3.3.23/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|
/dports/devel/etcd33/etcd-3.3.23/vendor/github.com/coreos/etcd/functional/tester/ |
H A D | case_failpoints.go | 50 for i, fpf := range fpFails { 54 desc: fpf.Desc(), 56 Case: fpf, 60 Case: fpf,
|