qiu8310/yod

Function parse has 97 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function parse (str) {

  var tpl = '';
  var callerStack = [];
  var pairs = {

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    function exec(str) {
      /* jshint ignore:start */
      if (str[0] === '`' && str.slice(-1) === '`') {
        try {
          var evalStr = 'data = ' + str.substr(1, str.length - 2);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

function exec(str) {
  /* jshint ignore:start */
  if (str[0] === '`' && str.slice(-1) === '`') {
    try {
      var evalStr = 'data = ' + str.substr(1, str.length - 2);

• Read up
  Read up

Function m has 91 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    }function v(n,t){for(var r=-1,e=n.length,u=-1,o=[];++r<e;)n[r]===t&&(n[r]=P,o[++u]=r);return o}function g(n){for(var t=-1,r=n.length;++t<r&&_(n.charCodeAt(t)););return t}function y(n){for(var t=n.length;t--&&_(n.charCodeAt(t)););return t}function d(n){return Bn[n]}function m(_){function Ln(n){if(h(n)&&!(Uo(n)||n instanceof zn)){if(n instanceof Bn)return n;if(Ze.call(n,"__chain__")&&Ze.call(n,"__wrapped__"))return Lr(n)}return new Bn(n)}function Pn(){}function Bn(n,t,r){this.__wrapped__=n,this.__actions__=r||[],
    this.__chain__=!!t}function zn(n){this.__wrapped__=n,this.__actions__=null,this.__dir__=1,this.__filtered__=false,this.__iteratees__=null,this.__takeCount__=ku,this.__views__=null}function Mn(){this.__data__={}}function Dn(n){var t=n?n.length:0;for(this.data={hash:yu(null),set:new cu};t--;)this.push(n[t])}function qn(n,t){var r=n.data;return(typeof t=="string"||le(t)?r.set.has(t):r.hash[t])?0:-1}function Kn(n,t){var r=-1,e=n.length;for(t||(t=Te(e));++r<e;)t[r]=n[r];return t}function Vn(n,t){for(var r=-1,e=n.length;++r<e&&false!==t(n[r],r,n););
    return n}function Yn(n,t){for(var r=-1,e=n.length;++r<e;)if(!t(n[r],r,n))return false;return true}function Xn(n,t){for(var r=-1,e=n.length,u=-1,o=[];++r<e;){var i=n[r];t(i,r,n)&&(o[++u]=i)}return o}function Hn(n,t){for(var r=-1,e=n.length,u=Te(e);++r<e;)u[r]=t(n[r],r,n);return u}function Qn(n){for(var t=-1,r=n.length,e=Eu;++t<r;){var u=n[t];u>e&&(e=u)}return e}function nt(n,t){for(var r=-1,e=n.length;++r<e;)if(t(n[r],r,n))return true;return false}function tt(n,t){return n===w?t:n}function rt(n,t,r,e){return n!==w&&Ze.call(e,r)?n:t;

    }function et(n,t,r){var e=Ko(t);iu.apply(e,Gu(t));for(var u=-1,o=e.length;++u<o;){var i=e[u],a=n[i],f=r(a,t[i],i,n,t);(f===f?f===a:a!==a)&&(a!==w||i in n)||(n[i]=f)}return n}function ut(n,t){for(var r=-1,e=n.length,u=Rr(e),o=t.length,i=Te(o);++r<o;){var a=t[r];i[r]=u?Or(a,e)?n[a]:w:n[a]}return i}function ot(n,t,r){r||(r={});for(var e=-1,u=t.length;++e<u;){var o=t[e];r[o]=n[o]}return r}function it(n,t,r){var e=typeof n;return"function"==e?t===w?n:zt(n,t,r):null==n?Ie:"object"==e?xt(n):t===w?Ce(n):At(n,t);

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    function _recycleCheck(current, stack) {
      var index = stack.indexOf(current);
      if (index >= 0) {
        var s = _.map(stack.slice(index).concat(current), function(it) { return it.toString(); });
        throw new Error('Recycle depends found. ' + s.join(' -> '));

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

function _recycleCheck(current, stack) {
  var index = stack.indexOf(current);
  if (index >= 0) {
    var s = _.map(stack.slice(index).concat(current), function(it) { return it.toString(); });
    throw new Error('Recycle depends found. ' + s.join(' -> '));

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

function KVPair(key, value, node) {
  /**
   * Object's key, can depends on Self, Parent object.
   * @type {String}
   */

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    function KVPair(key, value, node) {
      /**
       * Object's key, can depends on Self, Parent object.
       * @type {String}
       */

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

    }}function jt(n,t,r,e,u){if(!le(n))return n;var o=Rr(t.length)&&(Uo(t)||ve(t));if(!o){var i=Ko(t);iu.apply(i,Gu(t))}return Vn(i||t,function(a,f){if(i&&(f=a,a=t[f]),h(a)){e||(e=[]),u||(u=[]);n:{for(var c=f,l=e,s=u,p=l.length,_=t[c];p--;)if(l[p]==_){n[c]=s[p];break n}var p=n[c],v=r?r(p,_,c,n,t):w,g=v===w;g&&(v=_,Rr(_.length)&&(Uo(_)||ve(_))?v=Uo(p)?p:Zu(p)?Kn(p):[]:No(_)||ae(_)?v=ae(p)?ge(p):No(p)?p:{}:g=false),l.push(_),s.push(v),g?n[c]=jt(v,_,r,l,s):(v===v?v!==p:p===p)&&(n[c]=v)}}else c=n[f],l=r?r(c,a,f,n,t):w,
    (s=l===w)&&(l=a),!o&&l===w||!s&&(l===l?l===c:c!==c)||(n[f]=l)}),n}function Ot(n){return function(t){return null==t?w:Nr(t)[n]}}function Et(n){var t=n+"";return n=$r(n),function(r){return dt(r,n,t)}}function kt(n,t){for(var r=t.length;r--;){var e=parseFloat(t[r]);if(e!=u&&Or(e)){var u=e;su.call(n,e,1)}}}function It(n,t){return n+eu(Ou()*(t-n+1))}function Rt(n,t,r,e,u){return u(n,function(n,u,o){r=e?(e=false,n):t(r,n,u,o)}),r}function St(n,t,r){var e=-1,u=n.length;for(t=null==t?0:+t||0,0>t&&(t=-t>u?0:u+t),

Consider simplifying this complex logical expression.

Open

    return u}}function mt(n,t,r,e,u,o){if(n===t)return 0!==n||1/n==1/t;var i=typeof n,a=typeof t;if("function"!=i&&"object"!=i&&"function"!=a&&"object"!=a||null==n||null==t)n=n!==n&&t!==t;else n:{var i=mt,a=Uo(n),f=Uo(t),c=z,l=z;a||(c=Je.call(n),c==B?c=Y:c!=Y&&(a=ve(n))),f||(l=Je.call(t),l==B?l=Y:l!=Y&&ve(t));var s=c==Y&&!Gn(n),f=l==Y&&!Gn(t),l=c==l;if(!l||a||s){if(!e&&(c=s&&Ze.call(n,"__wrapped__"),f=f&&Ze.call(t,"__wrapped__"),c||f)){n=i(c?n.value():n,f?t.value():t,r,e,u,o);break n}if(l){for(u||(u=[]),
    o||(o=[]),c=u.length;c--;)if(u[c]==n){n=o[c]==t;break n}u.push(n),o.push(t),n=(a?vr:yr)(n,t,i,r,e,u,o),u.pop(),o.pop()}else n=false}else n=gr(n,t,c)}return n}function wt(n,t,r,e,u){for(var o=-1,i=t.length,a=!u;++o<i;)if(a&&e[o]?r[o]!==n[t[o]]:!(t[o]in n))return false;for(o=-1;++o<i;){var f=t[o],c=n[f],l=r[o];if(a&&e[o]?f=c!==w||f in n:(f=u?u(c,l,f):w,f===w&&(f=mt(l,c,u,true))),!f)return false}return true}function bt(n,t){var r=-1,e=Zu(n),u=Rr(e)?Te(e):[];return Bu(n,function(n,e,o){u[++r]=t(n,e,o)}),u}function xt(n){

Similar blocks of code found in 2 locations. Consider refactoring.

Open

type.generator = function(name, args, ctx) {
  var t = all[name];
  if (!t) {
    throw new Error('Type "' + name + '" not exists, can\'t generate.');
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    type.generator = function(name, args, ctx) {
      var t = all[name];
      if (!t) {
        throw new Error('Type "' + name + '" not exists, can\'t generate.');
      }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

module.exports = {
  generator: function(obj) {
    return function() {
      if (_.isPlainObject(obj)) {
        return (new KVPairNode(obj)).getValue();

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    module.exports = {
      generator: function(obj) {
        return function() {
          if (_.isPlainObject(obj)) {
            return (new KVPairNode(obj)).getValue();

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    tm.modifier = function(filters, name, fn, ctx) {
      if (_.isFunction(name)) {
        ctx = fn;
        fn = name;
        name = filters;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

tm.modifier = function(filters, name, fn, ctx) {
  if (_.isFunction(name)) {
    ctx = fn;
    fn = name;
    name = filters;

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

    }}),zn.prototype.compact=function(){return this.filter(Ie)},zn.prototype.reject=function(n,t){return n=mr(n,t,1),this.filter(function(t){return!n(t)})},zn.prototype.slice=function(n,t){n=null==n?0:+n||0;var r=0>n?this.takeRight(-n):this.drop(n);return t!==w&&(t=+t||0,r=0>t?r.dropRight(-t):r.take(t-n)),r},zn.prototype.toArray=function(){return this.drop(0)},vt(zn.prototype,function(n,t){var r=Ln[t];if(r){var e=/^(?:filter|map|reject)|While$/.test(t),u=/^(?:first|last)$/.test(t);Ln.prototype[t]=function(){
    function t(n){return n=[n],iu.apply(n,o),r.apply(Ln,n)}var o=arguments,i=this.__chain__,a=this.__wrapped__,f=!!this.__actions__.length,c=a instanceof zn,l=o[0],s=c||Uo(a);return s&&e&&typeof l=="function"&&1!=l.length&&(c=s=false),c=c&&!f,u&&!i?c?n.call(a):r.call(Ln,this.value()):s?(a=n.apply(c?a:new zn(this),o),u||!f&&!a.__actions__||(a.__actions__||(a.__actions__=[])).push({func:Gr,args:[t],thisArg:Ln}),new Bn(a,i)):this.thru(t)}}}),Vn("concat join pop push replace shift sort splice split unshift".split(" "),function(n){

Similar blocks of code found in 2 locations. Consider refactoring.

Open

KVPair.prototype.isParentOf = function(pair) {
  var node = pair.node;
  if (this.hasChildPairs) {
    while (node) {
      if (node === this.value) {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    KVPair.prototype.isParentOf = function(pair) {
      var node = pair.node;
      if (this.hasChildPairs) {
        while (node) {
          if (node === this.value) {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    return u}function Zr(n){return n=Ln(n),n.__chain__=true,n}function Gr(n,t,r){return t.call(r,n)}function Jr(n,t,r){var e=Uo(n)?Yn:lt;return r&&Er(n,t,r)&&(t=null),(typeof t!="function"||r!==w)&&(t=mr(t,r,3)),e(n,t)}function Xr(n,t,r){var e=Uo(n)?Xn:st;return t=mr(t,r,3),e(n,t)}function Hr(n,t,r,e){var u=n?Zu(n):0;return Rr(u)||(n=me(n),u=n.length),u?(r=typeof r!="number"||e&&Er(t,r,e)?0:0>r?wu(u+r,0):r||0,typeof n=="string"||!Uo(n)&&_e(n)?r<u&&-1<n.indexOf(t,r):-1<wr(n,t,r)):false}function Qr(n,t,r){var e=Uo(n)?Hn:bt;

• Read up
  Read up