concord-consortium/rigse

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

Open

  increment_record_count: function(scaffold_id) {
    // increment the last record count, firsts record count are in nested lists
    count = $$('#' + scaffold_id + ' span.active-scaffold-records').last();
    count.innerHTML = parseInt(count.innerHTML) + 1;
  },

• Read up
  Read up

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

Open

  decrement_record_count: function(scaffold_id) {
    // decrement the last record count, firsts record count are in nested lists
    count = $$('#' + scaffold_id + ' span.active-scaffold-records').last();
    count.innerHTML = parseInt(count.innerHTML) - 1;
  },

• Read up
  Read up

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

Open

    indexOf = [].indexOf || function( elem ) {
        var i = 0,
            len = this.length;
        for ( ; i < len; i++ ) {
            if ( this[i] === elem ) {

• Read up
  Read up

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

Open

        matchers = [ function( elem, context, xml ) {
            return ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
                (checkContext = context).nodeType ?
                    matchContext( elem, context, xml ) :
                    matchAnyContext( elem, context, xml ) );

• Read up
  Read up

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

Open

    indexOf = arr.indexOf || function( elem ) {
        var i = 0,
          len = this.length;
        for ( ; i < len; i++ ) {
          if ( this[i] === elem ) {

• Read up
  Read up

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

Open

  initialize: function() {
    this.element = new Element('iframe', {
      style: 'position:absolute;filter:progid:DXImageTransform.Microsoft.Alpha(opacity=0);display:none',
      src: 'javascript:false;',
      frameborder: 0

• Read up
  Read up

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

Open

    Object.extend(GLOBAL.Node, {
      ELEMENT_NODE:                1,
      ATTRIBUTE_NODE:              2,
      TEXT_NODE:                   3,
      CDATA_SECTION_NODE:          4,

• Read up
  Read up

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

Open

          match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) );

• Read up
  Read up

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

Open

                match[3] = +( match[3] ? match[4] + (match[5] || 1) : 2 * ( match[2] === "even" || match[2] === "odd" ) );

• Read up
  Read up

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

Open

  function getUniqueElementID(element) {
    if (element === window) return 0;

    if (typeof element._prototypeUID === 'undefined')
      element._prototypeUID = Element.Storage.UID++;

• Read up
  Read up

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

Open

    var Type = Tokenizer.Type = {
        ANGLE: 1,
        CHARACTER: 2,
        COLOR: 4,
        DIMEN: 8,

• Read up
  Read up

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

Open

const sortByOldest = function (a: any, b: any) {
  return ((a.created_at > b.created_at) ? 1 : (a.created_at < b.created_at) ? -1 : 0);
};

• Read up
  Read up

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

Open

const sortByNewest = function (a: any, b: any) {
  return ((b.created_at > a.created_at) ? 1 : (b.created_at < a.created_at) ? -1 : 0);
};

• Read up
  Read up

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

Open

  {
    category: "Elementary 5-6 Earth Science",
    className: "elementary-56",
    children: [
      {

• Read up
  Read up

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

Open

  {
    category: "Elementary 5-6 Physical Science",
    className: "elementary-56",
    children: [
      {

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

                if( lazy && ( bounds = boundsInfo.getBounds() ) && ( docEl = doc.documentElement || doc.body ) &&
                        ( bounds.y > docEl.clientHeight || bounds.x > docEl.clientWidth || bounds.y + bounds.h < 0 || bounds.x + bounds.w < 0 ) ) {
                    if( !delayed ) {
                        delayed = 1;
                        PIE.OnScroll.observe( init );

Consider simplifying this complex logical expression.

Open

        if (value != null && element.type != 'file' && (element.type != 'submit' || (!submitted &&
          submit !== false && (!submit || key == submit) && (submitted = true)))) {
          result = accumulator(result, key, value);
        }

Consider simplifying this complex logical expression.

Open

              } else if ( useCache && (cache = (elem[ expando ] || (elem[ expando ] = {}))[ type ]) && cache[0] === dirruns ) {
                diff = cache[1];

              } else {
                while ( (node = ++nodeIndex && node && node[ dir ] ||

Consider simplifying this complex logical expression.

Open

        if(event.pageX == null && event.clientX != null){
            var de = document.documentElement, b = document.body;
            ax = event.clientX + (de && de.scrollLeft || b.scrollLeft || 0);
            ay = event.clientY + (de && de.scrollTop || b.scrollTop || 0);
        }else{

Consider simplifying this complex logical expression.

Open

        if(event.pageX == null && event.clientX != null){
            var de = document.documentElement, b = document.body;
            ax = event.clientX + (de && de.scrollLeft || b.scrollLeft || 0);
            ay = event.clientY + (de && de.scrollTop || b.scrollTop || 0);
        }else{