upstash-haystack 0.1.0__py3-none-any.whl

haystack_integrations/components/retrievers/upstash/__init__.py

@@ -0,0 +1,8 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+from .embedding_retriever import UpstashEmbeddingRetriever
+from .hybrid_retriever import UpstashHybridRetriever
+
+__all__ = ["UpstashEmbeddingRetriever", "UpstashHybridRetriever"]

haystack_integrations/components/retrievers/upstash/embedding_retriever.py

@@ -0,0 +1,108 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+from typing import Any
+
+from haystack import component, default_from_dict, default_to_dict
+from haystack.dataclasses import Document
+
+from haystack_integrations.document_stores.upstash import UpstashDocumentStore
+
+
+@component
+class UpstashEmbeddingRetriever:
+    """
+    A component for retrieving documents from an UpstashDocumentStore using dense embeddings.
+    """
+
+    def __init__(
+        self,
+        document_store: UpstashDocumentStore,
+        filters: dict[str, Any] | None = None,
+        top_k: int = 10,
+    ) -> None:
+        """
+        Initializes the UpstashEmbeddingRetriever.
+
+        :param document_store: The UpstashDocumentStore instance to retrieve documents from.
+        :param filters: Optional filters to narrow down the search space.
+        :param top_k: The maximum number of documents to retrieve.
+        """
+        self.document_store = document_store
+        self.filters = filters
+        self.top_k = top_k
+
+    def to_dict(self) -> dict[str, Any]:
+        """
+        Serializes this Retriever to a dictionary.
+
+        :returns: The serialized Retriever.
+        """
+        return default_to_dict(
+            self,
+            document_store=self.document_store.to_dict(),
+            filters=self.filters,
+            top_k=self.top_k,
+        )
+
+    @classmethod
+    def from_dict(cls, data: dict[str, Any]) -> "UpstashEmbeddingRetriever":
+        """
+        Deserializes a dictionary into a Retriever.
+
+        :param data: The serialized Retriever.
+        :returns: The deserialized Retriever.
+        """
+        data["init_parameters"]["document_store"] = UpstashDocumentStore.from_dict(
+            data["init_parameters"]["document_store"]
+        )
+        return default_from_dict(cls, data)
+
+    @component.output_types(documents=list[Document])
+    def run(
+        self,
+        query_embedding: list[float],
+        filters: dict[str, Any] | None = None,
+        top_k: int | None = None,
+    ) -> dict[str, Any]:
+        """
+        Retrieves documents matching the given query embedding.
+
+        :param query_embedding: The dense embedding to query for.
+        :param filters: Optional filters to narrow down the search space.
+        :param top_k: The maximum number of documents to retrieve.
+        :returns: A dictionary with the following keys:
+            - `documents`: List of documents matching the query.
+        """
+        filters = filters or self.filters
+        top_k = top_k or self.top_k
+
+        from haystack_integrations.document_stores.upstash.filters import _normalize_filters  # noqa: PLC0415
+
+        filter_str = ""
+        if filters:
+            filter_str = _normalize_filters(filters)
+
+        results = self.document_store._index.query(
+            vector=query_embedding,
+            top_k=top_k,
+            filter=filter_str,
+            include_metadata=True,
+            include_vectors=True,
+            include_data=True,
+        )
+
+        documents = []
+        for res in results:
+            documents.append(
+                Document(
+                    id=res.id,
+                    content=res.data,
+                    embedding=res.vector,
+                    meta=res.metadata or {},
+                    score=res.score,
+                )
+            )
+
+        return {"documents": documents}

haystack_integrations/components/retrievers/upstash/hybrid_retriever.py

