Package de.jungblut.math.sparse

Examples of de.jungblut.math.sparse.SparseBitVector

200
201
202
203
204
205
206
207
208
209
210
211
212
213
  private void traverse(HuffmanTreeNode node, BitSet currentBits,
      int currentIndex, Map<VALUE, SparseBitVector> map) {

    if (node.isLeaf()) {
      // set the bits and insert
      SparseBitVector bitVector = new SparseBitVector(getCardinality());
      for (int i = currentBits.nextSetBit(0); i >= 0; i = currentBits
          .nextSetBit(i + 1)) {
        bitVector.set(i, 1d);
      }
      map.put(node.value, bitVector);
    }

    if (node.left != null) {
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
        .decode(generateVector(new int[] { 1, 0, 0, 0 })).intValue());

  }

  public SparseBitVector generateVector(int[] array) {
    SparseBitVector vec = new SparseBitVector(array.length);

    for (int i = 0; i < array.length; i++) {
      if (array[i] != 0) {
        vec.set(i, 1d);
      }
    }

    return vec;
  }
View Full Code Here
TOP

Related Classes of de.jungblut.math.sparse.SparseBitVector

  • de.jungblut.datastructure.HuffmanTree
  • de.jungblut.datastructure.HuffmanTreeTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.