Byte buffer specialized for data in chunks with special cases for dropping bytes in the front, merging bytes in to various integer types and abandoning buffer without penalty for previous chunk merges.

indutny

obuf

OffsetBuffer.prototype.isEmpty = function isEmpty() {

OffsetBuffer.prototype.clone = function clone(size) {

OffsetBuffer.prototype.toChunks = function toChunks() {

    this.buffers[0] = this.buffers[0].slice(this.offset);

  for (var i = 0; off <= this.size && i < this.buffers.length; i++) {

      this.buffers[i] = this.buffers[i].slice(0, -(off - this.size));

  // If some buffers were skipped - trim length

OffsetBuffer.prototype.toString = function toString(enc) {

  return this.toChunks().map(function(c) {

OffsetBuffer.prototype.use = function use(buf, off, n) {

OffsetBuffer.prototype.push = function push(data) {

OffsetBuffer.prototype.has = function has(n) {

OffsetBuffer.prototype.skip = function skip(n) {

  // Fast case, skip bytes in a first buffer

  if (this.offset + n < this.buffers[0].length) {

  var left = n - (this.buffers[0].length - this.offset);

  for (var shift = 1; left > 0 && shift < this.buffers.length; shift++) {

  this.buffers = this.buffers.slice(shift);

    "url": "git@github.com:indutny/offset-buffer"

  "author": "Fedor Indutny <fedor@indutny.com>",

    "url": "https://github.com/indutny/offset-buffer/issues"

  "homepage": "https://github.com/indutny/offset-buffer",

		@@ -327,6 +327,6 @@ var Buffer = require('buffer').Buffer;

		return ((r & 0xff) * 0x1000000) +
		((((r >>> 8) & 0xff) << 16) \|
		return (((r & 0xff) << 24) \|
		(((r >>> 8) & 0xff) << 16) \|
		(((r >>> 16) & 0xff) << 8) \|
		(r >>> 24));
		(r >>> 24)) >>> 0;
		};

		{
		"name": "obuf",
		"version": "1.0.3",
		"version": "1.0.4",
		"description": "",
		@@ -5,0 +5,0 @@ "main": "index.js",

Improved metrics