Package net.sf.cindy

Examples of net.sf.cindy.Buffer.position()

166
167
168
169
170
171
172
173
174
175
176
    }

    protected byte _get(int index) {
        Entry entry = getEntry(index);
        Buffer buffer = entry.buffer;
        return buffer.get(buffer.position() + index - entry.position);
    }

    protected void _put(int index, byte b) {
        Entry entry = getEntry(index);
        Buffer buffer = entry.buffer;
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
    }

    protected void _put(int index, byte b) {
        Entry entry = getEntry(index);
        Buffer buffer = entry.buffer;
        buffer.put(buffer.position() + index - entry.position, b);
    }

    protected Buffer batch(boolean get, int index, byte[] array, int offset,
            int length) {
        Entry entry = getEntry(index);
View Full Code Here
184
185
186
187
188
189
190
191
192
193
194
        do {
            Buffer buffer = entry.buffer;
            int len = Math.min(buffer.remaining() - off, length);

            if (get)
                buffer.get(buffer.position() + off, array, offset, len);
            else
                buffer.put(buffer.position() + off, array, offset, len);

            offset += len;
            length -= len;
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
            int len = Math.min(buffer.remaining() - off, length);

            if (get)
                buffer.get(buffer.position() + off, array, offset, len);
            else
                buffer.put(buffer.position() + off, array, offset, len);

            offset += len;
            length -= len;
            if (length <= 0)
                break;
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
        do {
            Buffer content = entry.buffer;
            int len = Math.min(content.remaining() - off, length);

            if (get)
                content.get(content.position() + off, buffer, len);
            else {
                content.put(content.position() + off, buffer, len);
            }

            length -= len;
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
            int len = Math.min(content.remaining() - off, length);

            if (get)
                content.get(content.position() + off, buffer, len);
            else {
                content.put(content.position() + off, buffer, len);
            }

            length -= len;
            if (length <= 0)
                break;
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
            super(packet, priority);
            this.obj = obj;
            this.future = future;

            Buffer content = packet.getContent();
            position = content.position();
            limit = content.limit();
        }

    }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
                    }

                    Buffer buffer = currentSendPacket.getContent();
                    if (!buffer.hasRemaining() || write(currentSendPacket)) {
                        buffer.limit(currentSendPacket.limit);
                        buffer.position(currentSendPacket.position);
                        buffer.release();
                        final FuturePacket packet = currentSendPacket;
                        currentSendPacket = null;

                        // keep dispatch order
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
            Buffer slice = content.asReadOnlyBuffer().slice();
            Object obj = session.getPacketDecoder().decode(session,
                    new DefaultPacket(slice, address));
            if (obj == null)
                break;
            content.skip(slice.position());
            session.getSessionFilterChain(false).objectReceived(obj);
        }
    }

    /**
 
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.