@@ -0,0 +1,116 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+from typing import Any
+
+from haystack import component, default_from_dict, default_to_dict
+from haystack.dataclasses import Document, SparseEmbedding
+
+from haystack_integrations.document_stores.upstash import UpstashDocumentStore
+
+
+@component
+class UpstashHybridRetriever:
+    """
+    A component for retrieving documents from an UpstashDocumentStore.
+
+    Uses both dense and sparse embeddings, combined via Upstash Vector's native Reciprocal Rank Fusion.
+    """
+
+    def __init__(
+        self,
+        document_store: UpstashDocumentStore,
+        filters: dict[str, Any] | None = None,
+        top_k: int = 10,
+    ) -> None:
+        """
+        Initializes the UpstashHybridRetriever.
+
+        :param document_store: The UpstashDocumentStore instance to retrieve documents from.
+        :param filters: Optional filters to narrow down the search space.
+        :param top_k: The maximum number of documents to retrieve.
+        """
+        self.document_store = document_store
+        self.filters = filters
+        self.top_k = top_k
+
+    def to_dict(self) -> dict[str, Any]:
+        """
+        Serializes this Retriever to a dictionary.
+
+        :returns: The serialized Retriever.
+        """
+        return default_to_dict(
+            self,
+            document_store=self.document_store.to_dict(),
+            filters=self.filters,
+            top_k=self.top_k,
+        )
+
+    @classmethod
+    def from_dict(cls, data: dict[str, Any]) -> "UpstashHybridRetriever":
+        """
+        Deserializes a dictionary into a Retriever.
+
+        :param data: The serialized Retriever.
+        :returns: The deserialized Retriever.
+        """
+        data["init_parameters"]["document_store"] = UpstashDocumentStore.from_dict(
+            data["init_parameters"]["document_store"]
+        )
+        return default_from_dict(cls, data)
+
+    @component.output_types(documents=list[Document])
+    def run(
+        self,
+        query_embedding: list[float],
+        query_sparse_embedding: SparseEmbedding,
+        filters: dict[str, Any] | None = None,
+        top_k: int | None = None,
+    ) -> dict[str, Any]:
+        """
+        Retrieves documents matching the given dense and sparse query embeddings.
+
+        :param query_embedding: The dense embedding to query for.
+        :param query_sparse_embedding: The sparse embedding to query for.
+        :param filters: Optional filters to narrow down the search space.
+        :param top_k: The maximum number of documents to retrieve.
+        :returns: A dictionary with the following keys:
+            - `documents`: List of documents matching the query.
+        """
+        filters = filters or self.filters
+        top_k = top_k or self.top_k
+
+        from haystack_integrations.document_stores.upstash.filters import _normalize_filters  # noqa: PLC0415
+
+        filter_str = ""
+        if filters:
+            filter_str = _normalize_filters(filters)
+
+        # Parse query_sparse_embedding
+        sparse_vec = (list(query_sparse_embedding.indices), list(query_sparse_embedding.values))
+
+        results = self.document_store._index.query(
+            vector=query_embedding,
+            sparse_vector=sparse_vec,
+            top_k=top_k,
+            filter=filter_str,
+            include_metadata=True,
+            include_vectors=True,
+            include_data=True,
+        )
+
+        documents = []
+        for res in results:
+            documents.append(
+                Document(
+                    id=res.id,
+                    content=res.data,
+                    embedding=res.vector,
+                    meta=res.metadata or {},
+                    score=res.score,
+                )
+            )
+
+        return {"documents": documents}

haystack_integrations/document_stores/upstash/__init__.py

@@ -0,0 +1,7 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+from .document_store import UpstashDocumentStore
+
+__all__ = ["UpstashDocumentStore"]

haystack_integrations/document_stores/upstash/document_store.py

