You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

IntegerKeyStore.java 2.2KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. /*
  2. * Licensed to the Apache Software Foundation (ASF) under one or more
  3. * contributor license agreements. See the NOTICE file distributed with
  4. * this work for additional information regarding copyright ownership.
  5. * The ASF licenses this file to You under the Apache License, Version 2.0
  6. * (the "License"); you may not use this file except in compliance with
  7. * the License. You may obtain a copy of the License at
  8. *
  9. * http://www.apache.org/licenses/LICENSE-2.0
  10. *
  11. * Unless required by applicable law or agreed to in writing, software
  12. * distributed under the License is distributed on an "AS IS" BASIS,
  13. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14. * See the License for the specific language governing permissions and
  15. * limitations under the License.
  16. */
  17. /* $Id$ */
  18. package org.apache.fop.afp.fonts;
  19. import java.util.ArrayList;
  20. import java.util.Collections;
  21. import java.util.HashMap;
  22. import java.util.Map;
  23. /**
  24. * A simple compact data structure to model a sparse array
  25. */
  26. class IntegerKeyStore<T> {
  27. private static final int RANGE_BIT_SIZE = 8;
  28. private static final int RANGE_SIZE = 1 << RANGE_BIT_SIZE;
  29. private final Map<Integer, ArrayList<T>> arrays = new HashMap<Integer, ArrayList<T>>();
  30. /**
  31. *
  32. * @param index a positive integer
  33. * @param value value to store
  34. */
  35. public void put(Integer index, T value) {
  36. if (index < 0) {
  37. throw new IndexOutOfBoundsException();
  38. }
  39. int rangeKey = index >> RANGE_BIT_SIZE;
  40. int rangeIndex = index % RANGE_SIZE;
  41. ArrayList<T> range = arrays.get(rangeKey);
  42. if (range == null) {
  43. range = new ArrayList<T>(Collections.<T>nCopies(RANGE_SIZE, null));
  44. arrays.put(rangeKey, range);
  45. }
  46. range.set(rangeIndex, value);
  47. }
  48. /**
  49. *
  50. * @param index a positive integer
  51. * @return value the value associated with the index or null
  52. */
  53. public T get(Integer index) {
  54. if (index < 0) {
  55. throw new IndexOutOfBoundsException();
  56. }
  57. int rangeKey = index >> RANGE_BIT_SIZE;
  58. int rangeIndex = index % RANGE_SIZE;
  59. ArrayList<T> range = arrays.get(rangeKey);
  60. return range == null ? null : range.get(rangeIndex);
  61. }
  62. }