Details

    • Type: Improvement
    • Status: Closed
    • Priority: Major
    • Resolution: Won't Do
    • Affects Version/s: None
    • Fix Version/s: None
    • Component/s: None
    • Labels:
      None

      Description

      I was working on a project ( https://github.com/nielsbasjes/yauaa ) where I ran into the situation that I needed a type of collection that was not yet present in either Java or commons-collections.

      So I wrote my own implementation and I think this may be a useful addition to commons-collections.

      At this point we have

      • the Map that allows retrieval of a single value based on an exact key.
      • the Trie that allows retrieval of a set of values based where the keys all start with the same prefix.

      What I needed a structure where it holds the prefixes and associated values and I want to retrieve the 'best matching prefix' for a given input.

      To illustrate what I mean using the original use case:
      PrefixMap<String> prefixMap = new ASCIIPrefixMap<>(false); // false == match case insensitive
      prefixMap.put("SM-", "Samsung");
      prefixMap.put("Mi-", "Xiaomi");
      prefixMap.getLongestMatch("SM-1234"); // ---> "Samsung"

        Attachments

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              nielsbasjes Niels Basjes
            • Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

              Dates

              • Created:
                Updated:
                Resolved:

                Time Tracking

                Estimated:
                Original Estimate - Not Specified
                Not Specified
                Remaining:
                Remaining Estimate - 0h
                0h
                Logged:
                Time Spent - 20m
                20m