@@ -0,0 +1,191 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+import logging
+from typing import Any
+
+from haystack import default_from_dict, default_to_dict
+from haystack.dataclasses import Document
+from haystack.document_stores.errors import DocumentStoreError, DuplicateDocumentError
+from haystack.document_stores.types import DuplicatePolicy
+from haystack.utils.auth import Secret, deserialize_secrets_inplace
+from upstash_vector import Index
+
+from .filters import _normalize_filters
+
+logger = logging.getLogger(__name__)
+
+TOP_K_LIMIT = 1000
+
+
+class UpstashDocumentStore:
+    """
+    A Document Store using Upstash Vector as the backend.
+    """
+
+    def __init__(
+        self,
+        url: Secret = Secret.from_env_var("UPSTASH_VECTOR_REST_URL"),
+        token: Secret = Secret.from_env_var("UPSTASH_VECTOR_REST_TOKEN"),
+    ) -> None:
+        """
+        Initializes the UpstashDocumentStore.
+
+        :param url: The URL of the Upstash Vector index.
+        :param token: The REST token for the Upstash Vector index.
+        """
+        self.url = url
+        self.token = token
+        url_val = url.resolve_value()
+        token_val = token.resolve_value()
+        if not isinstance(url_val, str) or not isinstance(token_val, str):
+            msg = "Upstash Vector URL and Token must be valid strings."
+            raise ValueError(msg)
+        self._index = Index(url=url_val, token=token_val)
+
+    def to_dict(self) -> dict[str, Any]:
+        """
+        Serializes this Document Store to a dictionary.
+
+        :returns: The serialized Document Store.
+        """
+        return default_to_dict(
+            self,
+            url=self.url.to_dict(),
+            token=self.token.to_dict(),
+        )
+
+    @classmethod
+    def from_dict(cls, data: dict[str, Any]) -> "UpstashDocumentStore":
+        """
+        Deserializes a dictionary into a Document Store.
+
+        :param data: The serialized Document Store.
+        :returns: The deserialized Document Store.
+        """
+        deserialize_secrets_inplace(data["init_parameters"], keys=["url", "token"])
+        return default_from_dict(cls, data)
+
+    def count_documents(self) -> int:
+        """
+        Returns the number of documents in the Document Store.
+
+        :returns: The total number of documents in the Upstash Vector index.
+        """
+        return self._index.info().vector_count
+
+    def write_documents(
+        self,
+        documents: list[Document],
+        policy: DuplicatePolicy = DuplicatePolicy.NONE,
+    ) -> int:
+        """
+        Writes documents to the Upstash Vector index.
+
+        :param documents: A list of Documents to be written to the Document Store.
+        :param policy: The duplicate policy to apply when a document with the same ID already exists.
+            If `DuplicatePolicy.NONE`, it defaults to `DuplicatePolicy.OVERWRITE`.
+            `DuplicatePolicy.FAIL` will raise a `DuplicateDocumentError`.
+            `DuplicatePolicy.SKIP` will skip existing documents.
+            `DuplicatePolicy.OVERWRITE` will replace existing documents.
+        :returns: The number of documents written.
+        :raises DuplicateDocumentError: If a document with the same ID already exists and `policy` is `FAIL`.
+        :raises DocumentStoreError: If a document does not have an embedding.
+        """
+        if len(documents) == 0:
+            return 0
+
+        if policy == DuplicatePolicy.NONE:
+            policy = DuplicatePolicy.OVERWRITE
+
+        if policy in [DuplicatePolicy.SKIP, DuplicatePolicy.FAIL]:
+            # Fetch existing to handle SKIP/FAIL
+            existing = self._index.fetch([doc.id for doc in documents])
+            existing_ids = [res.id for res in existing if res is not None]
+            if existing_ids:
+                if policy == DuplicatePolicy.FAIL:
+                    msg = f"Documents {existing_ids} already exist."
+                    raise DuplicateDocumentError(msg)
+                # If SKIP, filter them out
+                documents = [doc for doc in documents if doc.id not in existing_ids]
+                if not documents:
+                    return 0
+
+        vectors = []
+        for doc in documents:
+            if doc.embedding is None:
+                msg = f"Document {doc.id} must have an embedding."
+                raise DocumentStoreError(msg)
+
+            metadata = doc.meta.copy() if doc.meta else {}
+            vector_dict = {"id": doc.id, "vector": doc.embedding, "metadata": metadata}
+            if doc.content is not None:
+                vector_dict["data"] = doc.content
+            if hasattr(doc, "sparse_embedding") and doc.sparse_embedding is not None:
+                vector_dict["sparse_vector"] = (list(doc.sparse_embedding.indices), list(doc.sparse_embedding.values))
+
+            vectors.append(vector_dict)
+
+        # Upsert in batches of 1000
+        for i in range(0, len(vectors), 1000):
+            self._index.upsert(vectors=vectors[i : i + 1000])
+
+        return len(documents)
+
+    def delete_documents(self, document_ids: list[str]) -> None:
+        """
+        Deletes documents from the Document Store by their IDs.
+
+        :param document_ids: A list of document IDs to delete.
+        """
+        if not document_ids:
+            return
+
+        # Delete in batches
+        for i in range(0, len(document_ids), 1000):
+            self._index.delete(document_ids[i : i + 1000])
+
+    def filter_documents(self, filters: dict[str, Any] | None = None) -> list[Document]:
+        """
+        Retrieves documents from the Document Store that match the given filters.
+
+        Note: Due to backend limitations, this method retrieves a maximum of 10,000 documents.
+
+        :param filters: The filters to apply.
+        :returns: A list of Documents that match the filters.
+        """
+        filter_str = ""
+        if filters:
+            filter_str = _normalize_filters(filters)
+
+        dim = self._index.info().dimension
+        dummy_vector = [1.0] + [0.0] * (dim - 1)
+
+        results = self._index.query(
+            vector=dummy_vector,
+            top_k=TOP_K_LIMIT,
+            filter=filter_str,
+            include_metadata=True,
+            include_vectors=True,
+            include_data=True,
+        )
+
+        if len(results) == TOP_K_LIMIT:
+            logger.warning(
+                "Upstash Vector allows a maximum of 1,000 documents to be retrieved by a filter. "
+                "The result might be truncated."
+            )
+
+        documents = []
+        for res in results:
+            documents.append(
+                Document(
+                    id=res.id,
+                    content=res.data,
+                    embedding=res.vector,
+                    meta=res.metadata or {},
+                )
+            )
+
+        return documents

