qsharp-lang 1.0.27-dev → 1.0.29-dev

package/dist/main.js

@@ -31,6 +31,15 @@ export function getCompiler() {
     }
     return new Compiler(wasm);
 }
+export function getProjectLoader(readFile, loadDirectory, getManifest) {
+    if (!wasm) {
+        wasm = require("../lib/node/qsc_wasm.cjs");
+        // Set up logging and telemetry as soon as possible after instantiating
+        wasm.initLogging(log.logWithLevel, log.getLogLevel());
+        log.onLevelChanged = (level) => wasm?.setLogLevel(level);
+    }
+    return new wasm.ProjectLoader(readFile, loadDirectory, getManifest);
+}
 export function getCompilerWorker() {
     const thisDir = dirname(fileURLToPath(import.meta.url));
     const worker = new Worker(join(thisDir, "./compiler/worker-node.js"), {
@@ -62,10 +71,10 @@ export function getDebugServiceWorker() {
     worker.addListener("message", proxy.onMsgFromWorker);
     return proxy;
 }
-export function getLanguageService() {
+export function getLanguageService(readFile, listDir, getManifest) {
     if (!wasm)
         wasm = require("../lib/node/qsc_wasm.cjs");
-    return new QSharpLanguageService(wasm);
+    return new QSharpLanguageService(wasm, readFile, listDir, getManifest);
 }
 export function getLanguageServiceWorker() {
     const thisDir = dirname(fileURLToPath(import.meta.url));

package/dist/samples.generated.js

@@ -17,7 +17,7 @@ export default [
     {
         "title": "Bell States",
         "shots": 100,
-        "code": "/// # Sample\n/// Bell States\n///\n/// # Description\n/// Bell states or EPR pairs are specific quantum states of two qubits\n/// that represent the simplest (and maximal) examples of quantum entanglement.\n///\n/// This Q# program implements the four different Bell states.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation BellStates() : (Result, Result)[] {\n        // Allocate the two qubits that will be used to create a Bell state.\n        use register = Qubit[2];\n\n        // This array contains a label and a preparation operation for each one\n        // of the four Bell states.\n        let bellStateTuples = [\n            (\"|Φ+〉\", PreparePhiPlus),\n            (\"|Φ-〉\", PreparePhiMinus),\n            (\"|Ψ+〉\", PreparePsiPlus),\n            (\"|Ψ-〉\", PreparePsiMinus)\n        ];\n\n        // Prepare all Bell states, show them using the `DumpMachine` operation\n        // and measure the Bell state qubits.\n        mutable measurements = [];\n        for (label, prepare) in bellStateTuples {\n            prepare(register);\n            Message($\"Bell state {label}:\");\n            DumpMachine();\n            set measurements += [(M(register[0]), M(register[1]))];\n            ResetAll(register);\n        }\n        return measurements;\n    }\n\n    operation PreparePhiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 + |11〉)\n    }\n\n    operation PreparePhiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 - |11〉)\n    }\n\n    operation PreparePsiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        X(register[1]);                 // |+1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 + |10〉)\n    }\n\n    operation PreparePsiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        X(register[1]);                 // |-1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 - |10〉)\n    }\n}\n"
+        "code": "/// # Sample\n/// Bell States\n///\n/// # Description\n/// Bell states or EPR pairs are specific quantum states of two qubits\n/// that represent the simplest (and maximal) examples of quantum entanglement.\n///\n/// This Q# program implements the four different Bell states.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation BellStates() : (Result, Result)[] {\n        // Allocate the two qubits that will be used to create a Bell state.\n        use register = Qubit[2];\n\n        // This array contains a label and a preparation operation for each one\n        // of the four Bell states.\n        let bellStateTuples = [\n            (\"|Φ+〉\", PreparePhiPlus),\n            (\"|Φ-〉\", PreparePhiMinus),\n            (\"|Ψ+〉\", PreparePsiPlus),\n            (\"|Ψ-〉\", PreparePsiMinus)\n        ];\n\n        // Prepare all Bell states, show them using the `DumpMachine` operation\n        // and measure the Bell state qubits.\n        mutable measurements = [];\n        for (label, prepare) in bellStateTuples {\n            prepare(register);\n            Message($\"Bell state {label}:\");\n            DumpMachine();\n            set measurements += [(MResetZ(register[0]), MResetZ(register[1]))];\n        }\n        return measurements;\n    }\n\n    operation PreparePhiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 + |11〉)\n    }\n\n    operation PreparePhiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 - |11〉)\n    }\n\n    operation PreparePsiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        X(register[1]);                 // |+1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 + |10〉)\n    }\n\n    operation PreparePsiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        X(register[1]);                 // |-1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 - |10〉)\n    }\n}\n"
     },
     {
         "title": "Teleportation",
@@ -32,7 +32,7 @@ export default [
     {
         "title": "Random Number Generator",
         "shots": 1000,
-        "code": "/// # Sample\n/// Quantum Random Number Generator\n///\n/// # Description\n/// This program implements a quantum random number generator by setting qubits\n/// in superposition and then using the measurement results as random bits.\nnamespace Sample {\n    open Microsoft.Quantum.Measurement;\n    open Microsoft.Quantum.Intrinsic;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        // Generate 5-bit random number.\n        let nBits = 5;\n        return GenerateNRandomBits(nBits);\n    }\n\n    /// # Summary\n    /// Generates N random bits.\n    operation GenerateNRandomBits(nBits : Int) : Result[] {\n        // Allocate N qubits.\n        use register = Qubit[nBits];\n\n        // Set the qubits into superposition of 0 and 1 using the Hadamard\n        // operation `H`.\n        for qubit in register {\n            H(qubit);\n        }\n\n        // At this point each has 50% chance of being measured in the |0〉 state\n        // and 50% chance of being measured in the |1〉 state.\n        // Measure each qubit and reset them all so they can be safely\n        // deallocated.\n        let results = MeasureEachZ(register);\n        ResetAll(register);\n        return results;\n    }\n}\n"
+        "code": "/// # Sample\n/// Quantum Random Number Generator\n///\n/// # Description\n/// This program implements a quantum random number generator by setting qubits\n/// in superposition and then using the measurement results as random bits.\nnamespace Sample {\n    open Microsoft.Quantum.Measurement;\n    open Microsoft.Quantum.Intrinsic;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        // Generate 5-bit random number.\n        let nBits = 5;\n        return GenerateNRandomBits(nBits);\n    }\n\n    /// # Summary\n    /// Generates N random bits.\n    operation GenerateNRandomBits(nBits : Int) : Result[] {\n        // Allocate N qubits.\n        use register = Qubit[nBits];\n\n        // Set the qubits into superposition of 0 and 1 using the Hadamard\n        // operation `H`.\n        for qubit in register {\n            H(qubit);\n        }\n\n        // At this point each has 50% chance of being measured in the |0〉 state\n        // and 50% chance of being measured in the |1〉 state.\n        // Measure each qubit and reset them all so they can be safely\n        // deallocated.\n        let results = MResetEachZ(register);\n        return results;\n    }\n}\n"
     },
     {
         "title": "Random Number Generator (Advanced)",
@@ -42,7 +42,7 @@ export default [
     {
         "title": "Deutsch-Jozsa",
         "shots": 1,
-        "code": "/// # Sample\n/// Deutsch–Jozsa algorithm\n///\n/// # Description\n/// Deutsch–Jozsa is a quantum algorithm that determines whether a given Boolean\n/// function 𝑓 is constant (0 on all inputs or 1 on all inputs) or balanced\n/// (1 for exactly half of the input domain and 0 for the other half).\n///\n/// This Q# program implements the Deutsch–Jozsa algorithm.\nnamespace Sample {\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation Main() : (Result[], Result[]) {\n        // A Boolean function is a function that maps bitstrings to a bit:\n        //     𝑓 : {0, 1}^n → {0, 1}.\n\n        // We say that 𝑓 is constant if 𝑓(𝑥⃗) = 𝑓(𝑦⃗) for all bitstrings 𝑥⃗ and\n        // 𝑦⃗, and that 𝑓 is balanced if 𝑓 evaluates to true for exactly half of\n        // its inputs.\n\n        // If we are given a function 𝑓 as a quantum operation 𝑈 |𝑥〉|𝑦〉 =\n        // |𝑥〉|𝑦 ⊕ 𝑓(𝑥)〉, and are promised that 𝑓 is either constant or is\n        // balanced, then the Deutsch–Jozsa algorithm decides between these\n        // cases with a single application of 𝑈.\n\n        // Here, we demonstrate the use of the Deutsch-Jozsa algorithm by\n        // determining the type (constant or balanced) of a couple of functions.\n        let balancedResults = DeutschJozsa(SimpleBalancedBoolF, 5);\n        let constantResults = DeutschJozsa(SimpleConstantBoolF, 5);\n        return (balancedResults, constantResults);\n    }\n\n    /// # Summary\n    /// This operation implements the DeutschJozsa algorithm.\n    /// It returns the query register measurement results. If all the measurement\n    /// results are `Zero`, the function is constant. If at least one measurement\n    /// result is `One`, the function is balanced.\n    /// It is assumed that the function is either constant or balanced.\n    ///\n    /// # Input\n    /// ## Uf\n    /// A quantum operation that implements |𝑥〉|𝑦〉 ↦ |𝑥〉|𝑦 ⊕ 𝑓(𝑥)〉, where 𝑓 is a\n    /// Boolean function, 𝑥 is an 𝑛 bit register and 𝑦 is a single qubit.\n    /// ## n\n    /// The number of bits in the input register |𝑥〉.\n    ///\n    /// # Output\n    /// An array of measurement results for the query reguster.\n    /// All `Zero` measurement results indicate that the function is constant.\n    /// At least one `One` measurement result in the array indicates that the\n    /// function is balanced.\n    ///\n    /// # See Also\n    /// - For details see Section 1.4.3 of Nielsen & Chuang.\n    ///\n    /// # References\n    /// - [ *Michael A. Nielsen , Isaac L. Chuang*,\n    ///     Quantum Computation and Quantum Information ]\n    /// (http://doi.org/10.1017/CBO9780511976667)\n    operation DeutschJozsa(Uf : ((Qubit[], Qubit) => Unit), n : Int) : Result[] {\n        // We allocate n + 1 clean qubits. Note that the function `Uf` is defined\n        // on inputs of the form (x, y), where x has n bits and y has 1 bit.\n        use queryRegister = Qubit[n];\n        use target = Qubit();\n\n        // The last qubit needs to be flipped so that the function will actually\n        // be computed into the phase when Uf is applied.\n        X(target);\n\n        // Now, a Hadamard transform is applied to each of the qubits.\n        H(target);\n        // We use a within-apply block to ensure that the Hadamard transform is\n        // correctly inverted on the |𝑥〉 register.\n        within {\n            for q in queryRegister {\n                H(q);\n            }\n        } apply {\n            // We apply Uf to the n+1 qubits, computing |𝑥, 𝑦〉 ↦ |𝑥, 𝑦 ⊕ 𝑓(𝑥)〉.\n            Uf(queryRegister, target);\n        }\n\n        // Measure the query register and reset all qubits so they can be safely\n        // deallocated.\n        let results = MeasureEachZ(queryRegister);\n        ResetAll(queryRegister);\n        Reset(target);\n        return results;\n    }\n\n    // Simple constant Boolean function\n    operation SimpleConstantBoolF(args : Qubit[], target : Qubit) : Unit {\n        X(target);\n    }\n\n    // Simple balanced Boolean function\n    operation SimpleBalancedBoolF(args : Qubit[], target : Qubit) : Unit {\n        CX(args[0], target);\n    }\n}\n\n"
+        "code": "/// # Sample\n/// Deutsch–Jozsa algorithm\n///\n/// # Description\n/// Deutsch–Jozsa is a quantum algorithm that determines whether a given Boolean\n/// function 𝑓 is constant (0 on all inputs or 1 on all inputs) or balanced\n/// (1 for exactly half of the input domain and 0 for the other half).\n///\n/// This Q# program implements the Deutsch–Jozsa algorithm.\nnamespace Sample {\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation Main() : (Result[], Result[]) {\n        // A Boolean function is a function that maps bitstrings to a bit:\n        //     𝑓 : {0, 1}^n → {0, 1}.\n\n        // We say that 𝑓 is constant if 𝑓(𝑥⃗) = 𝑓(𝑦⃗) for all bitstrings 𝑥⃗ and\n        // 𝑦⃗, and that 𝑓 is balanced if 𝑓 evaluates to true for exactly half of\n        // its inputs.\n\n        // If we are given a function 𝑓 as a quantum operation 𝑈 |𝑥〉|𝑦〉 =\n        // |𝑥〉|𝑦 ⊕ 𝑓(𝑥)〉, and are promised that 𝑓 is either constant or is\n        // balanced, then the Deutsch–Jozsa algorithm decides between these\n        // cases with a single application of 𝑈.\n\n        // Here, we demonstrate the use of the Deutsch-Jozsa algorithm by\n        // determining the type (constant or balanced) of a couple of functions.\n        let balancedResults = DeutschJozsa(SimpleBalancedBoolF, 5);\n        let constantResults = DeutschJozsa(SimpleConstantBoolF, 5);\n        return (balancedResults, constantResults);\n    }\n\n    /// # Summary\n    /// This operation implements the DeutschJozsa algorithm.\n    /// It returns the query register measurement results. If all the measurement\n    /// results are `Zero`, the function is constant. If at least one measurement\n    /// result is `One`, the function is balanced.\n    /// It is assumed that the function is either constant or balanced.\n    ///\n    /// # Input\n    /// ## Uf\n    /// A quantum operation that implements |𝑥〉|𝑦〉 ↦ |𝑥〉|𝑦 ⊕ 𝑓(𝑥)〉, where 𝑓 is a\n    /// Boolean function, 𝑥 is an 𝑛 bit register and 𝑦 is a single qubit.\n    /// ## n\n    /// The number of bits in the input register |𝑥〉.\n    ///\n    /// # Output\n    /// An array of measurement results for the query reguster.\n    /// All `Zero` measurement results indicate that the function is constant.\n    /// At least one `One` measurement result in the array indicates that the\n    /// function is balanced.\n    ///\n    /// # See Also\n    /// - For details see Section 1.4.3 of Nielsen & Chuang.\n    ///\n    /// # References\n    /// - [ *Michael A. Nielsen , Isaac L. Chuang*,\n    ///     Quantum Computation and Quantum Information ]\n    /// (http://doi.org/10.1017/CBO9780511976667)\n    operation DeutschJozsa(Uf : ((Qubit[], Qubit) => Unit), n : Int) : Result[] {\n        // We allocate n + 1 clean qubits. Note that the function `Uf` is defined\n        // on inputs of the form (x, y), where x has n bits and y has 1 bit.\n        use queryRegister = Qubit[n];\n        use target = Qubit();\n\n        // The last qubit needs to be flipped so that the function will actually\n        // be computed into the phase when Uf is applied.\n        X(target);\n\n        // Now, a Hadamard transform is applied to each of the qubits.\n        H(target);\n        // We use a within-apply block to ensure that the Hadamard transform is\n        // correctly inverted on the |𝑥〉 register.\n        within {\n            for q in queryRegister {\n                H(q);\n            }\n        } apply {\n            // We apply Uf to the n+1 qubits, computing |𝑥, 𝑦〉 ↦ |𝑥, 𝑦 ⊕ 𝑓(𝑥)〉.\n            Uf(queryRegister, target);\n        }\n\n        // Measure the query register and reset all qubits so they can be safely\n        // deallocated.\n        let results = MResetEachZ(queryRegister);\n        Reset(target);\n        return results;\n    }\n\n    // Simple constant Boolean function\n    operation SimpleConstantBoolF(args : Qubit[], target : Qubit) : Unit {\n        X(target);\n    }\n\n    // Simple balanced Boolean function\n    operation SimpleBalancedBoolF(args : Qubit[], target : Qubit) : Unit {\n        CX(args[0], target);\n    }\n}\n\n"
     },
     {
         "title": "Deutsch-Jozsa (Advanced)",

package/lib/node/qsc_wasm.cjs

@@ -1,7 +1,7 @@
 let imports = {};
 imports['__wbindgen_placeholder__'] = module.exports;
 let wasm;
-const { TextDecoder, TextEncoder } = require(`util`);
+const { TextEncoder, TextDecoder } = require(`util`);
 
 const heap = new Array(128).fill(undefined);
 
@@ -9,32 +9,7 @@ heap.push(undefined, null, true, false);
 
 function getObject(idx) { return heap[idx]; }
 
-let heap_next = heap.length;
-
-function dropObject(idx) {
-    if (idx < 132) return;
-    heap[idx] = heap_next;
-    heap_next = idx;
-}
-
-function takeObject(idx) {
-    const ret = getObject(idx);
-    dropObject(idx);
-    return ret;
-}
-
-function addHeapObject(obj) {
-    if (heap_next === heap.length) heap.push(heap.length + 1);
-    const idx = heap_next;
-    heap_next = heap[idx];
-
-    heap[idx] = obj;
-    return idx;
-}
-
-let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
-
-cachedTextDecoder.decode();
+let WASM_VECTOR_LEN = 0;
 
 let cachedUint8Memory0 = null;
 
@@ -45,13 +20,6 @@ function getUint8Memory0() {
     return cachedUint8Memory0;
 }
 
-function getStringFromWasm0(ptr, len) {
-    ptr = ptr >>> 0;
-    return cachedTextDecoder.decode(getUint8Memory0().subarray(ptr, ptr + len));
-}
-
-let WASM_VECTOR_LEN = 0;
-
 let cachedTextEncoder = new TextEncoder('utf-8');
 
 const encodeString = (typeof cachedTextEncoder.encodeInto === 'function'
@@ -127,6 +95,38 @@ function getFloat64Memory0() {
     return cachedFloat64Memory0;
 }
 
+let heap_next = heap.length;
+
+function dropObject(idx) {
+    if (idx < 132) return;
+    heap[idx] = heap_next;
+    heap_next = idx;
+}
+
+function takeObject(idx) {
+    const ret = getObject(idx);
+    dropObject(idx);
+    return ret;
+}
+
+function addHeapObject(obj) {
+    if (heap_next === heap.length) heap.push(heap.length + 1);
+    const idx = heap_next;
+    heap_next = heap[idx];
+
+    heap[idx] = obj;
+    return idx;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+
+cachedTextDecoder.decode();
+
+function getStringFromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return cachedTextDecoder.decode(getUint8Memory0().subarray(ptr, ptr + len));
+}
+
 function debugString(val) {
     // primitive types
     const type = typeof val;
@@ -192,12 +192,32 @@ function debugString(val) {
     return className;
 }
 
-let stack_pointer = 128;
+function makeMutClosure(arg0, arg1, dtor, f) {
+    const state = { a: arg0, b: arg1, cnt: 1, dtor };
+    const real = (...args) => {
+        // First up with a closure we increment the internal reference
+        // count. This ensures that the Rust closure environment won't
+        // be deallocated while we're invoking it.
+        state.cnt++;
+        const a = state.a;
+        state.a = 0;
+        try {
+            return f(a, state.b, ...args);
+        } finally {
+            if (--state.cnt === 0) {
+                wasm.__wbindgen_export_2.get(state.dtor)(a, state.b);
 
-function addBorrowedObject(obj) {
-    if (stack_pointer == 1) throw new Error('out of js stack');
-    heap[--stack_pointer] = obj;
-    return stack_pointer;
+            } else {
+                state.a = a;
+            }
+        }
+    };
+    real.original = state;
+
+    return real;
+}
+function __wbg_adapter_44(arg0, arg1, arg2) {
+    wasm.__wbindgen_export_3(arg0, arg1, addHeapObject(arg2));
 }
 
 let cachedUint32Memory0 = null;
@@ -209,13 +229,6 @@ function getUint32Memory0() {
     return cachedUint32Memory0;
 }
 
-function passArray32ToWasm0(arg, malloc) {
-    const ptr = malloc(arg.length * 4, 4) >>> 0;
-    getUint32Memory0().set(arg, ptr / 4);
-    WASM_VECTOR_LEN = arg.length;
-    return ptr;
-}
-
 function passArrayJsValueToWasm0(array, malloc) {
     const ptr = malloc(array.length * 4, 4) >>> 0;
     const mem = getUint32Memory0();
@@ -226,6 +239,21 @@ function passArrayJsValueToWasm0(array, malloc) {
     return ptr;
 }
 
+let stack_pointer = 128;
+
+function addBorrowedObject(obj) {
+    if (stack_pointer == 1) throw new Error('out of js stack');
+    heap[--stack_pointer] = obj;
+    return stack_pointer;
+}
+
+function passArray32ToWasm0(arg, malloc) {
+    const ptr = malloc(arg.length * 4, 4) >>> 0;
+    getUint32Memory0().set(arg, ptr / 4);
+    WASM_VECTOR_LEN = arg.length;
+    return ptr;
+}
+
 function getArrayJsValueFromWasm0(ptr, len) {
     ptr = ptr >>> 0;
     const mem = getUint32Memory0();
@@ -277,20 +305,20 @@ module.exports.git_hash = function() {
         return getStringFromWasm0(r0, r1);
     } finally {
         wasm.__wbindgen_add_to_stack_pointer(16);
-        wasm.__wbindgen_export_2(deferred1_0, deferred1_1, 1);
+        wasm.__wbindgen_export_4(deferred1_0, deferred1_1, 1);
     }
 };
 
 /**
-* @param {string} code
+* @param {(Array<any>)[]} sources
 * @returns {string}
 */
-module.exports.get_qir = function(code) {
+module.exports.get_qir = function(sources) {
     let deferred3_0;
     let deferred3_1;
     try {
         const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
-        const ptr0 = passStringToWasm0(code, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+        const ptr0 = passArrayJsValueToWasm0(sources, wasm.__wbindgen_export_0);
         const len0 = WASM_VECTOR_LEN;
         wasm.get_qir(retptr, ptr0, len0);
         var r0 = getInt32Memory0()[retptr / 4 + 0];
@@ -308,21 +336,21 @@ module.exports.get_qir = function(code) {
         return getStringFromWasm0(ptr2, len2);
     } finally {
         wasm.__wbindgen_add_to_stack_pointer(16);
-        wasm.__wbindgen_export_2(deferred3_0, deferred3_1, 1);
+        wasm.__wbindgen_export_4(deferred3_0, deferred3_1, 1);
     }
 };
 
 /**
-* @param {string} code
+* @param {(Array<any>)[]} sources
 * @param {string} params
 * @returns {string}
 */
-module.exports.get_estimates = function(code, params) {
+module.exports.get_estimates = function(sources, params) {
     let deferred4_0;
     let deferred4_1;
     try {
         const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
-        const ptr0 = passStringToWasm0(code, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+        const ptr0 = passArrayJsValueToWasm0(sources, wasm.__wbindgen_export_0);
         const len0 = WASM_VECTOR_LEN;
         const ptr1 = passStringToWasm0(params, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
         const len1 = WASM_VECTOR_LEN;
@@ -342,7 +370,7 @@ module.exports.get_estimates = function(code, params) {
         return getStringFromWasm0(ptr3, len3);
     } finally {
         wasm.__wbindgen_add_to_stack_pointer(16);
-        wasm.__wbindgen_export_2(deferred4_0, deferred4_1, 1);
+        wasm.__wbindgen_export_4(deferred4_0, deferred4_1, 1);
     }
 };
 
@@ -361,7 +389,7 @@ module.exports.get_library_source_content = function(name) {
         let v2;
         if (r0 !== 0) {
             v2 = getStringFromWasm0(r0, r1).slice();
-            wasm.__wbindgen_export_2(r0, r1 * 1);
+            wasm.__wbindgen_export_4(r0, r1 * 1);
         }
         return v2;
     } finally {
@@ -388,21 +416,21 @@ module.exports.get_hir = function(code) {
         return getStringFromWasm0(r0, r1);
     } finally {
         wasm.__wbindgen_add_to_stack_pointer(16);
-        wasm.__wbindgen_export_2(deferred2_0, deferred2_1, 1);
+        wasm.__wbindgen_export_4(deferred2_0, deferred2_1, 1);
     }
 };
 
 /**
-* @param {string} code
+* @param {(Array<any>)[]} sources
 * @param {string} expr
 * @param {Function} event_cb
 * @param {number} shots
 * @returns {boolean}
 */
-module.exports.run = function(code, expr, event_cb, shots) {
+module.exports.run = function(sources, expr, event_cb, shots) {
     try {
         const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
-        const ptr0 = passStringToWasm0(code, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+        const ptr0 = passArrayJsValueToWasm0(sources, wasm.__wbindgen_export_0);
         const len0 = WASM_VECTOR_LEN;
         const ptr1 = passStringToWasm0(expr, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
         const len1 = WASM_VECTOR_LEN;
@@ -441,9 +469,13 @@ function handleError(f, args) {
     try {
         return f.apply(this, args);
     } catch (e) {
-        wasm.__wbindgen_export_3(addHeapObject(e));
+        wasm.__wbindgen_export_5(addHeapObject(e));
     }
 }
+function __wbg_adapter_145(arg0, arg1, arg2, arg3) {
+    wasm.__wbindgen_export_6(arg0, arg1, addHeapObject(arg2), addHeapObject(arg3));
+}
+
 /**
 */
 module.exports.StepResultId = Object.freeze({ BreakpointHit:0,"0":"BreakpointHit",Next:1,"1":"Next",StepIn:2,"2":"StepIn",StepOut:3,"3":"StepOut",Return:4,"4":"Return", });
@@ -477,34 +509,31 @@ class DebugService {
         return DebugService.__wrap(ret);
     }
     /**
-    * @param {string} path
-    * @param {string} source
+    * @param {(Array<any>)[]} sources
     * @param {string} target_profile
     * @param {string | undefined} entry
     * @returns {string}
     */
-    load_source(path, source, target_profile, entry) {
-        let deferred5_0;
-        let deferred5_1;
+    load_source(sources, target_profile, entry) {
+        let deferred4_0;
+        let deferred4_1;
         try {
             const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
-            const ptr0 = passStringToWasm0(path, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+            const ptr0 = passArrayJsValueToWasm0(sources, wasm.__wbindgen_export_0);
             const len0 = WASM_VECTOR_LEN;
-            const ptr1 = passStringToWasm0(source, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+            const ptr1 = passStringToWasm0(target_profile, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
             const len1 = WASM_VECTOR_LEN;
-            const ptr2 = passStringToWasm0(target_profile, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
-            const len2 = WASM_VECTOR_LEN;
-            var ptr3 = isLikeNone(entry) ? 0 : passStringToWasm0(entry, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
-            var len3 = WASM_VECTOR_LEN;
-            wasm.debugservice_load_source(retptr, this.__wbg_ptr, ptr0, len0, ptr1, len1, ptr2, len2, ptr3, len3);
+            var ptr2 = isLikeNone(entry) ? 0 : passStringToWasm0(entry, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+            var len2 = WASM_VECTOR_LEN;
+            wasm.debugservice_load_source(retptr, this.__wbg_ptr, ptr0, len0, ptr1, len1, ptr2, len2);
             var r0 = getInt32Memory0()[retptr / 4 + 0];
             var r1 = getInt32Memory0()[retptr / 4 + 1];
-            deferred5_0 = r0;
-            deferred5_1 = r1;
+            deferred4_0 = r0;
+            deferred4_1 = r1;
             return getStringFromWasm0(r0, r1);
         } finally {
             wasm.__wbindgen_add_to_stack_pointer(16);
-            wasm.__wbindgen_export_2(deferred5_0, deferred5_1, 1);
+            wasm.__wbindgen_export_4(deferred4_0, deferred4_1, 1);
         }
     }
     /**
@@ -656,13 +685,28 @@ class LanguageService {
         wasm.__wbg_languageservice_free(ptr);
     }
     /**
-    * @param {(uri: string, version: number | undefined, diagnostics: VSDiagnostic[]) => void} diagnostics_callback
     */
-    constructor(diagnostics_callback) {
-        const ret = wasm.languageservice_new(addHeapObject(diagnostics_callback));
+    constructor() {
+        const ret = wasm.languageservice_new();
         return LanguageService.__wrap(ret);
     }
     /**
+    * @param {(uri: string, version: number | undefined, diagnostics: VSDiagnostic[]) => void} diagnostics_callback
+    * @param {(uri: string) => Promise<string | null>} read_file
+    * @param {(uri: string) => Promise<[string, number][]>} list_directory
+    * @param {(uri: string) => Promise<{ manifestDirectory: string }| null>} get_manifest
+    * @returns {Promise<any>}
+    */
+    start_background_work(diagnostics_callback, read_file, list_directory, get_manifest) {
+        const ret = wasm.languageservice_start_background_work(this.__wbg_ptr, addHeapObject(diagnostics_callback), addHeapObject(read_file), addHeapObject(list_directory), addHeapObject(get_manifest));
+        return takeObject(ret);
+    }
+    /**
+    */
+    stop_background_work() {
+        wasm.languageservice_stop_background_work(this.__wbg_ptr);
+    }
+    /**
     * @param {IWorkspaceConfiguration} config
     */
     update_configuration(config) {
@@ -748,7 +792,7 @@ class LanguageService {
             var r0 = getInt32Memory0()[retptr / 4 + 0];
             var r1 = getInt32Memory0()[retptr / 4 + 1];
             var v2 = getArrayJsValueFromWasm0(r0, r1).slice();
-            wasm.__wbindgen_export_2(r0, r1 * 4);
+            wasm.__wbindgen_export_4(r0, r1 * 4);
             return v2;
         } finally {
             wasm.__wbindgen_add_to_stack_pointer(16);
@@ -803,11 +847,81 @@ class LanguageService {
     }
 }
 module.exports.LanguageService = LanguageService;
+/**
+* a minimal implementation for interacting with async JS filesystem callbacks to
+* load project files
+*/
+class ProjectLoader {
+
+    static __wrap(ptr) {
+        ptr = ptr >>> 0;
+        const obj = Object.create(ProjectLoader.prototype);
+        obj.__wbg_ptr = ptr;
+
+        return obj;
+    }
+
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+
+        return ptr;
+    }
+
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_projectloader_free(ptr);
+    }
+    /**
+    * @param {(uri: string) => Promise<string | null>} read_file
+    * @param {(uri: string) => Promise<[string, number][]>} list_directory
+    * @param {(uri: string) => Promise<{ manifestDirectory: string }| null>} get_manifest
+    */
+    constructor(read_file, list_directory, get_manifest) {
+        const ret = wasm.projectloader_new(addHeapObject(read_file), addHeapObject(list_directory), addHeapObject(get_manifest));
+        return ProjectLoader.__wrap(ret);
+    }
+    /**
+    * @param {{ manifestDirectory: string }} manifest
+    * @returns {Promise<[string, string][]>}
+    */
+    load_project(manifest) {
+        const ret = wasm.projectloader_load_project(this.__wbg_ptr, addHeapObject(manifest));
+        return takeObject(ret);
+    }
+}
+module.exports.ProjectLoader = ProjectLoader;
+
+module.exports.__wbindgen_string_get = function(arg0, arg1) {
+    const obj = getObject(arg1);
+    const ret = typeof(obj) === 'string' ? obj : undefined;
+    var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
+    var len1 = WASM_VECTOR_LEN;
+    getInt32Memory0()[arg0 / 4 + 1] = len1;
+    getInt32Memory0()[arg0 / 4 + 0] = ptr1;
+};
+
+module.exports.__wbindgen_number_get = function(arg0, arg1) {
+    const obj = getObject(arg1);
+    const ret = typeof(obj) === 'number' ? obj : undefined;
+    getFloat64Memory0()[arg0 / 8 + 1] = isLikeNone(ret) ? 0 : ret;
+    getInt32Memory0()[arg0 / 4 + 0] = !isLikeNone(ret);
+};
 
 module.exports.__wbindgen_object_drop_ref = function(arg0) {
     takeObject(arg0);
 };
 
+module.exports.__wbindgen_cb_drop = function(arg0) {
+    const obj = takeObject(arg0).original;
+    if (obj.cnt-- == 1) {
+        obj.a = 0;
+        return true;
+    }
+    const ret = false;
+    return ret;
+};
+
 module.exports.__wbindgen_bigint_from_u64 = function(arg0) {
     const ret = BigInt.asUintN(64, arg0);
     return addHeapObject(ret);
@@ -834,15 +948,6 @@ module.exports.__wbindgen_in = function(arg0, arg1) {
     return ret;
 };
 
-module.exports.__wbindgen_string_get = function(arg0, arg1) {
-    const obj = getObject(arg1);
-    const ret = typeof(obj) === 'string' ? obj : undefined;
-    var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_export_0, wasm.__wbindgen_export_1);
-    var len1 = WASM_VECTOR_LEN;
-    getInt32Memory0()[arg0 / 4 + 1] = len1;
-    getInt32Memory0()[arg0 / 4 + 0] = ptr1;
-};
-
 module.exports.__wbindgen_number_new = function(arg0) {
     const ret = arg0;
     return addHeapObject(ret);
@@ -866,11 +971,21 @@ module.exports.__wbg_stack_3090cd8fd3702c6e = function(arg0, arg1) {
     getInt32Memory0()[arg0 / 4 + 0] = ptr1;
 };
 
+module.exports.__wbindgen_is_null = function(arg0) {
+    const ret = getObject(arg0) === null;
+    return ret;
+};
+
 module.exports.__wbindgen_is_function = function(arg0) {
     const ret = typeof(getObject(arg0)) === 'function';
     return ret;
 };
 
+module.exports.__wbindgen_typeof = function(arg0) {
+    const ret = typeof getObject(arg0);
+    return addHeapObject(ret);
+};
+
 module.exports.__wbindgen_object_clone_ref = function(arg0) {
     const ret = getObject(arg0);
     return addHeapObject(ret);
@@ -887,13 +1002,6 @@ module.exports.__wbindgen_boolean_get = function(arg0) {
     return ret;
 };
 
-module.exports.__wbindgen_number_get = function(arg0, arg1) {
-    const obj = getObject(arg1);
-    const ret = typeof(obj) === 'number' ? obj : undefined;
-    getFloat64Memory0()[arg0 / 8 + 1] = isLikeNone(ret) ? 0 : ret;
-    getInt32Memory0()[arg0 / 4 + 0] = !isLikeNone(ret);
-};
-
 module.exports.__wbg_getwithrefkey_d1f0d12f1f1b63ea = function(arg0, arg1) {
     const ret = getObject(arg0)[getObject(arg1)];
     return addHeapObject(ret);
@@ -1015,6 +1123,11 @@ module.exports.__wbg_isArray_4c24b343cb13cfb1 = function(arg0) {
     return ret;
 };
 
+module.exports.__wbg_push_ca1c26067ef907ac = function(arg0, arg1) {
+    const ret = getObject(arg0).push(getObject(arg1));
+    return ret;
+};
+
 module.exports.__wbg_instanceof_ArrayBuffer_39ac22089b74fddb = function(arg0) {
     let result;
     try {
@@ -1046,6 +1159,40 @@ module.exports.__wbg_buffer_085ec1f694018c4f = function(arg0) {
     return addHeapObject(ret);
 };
 
+module.exports.__wbg_new_43f1b47c28813cbd = function(arg0, arg1) {
+    try {
+        var state0 = {a: arg0, b: arg1};
+        var cb0 = (arg0, arg1) => {
+            const a = state0.a;
+            state0.a = 0;
+            try {
+                return __wbg_adapter_145(a, state0.b, arg0, arg1);
+            } finally {
+                state0.a = a;
+            }
+        };
+        const ret = new Promise(cb0);
+        return addHeapObject(ret);
+    } finally {
+        state0.a = state0.b = 0;
+    }
+};
+
+module.exports.__wbg_resolve_53698b95aaf7fcf8 = function(arg0) {
+    const ret = Promise.resolve(getObject(arg0));
+    return addHeapObject(ret);
+};
+
+module.exports.__wbg_then_f7e06ee3c11698eb = function(arg0, arg1) {
+    const ret = getObject(arg0).then(getObject(arg1));
+    return addHeapObject(ret);
+};
+
+module.exports.__wbg_then_b2267541e2a73865 = function(arg0, arg1, arg2) {
+    const ret = getObject(arg0).then(getObject(arg1), getObject(arg2));
+    return addHeapObject(ret);
+};
+
 module.exports.__wbg_self_1ff1d729e9aae938 = function() { return handleError(function () {
     const ret = self.self;
     return addHeapObject(ret);
@@ -1123,6 +1270,11 @@ module.exports.__wbindgen_memory = function() {
     return addHeapObject(ret);
 };
 
+module.exports.__wbindgen_closure_wrapper536 = function(arg0, arg1, arg2) {
+    const ret = makeMutClosure(arg0, arg1, 156, __wbg_adapter_44);
+    return addHeapObject(ret);
+};
+
 const path = require('path').join(__dirname, 'qsc_wasm_bg.wasm');
 const bytes = require('fs').readFileSync(path);