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.

RevObjectList.java 4.3KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*
  2. * Copyright (C) 2009, Google Inc.
  3. * Copyright (C) 2009, Jonas Fonseca <fonseca@diku.dk>
  4. * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
  5. * and other copyright owners as documented in the project's IP log.
  6. *
  7. * This program and the accompanying materials are made available
  8. * under the terms of the Eclipse Distribution License v1.0 which
  9. * accompanies this distribution, is reproduced below, and is
  10. * available at http://www.eclipse.org/org/documents/edl-v10.php
  11. *
  12. * All rights reserved.
  13. *
  14. * Redistribution and use in source and binary forms, with or
  15. * without modification, are permitted provided that the following
  16. * conditions are met:
  17. *
  18. * - Redistributions of source code must retain the above copyright
  19. * notice, this list of conditions and the following disclaimer.
  20. *
  21. * - Redistributions in binary form must reproduce the above
  22. * copyright notice, this list of conditions and the following
  23. * disclaimer in the documentation and/or other materials provided
  24. * with the distribution.
  25. *
  26. * - Neither the name of the Eclipse Foundation, Inc. nor the
  27. * names of its contributors may be used to endorse or promote
  28. * products derived from this software without specific prior
  29. * written permission.
  30. *
  31. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  32. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  33. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  34. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  35. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  36. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  37. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  38. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  39. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  40. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  41. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  42. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  43. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  44. */
  45. package org.eclipse.jgit.revwalk;
  46. import java.text.MessageFormat;
  47. import java.util.AbstractList;
  48. import org.eclipse.jgit.internal.JGitText;
  49. /**
  50. * An ordered list of {@link RevObject} subclasses.
  51. *
  52. * @param <E>
  53. * type of subclass of RevObject the list is storing.
  54. */
  55. public class RevObjectList<E extends RevObject> extends AbstractList<E> {
  56. static final int BLOCK_SHIFT = 8;
  57. static final int BLOCK_SIZE = 1 << BLOCK_SHIFT;
  58. /**
  59. * Items stored in this list.
  60. * <p>
  61. * If {@link Block#shift} = 0 this block holds the list elements; otherwise
  62. * it holds pointers to other {@link Block} instances which use a shift that
  63. * is {@link #BLOCK_SHIFT} smaller.
  64. */
  65. protected Block contents = new Block(0);
  66. /** Current number of elements in the list. */
  67. protected int size = 0;
  68. /** Create an empty object list. */
  69. public RevObjectList() {
  70. // Initialized above.
  71. }
  72. public void add(final int index, final E element) {
  73. if (index != size)
  74. throw new UnsupportedOperationException(MessageFormat.format(
  75. JGitText.get().unsupportedOperationNotAddAtEnd,
  76. Integer.valueOf(index)));
  77. set(index, element);
  78. size++;
  79. }
  80. @SuppressWarnings("unchecked")
  81. public E set(int index, E element) {
  82. Block s = contents;
  83. while (index >> s.shift >= BLOCK_SIZE) {
  84. s = new Block(s.shift + BLOCK_SHIFT);
  85. s.contents[0] = contents;
  86. contents = s;
  87. }
  88. while (s.shift > 0) {
  89. final int i = index >> s.shift;
  90. index -= i << s.shift;
  91. if (s.contents[i] == null)
  92. s.contents[i] = new Block(s.shift - BLOCK_SHIFT);
  93. s = (Block) s.contents[i];
  94. }
  95. final Object old = s.contents[index];
  96. s.contents[index] = element;
  97. return (E) old;
  98. }
  99. @SuppressWarnings("unchecked")
  100. public E get(int index) {
  101. Block s = contents;
  102. if (index >> s.shift >= 1024)
  103. return null;
  104. while (s != null && s.shift > 0) {
  105. final int i = index >> s.shift;
  106. index -= i << s.shift;
  107. s = (Block) s.contents[i];
  108. }
  109. return s != null ? (E) s.contents[index] : null;
  110. }
  111. public int size() {
  112. return size;
  113. }
  114. @Override
  115. public void clear() {
  116. contents = new Block(0);
  117. size = 0;
  118. }
  119. /** One level of contents, either an intermediate level or a leaf level. */
  120. protected static class Block {
  121. final Object[] contents = new Object[BLOCK_SIZE];
  122. final int shift;
  123. Block(final int s) {
  124. shift = s;
  125. }
  126. }
  127. }