Spaces:

zeno-ml
/

langchain-qa

Runtime error

App Files Files Community

Alex Cabrera commited on Feb 23, 2023

Commit

5fe04ed

•

1 Parent(s): 5500788

initial commit

Browse files

Files changed (15) hide show

.dockerignore +1 -0
.gitattributes +1 -0
.zeno_cache/OUTPUTGPT-3.pickle +3 -0
.zeno_cache/POSTDISTILLcorrectGPT-3.pickle +3 -0
.zeno_cache/folders.pickle +3 -0
.zeno_cache/reports.pickle +3 -0
.zeno_cache/view.mjs +817 -0
Dockerfile +22 -0
README.md +2 -1
config.toml +9 -0
docs.index +3 -0
faiss_store.pkl +3 -0
model.py +44 -0
questions.csv +22 -0
requirements.txt +5 -0

.dockerignore ADDED Viewed

	@@ -0,0 +1 @@


1	+ .git

.gitattributes CHANGED Viewed

@@ -32,3 +32,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text

 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
+docs.index filter=lfs diff=lfs merge=lfs -text

.zeno_cache/OUTPUTGPT-3.pickle ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:64d0926959de922268e3c7424e0fd7e638e820d3be9238ebe025a035b0ca8331
+size 8579

.zeno_cache/POSTDISTILLcorrectGPT-3.pickle ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:da50fff84341add16a4695d17e748453ac60b2e77dc25b28cfa93f2f467c93de
+size 1506

.zeno_cache/folders.pickle ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:ec0a6ccf9debf1c16781445c4b9106080d00478b0559469336db7c7b7b9711c8
+size 5

.zeno_cache/reports.pickle ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:5da26028c635b1a8beee4b0759fbd4a8a86f5361ae95fc718aca4dd67e3ad50b
+size 200

.zeno_cache/view.mjs ADDED Viewed

	@@ -0,0 +1,817 @@

