Searched full:quicker (Results 1 – 25 of 42) sorted by relevance
12
30 implementations may offer a quicker form of validation that omits some checks in31 order to perform a lightweight sanity check of the key. If a quicker form is not38 implementations may offer a quicker form of validation that omits some checks in39 order to perform a lightweight sanity check of the key. If a quicker form is not
165 implementations may offer a quicker form of validation that omits some checks in166 order to perform a lightweight sanity check of the key. If a quicker form is not173 implementations may offer a quicker form of validation that omits some checks in174 order to perform a lightweight sanity check of the key. If a quicker form is not
50 Quicker measurements can be made by reducing decimation ratio.115 Quicker measurements can be made by reducing decimation ratio.
46 Quicker measurements can be made by reducing decimation ratio.
84 much quicker that RSA key generation for example.
85 Quicker measurements can be made by reducing the decimation ratio.
78 Quicker measurements can be made by reducing the decimation ratio.
65 Quicker measurements can be made by reducing decimation ratio.
88 Quicker measurements can be made by reducing decimation ratio.
64 // (which in some cases might even be quicker than using, let's say std::set).
51 * are bit reversed to make accesses quicker.
120 * bit reversed to make lookups quicker.
219 much quicker that \s-1RSA\s0 key generation for example.
148 * -t (test mode) is a lot quicker
262 sometimes handy to disable them for quicker development iteration.
125 /* will sorting make it quicker ?? */ in ldns_zone_glue_rr_list()
132 * over the low bit that indicates inversion for quicker sanity checking in arm_cond_match()
284 * to convert the modulo operation into something quicker. What a hack!
153 int fileRecordSize;/*copy of a variable, int for quicker calculations*/
81 is quicker than both
92 In general, the more detail you share about a problem the quicker a
180 * almost certainly be quicker to do this by direct bitwise access in tgamma128()
761 * locate it quicker. in ng_netflow_flow_add()884 * locate it quicker. in ng_netflow_flow6_add()
139 * @param leeway: prefetch TTL leeway to expire old rrsets quicker.
838 be appended to regardless. It is in any event quicker to append.