poma 0.2.1__tar.gz → 0.2.3__tar.gz

{poma-0.2.1/poma.egg-info → poma-0.2.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: poma
-Version: 0.2.1
+Version: 0.2.3
 Summary: Official Python SDK for the Poma document-processing API
 Author-email: "POMA AI GmbH, Berlin" <sdk@poma-ai.com>
 License-Expression: MPL-2.0

{poma-0.2.1 → poma-0.2.3}/poma/client.py

@@ -139,6 +139,8 @@ class Poma:
         """
         time.sleep(initial_delay)
         current_interval = poll_interval
+        last_status = None
+
         while True:
             time.sleep(current_interval)
             try:
@@ -181,9 +183,18 @@ class Poma:
                 elif status == "processing":
                     if show_progress:
                         print(f"Job {job_id} is still processing...")
+                    if last_status == "pending":
+                        current_interval = poll_interval
+                    current_interval = min(current_interval * 1.5, max_interval)
+                elif status == "pending":
+                    if show_progress:
+                        print(
+                            f"Job {job_id} is pending (queued due to rate limiting, sequential processing - common on demo accounts)..."
+                        )
                     current_interval = min(current_interval * 1.5, max_interval)
                 else:
                     raise InvalidResponseError(f"Unexpected job status: {status}")
+                last_status = status
             except httpx.HTTPStatusError as error:
                 raise RemoteServerError(
                     f"HTTP error: {error.response.status_code} {error.response.text}"

{poma-0.2.1 → poma-0.2.3}/poma/retrieval.py

@@ -224,14 +224,24 @@ def _get_relevant_chunks_for_ids(
         # idx1 must be before idx2 and have smaller depth
         if idx1 >= idx2:
             return False
+        if idx1 not in index_to_depth or idx2 not in index_to_depth:
+            return False
         depth1 = index_to_depth[idx1]
         depth2 = index_to_depth[idx2]
         if depth1 >= depth2:
             return False
         # scan from idx1+1 up to idx2, making sure all are deeper than depth1 until idx2
-        for i in range(idx1 + 1, idx2 + 1):
-            depth = index_to_depth[sorted_chunks[i]["chunk_index"]]
-            if depth <= depth1 and sorted_chunks[i]["chunk_index"] != idx2:
+        # Use sorted_chunks to iterate in order, but check chunk_index values
+        for chunk in sorted_chunks:
+            chunk_idx = chunk["chunk_index"]
+            if chunk_idx <= idx1:
+                continue
+            if chunk_idx > idx2:
+                break
+            if chunk_idx == idx2:
+                continue  # skip idx2 itself, we'll check it after
+            depth = index_to_depth[chunk_idx]
+            if depth <= depth1:
                 return False
         return True
 
@@ -245,9 +255,20 @@ def _get_relevant_chunks_for_ids(
 
     # Standard subtree/parent finding routines
     def get_child_indices(chunk_index: int) -> list[int]:
+        if chunk_index not in index_to_depth:
+            return []
         base_depth = index_to_depth[chunk_index]
         children = []
-        for i in range(chunk_index + 1, len(sorted_chunks)):
+        # Find the position of chunk_index in sorted_chunks
+        start_pos = None
+        for pos, chunk in enumerate(sorted_chunks):
+            if chunk["chunk_index"] == chunk_index:
+                start_pos = pos
+                break
+        if start_pos is None:
+            return []
+        # Iterate forward from the next position
+        for i in range(start_pos + 1, len(sorted_chunks)):
             idx = sorted_chunks[i]["chunk_index"]
             depth = sorted_chunks[i]["depth"]
             if depth <= base_depth:
@@ -256,9 +277,20 @@ def _get_relevant_chunks_for_ids(
         return children
 
     def get_parent_indices(chunk_index: int) -> list[int]:
+        if chunk_index not in index_to_depth:
+            return []
         parents = []
         current_depth = index_to_depth[chunk_index]
-        for i in range(chunk_index - 1, -1, -1):
+        # Find the position of chunk_index in sorted_chunks
+        start_pos = None
+        for pos, chunk in enumerate(sorted_chunks):
+            if chunk["chunk_index"] == chunk_index:
+                start_pos = pos
+                break
+        if start_pos is None:
+            return []
+        # Iterate backward from the previous position
+        for i in range(start_pos - 1, -1, -1):
             idx = sorted_chunks[i]["chunk_index"]
             depth = sorted_chunks[i]["depth"]
             if depth < current_depth:

{poma-0.2.1 → poma-0.2.3/poma.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: poma
-Version: 0.2.1
+Version: 0.2.3
 Summary: Official Python SDK for the Poma document-processing API
 Author-email: "POMA AI GmbH, Berlin" <sdk@poma-ai.com>
 License-Expression: MPL-2.0

{poma-0.2.1 → poma-0.2.3}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "poma"
-version = "0.2.1"
+version = "0.2.3"
 description = "Official Python SDK for the Poma document-processing API"
 authors = [{ name = "POMA AI GmbH, Berlin", email = "sdk@poma-ai.com" }]
 readme = "README.md"