+function noop() { }
+function run(fn) {
+    return fn();
+}
+function blank_object() {
+    return Object.create(null);
+}
+function run_all(fns) {
+    fns.forEach(run);
+}
+function is_function(thing) {
+    return typeof thing === 'function';
+}
+function safe_not_equal(a, b) {
+    return a != a ? b == b : a !== b || ((a && typeof a === 'object') || typeof a === 'function');
+}
+function is_empty(obj) {
+    return Object.keys(obj).length === 0;
+}
+// Track which nodes are claimed during hydration. Unclaimed nodes can then be removed from the DOM
+// at the end of hydration without touching the remaining nodes.
+let is_hydrating = false;
+function start_hydrating() {
+    is_hydrating = true;
+}
+function end_hydrating() {
+    is_hydrating = false;
+}
+function upper_bound(low, high, key, value) {
+    // Return first index of value larger than input value in the range [low, high)
+    while (low < high) {
+        const mid = low + ((high - low) >> 1);
+        if (key(mid) <= value) {
+            low = mid + 1;
+        }
+        else {
+            high = mid;
+        }
+    }
+    return low;
+}
+function init_hydrate(target) {
+    if (target.hydrate_init)
+        return;
+    target.hydrate_init = true;
+    // We know that all children have claim_order values since the unclaimed have been detached if target is not <head>
+    let children = target.childNodes;
+    // If target is <head>, there may be children without claim_order
+    if (target.nodeName === 'HEAD') {
+        const myChildren = [];
+        for (let i = 0; i < children.length; i++) {
+            const node = children[i];
+            if (node.claim_order !== undefined) {
+                myChildren.push(node);
+            }
+        }
+        children = myChildren;
+    }
+    /*
+    * Reorder claimed children optimally.
+    * We can reorder claimed children optimally by finding the longest subsequence of
+    * nodes that are already claimed in order and only moving the rest. The longest
+    * subsequence of nodes that are claimed in order can be found by
+    * computing the longest increasing subsequence of .claim_order values.
+    *
+    * This algorithm is optimal in generating the least amount of reorder operations
+    * possible.
+    *
+    * Proof:
+    * We know that, given a set of reordering operations, the nodes that do not move
+    * always form an increasing subsequence, since they do not move among each other
+    * meaning that they must be already ordered among each other. Thus, the maximal
+    * set of nodes that do not move form a longest increasing subsequence.
+    */
+    // Compute longest increasing subsequence
+    // m: subsequence length j => index k of smallest value that ends an increasing subsequence of length j
+    const m = new Int32Array(children.length + 1);
+    // Predecessor indices + 1
+    const p = new Int32Array(children.length);
+    m[0] = -1;
+    let longest = 0;
+    for (let i = 0; i < children.length; i++) {
+        const current = children[i].claim_order;
+        // Find the largest subsequence length such that it ends in a value less than our current value
+        // upper_bound returns first greater value, so we subtract one
+        // with fast path for when we are on the current longest subsequence
+        const seqLen = ((longest > 0 && children[m[longest]].claim_order <= current) ? longest + 1 : upper_bound(1, longest, idx => children[m[idx]].claim_order, current)) - 1;
+        p[i] = m[seqLen] + 1;
+        const newLen = seqLen + 1;
+        // We can guarantee that current is the smallest value. Otherwise, we would have generated a longer sequence.
+        m[newLen] = i;
+        longest = Math.max(newLen, longest);
+    }
+    // The longest increasing subsequence of nodes (initially reversed)
+    const lis = [];
+    // The rest of the nodes, nodes that will be moved
+    const toMove = [];
+    let last = children.length - 1;
+    for (let cur = m[longest] + 1; cur != 0; cur = p[cur - 1]) {
+        lis.push(children[cur - 1]);
+        for (; last >= cur; last--) {
+            toMove.push(children[last]);
+        }
+        last--;
+    }
+    for (; last >= 0; last--) {
+        toMove.push(children[last]);
+    }
+    lis.reverse();
+    // We sort the nodes being moved to guarantee that their insertion order matches the claim order
+    toMove.sort((a, b) => a.claim_order - b.claim_order);
+    // Finally, we move the nodes
+    for (let i = 0, j = 0; i < toMove.length; i++) {
+        while (j < lis.length && toMove[i].claim_order >= lis[j].claim_order) {
+            j++;
+        }
+        const anchor = j < lis.length ? lis[j] : null;
+        target.insertBefore(toMove[i], anchor);
+    }
+}
+function append(target, node) {
+    target.appendChild(node);
+}
+function append_styles(target, style_sheet_id, styles) {
+    const append_styles_to = get_root_for_style(target);
+    if (!append_styles_to.getElementById(style_sheet_id)) {
+        const style = element('style');
+        style.id = style_sheet_id;
+        style.textContent = styles;
+        append_stylesheet(append_styles_to, style);
+    }
+}
+function get_root_for_style(node) {
+    if (!node)
+        return document;
+    const root = node.getRootNode ? node.getRootNode() : node.ownerDocument;
+    if (root && root.host) {
+        return root;
+    }
+    return node.ownerDocument;
+}
+function append_stylesheet(node, style) {
+    append(node.head || node, style);
+    return style.sheet;
+}
+function append_hydration(target, node) {
+    if (is_hydrating) {
+        init_hydrate(target);
+        if ((target.actual_end_child === undefined) || ((target.actual_end_child !== null) && (target.actual_end_child.parentNode !== target))) {
+            target.actual_end_child = target.firstChild;
+        }
+        // Skip nodes of undefined ordering
+        while ((target.actual_end_child !== null) && (target.actual_end_child.claim_order === undefined)) {
+            target.actual_end_child = target.actual_end_child.nextSibling;
+        }
+        if (node !== target.actual_end_child) {
+            // We only insert if the ordering of this node should be modified or the parent node is not target
+            if (node.claim_order !== undefined || node.parentNode !== target) {
+                target.insertBefore(node, target.actual_end_child);
+            }
+        }
+        else {
+            target.actual_end_child = node.nextSibling;
+        }
+    }
+    else if (node.parentNode !== target || node.nextSibling !== null) {
+        target.appendChild(node);
+    }
+}
+function insert_hydration(target, node, anchor) {
+    if (is_hydrating && !anchor) {
+        append_hydration(target, node);
+    }
+    else if (node.parentNode !== target || node.nextSibling != anchor) {
+        target.insertBefore(node, anchor || null);
+    }
+}
+function detach(node) {
+    if (node.parentNode) {
+        node.parentNode.removeChild(node);
+    }
+}
+function element(name) {
+    return document.createElement(name);
+}
+function svg_element(name) {
+    return document.createElementNS('http://www.w3.org/2000/svg', name);
+}
+function text(data) {
+    return document.createTextNode(data);
+}
+function space() {
+    return text(' ');
+}
+function attr(node, attribute, value) {
+    if (value == null)
+        node.removeAttribute(attribute);
+    else if (node.getAttribute(attribute) !== value)
+        node.setAttribute(attribute, value);
+}
+function children(element) {
+    return Array.from(element.childNodes);
+}
+function init_claim_info(nodes) {
+    if (nodes.claim_info === undefined) {
+        nodes.claim_info = { last_index: 0, total_claimed: 0 };
+    }
+}
+function claim_node(nodes, predicate, processNode, createNode, dontUpdateLastIndex = false) {
+    // Try to find nodes in an order such that we lengthen the longest increasing subsequence
+    init_claim_info(nodes);
+    const resultNode = (() => {
+        // We first try to find an element after the previous one
+        for (let i = nodes.claim_info.last_index; i < nodes.length; i++) {
+            const node = nodes[i];
+            if (predicate(node)) {
+                const replacement = processNode(node);
+                if (replacement === undefined) {
+                    nodes.splice(i, 1);
+                }
+                else {
+                    nodes[i] = replacement;
+                }
+                if (!dontUpdateLastIndex) {
+                    nodes.claim_info.last_index = i;
+                }
+                return node;
+            }
+        }
+        // Otherwise, we try to find one before
+        // We iterate in reverse so that we don't go too far back
+        for (let i = nodes.claim_info.last_index - 1; i >= 0; i--) {
+            const node = nodes[i];
+            if (predicate(node)) {
+                const replacement = processNode(node);
+                if (replacement === undefined) {
+                    nodes.splice(i, 1);
+                }
+                else {
+                    nodes[i] = replacement;
+                }
+                if (!dontUpdateLastIndex) {
+                    nodes.claim_info.last_index = i;
+                }
+                else if (replacement === undefined) {
+                    // Since we spliced before the last_index, we decrease it
+                    nodes.claim_info.last_index--;
+                }
+                return node;
+            }
+        }
+        // If we can't find any matching node, we create a new one
+        return createNode();
+    })();
+    resultNode.claim_order = nodes.claim_info.total_claimed;
+    nodes.claim_info.total_claimed += 1;
+    return resultNode;
+}
+function claim_element_base(nodes, name, attributes, create_element) {
+    return claim_node(nodes, (node) => node.nodeName === name, (node) => {
+        const remove = [];
+        for (let j = 0; j < node.attributes.length; j++) {
+            const attribute = node.attributes[j];
+            if (!attributes[attribute.name]) {
+                remove.push(attribute.name);
+            }
+        }
+        remove.forEach(v => node.removeAttribute(v));
+        return undefined;
+    }, () => create_element(name));
+}
+function claim_element(nodes, name, attributes) {
+    return claim_element_base(nodes, name, attributes, element);
+}
+function claim_svg_element(nodes, name, attributes) {
+    return claim_element_base(nodes, name, attributes, svg_element);
+}
+function claim_text(nodes, data) {
+    return claim_node(nodes, (node) => node.nodeType === 3, (node) => {
+        const dataStr = '' + data;
+        if (node.data.startsWith(dataStr)) {
+            if (node.data.length !== dataStr.length) {
+                return node.splitText(dataStr.length);
+            }
+        }
+        else {
+            node.data = dataStr;
+        }
+    }, () => text(data), true // Text nodes should not update last index since it is likely not worth it to eliminate an increasing subsequence of actual elements
+    );
+}
+function claim_space(nodes) {
+    return claim_text(nodes, ' ');
+}
+function set_data(text, data) {
+    data = '' + data;
+    if (text.wholeText !== data)
+        text.data = data;
+}
+let current_component;
+function set_current_component(component) {
+    current_component = component;
+}
+const dirty_components = [];
+const binding_callbacks = [];
+const render_callbacks = [];
+const flush_callbacks = [];
+const resolved_promise = Promise.resolve();
+let update_scheduled = false;
+function schedule_update() {
+    if (!update_scheduled) {
+        update_scheduled = true;
+        resolved_promise.then(flush);
+    }
+}
+function add_render_callback(fn) {
+    render_callbacks.push(fn);
+}
+// flush() calls callbacks in this order:
+// 1. All beforeUpdate callbacks, in order: parents before children
+// 2. All bind:this callbacks, in reverse order: children before parents.
+// 3. All afterUpdate callbacks, in order: parents before children. EXCEPT
+//    for afterUpdates called during the initial onMount, which are called in
+//    reverse order: children before parents.
+// Since callbacks might update component values, which could trigger another
+// call to flush(), the following steps guard against this:
+// 1. During beforeUpdate, any updated components will be added to the
+//    dirty_components array and will cause a reentrant call to flush(). Because
+//    the flush index is kept outside the function, the reentrant call will pick
+//    up where the earlier call left off and go through all dirty components. The
+//    current_component value is saved and restored so that the reentrant call will
+//    not interfere with the "parent" flush() call.
+// 2. bind:this callbacks cannot trigger new flush() calls.
+// 3. During afterUpdate, any updated components will NOT have their afterUpdate
+//    callback called a second time; the seen_callbacks set, outside the flush()
+//    function, guarantees this behavior.
+const seen_callbacks = new Set();
+let flushidx = 0; // Do *not* move this inside the flush() function
+function flush() {
+    // Do not reenter flush while dirty components are updated, as this can
+    // result in an infinite loop. Instead, let the inner flush handle it.
+    // Reentrancy is ok afterwards for bindings etc.
+    if (flushidx !== 0) {
+        return;
+    }
+    const saved_component = current_component;
+    do {
+        // first, call beforeUpdate functions
+        // and update components
+        try {
+            while (flushidx < dirty_components.length) {
+                const component = dirty_components[flushidx];
+                flushidx++;
+                set_current_component(component);
+                update(component.$$);
+            }
+        }
+        catch (e) {
+            // reset dirty state to not end up in a deadlocked state and then rethrow
+            dirty_components.length = 0;
+            flushidx = 0;
+            throw e;
+        }
+        set_current_component(null);
+        dirty_components.length = 0;
+        flushidx = 0;
+        while (binding_callbacks.length)
+            binding_callbacks.pop()();
+        // then, once components are updated, call
+        // afterUpdate functions. This may cause
+        // subsequent updates...
+        for (let i = 0; i < render_callbacks.length; i += 1) {
+            const callback = render_callbacks[i];
+            if (!seen_callbacks.has(callback)) {
+                // ...so guard against infinite loops
+                seen_callbacks.add(callback);
+                callback();
+            }
+        }
+        render_callbacks.length = 0;
+    } while (dirty_components.length);
+    while (flush_callbacks.length) {
+        flush_callbacks.pop()();
+    }
+    update_scheduled = false;
+    seen_callbacks.clear();
+    set_current_component(saved_component);
+}
+function update($$) {
+    if ($$.fragment !== null) {
+        $$.update();
+        run_all($$.before_update);
+        const dirty = $$.dirty;
+        $$.dirty = [-1];
+        $$.fragment && $$.fragment.p($$.ctx, dirty);
+        $$.after_update.forEach(add_render_callback);
+    }
+}
+const outroing = new Set();
+function transition_in(block, local) {
+    if (block && block.i) {
+        outroing.delete(block);
+        block.i(local);
+    }
+}
+function mount_component(component, target, anchor, customElement) {
+    const { fragment, after_update } = component.$$;
+    fragment && fragment.m(target, anchor);
+    if (!customElement) {
+        // onMount happens before the initial afterUpdate
+        add_render_callback(() => {
+            const new_on_destroy = component.$$.on_mount.map(run).filter(is_function);
+            // if the component was destroyed immediately
+            // it will update the `$$.on_destroy` reference to `null`.
+            // the destructured on_destroy may still reference to the old array
+            if (component.$$.on_destroy) {
+                component.$$.on_destroy.push(...new_on_destroy);
+            }
+            else {
+                // Edge case - component was destroyed immediately,
+                // most likely as a result of a binding initialising
+                run_all(new_on_destroy);
+            }
+            component.$$.on_mount = [];
+        });
+    }
+    after_update.forEach(add_render_callback);
+}
+function destroy_component(component, detaching) {
+    const $$ = component.$$;
+    if ($$.fragment !== null) {
+        run_all($$.on_destroy);
+        $$.fragment && $$.fragment.d(detaching);
+        // TODO null out other refs, including component.$$ (but need to
+        // preserve final state?)
+        $$.on_destroy = $$.fragment = null;
+        $$.ctx = [];
+    }
+}
+function make_dirty(component, i) {
+    if (component.$$.dirty[0] === -1) {
+        dirty_components.push(component);
+        schedule_update();
+        component.$$.dirty.fill(0);
+    }
+    component.$$.dirty[(i / 31) | 0] |= (1 << (i % 31));
+}
+function init(component, options, instance, create_fragment, not_equal, props, append_styles, dirty = [-1]) {
+    const parent_component = current_component;
+    set_current_component(component);
+    const $$ = component.$$ = {
+        fragment: null,
+        ctx: [],
+        // state
+        props,
+        update: noop,
+        not_equal,
+        bound: blank_object(),
+        // lifecycle
+        on_mount: [],
+        on_destroy: [],
+        on_disconnect: [],
+        before_update: [],
+        after_update: [],
+        context: new Map(options.context || (parent_component ? parent_component.$$.context : [])),
+        // everything else
+        callbacks: blank_object(),
+        dirty,
+        skip_bound: false,
+        root: options.target || parent_component.$$.root
+    };
+    append_styles && append_styles($$.root);
+    let ready = false;
+    $$.ctx = instance
+        ? instance(component, options.props || {}, (i, ret, ...rest) => {
+            const value = rest.length ? rest[0] : ret;
+            if ($$.ctx && not_equal($$.ctx[i], $$.ctx[i] = value)) {
+                if (!$$.skip_bound && $$.bound[i])
+                    $$.bound[i](value);
+                if (ready)
+                    make_dirty(component, i);
+            }
+            return ret;
+        })
+        : [];
+    $$.update();
+    ready = true;
+    run_all($$.before_update);
+    // `false` as a special case of no DOM component
+    $$.fragment = create_fragment ? create_fragment($$.ctx) : false;
+    if (options.target) {
+        if (options.hydrate) {
+            start_hydrating();
+            const nodes = children(options.target);
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            $$.fragment && $$.fragment.l(nodes);
+            nodes.forEach(detach);
+        }
+        else {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            $$.fragment && $$.fragment.c();
+        }
+        if (options.intro)
+            transition_in(component.$$.fragment);
+        mount_component(component, options.target, options.anchor, options.customElement);
+        end_hydrating();
+        flush();
+    }
+    set_current_component(parent_component);
+}
+/**
+ * Base class for Svelte components. Used when dev=false.
+ */
+class SvelteComponent {
+    $destroy() {
+        destroy_component(this, 1);
+        this.$destroy = noop;
+    }
+    $on(type, callback) {
+        if (!is_function(callback)) {
+            return noop;
+        }
+        const callbacks = (this.$$.callbacks[type] || (this.$$.callbacks[type] = []));
+        callbacks.push(callback);
+        return () => {
+            const index = callbacks.indexOf(callback);
+            if (index !== -1)
+                callbacks.splice(index, 1);
+        };
+    }
+    $set($$props) {
+        if (this.$$set && !is_empty($$props)) {
+            this.$$.skip_bound = true;
+            this.$$set($$props);
+            this.$$.skip_bound = false;
+        }
+    }
+}
+/* src/InstanceView.svelte generated by Svelte v3.55.1 */
+function add_css(target) {
+	append_styles(target, "svelte-1tmeyfg", "#container.svelte-1tmeyfg.svelte-1tmeyfg{border:0.5px solid rgb(224, 224, 224);border-radius:2px;max-width:350px;padding:10px}.box.svelte-1tmeyfg.svelte-1tmeyfg{display:flex;flex-direction:row;align-items:center}.box-reverse.svelte-1tmeyfg.svelte-1tmeyfg{display:flex;flex-direction:row-reverse}.chat.svelte-1tmeyfg.svelte-1tmeyfg{padding:10px;border:1px solid #6a1a9a;border-radius:5px}.label.svelte-1tmeyfg.svelte-1tmeyfg{margin-right:5px;font-size:10px;color:rgba(0, 0, 0, 0.5);font-variant:small-caps}p.svelte-1tmeyfg.svelte-1tmeyfg{margin:5px;overflow-wrap:anywhere}.box.svelte-1tmeyfg svg.svelte-1tmeyfg{min-width:24px;width:24px;margin-right:10px;fill:#6a1a9a}.box-reverse.svelte-1tmeyfg svg.svelte-1tmeyfg{min-width:30px;width:30px;margin-left:10px;fill:#6a1a9a}");
+}
+// (25:2) {#if entry[modelColumn]}
+function create_if_block(ctx) {
+	let div;
+	let svg;
+	let path;
+	let t0;
+	let p;
+	let t1_value = /*entry*/ ctx[0][/*modelColumn*/ ctx[1]] + "";
+	let t1;
+	return {
+		c() {
+			div = element("div");
+			svg = svg_element("svg");
+			path = svg_element("path");
+			t0 = space();
+			p = element("p");
+			t1 = text(t1_value);
+			this.h();
+		},
+		l(nodes) {
+			div = claim_element(nodes, "DIV", { class: true });
+			var div_nodes = children(div);
+			svg = claim_svg_element(div_nodes, "svg", { xmlns: true, viewBox: true, class: true });
+			var svg_nodes = children(svg);
+			path = claim_svg_element(svg_nodes, "path", { d: true });
+			children(path).forEach(detach);
+			svg_nodes.forEach(detach);
+			t0 = claim_space(div_nodes);
+			p = claim_element(div_nodes, "P", { class: true });
+			var p_nodes = children(p);
+			t1 = claim_text(p_nodes, t1_value);
+			p_nodes.forEach(detach);
+			div_nodes.forEach(detach);
+			this.h();
+		},
+		h() {
+			attr(path, "d", "M320 0c17.7 0 32 14.3 32 32V96H472c39.8 0 72 32.2 72 72V440c0 39.8-32.2 72-72 72H168c-39.8 0-72-32.2-72-72V168c0-39.8 32.2-72 72-72H288V32c0-17.7 14.3-32 32-32zM208 384c-8.8 0-16 7.2-16 16s7.2 16 16 16h32c8.8 0 16-7.2 16-16s-7.2-16-16-16H208zm96 0c-8.8 0-16 7.2-16 16s7.2 16 16 16h32c8.8 0 16-7.2 16-16s-7.2-16-16-16H304zm96 0c-8.8 0-16 7.2-16 16s7.2 16 16 16h32c8.8 0 16-7.2 16-16s-7.2-16-16-16H400zM264 256a40 40 0 1 0 -80 0 40 40 0 1 0 80 0zm152 40a40 40 0 1 0 0-80 40 40 0 1 0 0 80zM48 224H64V416H48c-26.5 0-48-21.5-48-48V272c0-26.5 21.5-48 48-48zm544 0c26.5 0 48 21.5 48 48v96c0 26.5-21.5 48-48 48H576V224h16z");
+			attr(svg, "xmlns", "http://www.w3.org/2000/svg");
+			attr(svg, "viewBox", "0 0 640 512");
+			attr(svg, "class", "svelte-1tmeyfg");
+			attr(p, "class", "chat svelte-1tmeyfg");
+			attr(div, "class", "box-reverse svelte-1tmeyfg");
+		},
+		m(target, anchor) {
+			insert_hydration(target, div, anchor);
+			append_hydration(div, svg);
+			append_hydration(svg, path);
+			append_hydration(div, t0);
+			append_hydration(div, p);
+			append_hydration(p, t1);
+		},
+		p(ctx, dirty) {
+			if (dirty & /*entry, modelColumn*/ 3 && t1_value !== (t1_value = /*entry*/ ctx[0][/*modelColumn*/ ctx[1]] + "")) set_data(t1, t1_value);
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+		}
+	};
+}
+function create_fragment(ctx) {
+	let div2;
+	let div0;
+	let svg;
+	let path;
+	let t0;
+	let p0;
+	let t1_value = /*entry*/ ctx[0][/*dataColumn*/ ctx[3]] + "";
+	let t1;
+	let t2;
+	let t3;
+	let div1;
+	let span;
+	let t4;
+	let t5;
+	let p1;
+	let t6_value = /*entry*/ ctx[0][/*labelColumn*/ ctx[2]] + "";
+	let t6;
+	let if_block = /*entry*/ ctx[0][/*modelColumn*/ ctx[1]] && create_if_block(ctx);
+	return {
+		c() {
+			div2 = element("div");
+			div0 = element("div");
+			svg = svg_element("svg");
+			path = svg_element("path");
+			t0 = space();
+			p0 = element("p");
+			t1 = text(t1_value);
+			t2 = space();
+			if (if_block) if_block.c();
+			t3 = space();
+			div1 = element("div");
+			span = element("span");
+			t4 = text("label:");
+			t5 = space();
+			p1 = element("p");
+			t6 = text(t6_value);
+			this.h();
+		},
+		l(nodes) {
+			div2 = claim_element(nodes, "DIV", { id: true, class: true });
+			var div2_nodes = children(div2);
+			div0 = claim_element(div2_nodes, "DIV", { class: true });
+			var div0_nodes = children(div0);
+			svg = claim_svg_element(div0_nodes, "svg", { xmlns: true, viewBox: true, class: true });
+			var svg_nodes = children(svg);
+			path = claim_svg_element(svg_nodes, "path", { d: true });
+			children(path).forEach(detach);
+			svg_nodes.forEach(detach);
+			t0 = claim_space(div0_nodes);
+			p0 = claim_element(div0_nodes, "P", { class: true });
+			var p0_nodes = children(p0);
+			t1 = claim_text(p0_nodes, t1_value);
+			p0_nodes.forEach(detach);
+			div0_nodes.forEach(detach);
+			t2 = claim_space(div2_nodes);
+			if (if_block) if_block.l(div2_nodes);
+			t3 = claim_space(div2_nodes);
+			div1 = claim_element(div2_nodes, "DIV", { class: true });
+			var div1_nodes = children(div1);
+			span = claim_element(div1_nodes, "SPAN", { class: true });
+			var span_nodes = children(span);
+			t4 = claim_text(span_nodes, "label:");
+			span_nodes.forEach(detach);
+			t5 = claim_space(div1_nodes);
+			p1 = claim_element(div1_nodes, "P", { class: true });
+			var p1_nodes = children(p1);
+			t6 = claim_text(p1_nodes, t6_value);
+			p1_nodes.forEach(detach);
+			div1_nodes.forEach(detach);
+			div2_nodes.forEach(detach);
+			this.h();
+		},
+		h() {
+			attr(path, "d", "M224 256A128 128 0 1 0 224 0a128 128 0 1 0 0 256zm-45.7 48C79.8 304 0 383.8 0 482.3C0 498.7 13.3 512 29.7 512H418.3c16.4 0 29.7-13.3 29.7-29.7C448 383.8 368.2 304 269.7 304H178.3z");
+			attr(svg, "xmlns", "http://www.w3.org/2000/svg");
+			attr(svg, "viewBox", "0 0 448 512");
+			attr(svg, "class", "svelte-1tmeyfg");
+			attr(p0, "class", "chat svelte-1tmeyfg");
+			attr(div0, "class", "box svelte-1tmeyfg");
+			attr(span, "class", "label svelte-1tmeyfg");
+			attr(p1, "class", "svelte-1tmeyfg");
+			attr(div1, "class", "box svelte-1tmeyfg");
+			attr(div2, "id", "container");
+			attr(div2, "class", "svelte-1tmeyfg");
+		},
+		m(target, anchor) {
+			insert_hydration(target, div2, anchor);
+			append_hydration(div2, div0);
+			append_hydration(div0, svg);
+			append_hydration(svg, path);
+			append_hydration(div0, t0);
+			append_hydration(div0, p0);
+			append_hydration(p0, t1);
+			append_hydration(div2, t2);
+			if (if_block) if_block.m(div2, null);
+			append_hydration(div2, t3);
+			append_hydration(div2, div1);
+			append_hydration(div1, span);
+			append_hydration(span, t4);
+			append_hydration(div1, t5);
+			append_hydration(div1, p1);
+			append_hydration(p1, t6);
+		},
+		p(ctx, [dirty]) {
+			if (dirty & /*entry, dataColumn*/ 9 && t1_value !== (t1_value = /*entry*/ ctx[0][/*dataColumn*/ ctx[3]] + "")) set_data(t1, t1_value);
+			if (/*entry*/ ctx[0][/*modelColumn*/ ctx[1]]) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+				} else {
+					if_block = create_if_block(ctx);
+					if_block.c();
+					if_block.m(div2, t3);
+				}
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
+			}
+			if (dirty & /*entry, labelColumn*/ 5 && t6_value !== (t6_value = /*entry*/ ctx[0][/*labelColumn*/ ctx[2]] + "")) set_data(t6, t6_value);
+		},
+		i: noop,
+		o: noop,
+		d(detaching) {
+			if (detaching) detach(div2);
+			if (if_block) if_block.d();
+		}
+	};
+}
+function instance($$self, $$props, $$invalidate) {
+	let { options } = $$props;
+	let { entry } = $$props;
+	let { modelColumn } = $$props;
+	let { labelColumn } = $$props;
+	let { dataColumn } = $$props;
+	let { idColumn } = $$props;
+	$$self.$$set = $$props => {
+		if ('options' in $$props) $$invalidate(4, options = $$props.options);
+		if ('entry' in $$props) $$invalidate(0, entry = $$props.entry);
+		if ('modelColumn' in $$props) $$invalidate(1, modelColumn = $$props.modelColumn);
+		if ('labelColumn' in $$props) $$invalidate(2, labelColumn = $$props.labelColumn);
+		if ('dataColumn' in $$props) $$invalidate(3, dataColumn = $$props.dataColumn);
+		if ('idColumn' in $$props) $$invalidate(5, idColumn = $$props.idColumn);
+	};
+	return [entry, modelColumn, labelColumn, dataColumn, options, idColumn];
+}
+class InstanceView extends SvelteComponent {
+	constructor(options) {
+		super();
+		init(
+			this,
+			options,
+			instance,
+			create_fragment,
+			safe_not_equal,
+			{
+				options: 4,
+				entry: 0,
+				modelColumn: 1,
+				labelColumn: 2,
+				dataColumn: 3,
+				idColumn: 5
+			},
+			add_css
+		);
+	}
+}
+function getInstance(
+  div,
+  viewOptions,
+  entry,
+  modelColumn,
+  labelColumn,
+  dataColumn,
+  idColumn
+) {
+  new InstanceView({
+    target: div,
+    props: {
+      entry: entry,
+      viewOptions: viewOptions,
+      modelColumn: modelColumn,
+      labelColumn: labelColumn,
+      dataColumn: dataColumn,
+      idColumn: idColumn,
+    },
+    hydrate: true,
+  });
+}
+// export function getOptions(div, setOptions) {
+//   new OptionsView({
+//     target: div,
+//     props: {
+//       setOptions,
+//     },
+//   });
+// }
+export { getInstance };

