Searched refs:distance (Results 1 - 25 of 199) sorted by relevance

12345678

/macosx-10.10/tcl-105/tcl_ext/tklib/tklib/modules/diagrams/include/
H A Dpointarith.inc9 [call [cmd by] [arg distance] [arg direction]]
13 This command takes a [arg distance] and [arg direction] (angle in
57 [call [arg point] [cmd by] [arg distance] [arg direction]]
62 [$point + [by $distance $direction]]
/macosx-10.10/CPANInternal-159.1/Text-LevenshteinXS-0.03/
H A Dtest.pl4 use Text::LevenshteinXS qw(distance);
7 if (distance("foo","four") == 2) {ok(1)} else {ok(0)}
8 if (distance("foo","foo") == 0) {ok(1)} else {ok(0)}
9 if (distance("foo","") == 3) {ok(1)} else {ok(0)}
10 if (distance("four","foo") == 2) {ok(1)} else {ok(0)}
11 if (distance("foo","bar") == 3) {ok(1)} else {ok(0)}
H A DLevenshteinXS.pm20 distance
31 Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance
35 use Text::LevenshteinXS qw(distance);
37 print distance("foo","four");
40 print distance("foo","bar");
46 This module implements the Levenshtein edit distance in a XS way.
48 The Levenshtein edit distance is a measure of the degree of proximity between two strings.
49 This distance is the number of substitutions, deletions or insertions ("edits")
51 When two strings have distance 0, they are the same.
H A DLevenshteinXS.xs20 /*Compute levenshtein distance between s and t*/
23 int k,i,j,n,m,cost,*d,distance;
50 distance=d[n*m-1];
52 return distance;
69 distance(s,t)
/macosx-10.10/WebCore-7600.1.25/platform/audio/
H A DDistance.cpp49 double DistanceEffect::gain(double distance) argument
51 // don't go beyond maximum distance
52 distance = std::min(distance, m_maxDistance);
54 // if clamped, don't get closer than reference distance
56 distance = std::max(distance, m_refDistance);
60 return linearGain(distance);
62 return inverseGain(distance);
64 return exponentialGain(distance);
70 linearGain(double distance) argument
77 inverseGain(double distance) argument
82 exponentialGain(double distance) argument
[all...]
H A DDistance.h47 // Returns scalar gain for the given distance the current distance model is used
48 double gain(double distance);
68 double linearGain(double distance);
69 double inverseGain(double distance);
70 double exponentialGain(double distance);
/macosx-10.10/WebCore-7600.1.25/history/
H A DBackForwardController.cpp47 bool BackForwardController::canGoBackOrForward(int distance) const
49 if (!distance)
51 if (distance > 0 && distance <= forwardCount())
53 if (distance < 0 && -distance <= backCount())
58 void BackForwardController::goBackOrForward(int distance) argument
60 if (!distance)
63 HistoryItem* item = itemAtIndex(distance);
65 if (distance >
[all...]
H A DBackForwardController.h47 bool canGoBackOrForward(int distance) const;
48 void goBackOrForward(int distance);
/macosx-10.10/groff-38/groff/src/preproc/pic/
H A Dcommon.h38 const position &, const distance &,
42 void dashed_ellipse(const position &, const distance &, const line_type &);
43 void dotted_ellipse(const position &, const distance &, const line_type &);
50 void dashed_rounded_box(const position &, const distance &, double,
52 void dotted_rounded_box(const position &, const distance &, double,
54 void solid_rounded_box(const position &, const distance &, double,
56 void filled_rounded_box(const position &, const distance &, double, double);
68 void ellipse(const position &, const distance &,
70 void rounded_box(const position &, const distance &, double,
H A Dposition.h46 typedef position distance; typedef
H A Dtroff.cpp35 virtual void simple_ellipse(int, const position &, const distance &) = 0;
56 void ellipse(const position &, const distance &, const line_type &, double);
96 distance vec(v[i] - pos);
110 distance vec(v[i] - pos);
116 distance dash_vec = vec*(lt.dash_width/dist);
118 distance dash_gap_vec = vec*(dash_gap/dist);
186 void simple_output::ellipse(const position &cent, const distance &dim,
235 void simple_ellipse(int, const position &, const distance &);
336 const distance &dim)
349 void troff_output::simple_arc(const position &start, const distance
[all...]
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/list_update_map_/
H A Dinfo_fn_imps.hpp51 { return std::distance(begin(), end()); }
/macosx-10.10/WebCore-7600.1.25/bindings/scripts/
H A DHasher.pm32 my ($value, $distance) = @_;
33 return (($value << $distance) & 0xFFFFFFFF);
/macosx-10.10/WebCore-7600.1.25/svg/
H A DColorDistance.h41 float distance() const;
H A DSVGTransformDistance.h41 float distance() const;
/macosx-10.10/pyobjc-45/2.5/pyobjc/pyobjc-framework-Quartz/Examples/Core Image/CIHazeFilterSample/
H A DHazeFilterView.py10 distance = objc.ivar(type=objc._C_FLT) variable in class:HazeFilterView
14 self.distance = sender.floatValue()
43 self.filter.setValue_forKey_(self.distance, "inputDistance")
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-framework-Quartz/Examples/Core Image/CIHazeFilterSample/
H A DHazeFilterView.py10 distance = objc.ivar(type=objc._C_FLT) variable in class:HazeFilterView
14 self.distance = sender.floatValue()
43 self.filter.setValue_forKey_(self.distance, "inputDistance")
/macosx-10.10/pyobjc-45/pyobjc/pyobjc-framework-Quartz-2.5.1/Examples/Core Image/CIHazeFilterSample/
H A DHazeFilterView.py10 distance = objc.ivar(type=objc._C_FLT) variable in class:HazeFilterView
14 self.distance = sender.floatValue()
43 self.filter.setValue_forKey_(self.distance, "inputDistance")
/macosx-10.10/CPANInternal-159.1/Graph-0.94/lib/Graph/
H A DAdjacencyMatrix.pm102 sub distance { subroutine
127 $am->distance($u, $v)
130 $am->distance($u, $v)
138 and optionally also the distance matrix of a graph, and after that
140 method, or query the distance between vertices by using the
141 C<distance()> method.
143 By default the edge attribute used for distance is C<w>, but you
147 the adjacency matrix and the distance matrix may become invalid.
169 distance matrix, use the attribute C<distance_matrix> with a true value
174 By default the edge attribute used for distance i
[all...]
/macosx-10.10/CPANInternal-159.1/Graph-0.96/lib/Graph/
H A DAdjacencyMatrix.pm102 sub distance { subroutine
127 $am->distance($u, $v)
130 $am->distance($u, $v)
138 and optionally also the distance matrix of a graph, and after that
140 method, or query the distance between vertices by using the
141 C<distance()> method.
143 By default the edge attribute used for distance is C<w>, but you
147 the adjacency matrix and the distance matrix may become invalid.
169 distance matrix, use the attribute C<distance_matrix> with a true value
174 By default the edge attribute used for distance i
[all...]
/macosx-10.10/WebInspectorUI-7600.1.17/UserInterface/Views/
H A DHierarchicalPathNavigationItem.js176 var distance = -1; variable
199 if (distance > 0)
213 i = middle + distance;
215 // Increment the distance when it is in the positive direction.
216 if (distance > 0)
217 ++distance;
219 // Flip the direction of the distance.
220 distance *= -1;
/macosx-10.10/ruby-106/ruby/benchmark/
H A Dbm_so_nbody.rb30 distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
31 mag = dt / (distance * distance * distance)
61 distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
62 e -= (b.mass * b2.mass) / distance
/macosx-10.10/WebCore-7600.1.25/page/
H A DHistory.cpp106 void History::go(int distance) argument
111 m_frame->navigationScheduler().scheduleHistoryNavigation(distance);
114 void History::go(ScriptExecutionContext* context, int distance) argument
127 m_frame->navigationScheduler().scheduleHistoryNavigation(distance);
H A DHistory.h51 void go(int distance);
55 void go(ScriptExecutionContext*, int distance);
/macosx-10.10/tcl-105/tcl_ext/tklib/tklib/modules/diagrams/
H A Dpoint.tcl70 proc ::diagram::point::by {distance angle} {
71 return [list by [list $distance $angle]]
170 lassign $polar distance angle
171 return [geo::s* $distance [geo::direction $angle]]

Completed in 158 milliseconds

12345678