選択できるのは25トピックまでです。 トピックは、先頭が英数字で、英数字とダッシュ('-')を使用した35文字以内のものにしてください。

RevObjectList.java 4.1KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  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.util.AbstractList;
  47. /**
  48. * An ordered list of {@link RevObject} subclasses.
  49. *
  50. * @param <E>
  51. * type of subclass of RevObject the list is storing.
  52. */
  53. public class RevObjectList<E extends RevObject> extends AbstractList<E> {
  54. static final int BLOCK_SHIFT = 8;
  55. static final int BLOCK_SIZE = 1 << BLOCK_SHIFT;
  56. /**
  57. * Items stored in this list.
  58. * <p>
  59. * If {@link Block#shift} = 0 this block holds the list elements; otherwise
  60. * it holds pointers to other {@link Block} instances which use a shift that
  61. * is {@link #BLOCK_SHIFT} smaller.
  62. */
  63. protected Block contents = new Block(0);
  64. /** Current number of elements in the list. */
  65. protected int size = 0;
  66. /** Create an empty object list. */
  67. public RevObjectList() {
  68. // Initialized above.
  69. }
  70. public void add(final int index, final E element) {
  71. if (index != size)
  72. throw new UnsupportedOperationException("Not add-at-end: " + index);
  73. set(index, element);
  74. size++;
  75. }
  76. public E set(int index, E element) {
  77. Block s = contents;
  78. while (index >> s.shift >= BLOCK_SIZE) {
  79. s = new Block(s.shift + BLOCK_SHIFT);
  80. s.contents[0] = contents;
  81. contents = s;
  82. }
  83. while (s.shift > 0) {
  84. final int i = index >> s.shift;
  85. index -= i << s.shift;
  86. if (s.contents[i] == null)
  87. s.contents[i] = new Block(s.shift - BLOCK_SHIFT);
  88. s = (Block) s.contents[i];
  89. }
  90. final Object old = s.contents[index];
  91. s.contents[index] = element;
  92. return (E) old;
  93. }
  94. public E get(int index) {
  95. Block s = contents;
  96. if (index >> s.shift >= 1024)
  97. return null;
  98. while (s != null && s.shift > 0) {
  99. final int i = index >> s.shift;
  100. index -= i << s.shift;
  101. s = (Block) s.contents[i];
  102. }
  103. return s != null ? (E) s.contents[index] : null;
  104. }
  105. public int size() {
  106. return size;
  107. }
  108. @Override
  109. public void clear() {
  110. contents = new Block(0);
  111. size = 0;
  112. }
  113. /** One level of contents, either an intermediate level or a leaf level. */
  114. protected static class Block {
  115. final Object[] contents = new Object[BLOCK_SIZE];
  116. final int shift;
  117. Block(final int s) {
  118. shift = s;
  119. }
  120. }
  121. }