/external/chromium/chrome/browser/ui/views/tab_contents/ |
H A D | native_tab_contents_view_win.cc | 309 int distance = 0; local 312 distance = WHEEL_DELTA; 315 distance = -WHEEL_DELTA; 323 delegate_->OnNativeTabContentsViewWheelZoom(distance);
|
/external/chromium_org/cc/animation/ |
H A D | scrollbar_animation_controller_linear_fade.h | 34 virtual bool DidMouseMoveNear(base::TimeTicks now, float distance) OVERRIDE;
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | ColorDistance.cpp | 68 float ColorDistance::distance() const function in class:WebCore::ColorDistance 70 // This is just a simple distance calculation, not respecting color spaces
|
H A D | SVGPathElement.h | 61 SVGPoint getPointAtLength(float distance); 62 unsigned getPathSegAtLength(float distance);
|
/external/chromium_org/third_party/zlib/ |
H A D | deflate.h | 40 /* number of distance codes */ 119 * bytes. With this organization, matches are limited to a distance of 198 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 202 struct tree_desc_s d_desc; /* desc. for distance tree */ 308 /* Mapping from a distance to a distance code. dist is the distance - 1 and 331 # define _tr_tally_dist(s, distance, length, flush) \ 333 ush dist = (distance); \ 343 # define _tr_tally_dist(s, distance, lengt [all...] |
/external/chromium_org/tools/telemetry/telemetry/page/actions/ |
H A D | swipe.js | 14 this.distance_ = opt_options.distance; 30 // This class swipes a page for a specified distance.
|
/external/qemu/distrib/zlib-1.2.3/ |
H A D | deflate.h | 40 /* number of distance codes */ 116 * bytes. With this organization, matches are limited to a distance of 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 197 struct tree_desc_s d_desc; /* desc. for distance tree */ 292 /* Mapping from a distance to a distance code. dist is the distance - 1 and 315 # define _tr_tally_dist(s, distance, length, flush) \ 317 ush dist = (distance); \ 327 # define _tr_tally_dist(s, distance, lengt [all...] |
/external/skia/tests/ |
H A D | PathOpsDPointTest.cpp | 46 REPORTER_ASSERT(reporter, approximately_equal(pt.distance(p),
|
/external/stlport/test/eh/ |
H A D | Prefix.h | 98 #define EH_DISTANCE(a, b, result) EH_STD::distance(a, b, result) 207 # define EH_DISTANCE( a, b, result ) do { result = distance( a, b ); } while (0) 236 # define EH_DISTANCE( a, b, result ) distance( a, b, result ) 245 # define EH_DISTANCE( a, b, result ) do { result = distance( a, b ); } while (0)
|
/external/zlib/src/ |
H A D | deflate.h | 40 /* number of distance codes */ 119 * bytes. With this organization, matches are limited to a distance of 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 200 struct tree_desc_s d_desc; /* desc. for distance tree */ 307 /* Mapping from a distance to a distance code. dist is the distance - 1 and 330 # define _tr_tally_dist(s, distance, length, flush) \ 332 ush dist = (distance); \ 342 # define _tr_tally_dist(s, distance, lengt [all...] |
/external/chromium_org/third_party/flot/ |
H A D | jquery.flot.navigate.min.js | 86 */(function(e){function t(i){var l,h=this,p=i.data||{};if(p.elem)h=i.dragTarget=p.elem,i.dragProxy=a.proxy||h,i.cursorOffsetX=p.pageX-p.left,i.cursorOffsetY=p.pageY-p.top,i.offsetX=i.pageX-i.cursorOffsetX,i.offsetY=i.pageY-i.cursorOffsetY;else if(a.dragging||p.which>0&&i.which!=p.which||e(i.target).is(p.not))return;switch(i.type){case"mousedown":return e.extend(p,e(h).offset(),{elem:h,target:i.target,pageX:i.pageX,pageY:i.pageY}),o.add(document,"mousemove mouseup",t,p),s(h,!1),a.dragging=null,!1;case!a.dragging&&"mousemove":if(r(i.pageX-p.pageX)+r(i.pageY-p.pageY)<p.distance)break;i.target=p.target,l=n(i,"dragstart",h),l!==!1&&(a.dragging=h,a.proxy=i.dragProxy=e(l||h)[0]);case"mousemove":if(a.dragging){if(l=n(i,"drag",h),u.drop&&(u.drop.allowed=l!==!1,u.drop.handler(i)),l!==!1)break;i.type="mouseup"};case"mouseup":o.remove(document,"mousemove mouseup",t),a.dragging&&(u.drop&&u.drop.handler(i),n(i,"dragend",h)),s(h,!0),a.dragging=a.proxy=p.elem=!1}return!0}function n(t,n,r){t.type=n;var i=e.event.dispatch.call(r,t);return i===!1?!1:i||t.result}function r(e){return Math.pow(e,2)}function i(){return a.dragging===!1}function s(e,t){e&&(e.unselectable=t?"off":"on",e.onselectstart=function(){return t},e.style&&(e.style.MozUserSelect=t?"":"none"))}e.fn.drag=function(e,t,n){return t&&this.bind("dragstart",e),n&&this.bind("dragend",n),e?this.bind("drag",t?t:e):this.trigger("drag")};var o=e.event,u=o.special,a=u.drag={not:":input",distance:0,which:1,dragging:!1,setup:function(n){n=e.extend({distance:a.distance,which:a.which,not:a.not},n||{}),n.distance=r(n.distance),o.add(this,"mousedown",t,n),this.attachEvent&&this.attachEvent("ondragstart",i)},teardown:function(){o.remove(this,"mousedown",t),this===a.dragging&&(a.dragging=a.proxy=!1),s(this,!0),this.detachEvent&&this.detachEvent("ondragstart",i)}};u.dragstart=u.dragend={setup:function(){},teardown:function(){}}})(jQuery),function(e){function t(t){var n=t||window.event,r=[].slice.call(arguments,1),i=0,s=0,o=0,t=e.event.fix(n);return t.type="mousewheel",n.wheelDelta&&(i=n.wheelDelta/120),n.detail&&(i=-n.detail/3),o=i,void 0!==n.axis&&n.axis===n.HORIZONTAL_AXIS&&(o=0,s=-1*i),void 0!==n.wheelDeltaY&&(o=n.wheelDeltaY/120),void 0!==n.wheelDeltaX&&(s=-1*n.wheelDeltaX/120),r.unshift(t,i,s,o),(e.event.dispatch||e.event.handle).apply(this,r)}var n=["DOMMouseScroll","mousewheel"];if(e.event.fixHooks)for(var r=n.length;r;)e.event.fixHooks[n[--r]]=e.event.mouseHooks;e.event.special.mousewheel={setup:function(){if(this.addEventListener)for(var e=n.length;e;)this.addEventListener(n[--e],t,!1);else this.onmousewheel=t},teardown:function(){if(this.removeEventListener)for(var e=n.length;e;)this.removeEventListener(n[--e],t,!1);else this.onmousewheel=null}},e.fn.extend({mousewheel:function(e){return e?this.bind("mousewheel",e):this.trigger("mousewheel")},unmousewheel:function(e){return this.unbind("mousewheel",e)}})}(jQuery),function(e){function n(t){function n(e,n){var r=t.offset();r.left=e.pageX-r.left,r.top=e.pageY-r.top,n?t.zoomOut({center:r}):t.zoom({center:r})}function r(e,t){return e.preventDefault(),n(e,t<0),!1}function a(e){if(e.which!=1)return!1;var n=t.getPlaceholder().css("cursor");n&&(i=n),t.getPlaceholder().css("cursor",t.getOptions().pan.cursor),s=e.pageX,o=e.pageY}function f(e){var n=t.getOptions().pan.frameRate;if(u||!n)return;u=setTimeout(function(){t.pan({left:s-e.pageX,top:o-e.pageY}),s=e.pageX,o=e.pageY,u=null},1/n*1e3)}function l(e){u&&(clearTimeout(u),u=null),t.getPlaceholder().css("cursor",i),t.pan({left:s-e.pageX,top:o-e.pageY})}function c(e,t){var i=e.getOptions();i.zoom.interactive&&(t[i.zoom.trigger](n),t.mousewheel(r)),i.pan.interactive&&(t.bind("dragstart",{distance:10},a),t.bind("drag",f),t.bind("dragend",l))}function h(e,t){t.unbind(e.getOptions().zoom.trigger, (…)
|
/external/lzma/Java/SevenZip/Compression/LZMA/ |
H A D | Decoder.java | 243 int distance;
245 distance = rep1;
249 distance = rep2;
252 distance = rep3;
258 rep0 = distance;
|
/external/chromium_org/cc/resources/ |
H A D | picture_layer_tiling.cc | 667 int distance; member in struct:cc::__anon4196::EdgeEvent 753 // Sort the events by distance (closest first). 754 if (events[0].distance > events[1].distance) std::swap(events[0], events[1]); 755 if (events[2].distance > events[3].distance) std::swap(events[2], events[3]); 756 if (events[0].distance > events[2].distance) std::swap(events[0], events[2]); 757 if (events[1].distance > events[3].distance) st [all...] |
/external/openfst/src/include/fst/ |
H A D | rmepsilon.h | 42 #include <fst/shortest-distance.h> 78 vector<Weight> *distance, 80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true), 135 // Shortest distance algorithm computation state. 224 // The vector 'distance' will be used to hold the shortest distances 229 vector<typename Arc::Weight> *distance, 292 rmeps_state(*fst, distance, opts); 358 vector<Weight> distance; local 359 AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilte 77 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument 228 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument [all...] |
/external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/appmenu/ |
H A D | AppMenu.java | 418 * @return The shortest distance from the screen edges for the given position rawX, rawY 426 float distance = Math.min( 429 if (distance < 0.0f) { 430 Log.d(TAG, "Received touch event out of the screen edge boundary. distance = " + 431 distance); 433 return Math.abs(distance); 437 * @return The distance from the screen edge that is likely where the hardware menu button is 447 float distance; 450 distance = displaySize.y - rawY - 1; 453 distance [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-raytrace.js | 157 distance : function(color) { 203 getIntensity: function(distance){ 204 if(distance >= intensity) return 0; 206 return Math.pow((intensity - distance) / strength, 0.2); 464 info.distance = (-B) - Math.sqrt(D); 469 info.distance 523 info.distance = t; 555 distance: null, 709 best.distance = 2000; 716 if(info.isHit && info.distance > [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-raytrace.js | 157 distance : function(color) { 203 getIntensity: function(distance){ 204 if(distance >= intensity) return 0; 206 return Math.pow((intensity - distance) / strength, 0.2); 464 info.distance = (-B) - Math.sqrt(D); 469 info.distance 523 info.distance = t; 555 distance: null, 709 best.distance = 2000; 716 if(info.isHit && info.distance > [all...] |
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
H A D | statetracker.py | 322 """Computes the edit distance and list from the function params to the docs. 324 Uses the Levenshtein edit distance algorithm, with code modified from 331 The edit distance, the edit list. 335 distance = [[]] 338 distance[0].append(i) 342 distance.append([j]) 350 deletion = distance[i][j+1] + 1 351 insertion = distance[i+1][j] + 1 352 substitution = distance[i][j] + cost 379 distance[ [all...] |
/external/chromium_org/content/common/android/ |
H A D | address_parser.cc | 118 DCHECK_GT(std::distance(current_word.begin, current_word.end), 0); 119 size_t current_word_length = std::distance(
|
/external/chromium_org/content/public/android/java/src/org/chromium/content/browser/ |
H A D | LongPressDetector.java | 30 // True iff a touch_move has exceeded the touch slop distance. 111 int distance = (deltaX * deltaX) + (deltaY * deltaY); 112 if (distance > mTouchSlopSquare) {
|
/external/chromium_org/third_party/WebKit/Source/testing/runner/ |
H A D | MockSpellCheck.cpp | 87 int wordOffset = distance(stringText.begin(), firstChar); 114 wordLength = distance(firstChar, lastChar);
|
/external/chromium_org/third_party/closure_linter/closure_linter/ |
H A D | statetracker.py | 322 """Computes the edit distance and list from the function params to the docs. 324 Uses the Levenshtein edit distance algorithm, with code modified from 331 The edit distance, the edit list. 335 distance = [[]] 338 distance[0].append(i) 342 distance.append([j]) 350 deletion = distance[i][j+1] + 1 351 insertion = distance[i+1][j] + 1 352 substitution = distance[i][j] + cost 379 distance[ [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | dtitvinf.cpp | 488 // calculate distance 489 int32_t distance = 0; local 499 distance += DIFFERENT_FIELD; 502 distance += DIFFERENT_FIELD; 505 distance += STRING_NUMERIC_DIFFERENCE; 507 distance += (inputFieldWidth > fieldWidth) ? 512 if ( distance < bestDistance ) { 514 bestDistance = distance; 517 if ( distance == 0 ) {
|
/external/chromium_org/v8/tools/sodium/ |
H A D | sodium.js | 303 var distance = 0x7FFFFFFF; 313 if ((dist < distance) || (dist == distance && pos > position)) { 315 distance = dist;
|
/external/icu4c/i18n/ |
H A D | dtitvinf.cpp | 501 // calculate distance 502 int32_t distance = 0; local 512 distance += DIFFERENT_FIELD; 515 distance += DIFFERENT_FIELD; 518 distance += STRING_NUMERIC_DIFFERENCE; 520 distance += (inputFieldWidth > fieldWidth) ? 525 if ( distance < bestDistance ) { 527 bestDistance = distance; 530 if ( distance == 0 ) {
|