Dockerfile ADDED Viewed

	@@ -0,0 +1,22 @@

+# read the doc: https://huggingface.co/docs/hub/spaces-sdks-docker
+# you will also find guides on how best to write your Dockerfile
+FROM python:3.8
+RUN useradd -m -u 1000 user
+USER user
+# Set home to the user's home directory
+ENV HOME=/home/user \
+	PATH=/home/user/.local/bin:$PATH
+WORKDIR $HOME/app
+# Copy the current directory contents into the container at $HOME/app setting the owner to the user
+COPY --chown=user . $HOME/app
+ADD --chown=user ./.zeno_cache $HOME/app/.zeno_cache
+RUN chown user:user -R $HOME/app
+COPY ./requirements.txt /code/requirements.txt
+RUN pip install --no-cache-dir --upgrade -r /code/requirements.txt
+CMD ["zeno", "config.toml"]

README.md CHANGED Viewed

@@ -1,11 +1,12 @@
 ---
-title: Langchain Qa
 emoji: 📚
 colorFrom: yellow
 colorTo: blue
 sdk: docker
 pinned: false
 license: mit
 ---
 Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

 ---
+title: Langchain QA
 emoji: 📚
 colorFrom: yellow
 colorTo: blue
 sdk: docker
 pinned: false
 license: mit
