h-ai-brain 0.0.7__py3-none-any.whl → 0.0.8__py3-none-any.whl

h_ai/domain/priorityqueue/priority_queue_repository.py

@@ -14,14 +14,14 @@ class PriorityQueueRepository(ABC):
         pass
 
     @abstractmethod
-    def get_highest_priority_item(self, queue_name: str) -> Optional[QueueItem]:
+    def get_highest_priority_item(self, queue_name: str, block: bool = False, timeout: Optional[float] = None) -> Optional[QueueItem]:
         """Get and remove the highest priority item from the queue"""
         pass
 
-    @abstractmethod
-    def get_items(self, queue_name: str, limit: int = 10) -> List[QueueItem]:
-        """Get multiple items from the queue in priority order without removing them"""
-        pass
+    # @abstractmethod
+    # def get_items(self, queue_name: str, limit: int = 10) -> List[QueueItem]:
+    #     """Get multiple items from the queue in priority order without removing them"""
+    #     pass
 
     @abstractmethod
     def queue_length(self, queue_name: str) -> int:

h_ai/infrastructure/priorityqueue/in_memory_priority_queue_repository.py

@@ -1,4 +1,4 @@
-
+import queue
 import threading
 from queue import PriorityQueue
 from typing import Dict, List, Optional
@@ -31,56 +31,67 @@ class InMemoryPriorityQueueRepository(PriorityQueueRepository):
 
     def add_item(self, queue_name: str, item: QueueItem) -> None:
         """Add an item to the specified queue"""
-        queue = self._get_or_create_queue(queue_name)
+        q = self._get_or_create_queue(queue_name)
         with self._get_lock(queue_name):
             # The queue automatically orders by priority
-            queue.put(item)
+            q.put(item)
 
-    def get_highest_priority_item(self, queue_name: str) -> Optional[QueueItem]:
+    def get_highest_priority_item(self, queue_name: str, block: bool = False, timeout: Optional[float] = None) -> Optional[QueueItem]:
         """Get and remove the highest priority item from the queue"""
         if queue_name not in self.queues:
             return None
 
-        queue = self.queues[queue_name]
-        with self._get_lock(queue_name):
-            if queue.empty():
-                return None
-            return queue.get()
+        q = self.queues[queue_name]
+        try:
+            # We need to acquire the lock to check initially, but then we need to release it
+            # so that other threads can add items while we're blocking
+            with self._get_lock(queue_name):
+                # If not blocking and queue is empty, return immediately
+                if not block and q.empty():
+                    return None
+
+            # Note: queue.get() with block=True will internally manage locking
+            # We don't hold our custom lock during the blocking wait
+            return q.get(block=block, timeout=timeout)
+        except queue.Empty:
+            # This will be raised if timeout occurs with no items
+            return None
+
 
     def get_items(self, queue_name: str, limit: int = 10) -> List[QueueItem]:
-        """Get multiple items from the queue in priority order without removing them"""
-        if queue_name not in self.queues:
-            return []
+         """Get multiple items from the queue in priority order without removing them"""
+         if queue_name not in self.queues:
+             return []
 
-        queue = self.queues[queue_name]
-        result = []
+         q = self.queues[queue_name]
+         result = []
 
-        with self._get_lock(queue_name):
-            # Create a temporary list to hold items that we'll put back
-            temp_items = []
+         with self._get_lock(queue_name):
+             # Create a temporary list to hold items that we'll put back
+             temp_items = []
 
-            # Get up to 'limit' items
-            count = 0
-            while not queue.empty() and count < limit:
-                item = queue.get()
-                temp_items.append(item)
-                result.append(item)
-                count += 1
+             # Get up to 'limit' items
+             count = 0
+             while not q.empty() and count < limit:
+                 item = q.get()
+                 temp_items.append(item)
+                 result.append(item)
+                 count += 1
 
-            # Put all the items back in the same order
-            for item in temp_items:
-                queue.put(item)
+             # Put all the items back in the same order
+             for item in temp_items:
+                 q.put(item)
 
-        return result
+         return result
 
     def queue_length(self, queue_name: str) -> int:
         """Get the number of items in the queue"""
         if queue_name not in self.queues:
             return 0
 
-        queue = self.queues[queue_name]
+        q = self.queues[queue_name]
         with self._get_lock(queue_name):
-            return queue.qsize()
+            return q.qsize()
 
     def get_queue_names(self) -> List[str]:
         """Get a list of all available queue names"""

