@adelant/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,263 lines • 148 kB
JavaScript
var yt = Object.defineProperty;
var xt = (p, m, h) => m in p ? yt(p, m, { enumerable: !0, configurable: !0, writable: !0, value: h }) : p[m] = h;
var we = (p, m, h) => xt(p, typeof m != "symbol" ? m + "" : m, h);
var Ce = {}, je = {}, Ke;
function wt() {
if (Ke) return je;
Ke = 1, je.byteLength = u, je.toByteArray = Q, je.fromByteArray = re;
for (var p = [], m = [], h = typeof Uint8Array < "u" ? Uint8Array : Array, _ = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", v = 0, F = _.length; v < F; ++v)
p[v] = _[v], m[_.charCodeAt(v)] = v;
m[45] = 62, m[95] = 63;
function E(k) {
var S = k.length;
if (S % 4 > 0)
throw new Error("Invalid string. Length must be a multiple of 4");
var D = k.indexOf("=");
D === -1 && (D = S);
var O = D === S ? 0 : 4 - D % 4;
return [D, O];
}
function u(k) {
var S = E(k), D = S[0], O = S[1];
return (D + O) * 3 / 4 - O;
}
function V(k, S, D) {
return (S + D) * 3 / 4 - D;
}
function Q(k) {
var S, D = E(k), O = D[0], B = D[1], b = new h(V(k, O, B)), x = 0, T = B > 0 ? O - 4 : O, J;
for (J = 0; J < T; J += 4)
S = m[k.charCodeAt(J)] << 18 | m[k.charCodeAt(J + 1)] << 12 | m[k.charCodeAt(J + 2)] << 6 | m[k.charCodeAt(J + 3)], b[x++] = S >> 16 & 255, b[x++] = S >> 8 & 255, b[x++] = S & 255;
return B === 2 && (S = m[k.charCodeAt(J)] << 2 | m[k.charCodeAt(J + 1)] >> 4, b[x++] = S & 255), B === 1 && (S = m[k.charCodeAt(J)] << 10 | m[k.charCodeAt(J + 1)] << 4 | m[k.charCodeAt(J + 2)] >> 2, b[x++] = S >> 8 & 255, b[x++] = S & 255), b;
}
function $(k) {
return p[k >> 18 & 63] + p[k >> 12 & 63] + p[k >> 6 & 63] + p[k & 63];
}
function N(k, S, D) {
for (var O, B = [], b = S; b < D; b += 3)
O = (k[b] << 16 & 16711680) + (k[b + 1] << 8 & 65280) + (k[b + 2] & 255), B.push($(O));
return B.join("");
}
function re(k) {
for (var S, D = k.length, O = D % 3, B = [], b = 16383, x = 0, T = D - O; x < T; x += b)
B.push(N(k, x, x + b > T ? T : x + b));
return O === 1 ? (S = k[D - 1], B.push(
p[S >> 2] + p[S << 4 & 63] + "=="
)) : O === 2 && (S = (k[D - 2] << 8) + k[D - 1], B.push(
p[S >> 10] + p[S >> 4 & 63] + p[S << 2 & 63] + "="
)), B.join("");
}
return je;
}
var Ie = {};
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
var Ze;
function vt() {
return Ze || (Ze = 1, Ie.read = function(p, m, h, _, v) {
var F, E, u = v * 8 - _ - 1, V = (1 << u) - 1, Q = V >> 1, $ = -7, N = h ? v - 1 : 0, re = h ? -1 : 1, k = p[m + N];
for (N += re, F = k & (1 << -$) - 1, k >>= -$, $ += u; $ > 0; F = F * 256 + p[m + N], N += re, $ -= 8)
;
for (E = F & (1 << -$) - 1, F >>= -$, $ += _; $ > 0; E = E * 256 + p[m + N], N += re, $ -= 8)
;
if (F === 0)
F = 1 - Q;
else {
if (F === V)
return E ? NaN : (k ? -1 : 1) * (1 / 0);
E = E + Math.pow(2, _), F = F - Q;
}
return (k ? -1 : 1) * E * Math.pow(2, F - _);
}, Ie.write = function(p, m, h, _, v, F) {
var E, u, V, Q = F * 8 - v - 1, $ = (1 << Q) - 1, N = $ >> 1, re = v === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, k = _ ? 0 : F - 1, S = _ ? 1 : -1, D = m < 0 || m === 0 && 1 / m < 0 ? 1 : 0;
for (m = Math.abs(m), isNaN(m) || m === 1 / 0 ? (u = isNaN(m) ? 1 : 0, E = $) : (E = Math.floor(Math.log(m) / Math.LN2), m * (V = Math.pow(2, -E)) < 1 && (E--, V *= 2), E + N >= 1 ? m += re / V : m += re * Math.pow(2, 1 - N), m * V >= 2 && (E++, V /= 2), E + N >= $ ? (u = 0, E = $) : E + N >= 1 ? (u = (m * V - 1) * Math.pow(2, v), E = E + N) : (u = m * Math.pow(2, N - 1) * Math.pow(2, v), E = 0)); v >= 8; p[h + k] = u & 255, k += S, u /= 256, v -= 8)
;
for (E = E << v | u, Q += v; Q > 0; p[h + k] = E & 255, k += S, E /= 256, Q -= 8)
;
p[h + k - S] |= D * 128;
}), Ie;
}
/*!
* The buffer module from node.js, for the browser.
*
* @author Feross Aboukhadijeh <https://feross.org>
* @license MIT
*/
var Qe;
function _t() {
return Qe || (Qe = 1, function(p) {
const m = wt(), h = vt(), _ = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
p.Buffer = u, p.SlowBuffer = b, p.INSPECT_MAX_BYTES = 50;
const v = 2147483647;
p.kMaxLength = v, u.TYPED_ARRAY_SUPPORT = F(), !u.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 F() {
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(u.prototype, "parent", {
enumerable: !0,
get: function() {
if (u.isBuffer(this))
return this.buffer;
}
}), Object.defineProperty(u.prototype, "offset", {
enumerable: !0,
get: function() {
if (u.isBuffer(this))
return this.byteOffset;
}
});
function E(r) {
if (r > v)
throw new RangeError('The value "' + r + '" is invalid for option "size"');
const e = new Uint8Array(r);
return Object.setPrototypeOf(e, u.prototype), e;
}
function u(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 V(r, e, t);
}
u.poolSize = 8192;
function V(r, e, t) {
if (typeof r == "string")
return re(r, e);
if (ArrayBuffer.isView(r))
return S(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 (ce(r, ArrayBuffer) || r && ce(r.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (ce(r, SharedArrayBuffer) || r && ce(r.buffer, SharedArrayBuffer)))
return D(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 u.from(i, e, t);
const s = O(r);
if (s) return s;
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof r[Symbol.toPrimitive] == "function")
return u.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
);
}
u.from = function(r, e, t) {
return V(r, e, t);
}, Object.setPrototypeOf(u.prototype, Uint8Array.prototype), Object.setPrototypeOf(u, Uint8Array);
function Q(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 $(r, e, t) {
return Q(r), r <= 0 ? E(r) : e !== void 0 ? typeof t == "string" ? E(r).fill(e, t) : E(r).fill(e) : E(r);
}
u.alloc = function(r, e, t) {
return $(r, e, t);
};
function N(r) {
return Q(r), E(r < 0 ? 0 : B(r) | 0);
}
u.allocUnsafe = function(r) {
return N(r);
}, u.allocUnsafeSlow = function(r) {
return N(r);
};
function re(r, e) {
if ((typeof e != "string" || e === "") && (e = "utf8"), !u.isEncoding(e))
throw new TypeError("Unknown encoding: " + e);
const t = x(r, e) | 0;
let i = E(t);
const s = i.write(r, e);
return s !== t && (i = i.slice(0, s)), i;
}
function k(r) {
const e = r.length < 0 ? 0 : B(r.length) | 0, t = E(e);
for (let i = 0; i < e; i += 1)
t[i] = r[i] & 255;
return t;
}
function S(r) {
if (ce(r, Uint8Array)) {
const e = new Uint8Array(r);
return D(e.buffer, e.byteOffset, e.byteLength);
}
return k(r);
}
function D(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, u.prototype), i;
}
function O(r) {
if (u.isBuffer(r)) {
const e = B(r.length) | 0, t = E(e);
return t.length === 0 || r.copy(t, 0, 0, e), t;
}
if (r.length !== void 0)
return typeof r.length != "number" || Se(r.length) ? E(0) : k(r);
if (r.type === "Buffer" && Array.isArray(r.data))
return k(r.data);
}
function B(r) {
if (r >= v)
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + v.toString(16) + " bytes");
return r | 0;
}
function b(r) {
return +r != r && (r = 0), u.alloc(+r);
}
u.isBuffer = function(e) {
return e != null && e._isBuffer === !0 && e !== u.prototype;
}, u.compare = function(e, t) {
if (ce(e, Uint8Array) && (e = u.from(e, e.offset, e.byteLength)), ce(t, Uint8Array) && (t = u.from(t, t.offset, t.byteLength)), !u.isBuffer(e) || !u.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, f = Math.min(i, s); l < f; ++l)
if (e[l] !== t[l]) {
i = e[l], s = t[l];
break;
}
return i < s ? -1 : s < i ? 1 : 0;
}, u.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;
}
}, u.concat = function(e, t) {
if (!Array.isArray(e))
throw new TypeError('"list" argument must be an Array of Buffers');
if (e.length === 0)
return u.alloc(0);
let i;
if (t === void 0)
for (t = 0, i = 0; i < e.length; ++i)
t += e[i].length;
const s = u.allocUnsafe(t);
let l = 0;
for (i = 0; i < e.length; ++i) {
let f = e[i];
if (ce(f, Uint8Array))
l + f.length > s.length ? (u.isBuffer(f) || (f = u.from(f)), f.copy(s, l)) : Uint8Array.prototype.set.call(
s,
f,
l
);
else if (u.isBuffer(f))
f.copy(s, l);
else
throw new TypeError('"list" argument must be an Array of Buffers');
l += f.length;
}
return s;
};
function x(r, e) {
if (u.isBuffer(r))
return r.length;
if (ArrayBuffer.isView(r) || ce(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 Je(r).length;
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return t * 2;
case "hex":
return t >>> 1;
case "base64":
return Xe(r).length;
default:
if (s)
return i ? -1 : Je(r).length;
e = ("" + e).toLowerCase(), s = !0;
}
}
u.byteLength = x;
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 ct(this, e, t);
case "utf8":
case "utf-8":
return Pe(this, e, t);
case "ascii":
return st(this, e, t);
case "latin1":
case "binary":
return ut(this, e, t);
case "base64":
return nt(this, e, t);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return pt(this, e, t);
default:
if (i) throw new TypeError("Unknown encoding: " + r);
r = (r + "").toLowerCase(), i = !0;
}
}
u.prototype._isBuffer = !0;
function J(r, e, t) {
const i = r[e];
r[e] = r[t], r[t] = i;
}
u.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)
J(this, t, t + 1);
return this;
}, u.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)
J(this, t, t + 3), J(this, t + 1, t + 2);
return this;
}, u.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)
J(this, t, t + 7), J(this, t + 1, t + 6), J(this, t + 2, t + 5), J(this, t + 3, t + 4);
return this;
}, u.prototype.toString = function() {
const e = this.length;
return e === 0 ? "" : arguments.length === 0 ? Pe(this, 0, e) : T.apply(this, arguments);
}, u.prototype.toLocaleString = u.prototype.toString, u.prototype.equals = function(e) {
if (!u.isBuffer(e)) throw new TypeError("Argument must be a Buffer");
return this === e ? !0 : u.compare(this, e) === 0;
}, u.prototype.inspect = function() {
let e = "";
const t = p.INSPECT_MAX_BYTES;
return e = this.toString("hex", 0, t).replace(/(.{2})/g, "$1 ").trim(), this.length > t && (e += " ... "), "<Buffer " + e + ">";
}, _ && (u.prototype[_] = u.prototype.inspect), u.prototype.compare = function(e, t, i, s, l) {
if (ce(e, Uint8Array) && (e = u.from(e, e.offset, e.byteLength)), !u.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 f = l - s, R = i - t;
const H = Math.min(f, R), z = this.slice(s, l), Y = e.slice(t, i);
for (let M = 0; M < H; ++M)
if (z[M] !== Y[M]) {
f = z[M], R = Y[M];
break;
}
return f < R ? -1 : R < f ? 1 : 0;
};
function X(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, Se(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 = u.from(e, i)), u.isBuffer(e))
return e.length === 0 ? -1 : ie(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) : ie(r, [e], t, i, s);
throw new TypeError("val must be string, number or Buffer");
}
function ie(r, e, t, i, s) {
let l = 1, f = r.length, R = 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, f /= 2, R /= 2, t /= 2;
}
function H(Y, M) {
return l === 1 ? Y[M] : Y.readUInt16BE(M * l);
}
let z;
if (s) {
let Y = -1;
for (z = t; z < f; z++)
if (H(r, z) === H(e, Y === -1 ? 0 : z - Y)) {
if (Y === -1 && (Y = z), z - Y + 1 === R) return Y * l;
} else
Y !== -1 && (z -= z - Y), Y = -1;
} else
for (t + R > f && (t = f - R), z = t; z >= 0; z--) {
let Y = !0;
for (let M = 0; M < R; M++)
if (H(r, z + M) !== H(e, M)) {
Y = !1;
break;
}
if (Y) return z;
}
return -1;
}
u.prototype.includes = function(e, t, i) {
return this.indexOf(e, t, i) !== -1;
}, u.prototype.indexOf = function(e, t, i) {
return X(this, e, t, i, !0);
}, u.prototype.lastIndexOf = function(e, t, i) {
return X(this, e, t, i, !1);
};
function de(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 f;
for (f = 0; f < i; ++f) {
const R = parseInt(e.substr(f * 2, 2), 16);
if (Se(R)) return f;
r[t + f] = R;
}
return f;
}
function Fe(r, e, t, i) {
return Ee(Je(e, r.length - t), r, t, i);
}
function Be(r, e, t, i) {
return Ee(ft(e), r, t, i);
}
function ve(r, e, t, i) {
return Ee(Xe(e), r, t, i);
}
function ot(r, e, t, i) {
return Ee(ht(e, r.length - t), r, t, i);
}
u.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 f = !1;
for (; ; )
switch (s) {
case "hex":
return de(this, e, t, i);
case "utf8":
case "utf-8":
return Fe(this, e, t, i);
case "ascii":
case "latin1":
case "binary":
return Be(this, e, t, i);
case "base64":
return ve(this, e, t, i);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return ot(this, e, t, i);
default:
if (f) throw new TypeError("Unknown encoding: " + s);
s = ("" + s).toLowerCase(), f = !0;
}
}, u.prototype.toJSON = function() {
return {
type: "Buffer",
data: Array.prototype.slice.call(this._arr || this, 0)
};
};
function nt(r, e, t) {
return e === 0 && t === r.length ? m.fromByteArray(r) : m.fromByteArray(r.slice(e, t));
}
function Pe(r, e, t) {
t = Math.min(r.length, t);
const i = [];
let s = e;
for (; s < t; ) {
const l = r[s];
let f = null, R = l > 239 ? 4 : l > 223 ? 3 : l > 191 ? 2 : 1;
if (s + R <= t) {
let H, z, Y, M;
switch (R) {
case 1:
l < 128 && (f = l);
break;
case 2:
H = r[s + 1], (H & 192) === 128 && (M = (l & 31) << 6 | H & 63, M > 127 && (f = M));
break;
case 3:
H = r[s + 1], z = r[s + 2], (H & 192) === 128 && (z & 192) === 128 && (M = (l & 15) << 12 | (H & 63) << 6 | z & 63, M > 2047 && (M < 55296 || M > 57343) && (f = M));
break;
case 4:
H = r[s + 1], z = r[s + 2], Y = r[s + 3], (H & 192) === 128 && (z & 192) === 128 && (Y & 192) === 128 && (M = (l & 15) << 18 | (H & 63) << 12 | (z & 63) << 6 | Y & 63, M > 65535 && M < 1114112 && (f = M));
}
}
f === null ? (f = 65533, R = 1) : f > 65535 && (f -= 65536, i.push(f >>> 10 & 1023 | 55296), f = 56320 | f & 1023), i.push(f), s += R;
}
return at(i);
}
const Oe = 4096;
function at(r) {
const e = r.length;
if (e <= Oe)
return String.fromCharCode.apply(String, r);
let t = "", i = 0;
for (; i < e; )
t += String.fromCharCode.apply(
String,
r.slice(i, i += Oe)
);
return t;
}
function st(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 ut(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 ct(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 += bt[r[l]];
return s;
}
function pt(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;
}
u.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, u.prototype), s;
};
function Z(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");
}
u.prototype.readUintLE = u.prototype.readUIntLE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Z(e, t, this.length);
let s = this[e], l = 1, f = 0;
for (; ++f < t && (l *= 256); )
s += this[e + f] * l;
return s;
}, u.prototype.readUintBE = u.prototype.readUIntBE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Z(e, t, this.length);
let s = this[e + --t], l = 1;
for (; t > 0 && (l *= 256); )
s += this[e + --t] * l;
return s;
}, u.prototype.readUint8 = u.prototype.readUInt8 = function(e, t) {
return e = e >>> 0, t || Z(e, 1, this.length), this[e];
}, u.prototype.readUint16LE = u.prototype.readUInt16LE = function(e, t) {
return e = e >>> 0, t || Z(e, 2, this.length), this[e] | this[e + 1] << 8;
}, u.prototype.readUint16BE = u.prototype.readUInt16BE = function(e, t) {
return e = e >>> 0, t || Z(e, 2, this.length), this[e] << 8 | this[e + 1];
}, u.prototype.readUint32LE = u.prototype.readUInt32LE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216;
}, u.prototype.readUint32BE = u.prototype.readUInt32BE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]);
}, u.prototype.readBigUInt64LE = me(function(e) {
e = e >>> 0, xe(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && _e(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));
}), u.prototype.readBigUInt64BE = me(function(e) {
e = e >>> 0, xe(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && _e(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);
}), u.prototype.readIntLE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Z(e, t, this.length);
let s = this[e], l = 1, f = 0;
for (; ++f < t && (l *= 256); )
s += this[e + f] * l;
return l *= 128, s >= l && (s -= Math.pow(2, 8 * t)), s;
}, u.prototype.readIntBE = function(e, t, i) {
e = e >>> 0, t = t >>> 0, i || Z(e, t, this.length);
let s = t, l = 1, f = this[e + --s];
for (; s > 0 && (l *= 256); )
f += this[e + --s] * l;
return l *= 128, f >= l && (f -= Math.pow(2, 8 * t)), f;
}, u.prototype.readInt8 = function(e, t) {
return e = e >>> 0, t || Z(e, 1, this.length), this[e] & 128 ? (255 - this[e] + 1) * -1 : this[e];
}, u.prototype.readInt16LE = function(e, t) {
e = e >>> 0, t || Z(e, 2, this.length);
const i = this[e] | this[e + 1] << 8;
return i & 32768 ? i | 4294901760 : i;
}, u.prototype.readInt16BE = function(e, t) {
e = e >>> 0, t || Z(e, 2, this.length);
const i = this[e + 1] | this[e] << 8;
return i & 32768 ? i | 4294901760 : i;
}, u.prototype.readInt32LE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24;
}, u.prototype.readInt32BE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3];
}, u.prototype.readBigInt64LE = me(function(e) {
e = e >>> 0, xe(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && _e(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);
}), u.prototype.readBigInt64BE = me(function(e) {
e = e >>> 0, xe(e, "offset");
const t = this[e], i = this[e + 7];
(t === void 0 || i === void 0) && _e(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);
}), u.prototype.readFloatLE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), h.read(this, e, !0, 23, 4);
}, u.prototype.readFloatBE = function(e, t) {
return e = e >>> 0, t || Z(e, 4, this.length), h.read(this, e, !1, 23, 4);
}, u.prototype.readDoubleLE = function(e, t) {
return e = e >>> 0, t || Z(e, 8, this.length), h.read(this, e, !0, 52, 8);
}, u.prototype.readDoubleBE = function(e, t) {
return e = e >>> 0, t || Z(e, 8, this.length), h.read(this, e, !1, 52, 8);
};
function oe(r, e, t, i, s, l) {
if (!u.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");
}
u.prototype.writeUintLE = u.prototype.writeUIntLE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, i = i >>> 0, !s) {
const R = Math.pow(2, 8 * i) - 1;
oe(this, e, t, i, R, 0);
}
let l = 1, f = 0;
for (this[t] = e & 255; ++f < i && (l *= 256); )
this[t + f] = e / l & 255;
return t + i;
}, u.prototype.writeUintBE = u.prototype.writeUIntBE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, i = i >>> 0, !s) {
const R = Math.pow(2, 8 * i) - 1;
oe(this, e, t, i, R, 0);
}
let l = i - 1, f = 1;
for (this[t + l] = e & 255; --l >= 0 && (f *= 256); )
this[t + l] = e / f & 255;
return t + i;
}, u.prototype.writeUint8 = u.prototype.writeUInt8 = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 1, 255, 0), this[t] = e & 255, t + 1;
}, u.prototype.writeUint16LE = u.prototype.writeUInt16LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 2, 65535, 0), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
}, u.prototype.writeUint16BE = u.prototype.writeUInt16BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 2, 65535, 0), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
}, u.prototype.writeUint32LE = u.prototype.writeUInt32LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(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;
}, u.prototype.writeUint32BE = u.prototype.writeUInt32BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(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 ze(r, e, t, i, s) {
Ye(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 f = Number(e >> BigInt(32) & BigInt(4294967295));
return r[t++] = f, f = f >> 8, r[t++] = f, f = f >> 8, r[t++] = f, f = f >> 8, r[t++] = f, t;
}
function $e(r, e, t, i, s) {
Ye(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 f = Number(e >> BigInt(32) & BigInt(4294967295));
return r[t + 3] = f, f = f >> 8, r[t + 2] = f, f = f >> 8, r[t + 1] = f, f = f >> 8, r[t] = f, t + 8;
}
u.prototype.writeBigUInt64LE = me(function(e, t = 0) {
return ze(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
}), u.prototype.writeBigUInt64BE = me(function(e, t = 0) {
return $e(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
}), u.prototype.writeIntLE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, !s) {
const H = Math.pow(2, 8 * i - 1);
oe(this, e, t, i, H - 1, -H);
}
let l = 0, f = 1, R = 0;
for (this[t] = e & 255; ++l < i && (f *= 256); )
e < 0 && R === 0 && this[t + l - 1] !== 0 && (R = 1), this[t + l] = (e / f >> 0) - R & 255;
return t + i;
}, u.prototype.writeIntBE = function(e, t, i, s) {
if (e = +e, t = t >>> 0, !s) {
const H = Math.pow(2, 8 * i - 1);
oe(this, e, t, i, H - 1, -H);
}
let l = i - 1, f = 1, R = 0;
for (this[t + l] = e & 255; --l >= 0 && (f *= 256); )
e < 0 && R === 0 && this[t + l + 1] !== 0 && (R = 1), this[t + l] = (e / f >> 0) - R & 255;
return t + i;
}, u.prototype.writeInt8 = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 1, 127, -128), e < 0 && (e = 255 + e + 1), this[t] = e & 255, t + 1;
}, u.prototype.writeInt16LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 2, 32767, -32768), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
}, u.prototype.writeInt16BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(this, e, t, 2, 32767, -32768), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
}, u.prototype.writeInt32LE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(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;
}, u.prototype.writeInt32BE = function(e, t, i) {
return e = +e, t = t >>> 0, i || oe(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;
}, u.prototype.writeBigInt64LE = me(function(e, t = 0) {
return ze(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
}), u.prototype.writeBigInt64BE = me(function(e, t = 0) {
return $e(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
});
function Ge(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 We(r, e, t, i, s) {
return e = +e, t = t >>> 0, s || Ge(r, e, t, 4), h.write(r, e, t, i, 23, 4), t + 4;
}
u.prototype.writeFloatLE = function(e, t, i) {
return We(this, e, t, !0, i);
}, u.prototype.writeFloatBE = function(e, t, i) {
return We(this, e, t, !1, i);
};
function Ve(r, e, t, i, s) {
return e = +e, t = t >>> 0, s || Ge(r, e, t, 8), h.write(r, e, t, i, 52, 8), t + 8;
}
u.prototype.writeDoubleLE = function(e, t, i) {
return Ve(this, e, t, !0, i);
}, u.prototype.writeDoubleBE = function(e, t, i) {
return Ve(this, e, t, !1, i);
}, u.prototype.copy = function(e, t, i, s) {
if (!u.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;
}, u.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" && !u.isEncoding(s))
throw new TypeError("Unknown encoding: " + s);
if (e.length === 1) {
const f = e.charCodeAt(0);
(s === "utf8" && f < 128 || s === "latin1") && (e = f);
}
} 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 f = u.isBuffer(e) ? e : u.from(e, s), R = f.length;
if (R === 0)
throw new TypeError('The value "' + e + '" is invalid for argument "value"');
for (l = 0; l < i - t; ++l)
this[l + t] = f[l % R];
}
return this;
};
const ye = {};
function Ue(r, e, t) {
ye[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}`;
}
};
}
Ue(
"ERR_BUFFER_OUT_OF_BOUNDS",
function(r) {
return r ? `${r} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
},
RangeError
), Ue(
"ERR_INVALID_ARG_TYPE",
function(r, e) {
return `The "${r}" argument must be of type number. Received type ${typeof e}`;
},
TypeError
), Ue(
"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 = He(String(t)) : typeof t == "bigint" && (s = String(t), (t > BigInt(2) ** BigInt(32) || t < -(BigInt(2) ** BigInt(32))) && (s = He(s)), s += "n"), i += ` It must be ${e}. Received ${s}`, i;
},
RangeError
);
function He(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 lt(r, e, t) {
xe(e, "offset"), (r[e] === void 0 || r[e + t] === void 0) && _e(e, r.length - (t + 1));
}
function Ye(r, e, t, i, s, l) {
if (r > t || r < e) {
const f = typeof e == "bigint" ? "n" : "";
let R;
throw e === 0 || e === BigInt(0) ? R = `>= 0${f} and < 2${f} ** ${(l + 1) * 8}${f}` : R = `>= -(2${f} ** ${(l + 1) * 8 - 1}${f}) and < 2 ** ${(l + 1) * 8 - 1}${f}`, new ye.ERR_OUT_OF_RANGE("value", R, r);
}
lt(i, s, l);
}
function xe(r, e) {
if (typeof r != "number")
throw new ye.ERR_INVALID_ARG_TYPE(e, "number", r);
}
function _e(r, e, t) {
throw Math.floor(r) !== r ? (xe(r, t), new ye.ERR_OUT_OF_RANGE("offset", "an integer", r)) : e < 0 ? new ye.ERR_BUFFER_OUT_OF_BOUNDS() : new ye.ERR_OUT_OF_RANGE(
"offset",
`>= 0 and <= ${e}`,
r
);
}
const dt = /[^+/0-9A-Za-z-_]/g;
function mt(r) {
if (r = r.split("=")[0], r = r.trim().replace(dt, ""), r.length < 2) return "";
for (; r.length % 4 !== 0; )
r = r + "=";
return r;
}
function Je(r, e) {
e = e || 1 / 0;
let t;
const i = r.length;
let s = null;
const l = [];
for (let f = 0; f < i; ++f) {
if (t = r.charCodeAt(f), t > 55295 && t < 57344) {
if (!s) {
if (t > 56319) {
(e -= 3) > -1 && l.push(239, 191, 189);
continue;
} else if (f + 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 ft(r) {
const e = [];
for (let t = 0; t < r.length; ++t)
e.push(r.charCodeAt(t) & 255);
return e;
}
function ht(r, e) {
let t, i, s;
const l = [];
for (let f = 0; f < r.length && !((e -= 2) < 0); ++f)
t = r.charCodeAt(f), i = t >> 8, s = t % 256, l.push(s), l.push(i);
return l;
}
function Xe(r) {
return m.toByteArray(mt(r));
}
function Ee(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 ce(r, e) {
return r instanceof e || r != null && r.constructor != null && r.constructor.name != null && r.constructor.name === e.name;
}
function Se(r) {
return r !== r;
}
const bt = 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 me(r) {
return typeof BigInt > "u" ? gt : r;
}
function gt() {
throw new Error("BigInt not supported");
}
}(Ce)), Ce;
}
var he = _t();
function ae(p) {
let m = {};
return p.forEach(function(h, _) {
m[h] = _;
}), m.lookup = p, m;
}
function et(p, m) {
for (let h in m)
m[h] && m[h].constructor === Object ? (p[h] = p[h] || {}, et(p[h], m[h])) : p[h] = m[h];
return p;
}
let W = {
"document-state": ae([
,
,
,
// 0x00-0x02
"pending",
,
// 0x04
"processing",
,
// 0x06
"canceled",
// 0x07
"aborted",
// 0x08
"completed"
// 0x09
]),
finishings: ae([
,
,
,
// 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": ae([
,
,
// 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",
//