+fullWidth: true
 ---
 Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

config.toml ADDED Viewed

	@@ -0,0 +1,9 @@

+view = 'chatbot'
+functions = "model.py"
+metadata = 'questions.csv'
+models = ['GPT-3']
+data_column = 'input'
+label_column = 'label'
+port = 7860
+host = "0.0.0.0"
+editable = false

docs.index ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:e3518510defd75cc93dd35df279adef244eb0ba132f7fb9cae4d14fee7f1c2dc
+size 1191981

faiss_store.pkl ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:a02ec296c893613554f7af8f14afe4c3bed49fa573344ad9c65ddca46a176818
+size 268325

model.py ADDED Viewed

	@@ -0,0 +1,44 @@

+import pickle
+import faiss
+from langchain import OpenAI
+from langchain.chains import VectorDBQAWithSourcesChain
+from zeno import ZenoOptions, distill, metric, model
+@model
+def get_model(model_name):
+    # Blendle Notion chatbot example from:
+    # https://github.com/hwchase17/chat-langchain-notion
+    index = faiss.read_index("./docs.index")
+    with open("./faiss_store.pkl", "rb") as f:
+        store = pickle.load(f)
+    store.index = index
+    chain = VectorDBQAWithSourcesChain.from_llm(
+        llm=OpenAI(temperature=0), vectorstore=store
+    )
+    def pred(df, ops: ZenoOptions):
+        res = []
+        for question in df[ops.data_column]:
+            result = chain({"question": question})
+            res.append(
+                "Answer: {}\nSources: {}".format(result["answer"], result["sources"])
+            )
+        return res
+    return pred
+@distill
+def correct(df, ops: ZenoOptions):
+    return df.apply(
+        lambda x: x[ops.label_column].lower() in x[ops.output_column].lower(), axis=1
+    )
+@metric
+def accuracy(df, ops: ZenoOptions):
+    return df[ops.distill_columns["correct"]].astype(int).mean()

