File: KeywordMap.java

package info (click to toggle)
brltty 6.8-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 35,776 kB
  • sloc: ansic: 150,447; java: 13,484; sh: 9,667; xml: 5,702; tcl: 2,634; makefile: 2,328; awk: 713; lisp: 366; python: 321; ml: 301
file content (83 lines) | stat: -rw-r--r-- 2,252 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/*
 * libbrlapi - A library providing access to braille terminals for applications.
 *
 * Copyright (C) 2006-2025 by
 *   Samuel Thibault <Samuel.Thibault@ens-lyon.org>
 *   Sébastien Hinderer <Sebastien.Hinderer@ens-lyon.org>
 *
 * libbrlapi comes with ABSOLUTELY NO WARRANTY.
 *
 * This is free software, placed under the terms of the
 * GNU Lesser General Public License, as published by the Free Software
 * Foundation; either version 2.1 of the License, or (at your option) any
 * later version. Please see the file LICENSE-LGPL for details.
 *
 * Web Page: http://brltty.app/
 *
 * This software is maintained by Dave Mielke <dave@mielke.cc>.
 */

package org.a11y.brlapi;

import java.util.Set;
import java.util.Map;
import java.util.HashMap;
import java.util.LinkedHashMap;

public class KeywordMap<V> {
  private final Map<String, V> valueMap = new LinkedHashMap<>();
  private final Map<String, String> aliasMap = new HashMap<>();
  private final static String AMBIGUOUS = "";

  private static String normalizeKeyword (String keyword) {
    return keyword.toLowerCase();
  }

  private final void addAliases (String keyword) {
    String alias = keyword;

    while (true) {
      alias = alias.substring(0, alias.length()-1);
      if (alias.isEmpty()) break;

      String value = aliasMap.get(alias);
      if (value == null) {
        aliasMap.put(alias, keyword);
      } else if (value == AMBIGUOUS) {
        break;
      } else {
        aliasMap.put(alias, AMBIGUOUS);
      }
    }
  }

  public KeywordMap<V> put (String keyword, V value) {
    keyword = normalizeKeyword(keyword);
    valueMap.put(keyword, value);
    addAliases(keyword);
    return this;
  }

  public final V get (String keyword) {
    keyword = normalizeKeyword(keyword);
    V value = valueMap.get(keyword);
    if (value != null) return value;

    keyword = aliasMap.get(keyword);
    if (keyword == null) return null;
    if (keyword == AMBIGUOUS) return null;
    return valueMap.get(keyword);
  }

  public final String[] getKeywords () {
    Set<String> keywords = valueMap.keySet();
    return keywords.toArray(new String[keywords.size()]);
  }

  public final boolean isEmpty () {
    return valueMap.isEmpty();
  }

  public KeywordMap () {
  }
}