| /third_party/boost/libs/unordered/doc/ |
| D | comparison.qbk | 103 [logarithmic]
109 logarithmic otherwise]
140 [logarithmic]
151 [logarithmic]
156 [logarithmic]
|
| D | intro.qbk | 15 logarithmic complexity. That is generally okay, but in many cases a
|
| /third_party/node/deps/histogram/src/ |
| D | hdr_histogram.c | 1033 struct hdr_iter_log* logarithmic = &iter->specifics.log; in log_iter_next() local
1035 logarithmic->count_added_in_this_iteration_step = 0; in log_iter_next()
1039 iter, logarithmic->next_value_reporting_level_lowest_equivalent)) in log_iter_next()
1043 if (iter->value >= logarithmic->next_value_reporting_level_lowest_equivalent) in log_iter_next()
1045 update_iterated_values(iter, logarithmic->next_value_reporting_level); in log_iter_next()
1047 logarithmic->next_value_reporting_level *= (int64_t)logarithmic->log_base; in log_iter_next()
1048 …logarithmic->next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(iter->h, logar… in log_iter_next()
1058 logarithmic->count_added_in_this_iteration_step += iter->count; in log_iter_next()
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | lower_bound.rst | 79 The number of comparisons is logarithmic: at most log\ :sub:`2`\ ( ``size<s>::value`` ) + 1.
81 is also logarithmic; otherwise, the number of steps is proportional to
|
| D | upper_bound.rst | 79 The number of comparisons is logarithmic: at most log\ :sub:`2`\ ( ``size<s>::value`` ) + 1.
81 is also logarithmic; otherwise, the number of steps is proportional to
|
| /third_party/boost/libs/icl/doc/ |
| D | implementation.qbk | 84 deletion and search are all using logarithmic time.
129 /element value pair/ is always done in /logarithmic time/,
152 /logarithmic time/ before we can launch
154 So we have only a ['*logarithmic amortized
165 small, performance can be /logarithmic/.
|
| D | functions_selection.qbk | 24 * All time *complexities* are ['*logarithmic*] in the containers `iterative_size()`.
|
| D | functions_iterator_related.qbk | 59 ['*logarithmic*] in the `iterative_size` of the container.
|
| D | functions_addition.qbk | 209 of std::AssociativeContainers, we have a logarithmic complexity for
211 Addition of intervals or interval value pairs is amortized logarithmic
|
| D | functions_containedness.qbk | 121 logarithmic behavior, whereas the linear implementation
|
| /third_party/boost/libs/math/doc/sf/ |
| D | lgamma.qbk | 89 approximation. The logarithmic version of the __lanczos is:
97 When z is very near 1 or 2, then the logarithmic version of the __lanczos
|
| D | digamma.qbk | 21 Returns the digamma or psi function of /x/. Digamma is defined as the logarithmic
|
| /third_party/boost/libs/algorithm/doc/ |
| D | partition_point.qbk | 49 Both of the variants of `partition_point` run in ['O( log (N))] (logarithmic) time; that is, the pr…
|
| /third_party/boost/libs/math/doc/overview/ |
| D | overview.qbk | 57 special power and logarithmic functions.
|
| /third_party/boost/libs/regex/doc/ |
| D | regex_split.qbk | 90 // use logarithmic growth strategy, in case
|
| D | regex_token_iterator.qbk | 381 // use logarithmic growth strategy, in case
|
| /third_party/boost/libs/math/doc/interpolators/ |
| D | cubic_hermite.qbk | 199 The logarithmic complexity of the non-equispaced version is evident, as is the better cache utiliza…
|
| /third_party/boost/libs/math/ |
| D | README.md | 32 …grendre/Laguerre/Hermite/Chebyshev polynomials and various special power and logarithmic functions.
|
| /third_party/python/Doc/library/ |
| D | ossaudiodev.rst | 202 | :const:`AFMT_MU_LAW` | a logarithmic encoding (used by Sun ``.au`` |
205 | :const:`AFMT_A_LAW` | a logarithmic encoding |
|
| D | bisect.rst | 112 * The *insort()* functions are ``O(n)`` because the logarithmic search step
|
| D | cmath.rst | 83 Power and logarithmic functions
|
| /third_party/gstreamer/gstplugins_bad/ext/lv2/ |
| D | gstlv2filter.c | 49 gboolean toggled, logarithmic, integer, writable; member
|
| /third_party/boost/libs/numeric/odeint/doc/ |
| D | tutorial_chaotic_system.qbk | 27 time. The Lyapunov exponents are then defined as logarithmic growth rates of
|
| /third_party/boost/libs/hana/doc/js/ |
| D | highcharts.js | 125 …unction(){var a=this,t=a.axis,f=t.options,u=t.chart,m=t.categories,h=t.logarithmic,l=t.names,k=a.p…
156 {};d.positiveValuesOnly=!!d.logarithmic;d.isLinked=q(g.linkedTo);d.ticks={};d.labelEdge=[];d.minorT…
158 …icSymbolMagnitude||1E3;var a=h&&h.length,r=c.options.labels.format;c=c.logarithmic?Math.abs(b):c.t…
159 …iveValuesOnly&&0>=k&&(k=null);if(c.isXAxis){if(g=d.xData,g.length){g=c.logarithmic?g.filter(c.vali…
161 …inPixelPadding;g=(h.isOrdinal||h.brokenAxis&&h.brokenAxis.hasBreaks||h.logarithmic&&g)&&h.lin2val;…
164 …0,k=this.min-g;g=this.max+g;var h=g-k;if(h&&h/e<this.len/3){var a=this.logarithmic;if(a)this.padde…
165 …ForMinRange=function(){var c=this.options,b=this.min,e=this.max,d=this.logarithmic,g,k,h,a,l;this.…
166 …s.minRange;var f=(x-e+b)/2;f=[b-f,r(c.min,b-f)];m&&(f[2]=this.logarithmic?this.logarithmic.log2lin…
170 …is.range};e.prototype.setTickInterval=function(c){var b=this,e=b.chart,g=b.logarithmic,k=b.options,
175 b.closestPointRange:0);!f&&b.tickInterval<c&&(b.tickInterval=c);b.dateTime||b.logarithmic||f||(b.ti…
[all …]
|
| /third_party/ffmpeg/doc/ |
| D | snow.txt | 238 quality (logarithmic quantizer scale)
|