<commit_before>package com.jwetherell.algorithms.data_structures;

import java.security.InvalidParameterException;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import java.util.TreeSet;

/**
 * An interval tree is an ordered tree data structure to hold intervals.
 * Specifically, it allows one to efficiently find all intervals that overlap
 * with any given interval or point.
 * 
 * http://en.wikipedia.org/wiki/Interval_tree<commit_msg>Added a comment about duplicate intervals<commit_after>package com.jwetherell.algorithms.data_structures;

import java.security.InvalidParameterException;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import java.util.TreeSet;

/**
 * An interval tree is an ordered tree data structure to hold intervals.
 * Specifically, it allows one to efficiently find all intervals that overlap
 * with any given interval or point.
 * 
 * Note: This class does not handle intervals with the same start and end points.
 * 
 * http://en.wikipedia.org/wiki/Interval_tree
{'fraction_non_alphanumeric': 0.08261617900172118, 'fraction_numerical': 0.0, 'mean_word_length': 4.933673469387755, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7249038', 'n_tokens_mistral': 315, 'n_tokens_neox': 311, 'n_words': 110}