@hazeljs/resilience 0.2.0-beta.41

package/LICENSE

@@ -0,0 +1,192 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   Copyright 2024 HazelJS Team
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+
+---
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+   Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+   stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+   that You distribute, all copyright, patent, trademark, and
+   attribution notices from the Source form of the Work,
+   excluding those notices that do not pertain to any part of
+   the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+   distribution, then any Derivative Works that You distribute must
+   include a readable copy of the attribution notices contained
+   within such NOTICE file, excluding those notices that do not
+   pertain to any part of the Derivative Works, in at least one
+   of the following places: within a NOTICE text file distributed
+   as part of the Derivative Works; within the Source form or
+   documentation, if provided along with the Derivative Works; or,
+   within a display generated by the Derivative Works, if and
+   wherever such third-party notices normally appear. The contents
+   of the NOTICE file are for informational purposes only and
+   do not modify the License. You may add Your own attribution
+   notices within Derivative Works that You distribute, alongside
+   or as an addendum to the NOTICE text from the Work, provided
+   that such additional attribution notices cannot be construed
+   as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

package/README.md

@@ -0,0 +1,95 @@
+# @hazeljs/resilience
+
+Fault-tolerance and resilience patterns for HazelJS. Provides circuit breaker, retry, timeout, bulkhead, rate limiter, and metrics collection — all usable via decorators or programmatic API.
+
+[![npm version](https://img.shields.io/npm/v/@hazeljs/resilience.svg)](https://www.npmjs.com/package/@hazeljs/resilience)
+[![npm downloads](https://img.shields.io/npm/dm/@hazeljs/resilience)](https://www.npmjs.com/package/@hazeljs/resilience)
+[![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)
+
+## Installation
+
+```bash
+npm install @hazeljs/resilience
+```
+
+## Features
+
+- **Circuit Breaker** — Prevents cascading failures with sliding window metrics, configurable failure predicates, fallback support, and event-driven state transitions
+- **Retry** — Configurable retry with exponential/linear/fixed backoff, jitter, and retryable-error predicates
+- **Timeout** — Promise-based timeout wrapper with cancellation
+- **Bulkhead** — Concurrency limiter with queue support to isolate failures
+- **Rate Limiter** — Token bucket and sliding window strategies
+- **Metrics** — Tracks success/failure/latency per target, feeds into gateway canary decisions
+
+## Quick Start
+
+### Decorator API
+
+```typescript
+import { Injectable } from '@hazeljs/core';
+import { WithCircuitBreaker, WithRetry, WithTimeout, WithBulkhead, Fallback } from '@hazeljs/resilience';
+
+@Injectable()
+class PaymentService {
+  @WithCircuitBreaker({
+    failureThreshold: 5,
+    slidingWindow: { type: 'count', size: 20 },
+    resetTimeout: 30_000,
+    fallback: 'processPaymentFallback',
+  })
+  @WithRetry({ maxAttempts: 3, backoff: 'exponential', baseDelay: 500 })
+  @WithTimeout(5000)
+  @WithBulkhead({ maxConcurrent: 10, maxQueue: 50 })
+  async processPayment(order: Order): Promise<PaymentResult> {
+    return await this.paymentGateway.charge(order);
+  }
+
+  @Fallback('processPayment')
+  async processPaymentFallback(order: Order): Promise<PaymentResult> {
+    return { status: 'queued', message: 'Payment will be processed later' };
+  }
+}
+```
+
+### Programmatic API
+
+```typescript
+import { CircuitBreaker, RetryPolicy, Timeout, Bulkhead } from '@hazeljs/resilience';
+
+// Circuit Breaker
+const breaker = new CircuitBreaker({ failureThreshold: 5 });
+const result = await breaker.execute(() => fetch('/api/data'));
+
+breaker.on('stateChange', (from, to) => console.log(`${from} -> ${to}`));
+breaker.getMetrics(); // { totalRequests, failureRate, p99Latency, ... }
+
+// Retry
+const retry = new RetryPolicy({ maxAttempts: 3, backoff: 'exponential', baseDelay: 1000 });
+const data = await retry.execute(() => fetch('/api/unstable'));
+
+// Timeout
+const timeout = new Timeout(5000);
+const response = await timeout.execute(() => fetch('/api/slow'));
+
+// Bulkhead
+const bulkhead = new Bulkhead({ maxConcurrent: 10, maxQueue: 50 });
+const result = await bulkhead.execute(() => intensiveOperation());
+```
+
+## Circuit Breaker States
+
+```
+CLOSED  ──(failures >= threshold)──>  OPEN
+  ^                                     |
+  |                                     | (reset timeout)
+  |                                     v
+  └──(successes >= threshold)──  HALF_OPEN
+```
+
+## API Reference
+
+See the [full documentation](https://hazeljs.com/docs/packages/resilience) for complete API reference.
+
+## License
+
+MIT

package/dist/__tests__/bulkhead-timeout.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=bulkhead-timeout.test.d.ts.map

package/dist/__tests__/bulkhead-timeout.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bulkhead-timeout.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/bulkhead-timeout.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/bulkhead-timeout.test.js

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const bulkhead_1 = require("../bulkhead/bulkhead");
+const timeout_1 = require("../timeout/timeout");
+const types_1 = require("../types");
+describe('Bulkhead', () => {
+    it('should allow calls within concurrency limit', async () => {
+        const bulkhead = new bulkhead_1.Bulkhead({ maxConcurrent: 2, maxQueue: 0 });
+        const results = await Promise.all([
+            bulkhead.execute(() => Promise.resolve('a')),
+            bulkhead.execute(() => Promise.resolve('b')),
+        ]);
+        expect(results).toEqual(['a', 'b']);
+    });
+    it('should reject when concurrency and queue are full', async () => {
+        const bulkhead = new bulkhead_1.Bulkhead({ maxConcurrent: 1, maxQueue: 0 });
+        // Start a slow call that holds the slot
+        const slowCall = bulkhead.execute(() => new Promise((resolve) => setTimeout(() => resolve('slow'), 100)));
+        // This should be rejected immediately
+        await expect(bulkhead.execute(() => Promise.resolve('should-not-run'))).rejects.toThrow(types_1.BulkheadError);
+        await slowCall;
+    });
+    it('should queue calls when concurrency is full', async () => {
+        const bulkhead = new bulkhead_1.Bulkhead({ maxConcurrent: 1, maxQueue: 1 });
+        const order = [];
+        const call1 = bulkhead.execute(async () => {
+            await new Promise((resolve) => setTimeout(resolve, 50));
+            order.push('first');
+            return 'first';
+        });
+        const call2 = bulkhead.execute(async () => {
+            order.push('second');
+            return 'second';
+        });
+        const [r1, r2] = await Promise.all([call1, call2]);
+        expect(r1).toBe('first');
+        expect(r2).toBe('second');
+        expect(order).toEqual(['first', 'second']);
+    });
+    it('should track metrics', async () => {
+        const bulkhead = new bulkhead_1.Bulkhead({ maxConcurrent: 2, maxQueue: 5 });
+        const metrics = bulkhead.getMetrics();
+        expect(metrics.activeCalls).toBe(0);
+        expect(metrics.queueLength).toBe(0);
+        expect(metrics.maxConcurrent).toBe(2);
+        expect(metrics.maxQueue).toBe(5);
+    });
+});
+describe('Timeout', () => {
+    it('should resolve if function completes in time', async () => {
+        const timeout = new timeout_1.Timeout(1000);
+        const result = await timeout.execute(() => Promise.resolve('fast'));
+        expect(result).toBe('fast');
+    });
+    it('should reject with TimeoutError if too slow', async () => {
+        const timeout = new timeout_1.Timeout(50);
+        await expect(timeout.execute(() => new Promise((resolve) => setTimeout(() => resolve('slow'), 200)))).rejects.toThrow(types_1.TimeoutError);
+    });
+    it('should work with withTimeout helper', async () => {
+        const result = await (0, timeout_1.withTimeout)(() => Promise.resolve('quick'), 1000);
+        expect(result).toBe('quick');
+    });
+    it('should include duration in error message', async () => {
+        const timeout = new timeout_1.Timeout({ duration: 50, message: 'Custom timeout' });
+        try {
+            await timeout.execute(() => new Promise((resolve) => setTimeout(() => resolve('slow'), 200)));
+            fail('should have thrown');
+        }
+        catch (error) {
+            expect(error.message).toContain('Custom timeout');
+            expect(error.message).toContain('50ms');
+        }
+    });
+});

package/dist/__tests__/circuit-breaker.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=circuit-breaker.test.d.ts.map

package/dist/__tests__/circuit-breaker.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"circuit-breaker.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/circuit-breaker.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/circuit-breaker.test.js

@@ -0,0 +1,160 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const circuit_breaker_1 = require("../circuit-breaker/circuit-breaker");
+const circuit_breaker_registry_1 = require("../circuit-breaker/circuit-breaker-registry");
+const types_1 = require("../types");
+describe('CircuitBreaker', () => {
+    let breaker;
+    beforeEach(() => {
+        breaker = new circuit_breaker_1.CircuitBreaker({
+            failureThreshold: 3,
+            successThreshold: 2,
+            timeout: 5000,
+            resetTimeout: 100, // Short for tests
+        });
+    });
+    describe('CLOSED state', () => {
+        it('should start in CLOSED state', () => {
+            expect(breaker.getState()).toBe(types_1.CircuitState.CLOSED);
+            expect(breaker.isClosed()).toBe(true);
+        });
+        it('should pass through successful calls', async () => {
+            const result = await breaker.execute(() => Promise.resolve('success'));
+            expect(result).toBe('success');
+            expect(breaker.getState()).toBe(types_1.CircuitState.CLOSED);
+        });
+        it('should pass through failing calls and count failures', async () => {
+            await expect(breaker.execute(() => Promise.reject(new Error('fail')))).rejects.toThrow('fail');
+            expect(breaker.getFailureCount()).toBe(1);
+        });
+        it('should transition to OPEN after failure threshold', async () => {
+            for (let i = 0; i < 3; i++) {
+                await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            }
+            expect(breaker.getState()).toBe(types_1.CircuitState.OPEN);
+            expect(breaker.isOpen()).toBe(true);
+        });
+    });
+    describe('OPEN state', () => {
+        beforeEach(async () => {
+            // Trip the breaker
+            for (let i = 0; i < 3; i++) {
+                await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            }
+        });
+        it('should reject calls immediately when OPEN', async () => {
+            await expect(breaker.execute(() => Promise.resolve('should not reach'))).rejects.toThrow(types_1.CircuitBreakerError);
+        });
+        it('should transition to HALF_OPEN after reset timeout', async () => {
+            // Wait for reset timeout
+            await new Promise((resolve) => setTimeout(resolve, 150));
+            // Next call should be allowed (transitions to HALF_OPEN)
+            const result = await breaker.execute(() => Promise.resolve('trial'));
+            expect(result).toBe('trial');
+        });
+    });
+    describe('HALF_OPEN state', () => {
+        beforeEach(async () => {
+            // Trip the breaker, then wait for reset
+            for (let i = 0; i < 3; i++) {
+                await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            }
+            await new Promise((resolve) => setTimeout(resolve, 150));
+        });
+        it('should transition back to CLOSED after success threshold', async () => {
+            // successThreshold = 2
+            await breaker.execute(() => Promise.resolve('ok'));
+            expect(breaker.getState()).toBe(types_1.CircuitState.HALF_OPEN);
+            await breaker.execute(() => Promise.resolve('ok'));
+            expect(breaker.getState()).toBe(types_1.CircuitState.CLOSED);
+        });
+        it('should transition back to OPEN on failure in HALF_OPEN', async () => {
+            await breaker.execute(() => Promise.resolve('ok')); // first trial success
+            await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { }); // failure -> back to OPEN
+            expect(breaker.getState()).toBe(types_1.CircuitState.OPEN);
+        });
+    });
+    describe('events', () => {
+        it('should emit stateChange events', async () => {
+            const transitions = [];
+            breaker.on('stateChange', (from, to) => transitions.push([from, to]));
+            // Trip the breaker
+            for (let i = 0; i < 3; i++) {
+                await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            }
+            expect(transitions).toContainEqual([types_1.CircuitState.CLOSED, types_1.CircuitState.OPEN]);
+        });
+        it('should emit success and failure events', async () => {
+            let successCount = 0;
+            let failureCount = 0;
+            breaker.on('success', () => successCount++);
+            breaker.on('failure', () => failureCount++);
+            await breaker.execute(() => Promise.resolve('ok'));
+            await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            expect(successCount).toBe(1);
+            expect(failureCount).toBe(1);
+        });
+    });
+    describe('metrics', () => {
+        it('should track metrics', async () => {
+            await breaker.execute(() => Promise.resolve('ok'));
+            await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            const metrics = breaker.getMetrics();
+            expect(metrics.totalRequests).toBe(2);
+            expect(metrics.successCount).toBe(1);
+            expect(metrics.failureCount).toBe(1);
+            expect(metrics.failureRate).toBe(50);
+        });
+    });
+    describe('reset', () => {
+        it('should reset to CLOSED state', async () => {
+            // Trip the breaker
+            for (let i = 0; i < 3; i++) {
+                await breaker.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+            }
+            expect(breaker.getState()).toBe(types_1.CircuitState.OPEN);
+            breaker.reset();
+            expect(breaker.getState()).toBe(types_1.CircuitState.CLOSED);
+            expect(breaker.getFailureCount()).toBe(0);
+        });
+    });
+    describe('failure predicate', () => {
+        it('should ignore errors that do not match the predicate', async () => {
+            const selectiveBreaker = new circuit_breaker_1.CircuitBreaker({
+                failureThreshold: 1,
+                failurePredicate: (error) => error instanceof Error && error.message !== 'ignore-me',
+            });
+            // This error should NOT count as failure
+            await selectiveBreaker.execute(() => Promise.reject(new Error('ignore-me'))).catch(() => { });
+            expect(selectiveBreaker.getState()).toBe(types_1.CircuitState.CLOSED);
+            // This error SHOULD count
+            await selectiveBreaker.execute(() => Promise.reject(new Error('count-me'))).catch(() => { });
+            expect(selectiveBreaker.getState()).toBe(types_1.CircuitState.OPEN);
+        });
+    });
+});
+describe('CircuitBreakerRegistry', () => {
+    beforeEach(() => {
+        circuit_breaker_registry_1.CircuitBreakerRegistry.clear();
+    });
+    it('should create and cache circuit breakers', () => {
+        const b1 = circuit_breaker_registry_1.CircuitBreakerRegistry.getOrCreate('test');
+        const b2 = circuit_breaker_registry_1.CircuitBreakerRegistry.getOrCreate('test');
+        expect(b1).toBe(b2);
+    });
+    it('should return different breakers for different names', () => {
+        const b1 = circuit_breaker_registry_1.CircuitBreakerRegistry.getOrCreate('a');
+        const b2 = circuit_breaker_registry_1.CircuitBreakerRegistry.getOrCreate('b');
+        expect(b1).not.toBe(b2);
+    });
+    it('should reset all breakers', async () => {
+        const b = circuit_breaker_registry_1.CircuitBreakerRegistry.getOrCreate('test', {
+            failureThreshold: 1,
+            resetTimeout: 100,
+        });
+        await b.execute(() => Promise.reject(new Error('fail'))).catch(() => { });
+        expect(b.getState()).toBe(types_1.CircuitState.OPEN);
+        circuit_breaker_registry_1.CircuitBreakerRegistry.resetAll();
+        expect(b.getState()).toBe(types_1.CircuitState.CLOSED);
+    });
+});

package/dist/__tests__/decorators.test.d.ts

@@ -0,0 +1,2 @@
+import 'reflect-metadata';
+//# sourceMappingURL=decorators.test.d.ts.map

package/dist/__tests__/decorators.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decorators.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/decorators.test.ts"],"names":[],"mappings":"AAAA,OAAO,kBAAkB,CAAC"}