@digasystems/ipp-browser
Version:
ipp-browser is a powerful library that brings the power of Internet Printing Protocol (IPP) directly into the browser. With this library, you can easily integrate printing to IPP-compatible network devices directly from your web applications without havin
1,358 lines • 146 kB
JavaScript
var xt = Object.defineProperty;
var wt = (u, d, f) => d in u ? xt(u, d, { enumerable: !0, configurable: !0, writable: !0, value: f }) : u[d] = f;
var _e = (u, d, f) => (wt(u, typeof d != "symbol" ? d + "" : d, f), f);
var be = {}, Ue = {};
Ue.byteLength = jt;
Ue.toByteArray = Bt;
Ue.fromByteArray = Tt;
var le = [], re = [], vt = typeof Uint8Array < "u" ? Uint8Array : Array, qe = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
for (var je = 0, _t = qe.length; je < _t; ++je)
le[je] = qe[je], re[qe.charCodeAt(je)] = je;
re["-".charCodeAt(0)] = 62;
re["_".charCodeAt(0)] = 63;
function et(u) {
var d = u.length;
if (d % 4 > 0)
throw new Error("Invalid string. Length must be a multiple of 4");
var f = u.indexOf("=");
f === -1 && (f = d);
var x = f === d ? 0 : 4 - f % 4;
return [f, x];
}
function jt(u) {
var d = et(u), f = d[0], x = d[1];
return (f + x) * 3 / 4 - x;
}
function kt(u, d, f) {
return (d + f) * 3 / 4 - f;
}
function Bt(u) {
var d, f = et(u), x = f[0], w = f[1], j = new vt(kt(u, x, w)), _ = 0, c = w > 0 ? x - 4 : x, C;
for (C = 0; C < c; C += 4)
d = re[u.charCodeAt(C)] << 18 | re[u.charCodeAt(C + 1)] << 12 | re[u.charCodeAt(C + 2)] << 6 | re[u.charCodeAt(C + 3)], j[_++] = d >> 16 & 255, j[_++] = d >> 8 & 255, j[_++] = d & 255;
return w === 2 && (d = re[u.charCodeAt(C)] << 2 | re[u.charCodeAt(C + 1)] >> 4, j[_++] = d & 255), w === 1 && (d = re[u.charCodeAt(C)] << 10 | re[u.charCodeAt(C + 1)] << 4 | re[u.charCodeAt(C + 2)] >> 2, j[_++] = d >> 8 & 255, j[_++] = d & 255), j;
}
function Et(u) {
return le[u >> 18 & 63] + le[u >> 12 & 63] + le[u >> 6 & 63] + le[u & 63];
}
function It(u, d, f) {
for (var x, w = [], j = d; j < f; j += 3)
x = (u[j] << 16 & 16711680) + (u[j + 1] << 8 & 65280) + (u[j + 2] & 255), w.push(Et(x));
return w.join("");
}
function Tt(u) {
for (var d, f = u.length, x = f % 3, w = [], j = 16383, _ = 0, c = f - x; _ < c; _ += j)
w.push(It(u, _, _ + j > c ? c : _ + j));
return x === 1 ? (d = u[f - 1], w.push(
le[d >> 2] + le[d << 4 & 63] + "=="
)) : x === 2 && (d = (u[f - 2] << 8) + u[f - 1], w.push(
le[d >> 10] + le[d >> 4 & 63] + le[d << 2 & 63] + "="
)), w.join("");
}
var Ne = {};
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
Ne.read = function(u, d, f, x, w) {
var j, _, c = w * 8 - x - 1, C = (1 << c) - 1, Z = C >> 1, G = -7, N = f ? w - 1 : 0, te = f ? -1 : 1, W = u[d + N];
for (N += te, j = W & (1 << -G) - 1, W >>= -G, G += c; G > 0; j = j * 256 + u[d + N], N += te, G -= 8)
;
for (_ = j & (1 << -G) - 1, j >>= -G, G += x; G > 0; _ = _ * 256 + u[d + N], N += te, G -= 8)
;
if (j === 0)
j = 1 - Z;
else {
if (j === C)
return _ ? NaN : (W ? -1 : 1) * (1 / 0);
_ = _ + Math.pow(2, x), j = j - Z;
}
return (W ? -1 : 1) * _ * Math.pow(2, j - x);
};
Ne.write = function(u, d, f, x, w, j) {
var _, c, C, Z = j * 8 - w - 1, G = (1 << Z) - 1, N = G >> 1, te = w === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, W = x ? 0 : j - 1, ue = x ? 1 : -1, oe = d < 0 || d === 0 && 1 / d < 0 ? 1 : 0;
for (d = Math.abs(d), isNaN(d) || d === 1 / 0 ? (c = isNaN(d) ? 1 : 0, _ = G) : (_ = Math.floor(Math.log(d) / Math.LN2), d * (C = Math.pow(2, -_)) < 1 && (_--, C *= 2), _ + N >= 1 ? d += te / C : d += te * Math.pow(2, 1 - N), d * C >= 2 && (_++, C /= 2), _ + N >= G ? (c = 0, _ = G) : _ + N >= 1 ? (c = (d * C - 1) * Math.pow(2, w), _ = _ + N) : (c = d * Math.pow(2, N - 1) * Math.pow(2, w), _ = 0)); w >= 8; u[f + W] = c & 255, W += ue, c /= 256, w -= 8)
;
for (_ = _ << w | c, Z += w; Z > 0; u[f + W] = _ & 255, W += ue, _ /= 256, Z -= 8)
;
u[f + W - ue] |= oe * 128;
};
/*!
* The buffer module from node.js, for the browser.
*
* @author Feross Aboukhadijeh <https://feross.org>
* @license MIT
*/
(function(u) {
const d = Ue, f = Ne, x = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
u.Buffer = c, u.SlowBuffer = y, u.INSPECT_MAX_BYTES = 50;
const w = 2147483647;
u.kMaxLength = w, c.TYPED_ARRAY_SUPPORT = j(), !c.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
);
function j() {
try {
const r = new Uint8Array(1), e = { foo: function() {
return 42;
} };
return Object.setPrototypeOf(e, Uint8Array.prototype), Object.setPrototypeOf(r, e), r.foo() === 42;
} catch {
return !1;
}
}
Object.defineProperty(c.prototype, "parent", {
enumerable: !0,
get: function() {
if (c.isBuffer(this))
return this.buffer;
}
}), Object.defineProperty(c.prototype, "offset", {
enumerable: !0,
get: function() {
if (c.isBuffer(this))
return this.byteOffset;
}
});
function _(r) {
if (r > w)
throw new RangeError('The value "' + r + '" is invalid for option "size"');
const e = new Uint8Array(r);
return Object.setPrototypeOf(e, c.prototype), e;
}
function c(r, e, t) {
if (typeof r == "number") {
if (typeof e == "string")
throw new TypeError(
'The "string" argument must be of type string. Received type number'
);
return N(r);
}
return C(r, e, t);
}
c.poolSize = 8192;
function C(r, e, t) {
if (typeof r == "string")
return te(r, e);
if (ArrayBuffer.isView(r))
return ue(r);
if (r == null)
throw new TypeError(
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof r
);
if (pe(r, ArrayBuffer) || r && pe(r.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (pe(r, SharedArrayBuffer) || r && pe(r.buffer, SharedArrayBuffer)))
return oe(r, e, t);
if (typeof r == "number")
throw new TypeError(
'The "value" argument must not be of type number. Received type number'
);
const i = r.valueOf && r.valueOf();
if (i != null && i !== r)
return c.from(i, e, t);
const s = ce(r);
if (s)
return s;
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof r[Symbol.toPrimitive] == "function")
return c.from(r[Symbol.toPrimitive]("string"), e, t);
throw new TypeError(
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof r
);
}
c.from = function(r, e, t) {
return C(r, e, t);
}, Object.setPrototypeOf(c.prototype, Uint8Array.prototype), Object.setPrototypeOf(c, Uint8Array);
function Z(r) {
if (typeof r != "number")
throw new TypeError('"size" argument must be of type number');
if (r < 0)
throw new RangeError('The value "' + r + '" is invalid for option "size"');
}
function G(r, e, t) {
return Z(r), r <= 0 ? _(r) : e !== void 0 ? typeof t == "string" ? _(r).fill(e, t) : _(r).fill(e) : _(r);
}
c.alloc = function(r, e, t) {
return G(r, e, t);
};
function N(r) {
return Z(r), _(r < 0 ? 0 : F(r) | 0);
}
c.allocUnsafe = function(r) {
return N(r);
}, c.allocUnsafeSlow = function(r) {
return N(r);
};
function te(r, e) {
if ((typeof e != "string" || e === "") && (e = "utf8"), !c.isEncoding(e))
throw new TypeError("Unknown encoding: " + e);
const t = k(r, e) | 0;
let i = _(t);
const s = i.write(r, e);
return s !== t && (i = i.slice(0, s)), i;
}
function W(r) {
const e = r.length < 0 ? 0 : F(r.length) | 0, t = _(e);
for (let i = 0; i < e; i += 1)
t[i] = r[i] & 255;
return t;
}
function ue(r) {
if (pe(r, Uint8Array)) {
const e = new Uint8Array(r);
return oe(e.buffer, e.byteOffset, e.byteLength);
}
return W(r);
}
function oe(r, e, t) {
if (e < 0 || r.byteLength < e)
throw new RangeError('"offset" is outside of buffer bounds');
if (r.byteLength < e + (t || 0))
throw new RangeError('"length" is outside of buffer bounds');
let i;
return e === void 0 && t === void 0 ? i = new Uint8Array(r) : t === void 0 ? i = new Uint8Array(r, e) : i = new Uint8Array(r, e, t), Object.setPrototypeOf(i, c.prototype), i;
}
function ce(r) {
if (c.isBuffer(r)) {
const e = F(r.length) | 0, t = _(e);
return t.length === 0 || r.copy(t, 0, 0, e), t;
}
if (r.length !== void 0)
return typeof r.length != "number" || Re(r.length) ? _(0) : W(r);
if (r.type === "Buffer" && Array.isArray(r.data))
return W(r.data);
}
function F(r) {
if (r >= w)
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + w.toString(16) + " bytes");
return r | 0;
}
function y(r) {
return +r != r && (r = 0), c.alloc(+r);
}
c.isBuffer = function(e) {
return e != null && e._isBuffer === !0 && e !== c.prototype;
}, c.compare = function(e, t) {
if (pe(e, Uint8Array) && (e = c.from(e, e.offset, e.byteLength)), pe(t, Uint8Array) && (t = c.from(t, t.offset, t.byteLength)), !c.isBuffer(e) || !c.isBuffer(t))
throw new TypeError(
'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
);
if (e === t)
return 0;
let i = e.length, s = t.length;
for (let l = 0, h = Math.min(i, s); l < h; ++l)
if (e[l] !== t[l]) {
i = e[l], s = t[l];
break;
}
return i < s ? -1 : s < i ? 1 : 0;
}, c.isEncoding = function(e) {
switch (String(e).toLowerCase()) {
case "hex":
case "utf8":
case "utf-8":
case "ascii":
case "latin1":
case "binary":
case "base64":
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return !0;
default:
return !1;
}
}, c.concat = function(e, t) {
if (!Array.isArray(e))
throw new TypeError('"list" argument must be an Array of Buffers');
if (e.length === 0)
return c.alloc(0);
let i;
if (t === void 0)
for (t = 0, i = 0; i < e.length; ++i)
t += e[i].length;
const s = c.allocUnsafe(t);
let l = 0;
for (i = 0; i < e.length; ++i) {
let h = e[i];
if (pe(h, Uint8Array))
l + h.length > s.length ? (c.isBuffer(h) || (h = c.from(h)), h.copy(s, l)) : Uint8Array.prototype.set.call(
s,
h,
l
);
else if (c.isBuffer(h))
h.copy(s, l);
else
throw new TypeError('"list" argument must be an Array of Buffers');
l += h.length;
}
return s;
};
function k(r, e) {
if (c.isBuffer(r))
return r.length;
if (ArrayBuffer.isView(r) || pe(r, ArrayBuffer))
return r.byteLength;
if (typeof r != "string")
throw new TypeError(
'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof r
);
const t = r.length, i = arguments.length > 2 && arguments[2] === !0;
if (!i && t === 0)
return 0;
let s = !1;
for (; ; )
switch (e) {
case "ascii":
case "latin1":
case "binary":
return t;
case "utf8":
case "utf-8":
return Ce(r).length;
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return t * 2;
case "hex":
return t >>> 1;
case "base64":
return Qe(r).length;
default:
if (s)
return i ? -1 : Ce(r).length;
e = ("" + e).toLowerCase(), s = !0;
}
}
c.byteLength = k;
function T(r, e, t) {
let i = !1;
if ((e === void 0 || e < 0) && (e = 0), e > this.length || ((t === void 0 || t > this.length) && (t = this.length), t <= 0) || (t >>>= 0, e >>>= 0, t <= e))
return "";
for (r || (r = "utf8"); ; )
switch (r) {
case "hex":
return pt(this, e, t);
case "utf8":
case "utf-8":
return $e(this, e, t);
case "ascii":
return ut(this, e, t);
case "latin1":
case "binary":
return ct(this, e, t);
case "base64":
return at(this, e, t);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return lt(this, e, t);
default:
if (i)
throw new TypeError("Unknown encoding: " + r);
r = (r + "").toLowerCase(), i = !0;
}
}
c.prototype._isBuffer = !0;
function q(r, e, t) {
const i = r[e];
r[e] = r[t], r[t] = i;
}
c.prototype.swap16 = function() {
const e = this.length;
if (e % 2 !== 0)
throw new RangeError("Buffer size must be a multiple of 16-bits");
for (let t = 0; t < e; t += 2)
q(this, t, t + 1);
return this;
}, c.prototype.swap32 = function() {
const e = this.length;
if (e % 4 !== 0)
throw new RangeError("Buffer size must be a multiple of 32-bits");
for (let t = 0; t < e; t += 4)
q(this, t, t + 3), q(this, t + 1, t + 2);
return this;
}, c.prototype.swap64 = function() {
const e = this.length;
if (e % 8 !== 0)
throw new RangeError("Buffer size must be a multiple of 64-bits");
for (let t = 0; t < e; t += 8)
q(this, t, t + 7), q(this, t + 1, t + 6), q(this, t + 2, t + 5), q(this, t + 3, t + 4);
return this;
}, c.prototype.toString = function() {
const e = this.length;
return e === 0 ? "" : arguments.length === 0 ? $e(this, 0, e) : T.apply(this, arguments);
}, c.prototype.toLocaleString = c.prototype.toString, c.prototype.equals = function(e) {
if (!c.isBuffer(e))
throw new TypeError("Argument must be a Buffer");
return this === e ? !0 : c.compare(this, e) === 0;
}, c.prototype.inspect = function() {
let e = "";
const t = u.INSPECT_MAX_BYTES;
return e = this.toString("hex", 0, t).replace(/(.{2})/g, "$1 ").trim(), this.length > t && (e += " ... "), "<Buffer " + e + ">";
}, x && (c.prototype[x] = c.prototype.inspect), c.prototype.compare = function(e, t, i, s, l) {
if (pe(e, Uint8Array) && (e = c.from(e, e.offset, e.byteLength)), !c.isBuffer(e))
throw new TypeError(
'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof e
);
if (t === void 0 && (t = 0), i === void 0 && (i = e ? e.length : 0), s === void 0 && (s = 0), l === void 0 && (l = this.length), t < 0 || i > e.length || s < 0 || l > this.length)
throw new RangeError("out of range index");
if (s >= l && t >= i)
return 0;
if (s >= l)
return -1;
if (t >= i)
return 1;
if (t >>>= 0, i >>>= 0, s >>>= 0, l >>>= 0, this === e)
return 0;
let h = l - s, S = i - t;
const z = Math.min(h, S), M = this.slice(s, l), $ = e.slice(t, i);
for (let D = 0; D < z; ++D)
if (M[D] !== $[D]) {
h = M[D], S = $[D];
break;
}
return h < S ? -1 : S < h ? 1 : 0;
};
function V(r, e, t, i, s) {
if (r.length === 0)
return -1;
if (typeof t == "string" ? (i = t, t = 0) : t > 2147483647 ? t = 2147483647 : t < -2147483648 && (t = -2147483648), t = +t, Re(t) && (t = s ? 0 : r.length - 1), t < 0 && (t = r.length + t), t >= r.length) {
if (s)
return -1;
t = r.length - 1;
} else if (t < 0)
if (s)
t = 0;
else
return -1;
if (typeof e == "string" && (e = c.from(e, i)), c.isBuffer(e))
return e.length === 0 ? -1 : Q(r, e, t, i, s);
if (typeof e == "number")
return e = e & 255, typeof Uint8Array.prototype.indexOf == "function" ? s ? Uint8Array.prototype.indexOf.call(r, e, t) : Uint8Array.prototype.lastIndexOf.call(r, e, t) : Q(r, [e], t, i, s);
throw new TypeError("val must be string, number or Buffer");
}
function Q(r, e, t, i, s) {
let l = 1, h = r.length, S = e.length;
if (i !== void 0 && (i = String(i).toLowerCase(), i === "ucs2" || i === "ucs-2" || i === "utf16le" || i === "utf-16le")) {
if (r.length < 2 || e.length < 2)
return -1;
l = 2, h /= 2, S /= 2, t /= 2;
}
function z($, D) {
return l === 1 ? $[D] : $.readUInt16BE(D * l);
}
let M;
if (s) {
let $ = -1;
for (M = t; M < h; M++)
if (z(r, M) === z(e, $ === -1 ? 0 : M - $)) {
if ($ === -1 && ($ = M), M - $ + 1 === S)
return $ * l;
} else
$ !== -1 && (M -= M - $), $ = -1;
} else
for (t + S > h && (t = h - S), M = t; M >= 0; M--) {
let $ = !0;
for (let D = 0; D < S; D++)
if (z(r, M + D) !== z(e, D)) {
$ = !1;
break;
}
if ($)
return M;
}
return -1;
}
c.prototype.includes = function(e, t, i) {
return this.indexOf(e, t, i) !== -1;
}, c.prototype.indexOf = function(e, t, i) {
return V(this, e, t, i, !0);
}, c.prototype.lastIndexOf = function(e, t, i) {
return V(this, e, t, i, !1);
};
function fe(r, e, t, i) {
t = Number(t) || 0;
const s = r.length - t;
i ? (i = Number(i), i > s && (i = s)) : i = s;
const l = e.length;
i > l / 2 && (i = l / 2);
let h;
for (h = 0; h < i; ++h) {
const S = parseInt(e.substr(h * 2, 2), 16);
if (Re(S))
return h;
r[t + h] = S;
}
return h;
}
function Se(r, e, t, i) {
return Te(Ce(e, r.length - t), r, t, i);
}
function Ie(r, e, t, i) {
return Te(ht(e), r, t, i);
}
function ke(r, e, t, i) {
return Te(Qe(e), r, t, i);
}
function nt(r, e, t, i) {
return Te(bt(e, r.length - t), r, t, i);
}
c.prototype.write = function(e, t, i, s) {
if (t === void 0)
s = "utf8", i = this.length, t = 0;
else if (i === void 0 && typeof t == "string")
s = t, i = this.length, t = 0;
else if (isFinite(t))
t = t >>> 0, isFinite(i) ? (i = i >>> 0, s === void 0 && (s = "utf8")) : (s = i, i = void 0);
else
throw new Error(
"Buffer.write(string, encoding, offset[, length]) is no longer supported"
);
const l = this.length - t;
if ((i === void 0 || i > l) && (i = l), e.length > 0 && (i < 0 || t < 0) || t > this.length)
throw new RangeError("Attempt to write outside buffer bounds");
s || (s = "utf8");
let h = !1;
for (; ; )
switch (s) {
case "hex":
return fe(this, e, t, i);
case "utf8":
case "utf-8":
return Se(this, e, t, i);
case "ascii":
case "latin1":
case "binary":
return Ie(this, e, t, i);
case "base64":
return ke(this, e, t, i);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return nt(this, e, t, i);
default:
if (h)
throw new TypeError("Unknown encoding: " + s);
s = ("" + s).toLowerCase(), h = !0;
}
}, c.prototype.toJSON = function() {
return {
type: "Buffer",
data: Array.prototype.slice.call(this._arr || this, 0)
};
};
function at(r, e, t) {
return e === 0 && t === r.length ? d.fromByteArray(r) : d.fromByteArray(r.slice(e, t));
}
function $e(r, e, t) {
t = Math.min(r.length, t);
const i = [];
let s = e;
for (; s < t; ) {
const l = r[s];
let h = null, S = l > 239 ? 4 : l > 223 ? 3 : l > 191 ? 2 : 1;
if (s + S <= t) {
let z, M, $, D;
switch (S) {
case 1:
l < 128 && (h = l);
break;
case 2:
z = r[s + 1], (z & 192) === 128 && (D = (l & 31) << 6 | z & 63, D > 127 && (h = D));
break;
case 3:
z = r[s + 1], M = r[s + 2], (z & 192) === 128 && (M & 192) === 128 && (D = (l & 15) << 12 | (z & 63) << 6 | M & 63, D > 2047 && (D < 55296 || D > 57343) && (h = D));
break;
case 4:
z = r[s + 1], M = r[s + 2], $ = r[s + 3], (z & 192) === 128 && (M & 192) === 128 && ($ & 192) === 128 && (D = (l & 15) << 18 | (z & 63) << 12 | (M & 63) << 6 | $ & 63, D > 65535 && D < 1114112 && (h = D));
}
}
h === null ? (h = 65533, S = 1) : h > 65535 && (h -= 65536, i.push(h >>> 10 & 1023 | 55296), h = 56320 | h & 1023), i.push(h), s += S;
}
return st(i);
}
const Ge = 4096;
function st(r) {
const e = r.length;
if (e <= Ge)
return String.fromCharCode.apply(String, r);
let t = "", i = 0;
for (; i < e; )
t += String.fromCharCode.apply(
String,
r.slice(i, i += Ge)
);
return t;
}
function ut(r, e, t) {
let i = "";
t = Math.min(r.length, t);
for (let s = e; s < t; ++s)
i += String.fromCharCode(r[s] & 127);
return i;
}
function ct(r, e, t) {
let i = "";
t = Math.min(r.length, t);
for (let s = e; s < t; ++s)
i += String.fromCharCode(r[s]);
return i;
}
function pt(r, e, t) {
const i = r.length;
(!e || e < 0) && (e = 0), (!t || t < 0 || t > i) && (t = i);
let s = "";
for (let l = e; l < t; ++l)
s += gt[r[l]];
return s;
}
function lt(r, e, t) {
const i = r.slice(e, t);
let s = "";
for (let l = 0; l < i.length - 1; l += 2)
s += String.fromCharCode(i[l] + i[l + 1] * 256);
return s;
}
c.prototype.slice = function(e, t) {
const i = this.length;
e = ~~e, t = t === void 0 ? i : ~~t, e < 0 ? (e += i, e < 0 && (e = 0)) : e > i && (e = i), t < 0 ? (t += i, t < 0 && (t = 0)) : t > i && (t = i), t < e && (t = e);
const s = this.subarray(e, t);
return Object.setPrototypeOf(s, c.prototype), s;
};
function Y(r, e, t) {
if (r % 1 !== 0 || r < 0)
throw new RangeError("offset is not uint");
if (r + e > t)
throw new RangeError("Trying to access beyond buffer length");
}
c.prototype.readUintLE = c.prototype.readUIntLE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Y(e, t, this.length);
let s = this[e], l = 1, h = 0;
for (; ++h < t && (l *= 256); )
s += this[e + h] * l;
return s;
}, c.prototype.readUintBE = c.prototype.readUIntBE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Y(e, t, this.length);
let s = this[e + --t], l = 1;
for (; t > 0 && (l *= 256); )
s += this[e + --t] * l;
return s;
}, c.prototype.readUint8 = c.prototype.readUInt8 = function(e, t) {
return e = e >>> 0, t || Y(e, 1, this.length), this[e];
}, c.prototype.readUint16LE = c.prototype.readUInt16LE = function(e, t) {
return e = e >>> 0, t || Y(e, 2, this.length), this[e] | this[e + 1] << 8;
}, c.prototype.readUint16BE = c.prototype.readUInt16BE = function(e, t) {
return e = e >>> 0, t || Y(e, 2, this.length), this[e] << 8 | this[e + 1];
}, c.prototype.readUint32LE = c.prototype.readUInt32LE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216;
}, c.prototype.readUint32BE = c.prototype.readUInt32BE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]);
}, c.prototype.readBigUInt64LE = he(function(e) {
e = e >>> 0, ve(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && Be(e, this.length - 8);
const s = t + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24, l = this[++e] + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + i * 2 ** 24;
return BigInt(s) + (BigInt(l) << BigInt(32));
}), c.prototype.readBigUInt64BE = he(function(e) {
e = e >>> 0, ve(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && Be(e, this.length - 8);
const s = t * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + this[++e], l = this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + i;
return (BigInt(s) << BigInt(32)) + BigInt(l);
}), c.prototype.readIntLE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Y(e, t, this.length);
let s = this[e], l = 1, h = 0;
for (; ++h < t && (l *= 256); )
s += this[e + h] * l;
return l *= 128, s >= l && (s -= Math.pow(2, 8 * t)), s;
}, c.prototype.readIntBE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Y(e, t, this.length);
let s = t, l = 1, h = this[e + --s];
for (; s > 0 && (l *= 256); )
h += this[e + --s] * l;
return l *= 128, h >= l && (h -= Math.pow(2, 8 * t)), h;
}, c.prototype.readInt8 = function(e, t) {
return e = e >>> 0, t || Y(e, 1, this.length), this[e] & 128 ? (255 - this[e] + 1) * -1 : this[e];
}, c.prototype.readInt16LE = function(e, t) {
e = e >>> 0, t || Y(e, 2, this.length);
const i = this[e] | this[e + 1] << 8;
return i & 32768 ? i | 4294901760 : i;
}, c.prototype.readInt16BE = function(e, t) {
e = e >>> 0, t || Y(e, 2, this.length);
const i = this[e + 1] | this[e] << 8;
return i & 32768 ? i | 4294901760 : i;
}, c.prototype.readInt32LE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24;
}, c.prototype.readInt32BE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3];
}, c.prototype.readBigInt64LE = he(function(e) {
e = e >>> 0, ve(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && Be(e, this.length - 8);
const s = this[e + 4] + this[e + 5] * 2 ** 8 + this[e + 6] * 2 ** 16 + (i << 24);
return (BigInt(s) << BigInt(32)) + BigInt(t + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24);
}), c.prototype.readBigInt64BE = he(function(e) {
e = e >>> 0, ve(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && Be(e, this.length - 8);
const s = (t << 24) + // Overflow
this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + this[++e];
return (BigInt(s) << BigInt(32)) + BigInt(this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + i);
}), c.prototype.readFloatLE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), f.read(this, e, !0, 23, 4);
}, c.prototype.readFloatBE = function(e, t) {
return e = e >>> 0, t || Y(e, 4, this.length), f.read(this, e, !1, 23, 4);
}, c.prototype.readDoubleLE = function(e, t) {
return e = e >>> 0, t || Y(e, 8, this.length), f.read(this, e, !0, 52, 8);
}, c.prototype.readDoubleBE = function(e, t) {
return e = e >>> 0, t || Y(e, 8, this.length), f.read(this, e, !1, 52, 8);
};
function ee(r, e, t, i, s, l) {
if (!c.isBuffer(r))
throw new TypeError('"buffer" argument must be a Buffer instance');
if (e > s || e < l)
throw new RangeError('"value" argument is out of bounds');
if (t + i > r.length)
throw new RangeError("Index out of range");
}
c.prototype.writeUintLE = c.prototype.writeUIntLE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, i = i >>> 0, !s) {
const S = Math.pow(2, 8 * i) - 1;
ee(this, e, t, i, S, 0);
}
let l = 1, h = 0;
for (this[t] = e & 255; ++h < i && (l *= 256); )
this[t + h] = e / l & 255;
return t + i;
}, c.prototype.writeUintBE = c.prototype.writeUIntBE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, i = i >>> 0, !s) {
const S = Math.pow(2, 8 * i) - 1;
ee(this, e, t, i, S, 0);
}
let l = i - 1, h = 1;
for (this[t + l] = e & 255; --l >= 0 && (h *= 256); )
this[t + l] = e / h & 255;
return t + i;
}, c.prototype.writeUint8 = c.prototype.writeUInt8 = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 1, 255, 0), this[t] = e & 255, t + 1;
}, c.prototype.writeUint16LE = c.prototype.writeUInt16LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 2, 65535, 0), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
}, c.prototype.writeUint16BE = c.prototype.writeUInt16BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 2, 65535, 0), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
}, c.prototype.writeUint32LE = c.prototype.writeUInt32LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 4, 4294967295, 0), this[t + 3] = e >>> 24, this[t + 2] = e >>> 16, this[t + 1] = e >>> 8, this[t] = e & 255, t + 4;
}, c.prototype.writeUint32BE = c.prototype.writeUInt32BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 4, 4294967295, 0), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
};
function We(r, e, t, i, s) {
Ze(e, i, s, r, t, 7);
let l = Number(e & BigInt(4294967295));
r[t++] = l, l = l >> 8, r[t++] = l, l = l >> 8, r[t++] = l, l = l >> 8, r[t++] = l;
let h = Number(e >> BigInt(32) & BigInt(4294967295));
return r[t++] = h, h = h >> 8, r[t++] = h, h = h >> 8, r[t++] = h, h = h >> 8, r[t++] = h, t;
}
function Ve(r, e, t, i, s) {
Ze(e, i, s, r, t, 7);
let l = Number(e & BigInt(4294967295));
r[t + 7] = l, l = l >> 8, r[t + 6] = l, l = l >> 8, r[t + 5] = l, l = l >> 8, r[t + 4] = l;
let h = Number(e >> BigInt(32) & BigInt(4294967295));
return r[t + 3] = h, h = h >> 8, r[t + 2] = h, h = h >> 8, r[t + 1] = h, h = h >> 8, r[t] = h, t + 8;
}
c.prototype.writeBigUInt64LE = he(function(e, t = 0) {
return We(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
}), c.prototype.writeBigUInt64BE = he(function(e, t = 0) {
return Ve(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
}), c.prototype.writeIntLE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, !s) {
const z = Math.pow(2, 8 * i - 1);
ee(this, e, t, i, z - 1, -z);
}
let l = 0, h = 1, S = 0;
for (this[t] = e & 255; ++l < i && (h *= 256); )
e < 0 && S === 0 && this[t + l - 1] !== 0 && (S = 1), this[t + l] = (e / h >> 0) - S & 255;
return t + i;
}, c.prototype.writeIntBE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, !s) {
const z = Math.pow(2, 8 * i - 1);
ee(this, e, t, i, z - 1, -z);
}
let l = i - 1, h = 1, S = 0;
for (this[t + l] = e & 255; --l >= 0 && (h *= 256); )
e < 0 && S === 0 && this[t + l + 1] !== 0 && (S = 1), this[t + l] = (e / h >> 0) - S & 255;
return t + i;
}, c.prototype.writeInt8 = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 1, 127, -128), e < 0 && (e = 255 + e + 1), this[t] = e & 255, t + 1;
}, c.prototype.writeInt16LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 2, 32767, -32768), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
}, c.prototype.writeInt16BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 2, 32767, -32768), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
}, c.prototype.writeInt32LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 4, 2147483647, -2147483648), this[t] = e & 255, this[t + 1] = e >>> 8, this[t + 2] = e >>> 16, this[t + 3] = e >>> 24, t + 4;
}, c.prototype.writeInt32BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || ee(this, e, t, 4, 2147483647, -2147483648), e < 0 && (e = 4294967295 + e + 1), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
}, c.prototype.writeBigInt64LE = he(function(e, t = 0) {
return We(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
}), c.prototype.writeBigInt64BE = he(function(e, t = 0) {
return Ve(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
});
function He(r, e, t, i, s, l) {
if (t + i > r.length)
throw new RangeError("Index out of range");
if (t < 0)
throw new RangeError("Index out of range");
}
function Ye(r, e, t, i, s) {
return e = +e, t = t >>> 0, s || He(r, e, t, 4), f.write(r, e, t, i, 23, 4), t + 4;
}
c.prototype.writeFloatLE = function(e, t, i) {
return Ye(this, e, t, !0, i);
}, c.prototype.writeFloatBE = function(e, t, i) {
return Ye(this, e, t, !1, i);
};
function Xe(r, e, t, i, s) {
return e = +e, t = t >>> 0, s || He(r, e, t, 8), f.write(r, e, t, i, 52, 8), t + 8;
}
c.prototype.writeDoubleLE = function(e, t, i) {
return Xe(this, e, t, !0, i);
}, c.prototype.writeDoubleBE = function(e, t, i) {
return Xe(this, e, t, !1, i);
}, c.prototype.copy = function(e, t, i, s) {
if (!c.isBuffer(e))
throw new TypeError("argument should be a Buffer");
if (i || (i = 0), !s && s !== 0 && (s = this.length), t >= e.length && (t = e.length), t || (t = 0), s > 0 && s < i && (s = i), s === i || e.length === 0 || this.length === 0)
return 0;
if (t < 0)
throw new RangeError("targetStart out of bounds");
if (i < 0 || i >= this.length)
throw new RangeError("Index out of range");
if (s < 0)
throw new RangeError("sourceEnd out of bounds");
s > this.length && (s = this.length), e.length - t < s - i && (s = e.length - t + i);
const l = s - i;
return this === e && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(t, i, s) : Uint8Array.prototype.set.call(
e,
this.subarray(i, s),
t
), l;
}, c.prototype.fill = function(e, t, i, s) {
if (typeof e == "string") {
if (typeof t == "string" ? (s = t, t = 0, i = this.length) : typeof i == "string" && (s = i, i = this.length), s !== void 0 && typeof s != "string")
throw new TypeError("encoding must be a string");
if (typeof s == "string" && !c.isEncoding(s))
throw new TypeError("Unknown encoding: " + s);
if (e.length === 1) {
const h = e.charCodeAt(0);
(s === "utf8" && h < 128 || s === "latin1") && (e = h);
}
} else
typeof e == "number" ? e = e & 255 : typeof e == "boolean" && (e = Number(e));
if (t < 0 || this.length < t || this.length < i)
throw new RangeError("Out of range index");
if (i <= t)
return this;
t = t >>> 0, i = i === void 0 ? this.length : i >>> 0, e || (e = 0);
let l;
if (typeof e == "number")
for (l = t; l < i; ++l)
this[l] = e;
else {
const h = c.isBuffer(e) ? e : c.from(e, s), S = h.length;
if (S === 0)
throw new TypeError('The value "' + e + '" is invalid for argument "value"');
for (l = 0; l < i - t; ++l)
this[l + t] = h[l % S];
}
return this;
};
const we = {};
function Je(r, e, t) {
we[r] = class extends t {
constructor() {
super(), Object.defineProperty(this, "message", {
value: e.apply(this, arguments),
writable: !0,
configurable: !0
}), this.name = `${this.name} [${r}]`, this.stack, delete this.name;
}
get code() {
return r;
}
set code(s) {
Object.defineProperty(this, "code", {
configurable: !0,
enumerable: !0,
value: s,
writable: !0
});
}
toString() {
return `${this.name} [${r}]: ${this.message}`;
}
};
}
Je(
"ERR_BUFFER_OUT_OF_BOUNDS",
function(r) {
return r ? `${r} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
},
RangeError
), Je(
"ERR_INVALID_ARG_TYPE",
function(r, e) {
return `The "${r}" argument must be of type number. Received type ${typeof e}`;
},
TypeError
), Je(
"ERR_OUT_OF_RANGE",
function(r, e, t) {
let i = `The value of "${r}" is out of range.`, s = t;
return Number.isInteger(t) && Math.abs(t) > 2 ** 32 ? s = Ke(String(t)) : typeof t == "bigint" && (s = String(t), (t > BigInt(2) ** BigInt(32) || t < -(BigInt(2) ** BigInt(32))) && (s = Ke(s)), s += "n"), i += ` It must be ${e}. Received ${s}`, i;
},
RangeError
);
function Ke(r) {
let e = "", t = r.length;
const i = r[0] === "-" ? 1 : 0;
for (; t >= i + 4; t -= 3)
e = `_${r.slice(t - 3, t)}${e}`;
return `${r.slice(0, t)}${e}`;
}
function dt(r, e, t) {
ve(e, "offset"), (r[e] === void 0 || r[e + t] === void 0) && Be(e, r.length - (t + 1));
}
function Ze(r, e, t, i, s, l) {
if (r > t || r < e) {
const h = typeof e == "bigint" ? "n" : "";
let S;
throw l > 3 ? e === 0 || e === BigInt(0) ? S = `>= 0${h} and < 2${h} ** ${(l + 1) * 8}${h}` : S = `>= -(2${h} ** ${(l + 1) * 8 - 1}${h}) and < 2 ** ${(l + 1) * 8 - 1}${h}` : S = `>= ${e}${h} and <= ${t}${h}`, new we.ERR_OUT_OF_RANGE("value", S, r);
}
dt(i, s, l);
}
function ve(r, e) {
if (typeof r != "number")
throw new we.ERR_INVALID_ARG_TYPE(e, "number", r);
}
function Be(r, e, t) {
throw Math.floor(r) !== r ? (ve(r, t), new we.ERR_OUT_OF_RANGE(t || "offset", "an integer", r)) : e < 0 ? new we.ERR_BUFFER_OUT_OF_BOUNDS() : new we.ERR_OUT_OF_RANGE(
t || "offset",
`>= ${t ? 1 : 0} and <= ${e}`,
r
);
}
const mt = /[^+/0-9A-Za-z-_]/g;
function ft(r) {
if (r = r.split("=")[0], r = r.trim().replace(mt, ""), r.length < 2)
return "";
for (; r.length % 4 !== 0; )
r = r + "=";
return r;
}
function Ce(r, e) {
e = e || 1 / 0;
let t;
const i = r.length;
let s = null;
const l = [];
for (let h = 0; h < i; ++h) {
if (t = r.charCodeAt(h), t > 55295 && t < 57344) {
if (!s) {
if (t > 56319) {
(e -= 3) > -1 && l.push(239, 191, 189);
continue;
} else if (h + 1 === i) {
(e -= 3) > -1 && l.push(239, 191, 189);
continue;
}
s = t;
continue;
}
if (t < 56320) {
(e -= 3) > -1 && l.push(239, 191, 189), s = t;
continue;
}
t = (s - 55296 << 10 | t - 56320) + 65536;
} else
s && (e -= 3) > -1 && l.push(239, 191, 189);
if (s = null, t < 128) {
if ((e -= 1) < 0)
break;
l.push(t);
} else if (t < 2048) {
if ((e -= 2) < 0)
break;
l.push(
t >> 6 | 192,
t & 63 | 128
);
} else if (t < 65536) {
if ((e -= 3) < 0)
break;
l.push(
t >> 12 | 224,
t >> 6 & 63 | 128,
t & 63 | 128
);
} else if (t < 1114112) {
if ((e -= 4) < 0)
break;
l.push(
t >> 18 | 240,
t >> 12 & 63 | 128,
t >> 6 & 63 | 128,
t & 63 | 128
);
} else
throw new Error("Invalid code point");
}
return l;
}
function ht(r) {
const e = [];
for (let t = 0; t < r.length; ++t)
e.push(r.charCodeAt(t) & 255);
return e;
}
function bt(r, e) {
let t, i, s;
const l = [];
for (let h = 0; h < r.length && !((e -= 2) < 0); ++h)
t = r.charCodeAt(h), i = t >> 8, s = t % 256, l.push(s), l.push(i);
return l;
}
function Qe(r) {
return d.toByteArray(ft(r));
}
function Te(r, e, t, i) {
let s;
for (s = 0; s < i && !(s + t >= e.length || s >= r.length); ++s)
e[s + t] = r[s];
return s;
}
function pe(r, e) {
return r instanceof e || r != null && r.constructor != null && r.constructor.name != null && r.constructor.name === e.name;
}
function Re(r) {
return r !== r;
}
const gt = function() {
const r = "0123456789abcdef", e = new Array(256);
for (let t = 0; t < 16; ++t) {
const i = t * 16;
for (let s = 0; s < 16; ++s)
e[i + s] = r[t] + r[s];
}
return e;
}();
function he(r) {
return typeof BigInt > "u" ? yt : r;
}
function yt() {
throw new Error("BigInt not supported");
}
})(be);
function ne(u) {
let d = {};
return u.forEach(function(f, x) {
d[f] = x;
}), d.lookup = u, d;
}
function tt(u, d) {
for (let f in d)
d[f] && d[f].constructor === Object ? (u[f] = u[f] || {}, tt(u[f], d[f])) : u[f] = d[f];
return u;
}
let O = {
"document-state": ne([
,
,
,
// 0x00-0x02
"pending",
,
// 0x04
"processing",
,
// 0x06
"canceled",
// 0x07
"aborted",
// 0x08
"completed"
// 0x09
]),
finishings: ne([
,
,
,
// 0x00 - 0x02
"none",
// 0x03 http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple",
// 0x04 http://tools.ietf.org/html/rfc2911#section-4.2.6
"punch",
// 0x05 http://tools.ietf.org/html/rfc2911#section-4.2.6
"cover",
// 0x06 http://tools.ietf.org/html/rfc2911#section-4.2.6
"bind",
// 0x07 http://tools.ietf.org/html/rfc2911#section-4.2.6
"saddle-stitch",
// 0x08 http://tools.ietf.org/html/rfc2911#section-4.2.6
"edge-stitch",
// 0x09 http://tools.ietf.org/html/rfc2911#section-4.2.6
"fold",
// 0x0A http://tools.ietf.org/html/rfc2911#section-4.2.6
"trim",
// 0x0B ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"bale",
// 0x0C ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"booklet-maker",
// 0x0D ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"jog-offset",
,
,
,
,
,
// 0x0F - 0x13 reserved for future generic finishing enum values.
"staple-top-left",
// 0x14 http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-bottom-left",
// 0x15 http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-top-right",
// 0x16 http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-bottom-right",
// 0x17 http://tools.ietf.org/html/rfc2911#section-4.2.6
"edge-stitch-left",
// 0x18 http://tools.ietf.org/html/rfc2911#section-4.2.6
"edge-stitch-top",
// 0x19 http://tools.ietf.org/html/rfc2911#section-4.2.6
"edge-stitch-right",
// 0x1A http://tools.ietf.org/html/rfc2911#section-4.2.6
"edge-stitch-bottom",
// 0x1B http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-dual-left",
// 0x1C http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-dual-top",
// 0x1D http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-dual-right",
// 0x1E http://tools.ietf.org/html/rfc2911#section-4.2.6
"staple-dual-bottom",
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
// 0x20 - 0x31 reserved for future specific stapling and stitching enum values.
"bind-left",
// 0x32 ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"bind-top",
// 0x33 ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"bind-right",
// 0x34 ftp://ftp.pwg.org/pub/pwg/ipp/new_VAL/pwg5100.1.pdf
"bind-bottom",
,
,
,
,
,
,
// 0x36 - 0x3B
"trim-after-pages",
// 0x3C ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf (IPP Everywhere)
"trim-after-documents",
// 0x3D ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf (IPP Everywhere)
"trim-after-copies",
// 0x3E ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf (IPP Everywhere)
"trim-after-job"
// 0x3F ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf (IPP Everywhere)
]),
"operations-supported": ne([
,
,
// 0x01
"Print-Job",
// 0x02 http://tools.ietf.org/html/rfc2911#section-3.2.1
"Print-URI",
// 0x03 http://tools.ietf.org/html/rfc2911#section-3.2.2
"Validate-Job",
// 0x04 http://tools.ietf.org/html/rfc2911#section-3.2.3
"Create-Job",
// 0x05 http://tools.ietf.org/html/rfc2911#section-3.2.4
"Send-Document",
// 0x06 http://tools.ietf.org/html/rfc2911#section-3.3.1
"Send-URI",
// 0x07 http://tools.ietf.org/html/rfc2911#section-3.3.2
"Cancel-Job",
// 0x08 http://tools.ietf.org/html/rfc2911#section-3.3.3
"Get-Job-Attributes",
// 0x09 http://tools.ietf.org/html/rfc2911#section-3.3.4
"Get-Jobs",
// 0x0A http://tools.ietf.org/html/rfc2911#section-3.2.6
"Get-Printer-Attributes",
// 0x0B http://tools.ietf.org/html/rfc2911#section-3.2.5
"Hold-Job",
// 0x0C http://tools.ietf.org/html/rfc2911#section-3.3.5
"Release-Job",
// 0x0D http://tools.ietf.org/html/rfc2911#section-3.3.6
"Restart-Job",
,
// 0x0F
"Pause-Printer",
// 0x10 http://tools.ietf.org/html/rfc2911#section-3.2.7
"Resume-Printer",
// 0x11 http://tools.ietf.org/html/rfc2911#section-3.2.8
"Purge-Jobs",
// 0x12 http://tools.ietf.org/html/rfc2911#section-3.2.9
"Set-Printer-Attributes",
// 0x13 IPP2.1 http://tools.ietf.org/html/rfc3380#section-4.1
"Set-Job-Attributes",
// 0x14 IPP2.1 http://tools.ietf.org/html/rfc3380#section-4.2
"Get-Printer-Supported-Values",
// 0x15 IPP2.1 http://tools.ietf.org/html/rfc3380#section-4.3
"Create-Printer-Subscriptions",
// 0x16 IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.1.2
"Create-Job-Subscription",
// 0x17 IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.1.1
"Get-Subscription-Attributes",
// 0x18 IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.2.4
"Get-Subscriptions",
// 0x19 IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.2.5
"Renew-Subscription",
// 0x1A IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.2.6
"Cancel-Subscription",
// 0x1B IPP2.1 http://tools.ietf.org/html/rfc3995#section-7.1 && http://tools.ietf.org/html/rfc3995#section-11.2.7
"Get-Notifications",
// 0x1C IPP2.1 IPP2.1 http://tools.ietf.org/html/rfc3996#section-9.2 && http://tools.ietf.org/html/rfc3996#section-5
"ipp-indp-method",
// 0x1D did not get standardized
"Get-Resource-Attributes",
// 0x1E http://tools.ietf.org/html/draft-ietf-ipp-get-resource-00#section-4.1 did not get standardized
"Get-Resource-Data",
// 0x1F http://tools.ietf.org/html/draft-ietf-ipp-get-resource-00#section-4.2 did not get standardized
"Get-Resources",
// 0x20 http://tools.ietf.org/html/draft-ietf-ipp-get-resource-00#section-4.3 did not get standardized
"ipp-install",
// 0x21 did not get standardized
"Enable-Printer",
// 0x22 http://tools.ietf.org/html/rfc3998#section-3.1.1
"Disable-Printer",
// 0x23 http://tools.ietf.org/html/rfc3998#section-3.1.2
"Pause-Printer-After-Current-Job",
// 0x24 http://tools.ietf.org/html/rfc3998#section-3.2.1
"Hold-New-Jobs",
// 0x25 http://tools.ietf.org/html/rfc3998#section-3.3.1
"Release-Held-New-Jobs",
// 0x26 http://tools.ietf.org/html/rfc3998#section-3.3.2
"Deactivate-Printer",
// 0x27 http://tools.ietf.org/html/rfc3998#section-3.4.1
"Activate-Printer",
// 0x28 http://tools.ietf.org/html/rfc3998#section-3.4.2
"Restart-Printer",
// 0x29 http://tools.ietf.org/html/rfc3998#section-3.5.1
"Shutdown-Printer",
// 0x2A http://tools.ietf.org/html/rfc3998#section-3.5.2
"Startup-Printer",
// 0x2B http://tools.ietf.org/html/rfc3998#section-3.5.3
"Reprocess-Job",
// 0x2C http://tools.ietf.org/html/rfc3998#section-4.1
"Cancel-Current-Job",
// 0x2D http://tools.ietf.org/html/rfc3998#section-4.2
"Suspend-Current-Job",
// 0x2E http://tools.ietf.org/html/rfc3998#section-4.3.1
"Resume-Job",
// 0x2F http://tools.ietf.org/html/rfc3998#section-4.3.2
"Promote-Job",
// 0x30 http://tools.ietf.org/html/rfc3998#section-4.4.1
"Schedule-Job-After",
,
// 0x32
"Cancel-Document",
// 0x33 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippdocobject10-20031031-5100.5.pdf
"Get-Document-Attributes",
// 0x34 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippdocobject10-20031031-5100.5.pdf
"Get-Documents",
// 0x35 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippdocobject10-20031031-5100.5.pdf
"Delete-Document",
// 0x36 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippdocobject10-20031031-5100.5.pdf
"Set-Document-Attributes",
// 0x37 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippdocobject10-20031031-5100.5.pdf
"Cancel-Jobs",
// 0x38 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext10-20101030-5100.11.pdf
"Cancel-My-Jobs",
// 0x39 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext10-20101030-5100.11.pdf
"Resubmit-Job",
// 0x3A ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext10-20101030-5100.11.pdf
"Close-Job",
// 0x3B ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext10-20101030-5100.11.pdf
"Identify-Printer",
// 0x3C ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf
"Validate-Document"
// 0x3D ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf
]),
"job-collation-type": ne([
// IPP2.1 http://tools.ietf.org/html/rfc3381#section-6.3
"other",
// 0x01
"unknown",
// 0x02
"uncollated-documents",
// 0x03
"collated-documents",
// 0x04
"uncollated-documents"
// 0x05
]),
"job-state": ne([
,
,
,
// 0x00-0x02
"pending",
// 0x03
"pending-held",
// 0x04
"processing",
// 0x05
"processing-stopped",
// 0x06
"canceled",
// 0x07
"aborted",
// 0x08
"completed"
// 0x09
]),
"orientation-requested": ne([
,
,
,
// 0x00-0x02
"portrait",
// 0x03
"landscape",
// 0x04
"reverse-landscape",
// 0x05
"reverse-portrait",
// 0x06
"none"
// 0x07 ftp://ftp.pwg.org/pub/pwg/candidates/cs-ippjobprinterext3v10-20120727-5100.13.pdf
]),
"print-quality": ne([
,
,
,
// 0x00-0x