{h_ai_brain-0.0.7.dist-info → h_ai_brain-0.0.8.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: h_ai_brain
-Version: 0.0.7
+Version: 0.0.8
 Summary: AI Research agent API
 Author-email: shoebill <shoebill.hai@gmail.com>
 Classifier: Programming Language :: Python :: 3

{h_ai_brain-0.0.7.dist-info → h_ai_brain-0.0.8.dist-info}/RECORD

@@ -7,7 +7,7 @@ h_ai/application/system_prompts/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm
 h_ai/application/system_prompts/roles/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 h_ai/domain/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 h_ai/domain/priorityqueue/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-h_ai/domain/priorityqueue/priority_queue_repository.py,sha256=XCjBrJezloblcqOPJUStTmU5tofx954h-mzxOsYIAbg,1042
+h_ai/domain/priorityqueue/priority_queue_repository.py,sha256=_px-WFlsj439EKV1qN-z85rQDeybhs2p-xGEXRpOtHE,1104
 h_ai/domain/priorityqueue/queue_item.py,sha256=aP2Sd3ig9dgKnAsKE_rr3uRjJ_ClWIrvz0Y3nC8XbmE,1417
 h_ai/domain/reasoning/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 h_ai/domain/reasoning/llm_chat_repository.py,sha256=rY2izDyaDnoyyrCRS1qc9erHB98vARj4Mp-SnPwNhyY,211
@@ -47,10 +47,10 @@ h_ai/infrastructure/llm/ollama/models/ollama_chat_session.py,sha256=GZ_ddpbWa8iy
 h_ai/infrastructure/playwright/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 h_ai/infrastructure/playwright/playwright_web_content_fetcher.py,sha256=FVwcK6hv_6aE4fYlJapLHyxNHsztQkKaulklHabyrEc,2684
 h_ai/infrastructure/priorityqueue/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-h_ai/infrastructure/priorityqueue/in_memory_priority_queue_repository.py,sha256=-DodmvFBUFnglJJmbUFEi3HpqxEdZvYrOpwZrWZrSU0,3262
-h_ai_brain-0.0.7.dist-info/licenses/LICENSE,sha256=SbvpEU5JIU3yzMMkyzrI0dGqHDoJR_lMKGdl6GZHsy4,11558
-h_ai_brain-0.0.7.dist-info/licenses/NOTICE.txt,sha256=vxeIKUiGqAePLvDW4AVm3Xh-3BcsvMtCMn1tbsr9zsE,668
-h_ai_brain-0.0.7.dist-info/METADATA,sha256=KxLN_FGexCNE_QbLb9lpyx_YWEM7-P8VO_Zoy--v1Yk,735
-h_ai_brain-0.0.7.dist-info/WHEEL,sha256=pxyMxgL8-pra_rKaQ4drOZAegBVuX-G_4nRHjjgWbmo,91
-h_ai_brain-0.0.7.dist-info/top_level.txt,sha256=3MChDBWvDJV4cEHuZhzeODxQ4ewtw-arOuyaDOc6sIo,5
-h_ai_brain-0.0.7.dist-info/RECORD,,
+h_ai/infrastructure/priorityqueue/in_memory_priority_queue_repository.py,sha256=zxnrbzoLfiKQMB28dI1bPe0qUtvIDG8OEFcTQL_UeFg,3886
+h_ai_brain-0.0.8.dist-info/licenses/LICENSE,sha256=SbvpEU5JIU3yzMMkyzrI0dGqHDoJR_lMKGdl6GZHsy4,11558
+h_ai_brain-0.0.8.dist-info/licenses/NOTICE.txt,sha256=vxeIKUiGqAePLvDW4AVm3Xh-3BcsvMtCMn1tbsr9zsE,668
+h_ai_brain-0.0.8.dist-info/METADATA,sha256=tO3CbkRDXPuG4cTEIPA8sOtgyXqEMk7ew-KBTA0NGUA,735
+h_ai_brain-0.0.8.dist-info/WHEEL,sha256=pxyMxgL8-pra_rKaQ4drOZAegBVuX-G_4nRHjjgWbmo,91
+h_ai_brain-0.0.8.dist-info/top_level.txt,sha256=3MChDBWvDJV4cEHuZhzeODxQ4ewtw-arOuyaDOc6sIo,5
+h_ai_brain-0.0.8.dist-info/RECORD,,