@stonyx/cron 0.1.0 → 0.2.1-alpha.0

package/src/main.js

@@ -1,7 +1,23 @@
+/*
+ * Copyright 2025 Stone Costa
+ *
+ * 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.
+ */
+
 import config from 'stonyx/config';
 import log from 'stonyx/log';
 import { getTimestamp } from "@stonyx/utils/date";
-import MinHeap from './min-heap.js';
+import MinHeap from '@stonyx/cron/min-heap';
 
 export default class Cron {
   jobs = {};

package/stonyx-bootstrap.cjs

@@ -0,0 +1,9 @@
+/**
+ * commonJS Bootstrap loading - Stonyx must be loaded first, prior to the rest of the application
+ */
+const { default:Stonyx } = require('stonyx');
+const { default:config } = require('./config/environment.js');
+
+new Stonyx(config, __dirname);
+
+module.exports = Stonyx;

package/.nvmrc

@@ -1 +0,0 @@
-v22.18.0

package/test/min-heap-test.js

@@ -1,79 +0,0 @@
-import QUnit from 'qunit';
-import MinHeap from '../src/min-heap.js';
-
-const { module, test } = QUnit;
-
-module('[Unit] MinHeap', function () {
-  test('push and peek should return the smallest nextTrigger job', function (assert) {
-    const heap = new MinHeap();
-    const job1 = { nextTrigger: 5 };
-    const job2 = { nextTrigger: 2 };
-    const job3 = { nextTrigger: 8 };
-
-    heap.push(job1);
-    heap.push(job2);
-    heap.push(job3);
-
-    assert.strictEqual(heap.peek(), job2, 'Job with smallest nextTrigger is at the top');
-  });
-
-  test('pop should remove and return the smallest job', function (assert) {
-    const heap = new MinHeap();
-    const job1 = { nextTrigger: 5 };
-    const job2 = { nextTrigger: 2 };
-    const job3 = { nextTrigger: 8 };
-
-    heap.push(job1);
-    heap.push(job2);
-    heap.push(job3);
-
-    const popped = heap.pop();
-    assert.strictEqual(popped, job2, 'Popped job is the smallest');
-    assert.strictEqual(heap.peek(), job1, 'Next smallest job is now at the top');
-  });
-
-  test('isEmpty should correctly reflect heap state', function (assert) {
-    const heap = new MinHeap();
-    assert.ok(heap.isEmpty(), 'Heap is empty initially');
-
-    heap.push({ nextTrigger: 1 });
-    assert.notOk(heap.isEmpty(), 'Heap is not empty after adding a job');
-
-    heap.pop();
-    assert.ok(heap.isEmpty(), 'Heap is empty after removing last job');
-  });
-
-  test('remove should delete a specific job from the heap', function (assert) {
-    const heap = new MinHeap();
-    const job1 = { nextTrigger: 5 };
-    const job2 = { nextTrigger: 2 };
-    const job3 = { nextTrigger: 8 };
-
-    heap.push(job1);
-    heap.push(job2);
-    heap.push(job3);
-
-    heap.remove(job2);
-    assert.notStrictEqual(heap.peek(), job2, 'Removed job is no longer in heap');
-    assert.ok([job1, job3].includes(heap.peek()), 'Heap still has remaining jobs');
-  });
-
-  test('pop should work correctly when only one item is in heap', function (assert) {
-    const heap = new MinHeap();
-    const job = { nextTrigger: 1 };
-    heap.push(job);
-
-    assert.strictEqual(heap.pop(), job, 'Popped the only job in the heap');
-    assert.ok(heap.isEmpty(), 'Heap is empty after popping last job');
-  });
-
-  test('pop should return undefined if heap is empty', function (assert) {
-    const heap = new MinHeap();
-    assert.strictEqual(heap.pop(), undefined, 'Pop returns undefined for empty heap');
-  });
-
-  test('peek should return undefined if heap is empty', function (assert) {
-    const heap = new MinHeap();
-    assert.strictEqual(heap.peek(), undefined, 'Peek returns undefined for empty heap');
-  });
-});