This repository has been archived on 2023-03-25. You can view files and clone it, but cannot push or open issues or pull requests.
mightyscape-1.1-deprecated/extensions/fablabchemnitz/papercraft/openjscad/node_modules/most/dist/most.js.map

1 line
229 KiB
Plaintext
Raw Normal View History

{"version":3,"file":"most.js","sources":["../src/Stream.js","../node_modules/@most/prelude/dist/index.es.js","../src/disposable/Disposable.js","../src/disposable/SettableDisposable.js","../src/Promise.js","../src/disposable/dispose.js","../src/fatalError.js","../src/scheduler/PropagateTask.js","../src/source/core.js","../src/source/fromArray.js","../src/iterable.js","../src/source/fromIterable.js","../node_modules/symbol-observable/es/ponyfill.js","../node_modules/symbol-observable/es/index.js","../src/observable/getObservable.js","../src/source/tryEvent.js","../src/observable/fromObservable.js","../src/source/from.js","../src/source/periodic.js","../src/scheduler/ScheduledTask.js","../src/task.js","../src/scheduler/Scheduler.js","../src/scheduler/ClockTimer.js","../src/scheduler/Timeline.js","../src/scheduler/defaultScheduler.js","../src/observable/subscribe.js","../src/combinator/thru.js","../src/source/EventTargetSource.js","../src/sink/DeferredSink.js","../src/source/EventEmitterSource.js","../src/source/fromEvent.js","../src/runSource.js","../src/sink/Pipe.js","../src/fusion/Filter.js","../src/fusion/FilterMap.js","../src/fusion/Map.js","../src/combinator/transform.js","../src/combinator/observe.js","../src/combinator/loop.js","../src/combinator/accumulate.js","../src/source/unfold.js","../src/source/iterate.js","../src/source/generate.js","../src/combinator/continueWith.js","../src/combinator/build.js","../src/sink/IndexSink.js","../src/invoke.js","../src/combinator/combine.js","../src/combinator/applicative.js","../src/combinator/transduce.js","../src/LinkedList.js","../src/combinator/mergeConcurrently.js","../src/combinator/flatMap.js","../src/combinator/concatMap.js","../src/combinator/merge.js","../src/combinator/sample.js","../src/Queue.js","../src/combinator/zip.js","../src/combinator/switch.js","../src/combinator/filter.js","../src/combinator/slice.js","../src/combinator/timeslice.js","../src/combinator/delay.js","../src/combinator/timestamp.js","../src/combinator/limit.js","../src/combinator/promises.js","../src/sink/SafeSink.js","../src/combinator/errors.js","../node_modules/@most/multicast/dist/multicast.es.js","../src/index.js"],"sourcesContent":["/** @license MIT License (c) copyright 2010-2016 original author or authors */\n/** @author Brian Cavalier */\n/** @author John Hann */\n\nexport default function Stream (source) {\n this.source = source\n}\n\nStream.prototype.run = function (sink, scheduler) {\n return this.source.run(sink, scheduler)\n}\n","/** @license MIT License (c) copyright 2010-2016 original author or authors */\n\n// Non-mutating array operations\n\n// cons :: a -> [a] -> [a]\n// a with x prepended\nfunction cons (x, a) {\n var l = a.length;\n var b = new Array(l + 1);\n b[0] = x;\n for (var i = 0; i < l; ++i) {\n b[i + 1] = a[i];\n }\n return b\n}\n\n// append :: a -> [a] -> [a]\n// a with x appended\nfunction append (x, a) {\n var l = a.length;\n var b = new Array(l + 1);\n for (var i = 0; i < l; ++i) {\n b[i] = a[i];\n }\n\n b[l] = x;\n return b\n}\n\n// drop :: Int -> [a] -> [a]\n// drop first n elements\nfunction drop (n, a) { // eslint-disable-line complexity\n if (n < 0) {\n throw new TypeError('n must be >= 0')\n }\n\n var l = a.length;\n if (n === 0 || l === 0) {\n return a\n }\n\n if (n >= l) {\n return []\n }\n\n return unsafeDrop(n, a, l - n)\n}\n\n// unsafeDrop :: Int -> [a] -> Int -> [a]\n// Internal helper for drop\nfunction unsafeDrop (n, a, l) {\n var b = new Array(l);\n for (var i = 0; i < l; ++i) {\n b[i] = a[n + i];\n }\n return b\n}\n\n// tail :: [a] -> [a]\n// drop head element\nfunction tail (a) {\n return drop(1, a)\n}\n\n// copy :: [a] -> [a]\n// duplicate a (shallow duplication)\nfunction copy (a) {\n var l = a.length;\n var b = new Array(l);\n for (var i = 0; i < l; ++i) {\n b[i] = a[i];\n }\n return b\n}\n\n// map :: (a -> b) -> [a] -> [b]\n// transform each element with f\nfunction map (f, a) {\n var l = a.length;\n var b = new Array(l);\n for (var i = 0; i < l; ++i) {\n b[i] = f(a[i]);\n }\n ret