Package java.nio

Examples of java.nio.ByteBuffer.clear()


    ByteBuffer reversed = Misc.getByteBuffer(16);
   
    ByteBuffer tmp = Misc.getByteBuffer(4);

    for(int i = 0;i<16;i+=4) {
      tmp.clear();
      tmp.put(byteArray, i, 4);
      reversed.put(Convert.reverseArray(tmp.array()));
    }
   
    byteArrayToBitSet(reversed.array(), bit_set);
View Full Code Here


      ByteBuffer reversed = Misc.getByteBuffer(16);
     
      ByteBuffer tmp = Misc.getByteBuffer(4);
 
      for(int i = 0;i<16;i+=4) {
        tmp.clear();
        tmp.put(byteArray, i, 4);
        reversed.put(Convert.reverseArray(tmp.array()));
      }
     
      return reversed.array();
View Full Code Here

      fileChannel.read(data);
      short partCount = data.getShort(0);
     
      data = Misc.getByteBuffer(16);
      for(int i = 0 ; i <partCount; i++){
        data.clear();
        fileChannel.read(data);
        fileHashSet.add(data.array());
      }
     
      //Read tag count
View Full Code Here

        // check if all bytes where written
        if (buffer.hasRemaining()) {
            // if not all bytes were written, move the unwritten bytes to the beginning and
            // set position just after the last unwritten byte
            buffer.compact();
        } else { buffer.clear()}
        return (long)count;
    }


    //  -----------------------------------------------------------------------
View Full Code Here

                 else if (byBuffer.length < size)
                   byBuffer = new byte[size];
                 messageBuffer.get(byBuffer, 0, size);
                 channel.position(append);
                 channel.write(ByteBuffer.wrap(byBuffer));
                 messageBuffer.clear();
                 messageBuffer = null;
               } // fi (-1!=next)
               append+=size;
           }
         } // next
View Full Code Here

          fileChannel.write(bucket, bucketOffset);
        }

        // Continue searching for an empty slot in the overflow bucket
        bucketOffset = getOverflowBucketOffset(overflowID);
        bucket.clear();
      }
    }
  }

  public void clear()
View Full Code Here

      }

      // last node ID
      out.println(buf.getInt());

      buf.clear();
    }
    out.println("#nodes          = " + nodeCount);
    out.println("#values         = " + valueCount);
    out.println("---end of BTree file---");
  }
View Full Code Here

      if (bucketChanged) {
        // Some of the items were moved to the new bucket, write it to the
        // file
        newBucket.flip();
        fileChannel.write(newBucket, newBucketOffset);
        newBucket.clear();
      }

      // Reset overflow ID in the old bucket to 0 if necessary
      if (bucket.getInt(ITEM_SIZE * bucketSize) != 0) {
        bucket.putInt(ITEM_SIZE * bucketSize, 0);
View Full Code Here

    fileChannel.position(HEADER_LENGTH);

    out.println("---Buckets---");

    for (int bucketNo = 1; bucketNo <= bucketCount; bucketNo++) {
      buf.clear();
      fileChannel.read(buf);

      out.print("Bucket " + bucketNo + ": ");

      for (int slotNo = 0; slotNo < bucketSize; slotNo++) {
View Full Code Here

    out.println("---Overflow Buckets---");

    int bucketNo = 0;
    while (fileChannel.position() < fileChannel.size()) {
      buf.clear();
      fileChannel.read(buf);
      bucketNo++;

      out.print("Bucket " + bucketNo + ": ");
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.