haystack_integrations/document_stores/upstash/filters.py

@@ -0,0 +1,130 @@
+# SPDX-FileCopyrightText: 2026-present Avish Sinha <avishsinha10@gmail.com>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+from typing import Any
+
+from haystack.errors import FilterError
+
+
+def _normalize_filters(filters: dict[str, Any]) -> str:
+    """
+    Converts Haystack filters into Upstash Vector SQL-like filter strings.
+    """
+    if not isinstance(filters, dict):
+        msg = "Filters must be a dictionary"
+        raise FilterError(msg)
+
+    if "field" in filters:
+        return _parse_comparison_condition(filters)
+    return _parse_logical_condition(filters)
+
+
+def _parse_logical_condition(condition: dict[str, Any]) -> str:
+    if "operator" not in condition:
+        msg = f"'operator' key missing in {condition}"
+        raise FilterError(msg)
+    if "conditions" not in condition:
+        msg = f"'conditions' key missing in {condition}"
+        raise FilterError(msg)
+
+    operator = condition["operator"]
+    if operator not in ["AND", "OR", "NOT"]:
+        msg = f"Unknown logical operator '{operator}'"
+        raise FilterError(msg)
+
+    parsed_conditions = [_normalize_filters(c) for c in condition["conditions"]]
+    if operator == "NOT":
+        if len(parsed_conditions) != 1:
+            msg = "NOT operator needs exactly one condition"
+            raise FilterError(msg)
+        return f"NOT ({parsed_conditions[0]})"
+    else:
+        joined = f" {operator} ".join(f"({c})" for c in parsed_conditions)
+        return joined
+
+
+def _parse_comparison_condition(condition: dict[str, Any]) -> str:
+    if "field" not in condition:
+        return _parse_logical_condition(condition)
+
+    field = condition["field"]
+    if "operator" not in condition:
+        msg = f"'operator' key missing in {condition}"
+        raise FilterError(msg)
+    if "value" not in condition:
+        msg = f"'value' key missing in {condition}"
+        raise FilterError(msg)
+
+    if field.startswith("meta."):
+        field = field[5:]
+
+    operator = condition["operator"]
+    value = condition["value"]
+
+    return COMPARISON_OPERATORS[operator](field, value)
+
+
+def _format_value(value: Any) -> str:
+    if isinstance(value, str):
+        # Escape single quotes by doubling them
+        escaped = value.replace("'", "''")
+        return f"'{escaped}'"
+    elif isinstance(value, bool):
+        return "true" if value else "false"
+    elif isinstance(value, (int, float)):
+        return str(value)
+    msg = f"Unsupported value type {type(value)}"
+    raise FilterError(msg)
+
+
+def _equal(field: str, value: Any) -> str:
+    return f"{field} = {_format_value(value)}"
+
+
+def _not_equal(field: str, value: Any) -> str:
+    return f"{field} != {_format_value(value)}"
+
+
+def _greater_than(field: str, value: Any) -> str:
+    return f"{field} > {_format_value(value)}"
+
+
+def _greater_than_equal(field: str, value: Any) -> str:
+    return f"{field} >= {_format_value(value)}"
+
+
+def _less_than(field: str, value: Any) -> str:
+    return f"{field} < {_format_value(value)}"
+
+
+def _less_than_equal(field: str, value: Any) -> str:
+    return f"{field} <= {_format_value(value)}"
+
+
+def _in(field: str, value: Any) -> str:
+    if not isinstance(value, list):
+        msg = "Value for 'in' must be a list"
+        raise FilterError(msg)
+    formatted_values = ", ".join(_format_value(v) for v in value)
+    return f"{field} IN ({formatted_values})"
+
+
+def _not_in(field: str, value: Any) -> str:
+    if not isinstance(value, list):
+        msg = "Value for 'not in' must be a list"
+        raise FilterError(msg)
+    formatted_values = ", ".join(_format_value(v) for v in value)
+    return f"{field} NOT IN ({formatted_values})"
+
+
+COMPARISON_OPERATORS = {
+    "==": _equal,
+    "!=": _not_equal,
+    ">": _greater_than,
+    ">=": _greater_than_equal,
+    "<": _less_than,
+    "<=": _less_than_equal,
+    "in": _in,
+    "not in": _not_in,
+}

