/*!

 * mustache.js - Logic-less {{mustache}} templates with JavaScript

 * http://github.com/janl/mustache.js

 */

/*global define: false*/

(function (root, factory) {

  if (typeof exports === "object" && exports) {

    factory(exports); // CommonJS

  } else {

    var mustache = {};

    factory(mustache);

    if (typeof define === "function" && define.amd) {

      define(mustache); // AMD

    } else {

      root.Mustache = mustache; // <script>

    }

  }

}(this, function (mustache) {

  var whiteRe = /\s*/;

  var spaceRe = /\s+/;

  var nonSpaceRe = /\S/;

  var eqRe = /\s*=/;

  var curlyRe = /\s*\}/;

  var tagRe = /#|\^|\/|>|\{|&|=|!/;

  // Workaround for https://issues.apache.org/jira/browse/COUCHDB-577

  // See https://github.com/janl/mustache.js/issues/189

  var RegExp_test = RegExp.prototype.test;

  function testRegExp(re, string) {

    return RegExp_test.call(re, string);

  function isWhitespace(string) {

    return !testRegExp(nonSpaceRe, string);

  var Object_toString = Object.prototype.toString;

  var isArray = Array.isArray || function (obj) {

    return Object_toString.call(obj) === '[object Array]';

  };

  function escapeRegExp(string) {

    return string.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");

  }

  var entityMap = {

    "'": ''',

    "/": '/'

  function escapeHtml(string) {

    return String(string).replace(/[&<>"'\/]/g, function (s) {

      return entityMap[s];

  function Scanner(string) {

    this.string = string;

    this.tail = string;

    this.pos = 0;

  }

  /**

   * Returns `true` if the tail is empty (end of string).

   */

  Scanner.prototype.eos = function () {

    return this.tail === "";

  };

  /**

   * Tries to match the given regular expression at the current position.

   * Returns the matched text if it can match, the empty string otherwise.

   */

  Scanner.prototype.scan = function (re) {

    var match = this.tail.match(re);

    if (match && match.index === 0) {

      this.tail = this.tail.substring(match[0].length);

      this.pos += match[0].length;

      return match[0];

    }

    return "";

  };

  /**

   * Skips all text until the given regular expression can be matched. Returns

   * the skipped string, which is the entire tail if no match can be made.

   */

  Scanner.prototype.scanUntil = function (re) {

    var match, pos = this.tail.search(re);

    switch (pos) {

    case -1:

      match = this.tail;

      this.pos += this.tail.length;

      this.tail = "";

      break;

    case 0:

      match = "";

      break;

    default:

      match = this.tail.substring(0, pos);

      this.tail = this.tail.substring(pos);

      this.pos += pos;

    }

    return match;

  };

  function Context(view, parent) {

    this.view = view || {};

    this.parent = parent;

    this._cache = {};

  }

  Context.make = function (view) {

    return (view instanceof Context) ? view : new Context(view);

  };

  Context.prototype.push = function (view) {

    return new Context(view, this);

  };

  Context.prototype.lookup = function (name) {

    var value = this._cache[name];

    if (!value) {

      if (name == '.') {

        value = this.view;

      } else {

        var context = this;

        while (context) {

          if (name.indexOf('.') > 0) {

            value = context.view;

            var names = name.split('.'), i = 0;

            while (value && i < names.length) {

              value = value[names[i++]];

            }

          } else {

            value = context.view[name];

          }

          if (value != null) break;

          context = context.parent;

        }

      this._cache[name] = value;

    }

    if (typeof value === 'function') value = value.call(this.view);

    return value;

  };

  function Writer() {

    this.clearCache();

  }

  Writer.prototype.clearCache = function () {

    this._cache = {};

    this._partialCache = {};

  };

  Writer.prototype.compile = function (template, tags) {

    var fn = this._cache[template];

    if (!fn) {

      var tokens = mustache.parse(template, tags);

      fn = this._cache[template] = this.compileTokens(tokens, template);

    }

    return fn;

  };

  Writer.prototype.compilePartial = function (name, template, tags) {

    var fn = this.compile(template, tags);

    this._partialCache[name] = fn;

    return fn;

  };

  Writer.prototype.getPartial = function (name) {

    if (!(name in this._partialCache) && this._loadPartial) {

      this.compilePartial(name, this._loadPartial(name));

    }

    return this._partialCache[name];

  };

  Writer.prototype.compileTokens = function (tokens, template) {

    var self = this;

    return function (view, partials) {

      if (partials) {

        if (typeof partials === 'function') {

          self._loadPartial = partials;

          for (var name in partials) {

            self.compilePartial(name, partials[name]);

          }

      return renderTokens(tokens, self, Context.make(view), template);

    };

  };

  Writer.prototype.render = function (template, view, partials) {

    return this.compile(template)(view, partials);

  };

  /**

   * Low-level function that renders the given `tokens` using the given `writer`

   * and `context`. The `template` string is only needed for templates that use

   * higher-order sections to extract the portion of the original template that

   * was contained in that section.

   */

  function renderTokens(tokens, writer, context, template) {

    var buffer = '';

    var token, tokenValue, value;

    for (var i = 0, len = tokens.length; i < len; ++i) {

      token = tokens[i];

      tokenValue = token[1];

      switch (token[0]) {

      case '#':

        value = context.lookup(tokenValue);

        if (typeof value === 'object') {

          if (isArray(value)) {

            for (var j = 0, jlen = value.length; j < jlen; ++j) {

              buffer += renderTokens(token[4], writer, context.push(value[j]), template);

            }

          } else if (value) {

            buffer += renderTokens(token[4], writer, context.push(value), template);

          }

        } else if (typeof value === 'function') {

          var text = template == null ? null : template.slice(token[3], token[5]);

          value = value.call(context.view, text, function (template) {

            return writer.render(template, context);

          });

          if (value != null) buffer += value;

        } else if (value) {

          buffer += renderTokens(token[4], writer, context, template);

        }

        break;

      case '^':

        value = context.lookup(tokenValue);

        // Use JavaScript's definition of falsy. Include empty arrays.

        // See https://github.com/janl/mustache.js/issues/186

        if (!value || (isArray(value) && value.length === 0)) {

          buffer += renderTokens(token[4], writer, context, template);

        }

        break;

      case '>':

        value = writer.getPartial(tokenValue);

        if (typeof value === 'function') buffer += value(context);

        break;

      case '&':

        value = context.lookup(tokenValue);

        if (value != null) buffer += value;

        break;

      case 'name':

        value = context.lookup(tokenValue);

        if (value != null) buffer += mustache.escape(value);

        break;

      case 'text':

        buffer += tokenValue;

        break;

    }

    return buffer;

  }

  /**

   * Forms the given array of `tokens` into a nested tree structure where

   * tokens that represent a section have two additional items: 1) an array of

   * all tokens that appear in that section and 2) the index in the original

   * template that represents the end of that section.

   */

  function nestTokens(tokens) {

    var tree = [];

    var collector = tree;

    var sections = [];

    var token;

    for (var i = 0, len = tokens.length; i < len; ++i) {

      token = tokens[i];

      switch (token[0]) {

      case '#':

      case '^':

        sections.push(token);

        collector.push(token);

        collector = token[4] = [];

        break;

      case '/':

        var section = sections.pop();

        section[5] = token[2];

        collector = sections.length > 0 ? sections[sections.length - 1][4] : tree;

        break;

      default:

        collector.push(token);

    }

    return tree;

  }

  /**

   * Combines the values of consecutive text tokens in the given `tokens` array

   * to a single token.

   */

  function squashTokens(tokens) {

    var squashedTokens = [];

    var token, lastToken;

    for (var i = 0, len = tokens.length; i < len; ++i) {

      token = tokens[i];

      if (token) {

        if (token[0] === 'text' && lastToken && lastToken[0] === 'text') {

          lastToken[1] += token[1];

          lastToken[3] = token[3];

        } else {

          lastToken = token;

          squashedTokens.push(token);