104 lines
3.1 KiB
JavaScript
104 lines
3.1 KiB
JavaScript
|
import { noop, safe_not_equal, subscribe, run_all, is_function } from '../internal/index.mjs';
|
||
|
export { get_store_value as get } from '../internal/index.mjs';
|
||
|
|
||
|
const subscriber_queue = [];
|
||
|
/**
|
||
|
* Creates a `Readable` store that allows reading by subscription.
|
||
|
* @param value initial value
|
||
|
* @param {StartStopNotifier}start start and stop notifications for subscriptions
|
||
|
*/
|
||
|
function readable(value, start) {
|
||
|
return {
|
||
|
subscribe: writable(value, start).subscribe
|
||
|
};
|
||
|
}
|
||
|
/**
|
||
|
* Create a `Writable` store that allows both updating and reading by subscription.
|
||
|
* @param {*=}value initial value
|
||
|
* @param {StartStopNotifier=}start start and stop notifications for subscriptions
|
||
|
*/
|
||
|
function writable(value, start = noop) {
|
||
|
let stop;
|
||
|
const subscribers = new Set();
|
||
|
function set(new_value) {
|
||
|
if (safe_not_equal(value, new_value)) {
|
||
|
value = new_value;
|
||
|
if (stop) { // store is ready
|
||
|
const run_queue = !subscriber_queue.length;
|
||
|
for (const subscriber of subscribers) {
|
||
|
subscriber[1]();
|
||
|
subscriber_queue.push(subscriber, value);
|
||
|
}
|
||
|
if (run_queue) {
|
||
|
for (let i = 0; i < subscriber_queue.length; i += 2) {
|
||
|
subscriber_queue[i][0](subscriber_queue[i + 1]);
|
||
|
}
|
||
|
subscriber_queue.length = 0;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
function update(fn) {
|
||
|
set(fn(value));
|
||
|
}
|
||
|
function subscribe(run, invalidate = noop) {
|
||
|
const subscriber = [run, invalidate];
|
||
|
subscribers.add(subscriber);
|
||
|
if (subscribers.size === 1) {
|
||
|
stop = start(set) || noop;
|
||
|
}
|
||
|
run(value);
|
||
|
return () => {
|
||
|
subscribers.delete(subscriber);
|
||
|
if (subscribers.size === 0) {
|
||
|
stop();
|
||
|
stop = null;
|
||
|
}
|
||
|
};
|
||
|
}
|
||
|
return { set, update, subscribe };
|
||
|
}
|
||
|
function derived(stores, fn, initial_value) {
|
||
|
const single = !Array.isArray(stores);
|
||
|
const stores_array = single
|
||
|
? [stores]
|
||
|
: stores;
|
||
|
const auto = fn.length < 2;
|
||
|
return readable(initial_value, (set) => {
|
||
|
let inited = false;
|
||
|
const values = [];
|
||
|
let pending = 0;
|
||
|
let cleanup = noop;
|
||
|
const sync = () => {
|
||
|
if (pending) {
|
||
|
return;
|
||
|
}
|
||
|
cleanup();
|
||
|
const result = fn(single ? values[0] : values, set);
|
||
|
if (auto) {
|
||
|
set(result);
|
||
|
}
|
||
|
else {
|
||
|
cleanup = is_function(result) ? result : noop;
|
||
|
}
|
||
|
};
|
||
|
const unsubscribers = stores_array.map((store, i) => subscribe(store, (value) => {
|
||
|
values[i] = value;
|
||
|
pending &= ~(1 << i);
|
||
|
if (inited) {
|
||
|
sync();
|
||
|
}
|
||
|
}, () => {
|
||
|
pending |= (1 << i);
|
||
|
}));
|
||
|
inited = true;
|
||
|
sync();
|
||
|
return function stop() {
|
||
|
run_all(unsubscribers);
|
||
|
cleanup();
|
||
|
};
|
||
|
});
|
||
|
}
|
||
|
|
||
|
export { derived, readable, writable };
|