context_assembler.cpython-310.pyc•11.4 kB
o
Uy�g�N � @ sr d Z ddlmZmZmZmZmZ ddlZddlZ ej
ej d� e� e
�ZddlmZmZmZmZ G dd� d�ZdS ) z�
Context Assembly System
Responsible for assembling minimal necessary context for coding tasks,
summarizing peripheral components, and prioritizing based on relevance.
� )�Dict�List�Optional�Any�SetN)�level� )�KnowledgeGraph�
ComponentType�ComponentStatus�RelationshipTypec @ s� e Zd ZdZdefdd�Z d dedeee d e d
e
ee f fd d �Z d d
ed e d
e
ee f fdd�Z
d dee de d
e
ee f fdd�Zde
ee f d
efdd�Zdeded
efdd�ZdS ) �ContextAssemblerz<Assembles context for coding tasks from the knowledge graph.�knowledge_graphc C s
|| _ dS )zyInitialize the context assembler.
Args:
knowledge_graph: The knowledge graph to use
N)r )�selfr � r �\/Users/sparshdrolia/Sparsh personal/persistent-code-mcp/persistent_code/context_assembler.py�__init__ s
zContextAssembler.__init__N� �task_description�relevant_components�
max_tokens�returnc C s� |g g i d�}|s+t �d|� �� | jj|dd�}dd� |D �}t �dt|�� d�� t|�� �}|D ](}| j�|�}|s>q3|d �|� t|�d
d ��� �} || 7 }||d kr[ nq3t � }
|d D ]+}|d
}| jj
|dd�} | D ]} | d
}
|
|
vr�|
dd� |d D �vr�|
� |
� qsqct �dt|
�� d�� |
D ]B}
| j�|
�}|s�q�t|�d
d ��� �} || |kr�| � |�}||d |d
< |t|�� �7 }n |d �|� || 7 }||kr� nq�t �dt|d �� dt|d �� d|� d�� |S )am Assemble minimal context for a specific task.
This method uses semantic search in the knowledge graph to find
components relevant to the task, then assembles them into a
context object with primary components, related components, and
summaries if needed to stay within token limits.
Args:
task_description: Description of the task
relevant_components: List of component IDs known to be relevant
max_tokens: Maximum tokens for the context
Returns:
context: Assembled context information
)r �primary_components�related_components� summariesz&Searching for components relevant to: � )�query�limitc S � g | ]}|d �qS ��idr )�.0�rr r r �
<listcomp>E � z4ContextAssembler.prepare_context.<locals>.<listcomp>zFound z relevant componentsr � code_text� gffffff�?r r )� component_id�depthc S r r r )r! �cr r r r# h r$ z related componentsr r zAssembled context with z
primary and z related components (� tokens))
�logger�infor � search_code�len�split�
get_component�append�get�set�find_related_components�add�_summarize_component)r r r r �context�search_results� token_countr' � componentZcomponent_tokens� related_ids�relatedZrelated_component�
related_id�summaryr r r �prepare_context" sl �� � �
��
�.z ContextAssembler.prepare_contextr' c C s� | j �|�}|s ddiS t�d|�d�� �� |g g g i d�}d|v rC|�dg �D ]}|d �d�tjtjfv rA|d �|d
� q)n| j j |tjtjgd d �}||d < d
|v rx|�d
g �D ]}|d �d�tjtjfv rv|d �|d
� q^n:g }| j j
� � D ]-}| j j
j |dd�D ]!\} }
} |
|kr�| �d�tjtjfv r�| j �|�} | r�|�| � q�q�||d< |�d�}
|
�rg }| j j
j dd�D ] \}}|�d�|
kr�|�d�t
jkr�||kr�|�|� q�|�dd�}g }|D ]}| �||�dd��}|�||f� q�|jdd� dd� dd� |dd� D �|d< d}|tt|��� �7 }|d D ]
}|tt|��� �7 }�q%|d D ]
}|tt|��� �7 }�q7|d D ]
}|tt|��� �7 }�qI||k�r2t�d |� d |� d �� t|d �D ]9\}}| �|�}||d |d < |tt|��� �8 }|t|�� �7 }|d |d dd!�|d |< ||k�r� n�qn||k�r�t|d �D ]9\}}| �|�}||d |d < |tt|��� �8 }|t|�� �7 }|d |d dd!�|d |< ||k�r� n�q�||k�r2t|d �D ]9\}}| �|�}||d |d < |tt|��� �8 }|t|�� �7 }|d |d dd!�|d |< ||k�r0 n�q�t�d"|�d�� d#|� d$�� |S )%a Provide context to continue implementing a component.
Args:
component_id: ID of the component to continue implementing
max_tokens: Maximum tokens for the context
Returns:
context: Implementation context
�errorzComponent not foundz,Preparing context to continue implementing: �name)r: � dependencies�
dependents�related_implementationsr �outgoing_relationships� relationship�typerB r: r )r' �relationship_typesr( �incoming_relationshipsrC T��data�statusr& c S s | d S )Nr r )�xr r r �<lambda>� s z:ContextAssembler.continue_implementation.<locals>.<lambda>)�key�reversec S r )r r )r! �sr r r r# � r$ z<ContextAssembler.continue_implementation.<locals>.<listcomp>N� rD r z
Token count (z) exceeds limit (z), summarizing componentsr r )r rA Z
summarizedz%Assembled implementation context for z (r* )r r0 r+ r, r2 r �
DEPENDS_ON�CALLSr1 r4 �graph�nodes� out_edgesr � IMPLEMENTED�_simple_similarity�sortr. �strr/ � enumerater6 )r r' r r: r7 �relrB rC �node_id�_� target_id� edge_data� dependent�component_type� implemented� node_data�component_nameZscored�implZname_similarityr9 �dep�ir> r r r �continue_implementation� s� � ��
��� �
��
��
�
�
�
� z(ContextAssembler.continue_implementationr �
component_ids�dependencies_depthc
s� g i g d�}g }|r%|D ]}�j �|�}|r#|�d�tjkr#|�|� q n �j jjdd�D ]\}}|�d�} | tjtj fv rC|�|� q-|sJddiS t
� dt |�� d�� t
�� � |D ]
}� j|d fi |�� q[|D ]6}|d }g }
�j jj|dd�D ]\} } }
|
�d
�tjtjfv r�|
�| � q||
D ] }|� v r�� �||� q�qkz!tt
�� ��}|r fd d �|D �|d
< t
�dt |�� d�� W n
t
jy� Y nw z!tt
�� ��}|�� |D ]}�j �|�}|r�|d �|� q�W n t
j�y |D ] }|d �|� q�Y nw g }t dd� |D ��}|�rUg }t|�D ]!}d}� �|�D ]\} } | |v �r1d} n�q$|�s;|�|� �q|�sGt t |��g}|�|� |t |�8 }|�st |�D ]\}}�fdd �|D �|d d|d � �< �qYg }t |�D ]=\}}|d d|d � �g d�}|D ]#}�j �|�}|�r�|d �|d |d |d
|d |d d �� �q�|�|� �qw||d < t
� d t |�� d �� |S )!a4 Generate a plan for implementing pending components.
Args:
component_ids: List of component IDs to include (None for all pending)
dependencies_depth: How deep to analyze dependencies
Returns:
plan: Ordered implementation plan
)�ordered_components�dependency_groups�implementation_stepsrL TrJ r@ zNo pending components foundz Planning implementation for z pending componentsr rG c s* g | ]}d d� � fdd�|D ��� ��qS )zDependency cycle detected: z -> c s g | ] }� j | d �qS )rA )rV )r! �n�� dep_graphr r r# Q s zGContextAssembler.get_implementation_plan.<locals>.<listcomp>.<listcomp>)�join)r! �cyclerq r r r# Q s * z<ContextAssembler.get_implementation_plan.<locals>.<listcomp>�warningsz Detected z dependency cyclesrm c s s � | ]}|d V qdS )r Nr )r! r: r r r � <genexpr>j s � z;ContextAssembler.get_implementation_plan.<locals>.<genexpr>Fc s$ g | ]}� j �|�r� j �|��qS r )r r0 )r! r' )r r r r# � s
�
�rn Zgroup_r zImplement Group )�step� description�
componentsry rA rx )r rA rG rL rx ro z!Created implementation plan with z steps) r r0 r2 r rX r1 rU rV �PLANNED�PARTIALr+ r, r. �nx�DiGraph�add_noderW r rS rT �add_edge�list�
simple_cycles�warning�NetworkXNoCycle�topological_sortrP �NetworkXUnfeasibler3 �next�iterr\ )r rk rl �planZpending_componentsr' r: r^ re rL rB r_ r` ra Zdep_id�cyclesrm rn � remaining�groupZhas_pending_depsri �stepsrw r )rr r r �get_implementation_plan s� �
��
�
� ���� ����
�
�
�
� � ��z(ContextAssembler.get_implementation_planr: c C sb |� dd�}|� dd�}|� dd�}|� dd�}|tjkr3|� di �� d |d
�}d |� d |� �}|S |tjkr[|� di �� d |d
�}|� di �� d
d�}d|� d|� d |� �}|S |tjkr�|� di �� dg �} d�| dd� �t| �dkrzdnd }
d|� d|
� d|� �}|S |tjkr�|� di �� d|�} d| � d |� �}|S |�� � d |� d |� �}|S ) z�Create a summary of a component.
Args:
component: The component to summarize
Returns:
summary: Summary text
rA zUnnamed componentrG �unknownrx zNo description availablerL �metadata� signaturez()z
Function 'z': �classz
Unknown classzMethod '�.�methodsz, NrR z...r& zClass 'z' with methods [z]: �pathzFile 'z ') r2 r
�FUNCTION�METHOD�CLASSrs r. �FILE�
capitalize) r r: rA rc rx rL r� r> �
class_namer� � method_listr� r r r r6 � s0
�
�&
��z%ContextAssembler._summarize_component�str1�str2c C sP t |�� �� �}t |�� �� �}|r|sdS |�|�}|�|�}t|�t|� S )z�Calculate a simple similarity score between two strings.
Args:
str1: First string
str2: Second string
Returns:
similarity: Similarity score between 0 and 1
g )r3 �lowerr/ � intersection�unionr. )r r� r� Zwords1Zwords2r� r� r r r rY � s
z#ContextAssembler._simple_similarity)Nr )r )Nr )�__name__�
__module__� __qualname__�__doc__r r r[ r r �intr r r? rj r� r6 �floatrY r r r r r
s8
��
��
� i ���
� #r
)r� �typingr r r r r �logging�networkxr| � basicConfig�INFO� getLoggerr� r+ r r r
r r r
r r r r �<module> s