return result
}

/** Returns a copy of [mappings] with adjacent ranges merged wherever possible. */
internal fun mergeAdjacentRanges(mappings: List<Mapping>): List<Mapping> {
  var index = 0
  val result = mutableListOf<Mapping>()

  while (index < mappings.size) {
    val mapping = mappings[index]
    val type = canonicalizeType(mapping.type)
    val mappedTo = mapping.mappedTo

    var unionWith: Mapping = mapping

/**
 * Helper class for managing file type mappings based on MIME types.
 * This class provides functionality to map MIME types to file types and
 * retrieve appropriate file type classifications for documents during indexing.
 *
 * The mappings are loaded from configuration and can be dynamically modified
 * at runtime. When a MIME type is not found in the mapping, a default value
 * is returned.
 */

    }

    /**
     * Returns the number of key-value mappings in this map.
     *
     * @return the number of key-value mappings in this map
     */
    @Override
    public int size() {
        return parent.size();
    }

    /**
     * Returns true if this map contains no key-value mappings.
     *
     * @return true if this map contains no key-value mappings
     */
    @Override
    public boolean isEmpty() {

 */

package jcifs.smb1.util;

import java.io.IOException;
import java.io.InputStream;

/**
 * MIME type mapping utility for file extensions.
 * Provides mappings between file extensions and their corresponding MIME types
 * by reading from a resource file containing extension-to-MIME-type mappings.
 */
public class MimeMap {

    private static final int IN_SIZE = 7000;

    private static final int ST_START = 1;

    protected static final String GROOVY_MATCHER = "groovy:";

    /** Map of path mappings by process type. */
    protected final Map<String, List<PathMapping>> pathMappingMap = new HashMap<>();

    /** Cached list of path mappings. */
    protected volatile List<PathMapping> cachedPathMappingList = null;

    /**
     * Initializes the path mapping helper.
     */
    @PostConstruct
    public void init() {

        .initializer(
          """
          |%T(⇥
          |sections = "%L",
          |ranges = "%L",
          |mappings = "%L",
          |⇤)
          """.trimMargin(),
          idnaMappingTable,
          data.sections.escapeDataString(),
          data.ranges.escapeDataString(),
          data.mappings.escapeDataString(),
        ).build(),
    ).build()
}

/**

  ): Boolean {
    val index =
      mappings.binarySearch {
        when {
          it.sourceCodePoint1 < codePoint -> -1
          it.sourceCodePoint0 > codePoint -> 1
          else -> 0
        }
      }

    // Code points must be in 0..0x10ffff.
    require(index in mappings.indices) { "unexpected code point: $codePoint" }

    val mapping = mappings[index]
    var result = true

      }
    table = plainTable
    val data = buildIdnaMappingTableData(plainTable)
    compactTable =
      IdnaMappingTable(
        sections = data.sections,
        ranges = data.ranges,
        mappings = data.mappings,
      )
  }

  @Test fun regularMappings() {
    assertThat("hello".map()).isEqualTo("hello")
    assertThat("hello-world".map()).isEqualTo("hello-world")
    assertThat("HELLO".map()).isEqualTo("hello")

  }

  /**
   * Constructs a new bimap with the same mappings as the specified map. If the specified map is an
   * {@code EnumHashBiMap} or an {@link EnumBiMap}, the new bimap has the same key type as the input
   * bimap. Otherwise, the specified map must contain at least one mapping, in order to determine
   * the key type.
   *
   * @param map the map whose mappings are to be placed in this map

 * that of the preceding section.
 *
 * b2b3s2 is the offset into the ranges data. It is shifted by 2 because ranges are 4-byte aligned.
 *
 * Mappings Data (4,719 bytes)
 * ===========================
 *
 * This is UTF-8 character data. It is indexed into by b2b3 in the ranges dataset.
 *
 * Mappings may overlap.
 *
 * ASCII-Only
 * ==========
 *