ciorent 0.3.9 → 0.4.0

package/README.md

@@ -141,6 +141,34 @@ for (let i = 0; i < 3; i++) {
 topic.flush(numbers);
 ```
 
+### Stream
+Send and recieve data asynchronously through streams.
+
+```ts
+import * as stream from 'ciorent/stream';
+import * as co from 'ciorent';
+
+const numbers = stream.init<number>();
+
+// Spawn 3 tasks that read from the stream
+co.spawn(3, async (id) => {
+  while (true) {
+    const msg = await stream.read(numbers);
+    if (msg == null) return;
+    console.log('Task', id, 'recieved:', msg);
+  }
+});
+
+// Write messages to the stream
+for (let i = 0; i < 3; i++) {
+  stream.write(numbers, i);
+  await co.nextTick;
+}
+
+// Send undefined to every stream
+stream.flush(numbers);
+```
+
 ### Semaphore
 Semaphore is a concurrency primitive used to control access to a common resource by multiple processes.
 
@@ -170,34 +198,6 @@ const task = async (id: number) => {
 co.spawn(5, task);
 ```
 
-### Stream
-Send and recieve data asynchronously through streams.
-
-```ts
-import * as stream from 'ciorent/stream';
-import * as co from 'ciorent';
-
-const numbers = stream.init<number>();
-
-// Spawn 3 tasks that read from the stream
-co.spawn(3, async (id) => {
-  while (true) {
-    const msg = await stream.read(numbers);
-    if (msg == null) return;
-    console.log('Task', id, 'recieved:', msg);
-  }
-});
-
-// Write messages to the stream
-for (let i = 0; i < 3; i++) {
-  stream.write(numbers, i);
-  await co.nextTick;
-}
-
-// Send undefined to every stream
-stream.flush(numbers);
-```
-
 ### Fibers
 Virtual threads with more controlled execution.
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ciorent",
-  "version": "0.3.9",
+  "version": "0.4.0",
   "description": "A lightweight, low-overhead concurrency library",
   "homepage": "https://ciorent.netlify.app",
   "repository": {
@@ -18,13 +18,11 @@
   "main": "./index.js",
   "types": "./index.d.ts",
   "exports": {
-    "./queue": "./queue.js",
-    "./sliding-queue": "./sliding-queue.js",
-    ".": "./index.js",
-    "./semaphore": "./semaphore.js",
-    "./topic": "./topic.js",
     "./fiber": "./fiber.js",
+    "./queue": "./queue.d.ts",
+    "./semaphore": "./semaphore.js",
     "./stream": "./stream.js",
-    "./dropping-queue": "./dropping-queue.js"
+    "./topic": "./topic.js",
+    ".": "./index.js"
   }
 }

package/queue.d.ts

@@ -17,12 +17,8 @@ export type QueueNode<T> = [next: QueueNode<T> | null, value: T];
 /**
  * Describe an unbounded queue
  */
-export type UnboundedQueue<T> = [
-    head: QueueNode<T>,
-    tail: QueueNode<T>
-];
+export type UnboundedQueue<T> = [head: QueueNode<T>, tail: QueueNode<T>];
 /**
- * Create a fixed queue
- * @param n - The queue size
+ * Cached promise callback
  */
-export declare const fixed: <T extends {} = {}>(n: number) => FixedQueue<T>;
+export type PromiseFn<T = any> = (res: (value?: T) => void) => void;

package/semaphore.d.ts

@@ -1,12 +1,13 @@
 /**
  * @module Semaphores
  */
-import type { UnboundedQueue } from './queue.js';
+import type { PromiseFn, UnboundedQueue } from './queue.js';
 /**
  * Describe a semaphore
  */
 export type Semaphore = [
     ...UnboundedQueue<() => void>,
+    callback: PromiseFn<void>,
     remain: number
 ];
 /**

package/stream.d.ts

@@ -1,12 +1,13 @@
 /**
  * @module Streams
  */
-import type { UnboundedQueue } from './queue.js';
+import type { PromiseFn, UnboundedQueue } from './queue.js';
 /**
  * Describe a stream
  */
 export type Stream<T extends {} = {}> = [
     ...UnboundedQueue<T | ((val?: T) => void)>,
+    callback: PromiseFn<T>,
     queueing: boolean
 ];
 /**

package/topic.d.ts

@@ -1,12 +1,13 @@
 /**
  * @module Pubsub
  */
-import type { QueueNode } from "./queue.js";
+import type { PromiseFn, QueueNode } from './queue.js';
 /**
  * Describe a topic
  */
 export type Topic<T extends {} = {}> = [
     head: QueueNode<T>,
+    callback: PromiseFn<void>,
     resolve: (() => void) | null,
     pending: Promise<void> | null
 ];

package/dropping-queue.d.ts

@@ -1,12 +0,0 @@
-/**
- * @module Dropping queues
- */
-import type { FixedQueue } from './queue.js';
-export { fixed as init } from './queue.js';
-export { pop } from './sliding-queue.js';
-/**
- * Push an item to a dropping queue
- * @param q - The queue to push to
- * @param item
- */
-export declare const push: <T extends {}>(q: FixedQueue<T>, item: T) => boolean;

package/dropping-queue.js

@@ -1 +0,0 @@
-export{fixed as init}from"./queue.js";export{pop}from"./sliding-queue.js";export let push=(q,item)=>{if(q[0][(q[2]+1)%q[1]]!=null)return false;q[0][q[2]=(q[2]+1)%q[1]]=item;return true};

package/queue.js

@@ -1 +0,0 @@
-export let fixed=(n)=>[new Array(n),n,-1,-1];

package/sliding-queue.d.ts

@@ -1,16 +0,0 @@
-/**
- * @module Sliding queues
- */
-import type { FixedQueue } from './queue.js';
-export { fixed as init } from './queue.js';
-/**
- * Push an item to a sliding queue
- * @param q - The queue to push to
- * @param item
- */
-export declare const push: <T extends {}>(q: FixedQueue<T>, item: T) => void;
-/**
- * Pop an item from the queue
- * @param q - The queue to pop from
- */
-export declare const pop: <T extends {}>(q: FixedQueue<T>) => T | undefined;

package/sliding-queue.js

@@ -1 +0,0 @@
-export{fixed as init}from"./queue.js";export let push=(q,item)=>{q[0][q[2]=(q[2]+1)%q[1]]=item};export let pop=(q)=>{let val=q[0][(q[3]+1)%q[1]];if(val!=null){q[0][q[3]=(q[3]+1)%q[1]]=null;return val}};