@adobe/data 0.2.0 → 0.2.2

package/asconfig.json

@@ -1,22 +0,0 @@
-{
-  "targets": {
-    "debug": {
-      "outFile": "build/debug.wasm",
-      "textFile": "build/debug.wat",
-      "sourceMap": true,
-      "debug": true
-    },
-    "release": {
-      "outFile": "build/release.wasm",
-      "textFile": "build/release.wat",
-      "sourceMap": true,
-      "optimizeLevel": 3,
-      "shrinkLevel": 0,
-      "converge": false,
-      "noAssert": false
-    }
-  },
-  "options": {
-    "bindings": "esm"
-  }
-}

package/assembly/index.ts

@@ -1,85 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-export function add(a: i32, b: i32): i32 {
-  return a + b;
-}
-
-export function addF32Arrays(aPtr: usize, bPtr: usize, length: u32): void {
-  // now handle any remaining elements
-  for (let i: u32 = 0 /*length & ~7*/; i < length; i++) {
-    const aOffset = aPtr + (i << 2); // i * 4 (each Float32 is 4 bytes)
-    const bOffset = bPtr + (i << 2);
-
-    const va = f32.load(aOffset);
-    const vb = f32.load(bOffset);
-
-    f32.store(aOffset, va + vb);
-  }
-}
-
-export function addF32ArraysSimd4(aPtr: usize, bPtr: usize, length: u32): void {
-  const stride = 4; // Process 4 f32 elements per SIMD operation
-  let i: u32 = 0;
-  const end = length - stride;
-
-  // Handle SIMD operations for chunks of 4 elements
-  for (; i < end; i += stride) {
-    v128.store(aPtr, f32x4.add(v128.load(aPtr), v128.load(bPtr)));
-    aPtr += stride * sizeof<f32>();
-    bPtr += stride * sizeof<f32>();
-  }
-
-  // Handle remaining elements that aren't divisible by 4
-  for (; i < length; i++) {
-    store<f32>(aPtr, load<f32>(aPtr) + load<f32>(bPtr));
-    aPtr += sizeof<f32>();
-    bPtr += sizeof<f32>();
-  }
-}
-
-export function addF32ArraysSimd4Unrolled(aPtr: usize, bPtr: usize, length: u32): void {
-  const stride = 4; // Process 4 f32 elements per SIMD operation
-  const unrollFactor = 2; // Number of SIMD operations per loop iteration
-  const totalStride = stride * unrollFactor; // Total elements processed per loop iteration
-  let i: u32 = 0;
-  const end = length - (length % totalStride);
-
-  // Handle SIMD operations for chunks of totalStride elements
-  for (; i < end; i += totalStride) {
-    // First SIMD operation
-    v128.store(aPtr, f32x4.add(v128.load(aPtr), v128.load(bPtr)));
-    aPtr += stride * sizeof<f32>();
-    bPtr += stride * sizeof<f32>();
-
-    // Second SIMD operation
-    v128.store(aPtr, f32x4.add(v128.load(aPtr), v128.load(bPtr)));
-    aPtr += stride * sizeof<f32>();
-    bPtr += stride * sizeof<f32>();
-  }
-
-  // Handle remaining elements that aren't divisible by totalStride
-  for (; i < length; i++) {
-    store<f32>(aPtr, load<f32>(aPtr) + load<f32>(bPtr));
-    aPtr += sizeof<f32>();
-    bPtr += sizeof<f32>();
-  }
-}

package/assembly/tsconfig.json

@@ -1,17 +0,0 @@
-{
-  "compilerOptions": {
-    "target": "esnext",
-    "module": "esnext",
-    "noEmit": true,
-    "types": [],
-    "strict": false,
-    "noImplicitAny": false,
-    "noUnusedLocals": false,
-    "noUnusedParameters": false,
-    "experimentalDecorators": true
-  },
-  "include": [
-    "./**/*.ts"
-  ],
-  "extends": "../../node_modules/.pnpm/assemblyscript@0.27.30/node_modules/assemblyscript/std/assembly.json"
-}

package/c/build_run.sh

@@ -1,2 +0,0 @@
-
-clang -O3 -march=armv8-a+simd -mtune=native -o vector_addition vector_addition.c && ./vector_addition

package/c/vector_addition.c

