Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for trueapp (0.04 sec)

  1. fess-crawler-lasta/src/main/resources/crawler/extractor.xml

    				"application/vnd.tao.intent-module-archive",
    				"application/vnd.tcpdump.pcap",
    				"application/vnd.tmobile-livetv",
    				"application/vnd.trid.tpt",
    				"application/vnd.triscape.mxs",
    				"application/vnd.trueapp",
    				"application/vnd.truedoc",
    				"application/vnd.ufdl",
    				"application/vnd.uiq.theme",
    				"application/vnd.umajin",
    				"application/vnd.unity",
    				"application/vnd.uoml+xml",
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sat Aug 01 21:40:30 UTC 2020
    - 49K bytes
    - Viewed (0)
  2. fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml

        <glob pattern="*.tpt"/>
      </mime-type>
      <mime-type type="application/vnd.triscape.mxs">
        <glob pattern="*.mxs"/>
      </mime-type>
      <mime-type type="application/vnd.trueapp">
        <glob pattern="*.tra"/>
      </mime-type>
      <mime-type type="application/vnd.truedoc"/>
      <mime-type type="application/vnd.ufdl">
        <glob pattern="*.ufd"/>
        <glob pattern="*.ufdl"/>
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Thu Mar 13 08:18:01 UTC 2025
    - 320.1K bytes
    - Viewed (1)
  3. android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java

            for (int i = 0; i < size; i++) {
              keys[i] = rng.nextInt();
            }
            return createTreap(Ints.asList(keys));
          }
    
          // See http://en.wikipedia.org/wiki/Treap for details on the algorithm.
          private Optional<BinaryNode> createTreap(List<Integer> keys) {
            if (keys.isEmpty()) {
              return Optional.absent();
            }
            int minIndex = 0;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.9K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java

            for (int i = 0; i < size; i++) {
              keys[i] = rng.nextInt();
            }
            return createTreap(Ints.asList(keys));
          }
    
          // See http://en.wikipedia.org/wiki/Treap for details on the algorithm.
          private Optional<BinaryNode> createTreap(List<Integer> keys) {
            if (keys.isEmpty()) {
              return Optional.absent();
            }
            int minIndex = 0;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.9K bytes
    - Viewed (0)
Back to top