Package java.nio

Examples of java.nio.CharBuffer.remaining()

738
739
740
741
742
743
744
745
746
747
748
          return -1;
        }
        break;
      }

      int remain = char_buf.remaining();
      if (remain > n) {
        remain = n;
      }
      char_buf.get(buf, offset, remain);
      n -= remain;
View Full Code Here
768
769
770
771
772
773
774
775
776
777
778
      CharBuffer char_buf = getReadCharBuffer();
      if (char_buf == null) {
        break;
      }

      int remain = char_buf.remaining();
      if (remain > c) {
        remain = (int) c;
      }
      char_buf.position(char_buf.position() + remain);
      c -= remain;
View Full Code Here
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
    while (count > 0) {
      if (!char_buf.hasRemaining()) {
        char_buf = getWriteCharBuffer();
      }
      int remain = char_buf.remaining();
      if (remain > count) {
        remain = count;
      }
      char_buf.put(buf, offset, remain);
      count -= remain;
View Full Code Here
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
        flushWriteBuffer();
      } else if (res == CoderResult.UNDERFLOW && char_buf.hasRemaining()) {
        // Create new underflow buf containing the remaining chars and room
        // for one more char. The longest sequence of characters that can
        // represent a single code point is 2 (a pair of surrogate chars).
        underflow_char_buf_ = CharBuffer.allocate(char_buf.remaining() + 1);
        // Copy the characters over to the underflow_char_buf_. Note that
        // calling underflow_char_buf_.append(char_buf) is not correct because
        // it does not properly advance the position of char_buf.
        while (char_buf.hasRemaining()) {
          underflow_char_buf_.put(char_buf.get());
View Full Code Here
725
726
727
728
729
730
731
732
733
734
735
          return -1;
        }
        break;
      }

      int remain = char_buf.remaining();
      if (remain > n) {
        remain = n;
      }
      char_buf.get(buf, offset, remain);
      n -= remain;
View Full Code Here
755
756
757
758
759
760
761
762
763
764
765
      CharBuffer char_buf = getReadCharBuffer();
      if (char_buf == null) {
        break;
      }

      int remain = char_buf.remaining();
      if (remain > c) {
        remain = (int) c;
      }
      char_buf.position(char_buf.position() + remain);
      c -= remain;
View Full Code Here
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
    while (count > 0) {
      if (!char_buf.hasRemaining()) {
        char_buf = getWriteCharBuffer();
      }
      int remain = char_buf.remaining();
      if (remain > count) {
        remain = count;
      }
      char_buf.put(buf, offset, remain);
      count -= remain;
View Full Code Here
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
        flushWriteBuffer();
      } else if (res == CoderResult.UNDERFLOW && char_buf.hasRemaining()) {
        // Create new underflow buf containing the remaining chars and room
        // for one more char. The longest sequence of characters that can
        // represent a single code point is 2 (a pair of surrogate chars).
        underflow_char_buf_ = CharBuffer.allocate(char_buf.remaining() + 1);
        // Copy the characters over to the underflow_char_buf_. Note that
        // calling underflow_char_buf_.append(char_buf) is not correct because
        // it does not properly advance the position of char_buf.
        while (char_buf.hasRemaining()) {
          underflow_char_buf_.put(char_buf.get());
View Full Code Here
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
        public ByteBuffer putString(
                CharSequence val, CharsetEncoder encoder ) throws CharacterCodingException
        {
            CharBuffer in = CharBuffer.wrap( val );
            int expectedLength = (int) (in.remaining() * encoder.averageBytesPerChar());

            encoder.reset();

            for (;;) {
                CoderResult cr;
View Full Code Here
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
            }
            if (cr.isOverflow()) {
                if (isAutoExpand()) {
                    switch (expandedState) {
                    case 0:
                        autoExpand((int) Math.ceil(in.remaining()
                                * encoder.averageBytesPerChar()));
                        expandedState++;
                        break;
                    case 1:
                        autoExpand((int) Math.ceil(in.remaining()
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.