@@ -1,125 +0,0 @@
-/*************************************************************************
- *
- * ADOBE CONFIDENTIAL
- * ___________________
- *
- *  Copyright 2025 Adobe
- *  All Rights Reserved.
- *
- * NOTICE: All information contained herein is, and remains
- * the property of Adobe and its suppliers, if any. The intellectual
- * and technical concepts contained herein are proprietary to Adobe
- * and its suppliers and are protected by all applicable intellectual
- * property laws, including trade secret and copyright laws.
- * Dissemination of this information or reproduction of this material
- * is strictly forbidden unless prior written permission is obtained
- * from Adobe.
- **************************************************************************/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <arm_neon.h>
-#include <time.h>
-#include <pthread.h>
-
-// Vector3 struct to store three floats
-typedef struct
-{
-    float x, y, z;
-} Vector3;
-
-#define ARRAY_SIZE 250000
-#define NUM_RUNS 10
-
-//  When this runs with interleaved data we get  5400 MFLOPS
-//  When I run with non interleaved data we get 17000 MFLOPS
-
-// High precision timer function using clock_gettime with CLOCK_MONOTONIC_RAW
-double get_time()
-{
-    struct timespec ts;
-    clock_gettime(CLOCK_MONOTONIC_RAW, &ts);
-    return ts.tv_sec + ts.tv_nsec * 1e-9;
-}
-
-void add_vectors(Vector3 *a, Vector3 *b, Vector3 *result, int size)
-{
-    for (int i = 0; i < size; i += 4)
-    {
-        // Load 4 Vector3 elements from both arrays (12 floats in total for each array)
-        float32x4_t ax = vld1q_f32(&a[i].x);
-        float32x4_t ay = vld1q_f32(&a[i].y);
-        float32x4_t az = vld1q_f32(&a[i].z);
-
-        float32x4_t bx = vld1q_f32(&b[i].x);
-        float32x4_t by = vld1q_f32(&b[i].y);
-        float32x4_t bz = vld1q_f32(&b[i].z);
-
-        // Add corresponding components using SIMD
-        float32x4_t rx = vaddq_f32(ax, bx);
-        float32x4_t ry = vaddq_f32(ay, by);
-        float32x4_t rz = vaddq_f32(az, bz);
-
-        // Store the result back into the result array
-        vst1q_f32(&result[i].x, rx);
-        vst1q_f32(&result[i].y, ry);
-        vst1q_f32(&result[i].z, rz);
-    }
-}
-
-int main()
-{
-    // Allocate memory for the two arrays and the result array
-    Vector3 *a = (Vector3 *)aligned_alloc(16, ARRAY_SIZE * sizeof(Vector3));
-    Vector3 *b = (Vector3 *)aligned_alloc(16, ARRAY_SIZE * sizeof(Vector3));
-    Vector3 *result = (Vector3 *)aligned_alloc(16, ARRAY_SIZE * sizeof(Vector3));
-
-    // Initialize arrays with some data
-    for (int i = 0; i < ARRAY_SIZE; i++)
-    {
-        a[i].x = i * 0.1f;
-        a[i].y = i * 0.2f;
-        a[i].z = i * 0.3f;
-        b[i].x = i * 0.4f;
-        b[i].y = i * 0.5f;
-        b[i].z = i * 0.6f;
-    }
-
-    // Use volatile to prevent the compiler from optimizing away the result
-    volatile float sink = 0.0f;
-
-    // Perform the vector addition NUM_RUNS times and measure the time
-    double start_time = get_time();
-
-    for (int run = 0; run < NUM_RUNS; run++)
-    {
-        add_vectors(a, b, result, ARRAY_SIZE);
-
-        // Force the compiler to keep the result
-        sink += result[0].x + result[0].y + result[0].z;
-    }
-
-    double end_time = get_time();
-
-    // Calculate elapsed time
-    double total_time = end_time - start_time;
-    double average_time = total_time / NUM_RUNS;
-
-    // Calculate MFLOPS
-    double total_flops = sizeof(Vector3) * ARRAY_SIZE * NUM_RUNS; // 3 operations per Vector3
-    double mflops_per_second = (total_flops / total_time) / 1e6;
-
-    printf("Average time per run: %f seconds\n", average_time);
-    printf("Total time: %f seconds\n", total_time);
-    printf("Performance: %f MFLOPS\n", mflops_per_second);
-
-    // Use sink to prevent dead-code elimination
-    printf("Sink: %f\n", sink);
-
-    // Free allocated memory
-    free(a);
-    free(b);
-    free(result);
-
-    return 0;
-}

package/config/license.js

@@ -1,21 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/

package/docs/perftest.html

