}
    }
    return new ImmutableRangeSet<>(ImmutableList.copyOf(rangeSet.asRanges()));
  }

  /**
   * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
   * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
   * will be merged.
   *
   * @throws IllegalArgumentException if any ranges overlap or are empty

    extends AbstractMultimap<K, V> implements ListMultimap<K, V>, Serializable {
  /*
   * Order is maintained using a linked list containing all key-value pairs. In
   * addition, a series of disjoint linked lists of "siblings", each containing
   * the values for a specific key, is used to implement {@link
   * ValueForKeyIterator} in constant time.
   */

 *
 *   private final ImmutableSet<String> codes;
 *
 *   public Foo(Iterable<String> codes) {
 *     this.codes = ImmutableSet.copyOf(codes);
 *     checkArgument(Collections.disjoint(this.codes, RESERVED_CODES));
 *   }
 * }
 * }
 *
 * <h3>See also</h3>
 *
 * <p>See the Guava User Guide article on <a href=

   *  / | \     |
   * a  b  c    f
   * }
   */
  private static final SuccessorsFunction<Character> TREE =
      createDirectedGraph("hd", "he", "hg", "da", "db", "dc", "gf");

  /**
   * Two disjoint tree-shaped graphs that look as follows (all edges are directed facing downwards):
   *
   * {@snippet :
   * a   c
   * |   |
   * |   |
   * b   d
   * }
   */

   *  / | \     |
   * a  b  c    f
   * }
   */
  private static final SuccessorsFunction<Character> TREE =
      createDirectedGraph("hd", "he", "hg", "da", "db", "dc", "gf");

  /**
   * Two disjoint tree-shaped graphs that look as follows (all edges are directed facing downwards):
   *
   * {@snippet :
   * a   c
   * |   |
   * |   |
   * b   d
   * }
   */

          if (set2.contains(e)) {
            size++;
          }
        }
        return size;
      }

      @Override
      public boolean isEmpty() {
        return Collections.disjoint(set2, set1);
      }

      @Override
      public boolean contains(@Nullable Object object) {
        return set1.contains(object) && set2.contains(object);
      }

      @Override

    public void test_evaluate_withSpecialCharacters() {
        String template = "Price: $${price} (with ${discount}% off)";
        Map<String, Object> paramMap = new HashMap<>();
        paramMap.put("price", "100");
        paramMap.put("discount", "20");

        Object result = scriptEngine.evaluate(template, paramMap);
        assertEquals("Price: $100 (with 20% off)", result);
    }

direct

// directory : Binky Moon, LLC
// https://www.iana.org/domains/root/db/directory.html
directory

// discount : Binky Moon, LLC
// https://www.iana.org/domains/root/db/discount.html
discount

// discover : Discover Financial Services
// https://www.iana.org/domains/root/db/discover.html
discover

// dish : Dish DBS Corporation

diamonds
dielddanuorri.no
dienbien.vn
diet
digick.jp
digital
diher.solutions
direct
direct.quickconnect.cn
direct.quickconnect.to
directory
discordsays.com
discordsez.com
discount
discourse.group
discourse.team
discover
dish
diskstation.eu
diskstation.me
diskstation.org
diskussionsbereich.de
ditchyourip.com
divtasvuodna.no
divttasvuotna.no
dix.asia

diamonds
dielddanuorri.no
dienbien.vn
diet
digick.jp
digital
diher.solutions
direct
direct.quickconnect.cn
direct.quickconnect.to
directory
discordsays.com
discordsez.com
discount
discourse.group
discourse.team
discover
dish
diskstation.eu
diskstation.me
diskstation.org
diskussionsbereich.de
ditchyourip.com
divtasvuodna.no
divttasvuotna.no
dix.asia