questions.csv ADDED Viewed

	@@ -0,0 +1,22 @@

+input,label,question_type,present_in_database
+How much money do employees make on average?,"I don't know",how,false
+How many days off do employees get?,"unlimited",how,true
+What type of healthcare does Blendle provide?,"I don't know",what,false
+What is the learning budget?,"I don't know",what,false
+Does Blendle have a learning budget?,"yes",yesno,true
+Should I have weekly one-on-ones with my manager?,"recommended",yesno,true
+Why is this document public?,"feedback",why,true
+Who should I email about issues with these documents?,"hr@blendle.com",who,true
+How long does someone I referred have to work at Blendle for me to get a bonus?,"month",how,true
+What is the severance package?,"I don't know",what,false
+Who is the CEO of Blendle?,"I don't know",who,false
+What is the Matrix?,"feedback",what,true
+Are there free massages at Blendle?,"yes",yesno,true
+What card do I get for train travel?,"NS",what,true
+Will Blendle buy me a bike?,"no",yesno,false
+Do I need a receipt to reimburse my expenses?,"yes",yesno,true
+Can I drive to the office?,"I don't know",yesno,false
+How much stock compensation do I get?,"I don't know",how,false
+When is salary review?,"january",when,true
+Who is the head of people?,"gemma",who,true
+Where is the company based?,"utrecht",where,true

requirements.txt ADDED Viewed

	@@ -0,0 +1,5 @@

+zenoml>=0.3.10
+langchain
+zenoml
+faiss-cpu
+openai