@@ -1,28 +0,0 @@
-
-<html>
-<head>
-    <title>ECS Performance Test</title>
-</head>
-<body></body>
-    <h1>ECS Performance Test</h1>
-    <p>
-        This is the documentation for the Firefly Data API. The Firefly Data API is a RESTful API that allows you to interact with the Firefly Data service.
-    </p>
-    <p>
-        Performance tests running. View them in the developer console.
-    </p>
-    <script type="module">
-        function supportsHighResolutionPerformanceNow() {
-            // Check if the performance object and performance.now method exist
-            if (typeof performance !== 'undefined' && typeof performance.now === 'function') {
-                // Call performance.now and check if the result includes sub-millisecond precision
-                const result = performance.now();
-                return Math.floor(result) !== result;
-            }
-            return false;
-        }
-        console.log('supportsHighResolutionPerformanceNow:', supportsHighResolutionPerformanceNow());
-        import { run } from "../dist/perftest/index.js";
-        run();
-    </script>
-</html>

package/index.html

@@ -1,10 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-<script type="module">
-import { add } from "./build/release.js";
-document.body.innerText = add(1, 2);
-</script>
-</head>
-<body></body>
-</html>

package/scripts/deploy-docs.sh

@@ -1,41 +0,0 @@
-#!/bin/bash
-
-# Exit if any command fails
-set -e
-
-# Step 1: Ensure we are on the main branch
-current_branch=$(git branch --show-current)
-if [ "$current_branch" != "main" ]; then
-  echo "Error: You are on branch '$current_branch'. Please switch to 'main' before deploying."
-  exit 1
-fi
-
-# Step 2: Check for uncommitted changes
-if [[ -n $(git status --porcelain) ]]; then
-  echo "Error: You have uncommitted changes. Please commit or stash your changes before deploying."
-  exit 1
-fi
-
-# Step 3: Build the project
-echo "Building the project..."
-pnpm install
-pnpm run build
-
-# Step 4: Checkout gh-pages branch
-echo "Checking out the gh-pages branch..."
-git fetch origin
-git checkout gh-pages
-git pull origin gh-pages
-
-# Step 5: Commit and push the changes to gh-pages
-echo "Committing and pushing changes to gh-pages..."
-git checkout -f main -- README.md docs
-git add dist/ docs/ README.md
-git commit -m "Deploy updated docs and dist to GitHub Pages"
-git push origin gh-pages
-
-# Step 6: Switch back to the main branch
-echo "Switching back to the main branch..."
-git checkout main
-
-echo "Deployment to gh-pages complete!"

package/src/assembly-test/assembly.test.ts

@@ -1,29 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-import { describe, expect, test } from "vitest";
-import { add } from "../../dist/assembly/index.js";
-
-describe("Assembly", () => {
-  test("should be able to call assembly script functions", () => {
-    expect(add(40, 2)).toBe(42);
-  });
-});

package/src/cache/async-cache.ts

@@ -1,38 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-
-/**
- * This is a generalization of the browser built in Cache API.
- */
-export interface AsyncCache<K, V> {
-  put(key: K, value: V): Promise<void>;
-  match(key: K): Promise<V | undefined>;
-  delete(key: K): Promise<void>;
-}
-
-/**
- * Shouldn't be needed normally. Only used by ManagedAsyncCache.
- * We don't want to expose it externally so leaving out of main AsyncCache type.
- */
-export interface AsyncCacheWithKeys<K, V> extends AsyncCache<K, V> {
-  keys(): Promise<ReadonlyArray<K>>;
-}

package/src/cache/blob-store.test.ts