upstash_haystack-0.1.0.dist-info/METADATA

@@ -0,0 +1,175 @@
+Metadata-Version: 2.4
+Name: upstash-haystack
+Version: 0.1.0
+Summary: An integration of Upstash Vector with Haystack.
+Project-URL: Documentation, https://github.com/avish006/upstash-haystack#readme
+Project-URL: Issues, https://github.com/avish006/upstash-haystack/issues
+Project-URL: Source, https://github.com/avish006/upstash-haystack
+Author-email: Avish Sinha <avishsinha10@gmail.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: document store,haystack,hybrid search,retriever,upstash,vector database
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Programming Language :: Python :: Implementation :: PyPy
+Requires-Python: >=3.10
+Requires-Dist: haystack-ai
+Requires-Dist: upstash-vector
+Description-Content-Type: text/markdown
+
+# upstash-haystack
+
+[![PyPI - Version](https://img.shields.io/pypi/v/upstash-haystack?color=blue&label=pypi)](https://pypi.org/project/upstash-haystack)
+[![PyPI - Python Version](https://img.shields.io/pypi/pyversions/upstash-haystack)](https://pypi.org/project/upstash-haystack)
+[![CI](https://github.com/avish006/template-repo/actions/workflows/test.yml/badge.svg)](https://github.com/avish006/template-repo/actions/workflows/test.yml)
+[![License](https://img.shields.io/badge/license-Apache%202.0-green)](https://spdx.org/licenses/Apache-2.0.html)
+
+> **Upstash Vector** integration for [Haystack](https://haystack.deepset.ai/) — serverless, scalable vector search with zero infrastructure.
+
+---
+
+## Overview
+
+`upstash-haystack` brings [Upstash Vector](https://upstash.com/vector) into the Haystack ecosystem. Upstash Vector is a serverless, pay-as-you-go vector database with a generous free tier — no servers to provision, no clusters to manage.
+
+### Components
+
+| Component | Description |
+|---|---|
+| `UpstashDocumentStore` | Full-featured document store backed by Upstash Vector |
+| `UpstashEmbeddingRetriever` | Dense retrieval using cosine/dot-product similarity |
+| `UpstashHybridRetriever` | Dense + sparse hybrid search via native Reciprocal Rank Fusion (RRF) |
+
+---
+
+## Installation
+
+```bash
+pip install upstash-haystack
+```
+
+---
+
+## Quick Start
+
+### 1. Create an Upstash Vector index
+
+Sign up at [console.upstash.com](https://console.upstash.com/) and create a Vector index. Copy the **REST URL** and **REST Token** from the dashboard.
+
+```bash
+export UPSTASH_VECTOR_REST_URL="https://your-endpoint.upstash.io"
+export UPSTASH_VECTOR_REST_TOKEN="your-token"
+```
+
+### 2. Dense (Embedding) Retrieval
+
+```python
+from haystack import Document, Pipeline
+from haystack_integrations.document_stores.upstash import UpstashDocumentStore
+from haystack_integrations.components.retrievers.upstash import UpstashEmbeddingRetriever
+
+# Initialize the document store (reads credentials from env vars)
+document_store = UpstashDocumentStore()
+
+# Write documents with embeddings
+docs = [
+    Document(content="The capital of France is Paris.", embedding=[0.1, 0.2, ...]),
+    Document(content="The capital of Germany is Berlin.", embedding=[0.4, 0.5, ...]),
+]
+document_store.write_documents(docs)
+
+# Retrieve the top-k most similar documents
+retriever = UpstashEmbeddingRetriever(document_store=document_store)
+result = retriever.run(query_embedding=[0.1, 0.2, ...], top_k=1)
+print(result["documents"])
+```
+
+### 3. Hybrid Retrieval (Dense + Sparse)
+
+Upstash Vector natively supports hybrid search via Reciprocal Rank Fusion (RRF), combining dense and sparse signals for superior relevance.
+
+```python
+from haystack.dataclasses import SparseEmbedding
+from haystack_integrations.components.retrievers.upstash import UpstashHybridRetriever
+
+retriever = UpstashHybridRetriever(document_store=document_store)
+
+result = retriever.run(
+    query_embedding=[0.1, 0.2, ...],
+    query_sparse_embedding=SparseEmbedding(indices=[0, 5, 12], values=[0.9, 0.4, 0.2]),
+    top_k=5,
+)
+print(result["documents"])
+```
+
+### 4. Filtering
+
+```python
+# Equality filter
+docs = document_store.filter_documents(
+    filters={"field": "meta.category", "operator": "==", "value": "science"}
+)
+
+# AND operator
+docs = document_store.filter_documents(
+    filters={
+        "operator": "AND",
+        "conditions": [
+            {"field": "meta.category", "operator": "==", "value": "science"},
+            {"field": "meta.year", "operator": ">", "value": 2020},
+        ],
+    }
+)
+```
+
+---
+
+## Configuration
+
+The document store is configured via environment variables or explicit `Secret` objects:
+
+```python
+from haystack.utils.auth import Secret
+from haystack_integrations.document_stores.upstash import UpstashDocumentStore
+
+store = UpstashDocumentStore(
+    url=Secret.from_env_var("UPSTASH_VECTOR_REST_URL"),
+    token=Secret.from_env_var("UPSTASH_VECTOR_REST_TOKEN"),
+)
+```
+
+---
+
+## Development
+
+This project uses [Hatch](https://hatch.pypa.io/) for environment and dependency management.
+
+```bash
+# Format and lint
+hatch run fmt
+
+# Type checking
+hatch run test:types
+
+# Unit tests (mocked, no credentials needed)
+hatch run test:unit
+
+# Integration tests (requires live Upstash credentials)
+export UPSTASH_VECTOR_REST_URL="..."
+export UPSTASH_VECTOR_REST_TOKEN="..."
+hatch run test:integration
+```
+
+---
+
+## License
+
+`upstash-haystack` is distributed under the terms of the [Apache 2.0](https://spdx.org/licenses/Apache-2.0.html) license.

upstash_haystack-0.1.0.dist-info/RECORD

@@ -0,0 +1,11 @@
+haystack_integrations/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+haystack_integrations/components/retrievers/upstash/__init__.py,sha256=vpLBmA11UL9dtLhc2--lOiKYYQkOjemd6JC5-fysWxc,296
+haystack_integrations/components/retrievers/upstash/embedding_retriever.py,sha256=2_aQgLNyt8jVbH0aLJDJh-xBiHq54WWclk0cVgPCPYw,3425
+haystack_integrations/components/retrievers/upstash/hybrid_retriever.py,sha256=ArR8rXeJE3ZesWM06i6zMapj6pvGHJ3empGn-2v4LI4,3831
+haystack_integrations/document_stores/upstash/__init__.py,sha256=_zjAAJFpFcRO_6UEO6O7Eu6YsxciZlc__esCvNou5Hk,202
+haystack_integrations/document_stores/upstash/document_store.py,sha256=ojNq0XjvpIgZJJiEVuRGNRi-_UEGtoJAp_Ml02N2HeE,6824
+haystack_integrations/document_stores/upstash/filters.py,sha256=XKf2MZoo6q63XHTAv5KB8NerGhFz8sOb-uYQJjwXOWM,3825
+upstash_haystack-0.1.0.dist-info/METADATA,sha256=Ae5q2plxl6zqBwkiV3F8PWPJeOR1d9DYfJVVTuRGOz0,5749
+upstash_haystack-0.1.0.dist-info/WHEEL,sha256=lCkmxWfQsSc9CfIClYeavTdQeEX2toPqufh9gI35EQA,87
+upstash_haystack-0.1.0.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
+upstash_haystack-0.1.0.dist-info/RECORD,,

upstash_haystack-0.1.0.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: hatchling 1.31.0
+Root-Is-Purelib: true
+Tag: py3-none-any

upstash_haystack-0.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.