"use strict";
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
    if (k2 === undefined) k2 = k;
    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
}) : (function(o, m, k, k2) {
    if (k2 === undefined) k2 = k;
    o[k2] = m[k];
}));
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
    Object.defineProperty(o, "default", { enumerable: true, value: v });
}) : function(o, v) {
    o["default"] = v;
});
var __importStar = (this && this.__importStar) || function (mod) {
    if (mod && mod.__esModule) return mod;
    var result = {};
    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
    __setModuleDefault(result, mod);
    return result;
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.throttleEnforceM_ = exports.throttleEnforceM = void 0;
// tracing: off
const CL = __importStar(require("../../Clock"));
const Tp = __importStar(require("../../Collections/Immutable/Tuple"));
const Function_1 = require("../../Function");
const O = __importStar(require("../../Option"));
const T = __importStar(require("../_internal/effect"));
const M = __importStar(require("../_internal/managed"));
const Ref = __importStar(require("../_internal/ref"));
const definitions_1 = require("./definitions");
/**
 * Throttles the chunks of this stream according to the given bandwidth parameters using the token bucket
 * algorithm. Allows for burst in the processing of elements by allowing the token bucket to accumulate
 * tokens up to a `units + burst` threshold. Chunks that do not meet the bandwidth constraints are dropped.
 * The weight of each chunk is determined by the `costFn` effectful function.
 *
 * @dataFirst throttleEnforceM_
 */
function throttleEnforceM(costFn, units, duration, burst = 0) {
    return (self) => throttleEnforceM_(self, costFn, units, duration, burst);
}
exports.throttleEnforceM = throttleEnforceM;
/**
 * Throttles the chunks of this stream according to the given bandwidth parameters using the token bucket
 * algorithm. Allows for burst in the processing of elements by allowing the token bucket to accumulate
 * tokens up to a `units + burst` threshold. Chunks that do not meet the bandwidth constraints are dropped.
 * The weight of each chunk is determined by the `costFn` effectful function.
 */
function throttleEnforceM_(self, costFn, units, duration, burst = 0) {
    return new definitions_1.Stream((M.map_(M.let_(M.bind_(M.bind_(M.bind_(M.do, "chunks", () => self.proc), "currentTime", () => T.toManaged(CL.currentTime)), "bucket", ({ currentTime }) => T.toManaged(Ref.makeRef(Tp.tuple(units, currentTime)))), "pull", ({ bucket, chunks }) => {
        const go = T.chain_(chunks, (chunk) => (T.chain_((T.zip_(T.mapError_(costFn(chunk), O.some), CL.currentTime)), ({ tuple: [weight, current] }) => (T.chain_(Ref.modify_(bucket, ({ tuple: [tokens, timestamp] }) => {
            const elapsed = current - timestamp;
            const cycles = elapsed / duration;
            const available = (() => {
                const sum = tokens + cycles * units;
                const max = units + burst < 0 ? Number.MAX_VALUE : units + burst;
                return sum < 0 ? max : Math.min(sum, max);
            })();
            if (weight <= available) {
                return Tp.tuple(O.some(chunk), Tp.tuple(available - weight, current));
            }
            else {
                return Tp.tuple(O.none, Tp.tuple(available, current));
            }
        }), O.fold(() => go, (os) => T.succeed(os)))))));
        //
        return go;
    }), ({ pull }) => pull)));
}
exports.throttleEnforceM_ = throttleEnforceM_;
//# sourceMappingURL=throttleEnforceM.js.map