Package java.nio

Examples of java.nio.ByteBuffer.position()

1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
     
        // derive the sequence number in the normal way so that if a retranmission occurs
        // after crypto has been setup then it'll get handled correctly as a dupliate packet
        // below
     
      initial_buffer.position( 4 );
     
      Integer  pseudo_seq = new Integer( initial_buffer.getInt());
     
      initial_buffer.position( 0 );
     
View Full Code Here
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
     
      initial_buffer.position( 4 );
     
      Integer  pseudo_seq = new Integer( initial_buffer.getInt());
     
      initial_buffer.position( 0 );
     
      if ( !receive_done_sequences.contains( pseudo_seq )){
       
        receive_done_sequences.addFirst( pseudo_seq );
     
View Full Code Here
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
        int  limit = buffer.limit();
       
        try{
          if ( buffer.remaining() > rem ){
           
            buffer.limit( buffer.position() + rem );
          }
         
          rem -= buffer.remaining();
         
          packet_buffer.put( buffer );
View Full Code Here
248
249
250
251
252
253
254
255
256
257
258
  }

  private static ByteBuffer doNoCopyWrap(ByteBuffer buffer) {
    ByteBuffer direct_buffer = lookupBuffer(buffer);
    direct_buffer.limit(buffer.limit());
    direct_buffer.position(buffer.position());
    return direct_buffer;
  }

  private static ShortBuffer doNoCopyWrap(ShortBuffer buffer) {
    ShortBuffer direct_buffer = lookupBuffer(buffer);
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
       
        int  rem = buffer.remaining();
       
        if ( rem > to_write ){
         
          buffer.limit( buffer.position() + to_write );
         
          to_write = 0;
         
        }else{
         
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
       
        int  rem = buffer.remaining();
       
        if ( rem > to_read ){
         
          buffer.limit( buffer.position() + to_read );
         
          to_read = 0;
         
        }else{
         
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
      if ( data_already_read != null ) {
          ByteBuffer new_bb = ByteBuffer.allocate(data_already_read.remaining() + bytes_already_read.remaining());
          new_bb.put(bytes_already_read);
          new_bb.put(data_already_read);
          new_bb.position(0);
          data_already_read = new_bb;
      }
      else {
        data_already_read  = bytes_already_read;
      }
View Full Code Here
524
525
526
527
528
529
530
531
532
533
534
           
            ByteBuffer buff = payloads[x].getBuffer( DirectByteBuffer.SS_NET );
           
            raw_buffers[buffer_count] = buff;
           
            orig_positions[buffer_count] = buff.position();
           
            total_sofar += buff.remaining();

            buffer_count++;
           
View Full Code Here
605
606
607
608
609
610
611
612
613
614
615
                if( i < x ) {  //if in front of non-empty buffer
                  written += buff.limit();
                }
                else if( i == x ) {  //is non-empty buffer
                  written += buff.position();
                }
              }

              percent_complete = (written * 100) / message_size;

View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
        ByteBuffer[]  bbs = new ByteBuffer[buffers.length];
       
        ByteBuffer  last_bb  = null;
        for (int i=0;i<bbs.length;i++){
          ByteBuffer bb = bbs[i] = buffers[i].getBuffer(DirectByteBuffer.SS_FILE);
          int  pos = original_positions[i] = bb.position();
          if ( pos != bb.limit()){
            last_bb  = bbs[i];
          }
        }
       
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.