Home
last modified time | relevance | path

Searched refs:ect1 (Results 1 – 25 of 42) sorted by relevance

12

/dports/japanese/libslang/slang-1.4.5jp2/doc/tm/
H A Dslangfun.tm60 \sect1{Array Functions}
72 \sect1{Informational Functions}
75 \sect1{Mathematical Functions}
81 \sect1{Time and Date Functions}
93 \sect1{Directory Functions}
99 \sect1{System Call Functions}
102 \sect1{Eval Functions}
105 \sect1{Module Functions}
108 \sect1{Debugging Functions}
111 \sect1{Stack Functions}
[all …]
H A Dregexp.tm1 \sect1{Regular Expressions}
H A Dpreface.tm2 \sect1{Preface} #%{{{
/dports/japanese/slrn/slrn-0.9.6.2/doc/tm/
H A Dslrnfuns.tm48 \sect1{Header and Thread Functions}
51 \sect1{Article Functions}
54 \sect1{Group Functions}
57 \sect1{Dialog and Message Functions}
60 \sect1{Key Input Functions}
63 \sect1{File I/O Functions}
66 \sect1{Miscellaneous Functions}
/dports/sysutils/slurm-wlm/slurm-20.02.7/testsuite/expect/
H A Dtest21.3142 set ect1 40
157 -re "Total=$ect1 Used=0 Free=$ect1 Remote=yes" {
169 … Expected: LicenseName=$sr1@$resource1(Server). Expected: Total=$ect1 Used=0 Free=$ect1 Remote=yes"
214 … Expected: LicenseName=$sr1@$resource1(Server). Expected: Total=$ect1 Used=0 Free=$ect1 Remote=yes"
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net/storj/storj-1.45.3/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/security/xray-core/Xray-core-1.5.0/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/dns/nextdns/nextdns-1.32.2/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net/v2ray/v2ray-core-4.36.2/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net/syncthing/syncthing-1.18.1/syncthing/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/net/traefik/traefik-2.6.1/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/
H A Dreceived_packet_tracker.go18 ect0, ect1, ecnce uint64 member
73 h.ect1++
180 ECT1: h.ect1,
/dports/www/trafficserver/trafficserver-9.1.1/iocore/net/quic/qlog/
H A DQLogFrame.cc113 if (ect1) { in encode()
114 node["ect1"] = ect1; in encode()
117 if (ect1) { in encode()
H A DQLogFrame.h73 ect1 = frame.ecn_section()->ect1_count(); in AckFrame()
81 uint64_t ect1 = 0; member
/dports/security/libecc/libecc-0.14.0/testsuite/point/
H A Dbspacetables3.cc306 assert(fecm_trace1_count == ect1(m) / m); in main()
310 assert(fecm_own_inverse_count == (m % 2 != 0) ? 0 : ect1(m / 2) / (m / 2)); in main()
314 …nt == ((m % 2 != 0) ? 0 : (m % 4 != 0) ? wm1[m / 2] / 2 : (wm1[m / 2] + 4 * ect1(m / 4) / m) / 2)); in main()
/dports/security/libecc/libecc-0.14.0/testsuite/polynomial/
H A Dutils.h15 extern unsigned long ect1(unsigned int m);
H A Dutils.cc525 unsigned long ect1(unsigned int m) in ect1() function
541 result -= ect1(m / *iter); in ect1()
/dports/net/libngtcp2/ngtcp2-224bd62/lib/
H A Dngtcp2_conn.h271 size_t ect1; member
277 uint64_t ect1; member
H A Dngtcp2_rtb.c771 pktns->rx.ecn.ack.ect1 > fr->ecn.ect1 || in conn_verify_ecn()
776 fr->ecn.ect0 > pktns->tx.ecn.ect0 || fr->ecn.ect1))) { in conn_verify_ecn()
795 pktns->rx.ecn.ack.ect1 = fr->ecn.ect1; in conn_verify_ecn()
/dports/security/libecc/libecc-0.14.0/doc/
H A Dbspace.dox963 Then the \fb ect1(m) \fe can be calculated by taking the total number of elements with
973 1 in the Frobenius equivalence classes of \fb w(m/d, 1) \fe, which is defined as \fb ect1(m/d) \fe.
987 then, because of the 1-on-1 correspondence \fb blwt1(n) = ect1(n) / n \fe.
1004 As a result, we can write \fb ect1(m) \fe as follows,
1011 <tr><td>\fb ect1(6) \fe</td><td class="equals">\fb = \fe</td><td>\fb q/2 \fe</td><td>\fb - \fe</td>…
1020 <tr><td>\fb ect1(15) \fe</td><td class="equals">\fb = \fe</td><td>\fb q/2 - 1 \fe</td><td>\fb - \fe…
1023 <tr><td>\fb ect1(18) \fe</td><td class="equals">\fb = \fe</td><td>\fb q/2 \fe</td><td>\fb - \fe</td…
1026 <tr><td>\fb ect1(21) \fe</td><td class="equals">\fb = \fe</td><td>\fb q/2 - 1 \fe</td><td>\fb - \fe…
1032 <tr><td>\fb ect1(27) \fe</td><td class="equals">\fb = \fe</td><td>\fb q/2 - 1 \fe</td><td>\fb - \fe…
1035 If we define \fb ect1(1) = 1 \fe, then this can be written as:
[all …]
/dports/net/libngtcp2/ngtcp2-224bd62/tests/
H A Dngtcp2_pkt_test.c762 fr->ack.ecn.ect1 = 16384; in test_ngtcp2_pkt_encode_ack_ecn_frame()
779 CU_ASSERT(fr->ack.ecn.ect1 == nfr->ack.ecn.ect1); in test_ngtcp2_pkt_encode_ack_ecn_frame()
796 fr->ack.ecn.ect1 = 64; in test_ngtcp2_pkt_encode_ack_ecn_frame()
819 CU_ASSERT(fr->ack.ecn.ect1 == nfr->ack.ecn.ect1); in test_ngtcp2_pkt_encode_ack_ecn_frame()
/dports/devel/libslang2/slang-2.3.2/doc/tm/
H A Dcslang.tm302 \sect1{Loading Files}
373 \sect1{Loading Strings}
467 \sect1{Adding a New Intrinsic} #%{{{
581 \sect1{More Complicated Intrinsics} #%{{{
781 \sect1{Arrays} #%{{{
942 \sect1{Structures} #%{{{
1852 \sect1{Positioning the cursor}
1882 \sect1{Writing to the Display}
1969 \sect1{Erasing the Display}
1984 \sect1{Setting Character Attributes}
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Dresource.cc330 const int64_t ect1 = right.energetic_end_min_opt; in Compute() local
333 if (ect1 >= ect2 && ect1 >= ect3) { // ect1 max in Compute()
334 energetic_end_min_opt = ect1; in Compute()
336 } else if (ect2 >= ect1 && ect2 >= ect3) { // ect2 max in Compute()

12