cafe-grader-web Files · node_modules/es5-ext/array/#/copy-within/shim.js

cafe-grader-web

Location: cafe-grader-web/node_modules/es5-ext/array/#/copy-within/shim.js

Commit Description:

- login report...

Commit Description:

- login report - fix bugs on pagination on user manage

References:

r792:6ae18fbc4b91 default

File last commit:

r789:8cd7e8db7e38 default

Show/Diff file:

Action:

            
                    node_modules/es5-ext/array/#/copy-within/shim.js
                
             | 45 lines
             | 1.2 KiB
             | application/javascript 
             | JavascriptLexer
             | 
      
            History
        
           Show Full History
         |
          Annotation
         | Raw
         |
              
              Download
              
      // Taken from: https://github.com/paulmillr/es6-shim/

      "use strict";

      var toInteger         = require("../../../number/to-integer")

        , toPosInt          = require("../../../number/to-pos-integer")

        , validValue        = require("../../../object/valid-value")

        , objHasOwnProperty = Object.prototype.hasOwnProperty

        , max               = Math.max

        , min               = Math.min;

      module.exports = function (target, start/*, end*/) {

      	var arr = validValue(this)

      	  , end = arguments[2]

      	  , length = toPosInt(arr.length)

      	  , to

      	  , from

      	  , fin

      	  , count

      	  , direction;

      	target = toInteger(target);

      	start = toInteger(start);

      	end = end === undefined ? length : toInteger(end);

      	to = target < 0 ? max(length + target, 0) : min(target, length);

      	from = start < 0 ? max(length + start, 0) : min(start, length);

      	fin = end < 0 ? max(length + end, 0) : min(end, length);

      	count = min(fin - from, length - to);

      	direction = 1;

      	if (from < to && to < from + count) {

      		direction = -1;

      		from += count - 1;

      		to += count - 1;

      	}

      	while (count > 0) {

      		if (objHasOwnProperty.call(arr, from)) arr[to] = arr[from];

      		else delete arr[from];

      		from += direction;

      		to += direction;

      		count -= 1;

      	}

      	return arr;

      };

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository permissions settings

Sign in to your account

Last Author

				// Taken from: https://github.com/paulmillr/es6-shim/

				"use strict";

				var toInteger = require("../../../number/to-integer")
				, toPosInt = require("../../../number/to-pos-integer")
				, validValue = require("../../../object/valid-value")
				, objHasOwnProperty = Object.prototype.hasOwnProperty
				, max = Math.max
				, min = Math.min;

				module.exports = function (target, start/, end/) {
				var arr = validValue(this)
				, end = arguments[2]
				, length = toPosInt(arr.length)
				, to
				, from
				, fin
				, count
				, direction;

				target = toInteger(target);
				start = toInteger(start);
				end = end === undefined ? length : toInteger(end);

				to = target < 0 ? max(length + target, 0) : min(target, length);
				from = start < 0 ? max(length + start, 0) : min(start, length);
				fin = end < 0 ? max(length + end, 0) : min(end, length);
				count = min(fin - from, length - to);
				direction = 1;

				if (from < to && to < from + count) {
				direction = -1;
				from += count - 1;
				to += count - 1;
				}
				while (count > 0) {
				if (objHasOwnProperty.call(arr, from)) arr[to] = arr[from];
				else delete arr[from];
				from += direction;
				to += direction;
				count -= 1;
				}
				return arr;
				};