@@ -1,176 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-import { describe, it, expect, vi, beforeEach, afterEach } from "vitest";
-import { type BlobStore, createBlobStore } from "./blob-store.js";
-
-describe("blobStore", () => {
-    // Mock URL.createObjectURL and URL.revokeObjectURL
-    const mockCreateObjectURL = vi.fn((blob: Blob) => `blob:${Math.random()}`);
-    const mockRevokeObjectURL = vi.fn();
-    let testBlobStore: BlobStore;
-    let createdUrl: string;
-
-    beforeEach(async () => {
-        // Setup URL mock functions
-        const originalCreateObjectURL = URL.createObjectURL;
-        const originalRevokeObjectURL = URL.revokeObjectURL;
-
-        // Ensure we create a non-http URL
-        mockCreateObjectURL.mockImplementation((blob: Blob) => {
-            createdUrl = `blob:${Math.random()}`;
-            return createdUrl;
-        });
-
-        URL.createObjectURL = mockCreateObjectURL;
-        URL.revokeObjectURL = mockRevokeObjectURL;
-
-        // Clear mock call history
-        mockCreateObjectURL.mockClear();
-        mockRevokeObjectURL.mockClear();
-
-        testBlobStore = await createBlobStore();
-
-        return () => {
-            URL.createObjectURL = originalCreateObjectURL;
-            URL.revokeObjectURL = originalRevokeObjectURL;
-        };
-    });
-
-    afterEach(() => {
-        // Clean up any remaining borrowed URLs
-        mockCreateObjectURL.mockReset();
-        mockRevokeObjectURL.mockReset();
-    });
-
-    describe("URL reference counting", () => {
-        it("should reuse the same URL for multiple borrows of the same blob", async () => {
-            // Create a test blob
-            const testBlob = new Blob(["test"], { type: "text/plain" });
-            const blobRef = await testBlobStore.getRef(testBlob);
-
-            // Borrow the URL multiple times
-            const url1 = await testBlobStore.borrowUrl(blobRef);
-            const url2 = await testBlobStore.borrowUrl(blobRef);
-            const url3 = await testBlobStore.borrowUrl(blobRef);
-
-            expect(url1).toBeTruthy();
-            expect(url1).toBe(url2);
-            expect(url2).toBe(url3);
-            expect(url1).toMatch(/^blob:/); // Verify it's a blob URL
-
-            // createObjectURL should only be called once
-            expect(mockCreateObjectURL).toHaveBeenCalledTimes(1);
-
-            // Clean up
-            testBlobStore.returnUrl(url1);
-            testBlobStore.returnUrl(url2);
-            testBlobStore.returnUrl(url3);
-        });
-
-        it("should only revoke URL when all references are returned", async () => {
-            const testBlob = new Blob(["test"], { type: "text/plain" });
-            const blobRef = await testBlobStore.getRef(testBlob);
-
-            // Borrow the URL three times
-            const url1 = await testBlobStore.borrowUrl(blobRef);
-            const url2 = await testBlobStore.borrowUrl(blobRef);
-            const url3 = await testBlobStore.borrowUrl(blobRef);
-
-            expect(url1).toMatch(/^blob:/); // Verify it's a blob URL
-
-            // Return URLs one by one
-            testBlobStore.returnUrl(url1);
-            expect(mockRevokeObjectURL).not.toHaveBeenCalled();
-
-            testBlobStore.returnUrl(url2);
-            expect(mockRevokeObjectURL).not.toHaveBeenCalled();
-
-            testBlobStore.returnUrl(url3);
-            expect(mockRevokeObjectURL).toHaveBeenCalledTimes(1);
-            expect(mockRevokeObjectURL).toHaveBeenCalledWith(createdUrl);
-        });
-
-        it("should handle remote URLs correctly", async () => {
-            const remoteRef = testBlobStore.createRemoteBlobRef("http://example.com/image.jpg");
-
-            // Borrow remote URL multiple times
-            const url1 = await testBlobStore.borrowUrl(remoteRef);
-            const url2 = await testBlobStore.borrowUrl(remoteRef);
-
-            expect(url1).toBe("http://example.com/image.jpg");
-            expect(url2).toBe("http://example.com/image.jpg");
-            expect(mockCreateObjectURL).not.toHaveBeenCalled();
-
-            // Return URLs
-            testBlobStore.returnUrl(url1);
-            testBlobStore.returnUrl(url2);
-
-            // Should not revoke remote URLs
-            expect(mockRevokeObjectURL).not.toHaveBeenCalled();
-        });
-
-        it("should handle null inputs gracefully", async () => {
-            const nullUrl = await testBlobStore.borrowUrl(null);
-            expect(nullUrl).toBeNull();
-
-            // Should not throw when returning null
-            expect(() => testBlobStore.returnUrl(null)).not.toThrow();
-        });
-
-        it('demonstrates race condition in borrowUrl', async () => {
-            const store = testBlobStore;
-            const testBlob = new Blob(['test data'], { type: 'text/plain' });
-            const blobRef = await store.getRef(testBlob);
-
-            // Create an artificially delayed getBlob to simulate network latency
-            const originalGetBlob = store.getBlob;
-            store.getBlob = async (ref) => {
-                await new Promise(resolve => setTimeout(resolve, 50)); // Add delay
-                return originalGetBlob(ref);
-            };
-
-            // Make two parallel borrowUrl calls
-            const [url1, url2] = await Promise.all([
-                store.borrowUrl(blobRef),
-                store.borrowUrl(blobRef)
-            ]);
-
-            expect(url1).toBe(url2); // Same URL should be returned
-
-            // Return one of the URLs
-            store.returnUrl(url1);
-
-            // Verify that the borrow count is still 1 since we borrowed twice and returned once
-            expect(store._testGetBorrowCount(blobRef)).toBe(1);
-
-            // Return the second URL
-            store.returnUrl(url2);
-
-            // Verify the borrow count is now 0
-            expect(store._testGetBorrowCount(blobRef)).toBe(0);
-
-            // Verify the URL was revoked
-            expect(mockRevokeObjectURL).toHaveBeenCalledTimes(1);
-            expect(mockRevokeObjectURL).toHaveBeenCalledWith(url1);
-        });
-    });
-});