ipUdZddlmZddlZddlmZddlmZddlm Z m Z ddl m Z ddl mZdd lmZeeZhd Zhd Zejd Zd4dZd5dZd6dZd6dZeaded<eaded< d7d8dZGddZ d9d!Z!d:d&Z"d;d+Z#dd/Z&d?d@d3Z'dS)Au;Neo4j async client wrapper for knowledge-graph operations. Neo4j 异步客户端封装模块。 负责知识图谱的 Schema 初始化、文档子图的 MERGE 写入、 实体/关系的 CRUD 操作以及文档邻域子图查询。 支持基于 graph_schema.yaml 的动态类型校验和占位文档节点合并。 ) annotationsN) defaultdict)Any) AsyncDriverAsyncGraphDatabase)settings) get_schema) get_logger>失效有效 已废止 待确认 部分失效>其他市级未知省级 区县级 国家级乡镇街道级z^[A-Za-z_]\w{0,49}$namestrreturncxt|std|dtj|S)u校验 Cypher 标签名或关系类型名是否合法，不合法则抛出 ValueError。 Validate a Cypher identifier (node label or relationship type). Prevents Cypher injection when identifiers are interpolated into f-strings. zInvalid Cypher identifier: u — must match )_IDENTIFIER_REmatch ValueErrorpattern)rs 9D:\work\zm-rag\backend\app\infrastructure\neo4j_client.py_validate_identifierr !sT    % %  3$ 3 3(0 3 3    Kpropsdict[str, Any]cj|dd}|rA|tvr8td|t|dd|dd}|rA|t vr8td|t |dd|S) zValidate and sanitise Document enum fields before Neo4j write. - status: must be in VALID_DOC_STATUS, otherwise cleared with a warning. - admin_level: must be in VALID_DOC_ADMIN_LEVEL, otherwise cleared. statusinvalid_doc_status)r%allowedN admin_levelinvalid_doc_admin_level)r)r()getVALID_DOC_STATUSloggerwarningpopVALID_DOC_ADMIN_LEVEL)r"r%r)s r_validate_doc_enumr1/s YYx $ $F "& 000+FDTUUU (D!!!))M2..K'{*??? %#)     -&&& Lr!set[str]cBtS)z0Load default node labels from graph_schema.yaml.)r all_node_labelsr!r_default_node_labelsr6Fs << ' ' ) ))r!cBtS)z7Load default relationship types from graph_schema.yaml.)r all_rel_typesr5r!r_default_rel_typesr9Ks << % % ' ''r!_VALID_NODE_LABELS_VALID_REL_TYPES node_labelsset[str] | None rel_typesNonec\||dhzanta||adStadS)aReplace the module-level valid label / type sets. Called by GraphAdminService after loading or mutating type definitions. Always includes "Document" as a built-in label. If called with ``None``, defaults are loaded from ``graph_schema.yaml``. NDocument)r:r6r;r9)r<r>s rreload_valid_typesrB[sJ(J<7133$-//r!ceZdZdZd*dZed+dZed,d Zd-d Z d-d Z d.dZ d/dZ dddd0dZ d1dZd2dZd3d Zd4d$Zd5d%Zd6d(Zd7d)ZdS)8 Neo4jClientuAsync Neo4j driver wrapper with schema initialisation helpers. Neo4j 异步驱动封装，提供 Schema 初始化、文档子图合并、 实体 CRUD 和邻域查询等核心图操作接口。 driverrrr?c||_dSN_driver)selfrEs r__init__zNeo4jClient.__init__ws  r! 'Neo4jClient'ctjtjtjtjf}||S)z5Create a client from the global application settings.)auth)rrEr neo4j_uri neo4j_userneo4j_password)clsrEs r from_settingszNeo4jClient.from_settingszs?$*  %x'>?   s6{{r!c|jSrGrHrJs rrEzNeo4jClient.drivers |r!cHK|jd{VdSrG)rIcloserUs rrWzNeo4jClient.closes2l  """""""""""r!c Kt}|jtj4d{V}|dd{V|jD]}|d}|dd}t|t|| d|d}d|d |d |d }||d{V|d d{V|d d{V|dd{V|dd{V|dd{V|dd{V|dd{V|dd{Vdddd{Vn#1d{VswxYwYt ddS)u^初始化图谱 Schema：创建唯一性约束、属性索引和全文索引。 Create uniqueness constraints, property indexes and fulltext indexes required by the knowledge graph. Entity types are loaded from ``graph_schema.yaml``; a uniqueness constraint on the ``key_property`` is created for each type. databaseNzYCREATE CONSTRAINT doc_id_unique IF NOT EXISTS FOR (d:Document) REQUIRE d.doc_id IS UNIQUEr key_property__uniquezCREATE CONSTRAINT z IF NOT EXISTS FOR (n:z ) REQUIRE n.z IS UNIQUEzrCREATE FULLTEXT INDEX doc_fulltext IF NOT EXISTS FOR (d:Document) ON EACH [d.title, d.subject_summary, d.doc_code]zVCREATE FULLTEXT INDEX org_fulltext IF NOT EXISTS FOR (o:Organization) ON EACH [o.name]zbCREATE FULLTEXT INDEX matter_fulltext IF NOT EXISTS FOR (m:Matter) ON EACH [m.name, m.description]zPCREATE INDEX doc_publish_date IF NOT EXISTS FOR (d:Document) ON (d.publish_date)zHCREATE INDEX doc_doc_code IF NOT EXISTS FOR (d:Document) ON (d.doc_code)zDCREATE INDEX doc_status IF NOT EXISTS FOR (d:Document) ON (d.status)zaCREATE INDEX doc_knowledge_category IF NOT EXISTS FOR (d:Document) ON (d.knowledge_category_code)zXCREATE INDEX doc_normalized_title IF NOT EXISTS FOR (d:Document) ON (d.normalized_title)neo4j_schema_initialized) r rIsessionrneo4j_databaserun entity_typesr+r lowerr-info)rJschemar_etlabelkey_propconstraint_namecyphers r init_schemazNeo4jClient.init_schemas<''1H'II8 8 8 8 8 8 8 W++>        ) * *6 66.&99%U+++$X...%*[[]]"F"FX"F"F"FFFF#FF19FFFkk&))))))))))++T       ++8       ++A        ++7       ++3       ++1       ++B       ++;       k8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 t  ./////sE;G  GGdoc_idrmetadatar#entitieslist[dict[str, Any]] relationshipsc  Ktp t}tp t}t }|dd}|dd} |r| s||} |jtj 4d{V} id|d|ddd|ddd |d p|d dd |d dd |d dd |d dd|ddd|ddd|ddd|ddd|dp|dpgd|d| d|ddd|dddtt |dpg} d| D} || d<t| } | d|| d{V| d d} | rZ| d| |d{V| d| |d{V| d| |d{Vt#t} |D]k}|dd}|d pi}||vrt$d!|"P| ||l| D]\}}t+| ||d{Vt#t}|D]}|d#d}|d$d}|d%d}||vs||vs||vrt$d&|||'o||||f||D]"\\}}}}t-| ||||d{V# dddd{Vn#1d{VswxYwYt$d(|t1|t1|)dS)*u将完整的文档子图合并写入 Neo4j（MERGE 幂等操作），包括文档节点、实体节点和关系。 Merge a complete document subgraph into Neo4j (MERGE, idempotent). Parameters ---------- doc_id: Unique document ID used as the Document node key. metadata: Document-level metadata written onto the Document node. entities: Each dict: ``{"label": "", "properties": {...}}``. Document nodes are keyed by ``doc_id``. All other nodes are keyed by ``name`` (or ``key_property`` defined in ``graph_schema.yaml``). relationships: Each dict: ``{"from_label", "from_key", "to_label", "to_key", "type", "properties"}``. ``from_key`` / ``to_key`` are the matching key values (``doc_id`` for Document nodes, ``name`` for all others). knowledge_categoryr&knowledge_category_coderYNrltitlenormalized_titledoc_code doc_numberdoc_typer% publish_dateeffective_date expiry_dater)subject_summarykeywords subject_wordssource is_currentTacl_idsc>i|]\}}|dk |gks|dk||S)r&rr5).0kvs r z4Neo4jClient.merge_document_graph..s?Aq77R1 >>1+9>>r!z4MERGE (d:Document {doc_id: $doc_id}) SET d += $props)rlr"a MATCH (placeholder:Document) WHERE placeholder.doc_code = $doc_code AND placeholder.doc_id STARTS WITH 'ref:' AND placeholder.doc_id <> $doc_id AND coalesce(placeholder.is_placeholder, false) = true WITH placeholder MATCH (src)-[r]->(placeholder) WITH placeholder, src, r, type(r) AS rtype, properties(r) AS rprops MATCH (real:Document {doc_id: $doc_id}) CALL apoc.create.relationship(src, rtype, rprops, real) YIELD rel DELETE r )rvrla MATCH (placeholder:Document) WHERE placeholder.doc_code = $doc_code AND placeholder.doc_id STARTS WITH 'ref:' AND placeholder.doc_id <> $doc_id AND coalesce(placeholder.is_placeholder, false) = true WITH placeholder MATCH (placeholder)-[r]->(tgt) WITH placeholder, tgt, r, type(r) AS rtype, properties(r) AS rprops MATCH (real:Document {doc_id: $doc_id}) CALL apoc.create.relationship(real, rtype, rprops, tgt) YIELD rel DELETE r am MATCH (placeholder:Document) WHERE placeholder.doc_code = $doc_code AND placeholder.doc_id STARTS WITH 'ref:' AND placeholder.doc_id <> $doc_id AND coalesce(placeholder.is_placeholder, false) = true DELETE placeholder rg propertiesunknown_node_label)rg from_labelto_labeltypeinvalid_relationship)rrrel_typedocument_graph_merged)rlrnrp)r:r6r;r9r r+rsrIr_rr`listdictfromkeysitemsr1rarr-r.append_batch_merge_nodes_batch_merge_relsrdlen)rJrlrmrnrp valid_labels valid_relsrekckc_coder_ doc_propsrv node_groupsentityrgr" props_list rel_groupsrelrrrrel_lists rmerge_document_graphz Neo4jClient.merge_document_graphs:*C-A-C-C %=);)=)=  \\. 3 3,,8"==  9g 944R88G<''1H'IIC [C [C [C [C [C [C [W)&)gr22)#HLL1CR$H$H)HLL44V \SU8V8V ) HLLR88 ) (,,x44 ) ^R @ @)!(,,/?"D"D)x||M2>>)x||M2>>)"8<<0A2#F#F)HLL44[ _8U8U[Y[)%b)*7)(,,x44) hll<>>!)"4 hll9.E.E.K L LMM#)I(%OO--I #)Ih *955I++F       !}}Z44H1 kk &!"$kk &!"$kk&!"         H>N>N>P>P [ [:0Xx('XxQYZZZZZZZZZZ [EC [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [C [J  #]]m,,      s+O/R-- R7:R7cK|jtj4d{V}|d|d{V|D]F}|d}|d}d|dt ||d }||| d{VG|D]} | d } | d } | d } | d} | d}| di}d| dt| | dd| dt| | dd|d }||| | |d{V dddd{Vn#1d{VswxYwYt d|t|dS)aMerge extracted entities and relationships into the knowledge graph. Parameters ---------- doc_id: The source document identifier. entities: Each dict must have ``label`` (e.g. Organization) and ``properties`` containing at least the uniqueness key (e.g. ``name``). relationships: Each dict must have ``from_label``, ``from_key``, ``to_label``, ``to_key``, ``type`` (relationship type) and optionally ``properties``. rYNz$MERGE (d:Document {doc_id: $doc_id})rlrgr MERGE (n: {z}) SET n += $props)r"rfrom_keyrto_keyr MATCH (a:fromz }) MATCH (b:toz}) MERGE (a)-[r:]->(b) SET r += $rel_propsrr rel_propsneo4j_entities_merged)rlcount) rIr_rr`ra _key_clauser+ _match_clauser-rdr)rJrlrnrpr_rrgr"rjrrrrrrrs rmerge_entitieszNeo4jClient.merge_entitiess&<''1H'II# # # # # # # W++6        # 7 7w|,'''+eU*C*C'''kk&k6666666666$   . z?z?Xv;GGL"55 + ++}ZSY/Z/Z++ (++-:8VT-R-R++$,+++ kk%!' " !# # # # # # # # # # # # # # # # # # # # # # # # # # # J  +F#h-- PPPPPsC9D:: EEN) max_depth acl_tokensrintrlist[str] | Nonec Ktdtt|d}d}|d}d|d|d}|jt j 4d{V}d |i}|||d <|j|fi|d{V} | d{V} dddd{Vn#1d{VswxYwY| ggd St} g} | d pgD]f} | d}|rZ|| vrV| || |t| dt| dpidgt}g}| dpgD]s}|d|d|df}||vrV| || |d|d|dt|dpidt| |d S)ur查询文档的邻域子图，返回指定深度内的所有节点和边。 Return nodes and edges for a document's neighbourhood sub-graph. Returns a dict with ``nodes`` (list of dicts) and ``edges`` (list of dicts with ``source``, ``target``, ``type``). NOTE: Neo4j does not allow parameters in variable-length path ranges ``[*1..$max_depth]``. The depth is embedded as a literal. All node and relationship data is returned as scalar values (elementId, labels, properties) so the async driver never needs to serialise Node / Relationship objects. z,coalesce(node.is_placeholder, false) = falseNz(coalesce(node.is_placeholder, false) = false AND node.acl_ids IS NOT NULL AND (size(coalesce(node.acl_ids, [])) = 0 OR any(token IN coalesce(node.acl_ids, []) WHERE token IN $acl_tokens)))z1MATCH path = (d:Document {doc_id: $doc_id})-[*1..zF]-(neighbor) WHERE all(node IN nodes(path) WHERE NOT node:Document OR a) UNWIND relationships(path) AS rel WITH DISTINCT rel WITH collect(DISTINCT {eid: elementId(startNode(rel)), lbs: labels(startNode(rel)), props: properties(startNode(rel))}) + collect(DISTINCT {eid: elementId(endNode(rel)), lbs: labels(endNode(rel)), props: properties(endNode(rel))}) AS all_nodes, collect(DISTINCT {src: elementId(startNode(rel)), tgt: elementId(endNode(rel)), typ: type(rel), props: properties(rel)}) AS all_rels RETURN all_nodes AS nodes, all_rels AS relsrYrlr)nodesedgesreidlbsr"idlabelsrrelssrctgttyp)rtargetrr)maxminrrIr_rr`rasinglesetaddrrr)rJrlrr depth_safedoc_visibilityrjr_paramsresultrecord seen_nodesrnr seen_edgesrrkeys rquery_document_graphz Neo4jClient.query_document_graphs(CI2233 G  ![  :* : :HV : : : <''1H'II + + + + + + +W&.%7F%'1|$&7;v8888888888F!==??******F  + + + + + + + + + + + + + + + + + + + + + + + + + + + >"-- - #uu &(/'R  AE(C s*,,s### "1U8nn"&qz'7R"8"8 "% &(.&B  AU8QuXqx0C*$$s### hheH"&qz'7R"8"8 ///s(:B44 B>B>c*K|jtj4d{V}|dd{V}|d{V}|r|dndcdddd{VS#1d{VswxYwYdS)z8Return the total number of nodes in the knowledge graph.rYNz MATCH (n) RETURN count(n) AS cntcntrrIr_rr`rar)rJr_rrs rget_node_countzNeo4jClient.get_node_counts0<''1H'II 2 2 2 2 2 2 2W";;'IJJJJJJJJF!==??******F$*16%== 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2sAB B B dict[str, int]c|Kd}|jtj4d{V}|||d{V}|d{V}|r|dnd}dddd{Vn#1d{VswxYwYd|z}t d||| d |iS) u删除文档节点、关系，以及因此变为孤立的实体节点。 Steps: 1. 收集 Document 直连的所有实体节点 ID 2. DETACH DELETE Document 节点 3. 对原直连实体，若不再有任何 Document 引用则删除（清理孤立节点） Returns ------- dict ``{"deleted_nodes": int}`` — 删除的节点总数（含 Document + 孤立实体）。 a MATCH (d:Document {doc_id: $doc_id}) OPTIONAL MATCH (d)--(entity) WHERE NOT entity:Document WITH d, collect(DISTINCT elementId(entity)) AS entity_ids DETACH DELETE d WITH entity_ids UNWIND entity_ids AS eid MATCH (e) WHERE elementId(e) = eid WHERE NOT EXISTS { MATCH (e)--(other:Document) } DETACH DELETE e RETURN count(e) AS orphans_deleted rYNrorphans_deletedrrneo4j_document_deleted)rl deleted_nodesrrrIr_rr`rarr-rd)rJrlrjr_rrorphanstotals rdelete_document_graphz!Neo4jClient.delete_document_graphs  <''1H'II A A A A A A AW";;vf;========F!==??******F39@f.//qG A A A A A A A A A A A A A A A A A A A A A A A A A A A G  $#     ''sAB BBcKd}d}|jtj4d{V} ||d{V}|d{V}|r|dnd}||z }|dkrnN dddd{Vn#1d{VswxYwYt d| d |iS) u0删除图数据库中的所有节点和关系。zq MATCH (n) WITH n LIMIT 10000 DETACH DELETE n RETURN count(n) AS deleted rrYNTdeletedi'neo4j_all_deleted)rrr)rJrj total_deletedr_rrbatchs rdelete_all_graphzNeo4jClient.delete_all_graphEs{   <''1H'II       W &{{622222222%}}......-3:y))& 5==                                '} EEE//sAB B"B entity_idr"dict[str, Any] | NonecKd}|jtj4d{V}||||d{V}|d{V}dddd{Vn#1d{VswxYwY|dS|dt |dt|ddS) z4Update properties on a node identified by elementId.zzMATCH (n) WHERE elementId(n) = $eid SET n += $props RETURN elementId(n) AS id, labels(n) AS labels, properties(n) AS propsrYN)rr"rrr"r)rIr_rr`rarrr)rJrr"rjr_rrs r update_nodezNeo4jClient.update_nodeZsd U  <''1H'II + + + + + + +W";;v9E;JJJJJJJJF!==??******F + + + + + + + + + + + + + + + + + + + + + + + + + + + >4,6(+,,vg//   s9A;; BBc2Kd}|jtj4d{V}|||d{V}|d{V}dddd{Vn#1d{VswxYwYd|r|dndiS)zQDETACH DELETE a node by elementId, returning the number of deleted relationships.zpMATCH (n) WHERE elementId(n) = $eid WITH n, size([(n)-[r]-() | r]) AS rel_count DETACH DELETE n RETURN rel_countrYNrdeleted_relationships rel_countrr)rJrrjr_rrs r delete_nodezNeo4jClient.delete_nodels<   <''1H'II + + + + + + +W";;v9;========F!==??******F + + + + + + + + + + + + + + + + + + + + + + + + + + +()M )<)() WHERE elementId(r) = $rid DELETE r RETURN count(r) AS cntrYN)ridrr)rIr_rr`rarr)rJrrjr_rrs rdelete_relationship_by_idz%Neo4jClient.delete_relationship_by_idys> . <''1H'II + + + + + + +W";;v6;::::::::F!==??******F + + + + + + + + + + + + + + + + + + + + + + + + + + +F0ve}q0111rc Kd}|jtj4d{V}|||d{V}|d{V}dddd{Vn#1d{VswxYwY|dS|d}g}|dD]y}|do||dj|djt|dj t|d d d d z|jt|j t||d S) z0Retrieve a single entity node by its element id.zMATCH (n) WHERE elementId(n) = $eid OPTIONAL MATCH (n)-[r]-(m) RETURN n, collect(DISTINCT {rel: r, neighbor: m}) AS connectionsrYNrr connectionsrneighborrr&)r neighbor_idneighbor_labels neighbor_name)rrrr) rIr_rr`rarrr element_idrrrr+) rJrrjr_rrnoderconns r get_entityzNeo4jClient.get_entitys O  <''1H'II + + + + + + +W";;v9;========F!==??******F + + + + + + + + + + + + + + + + + + + + + + + + + + + >4c{ =)  DE{&"" K,#' #3#>'+D,<,C'D'D%)$z*:%;%;%?%?%K%K $$/4;''t**&    r)rErrr?)rrL)rr)rr?) rlrrmr#rnrorprorr?)rlrrnrorprorr?)rlrrrrrrr#)rr)rlrrr)rr)rrr"r#rr)rrrr)rrrr)rrrr)__name__ __module__ __qualname____doc__rK classmethodrSpropertyrErWrkrrrrrrrrrrr5r!rrDrDps [X#### E0E0E0E0Rq q q q j8Q8Q8Q8Q@'+ N0N0N0N0N0N0`2222&(&(&(&(P0000*    $ O O O O 2 2 2 2      r!rDrgc|dkrdS t}|}||vr||ddSn,#t$rtddYnwxYwdS)zReturn the primary key property name for a given node label. Uses ``key_property`` from ``graph_schema.yaml`` if available, otherwise defaults to ``doc_id`` for Document and ``name`` for others. rArlr[rz8Failed to determine key property, falling back to 'name'T)exc_info)r entity_type_mapr+ Exceptionr-debug)rgreet_maps r _key_proprs  x`'')) F??%=$$^V<< <  ``` OZ^ _____` 6sAA &A65A6r_rrroc K|sdSt|t|}t|g}|D]p}||d}|s>td||t |X|||dq|sdSd|d|d} ||| d{VdS#t$re}td |t|t| |D]} t||| d d{V Yd}~dSd}~wwxYw) u批量 MERGE 同一 label 的节点，使用 UNWIND 减少网络往返。 Batch merge nodes of the same label using UNWIND to minimise round-trips. Filters out items with empty/None key values and falls back to per-item execution if the entire batch fails. Nr&batch_node_skip_empty_key)rgrh props_keyskey_valr"zUNWIND $batch AS item MERGE (n:rz$: item.key_val}) SET n += item.propsr batch_node_merge_failed_fallback)rg batch_sizeerrorr") r rr+r-r.rkeysrrar rr _merge_node) r_rgrrhrr"rrjexcitems rrrs H"""#%E ; ;))Hb))  NN+! --      599::::    &    =kk&k...........  = = =  .5zzc((     = =Dgud7m<< < < < < < < < < = = = = = = =s7C E AEErrrrc 2K|sdSt|t|t|t|}t|}t|t|g}|D]}|dd} |dd} | r| s!td|||| | S|| | |dpid|sdSd |d |d |d |d |d } || |d{VdS#t$r`} td|||t|t| |D]} t|| d{VYd} ~ dSd} ~ wwxYw)u批量 MERGE 同一类型的关系，使用 UNWIND 减少网络往返。 Batch merge relationships of the same (from_label, to_label, rel_type) using UNWIND to minimise round-trips. Falls back to per-item execution if the entire batch fails. Nrr&rbatch_rel_skip_empty_key)rrrrrr)rrr"zUNWIND $batch AS item MATCH (a:rz: item.from_key}) MATCH (b:z: item.to_key}) MERGE (a)-[r:z]->(b) SET r += item.propsrbatch_rel_merge_failed_fallback)rrrrr) r rr+r-r.rrar rr _merge_rel)r_rrrr from_key_prop to_key_proprrrrrjritem_rels rrrsu $$$""""""j))MH%%K'''%%%#%E  77:r**2&& v  NN*%!!!       WW\**0b         #0    !,  !    0kk&k...........  0 0 0  -!5zzc((    ! 0 0HWh// / / / / / / / / 0 0 0 0 0 0 0s D,, F6AFFcJK t|t|}||d}|sdS|d|d|d||d{VdS#t$r5}t d|t|Yd}~dSd}~wwxYw) z9Merge a single entity node. Label must be pre-validated.r&Nrrz: $key_val}) SET n += $propsrnode_merge_failed)rgr)r rr+rar r-r.r)r_rgr"rrrs rrr=sI U###))C$$  Fkk D D D# D D D           III*%s3xxHHHHHHHHHIs6A#%A## B"-*BB"rc K|d}|d}|d}|d}|d}|dpi}|r|sdSt|t|t|t|}t|} d|d |d |d | d |d } || ||| d{VdS#t$r7} t d|||t| Yd} ~ dSd} ~ wwxYw)zDMerge a single relationship. Labels and type must be pre-validated.rrrrrrNrrz: $from_key}) MATCH (b:z: $to_key}) MERGE (a)-[r:rrrel_merge_failed)rrrr)r+r rrar r-r.r) r_rrrrrrr from_propto_proprjrs rr!r!Qs\"J:H:H ]F6{H %%+I 6$$$""""""*%%I!!G J  9    !(        kk                 !c((           s&C D,DDc.t|}|d|S)zDBuild the MERGE key clause based on the node label's uniqueness key.z : $props.r)rgr"rs rrrs# E  C ! !C ! !!r!r key_value param_prefixc0t|}|d|dS)uBuild a MATCH clause fragment for a node look-up by its primary key. 根据 param_prefix 生成正确的参数引用（from_key 或 to_key）， 修复之前始终返回 $from_key 而忽略 $to_key 的逻辑缺陷。 z: $_keyr,)rgr-r.rs rrrs( E  C ( (l ( ( ((r!)rrrr)r"r#rr#)rr2)NN)r<r=r>r=rr?)rgrrr)r_rrgrrrorr?) r_rrrrrrrrrorr?)r_rrgrr"r#rr?)r_rrr#rr?)rgrr"r#rr)r)rgrr-rr.rrr)(r __future__rre collectionsrtypingrneo4jrr app.configrapp.core.graph_schema_loaderr app.utils.loggerr rr-r,r0compilerr r1r6r9rr:__annotations__r;rBrDrrrrr!rrr5r!rr;s[#""""" ######11111111333333'''''' H  RQQmmm233    .**** (((( #suu$$$$ SUU""""$(!%00000*r r r r r r r r p&3=3=3=3=lI0I0I0I0XIIII(* * * * ^"""" )))))))r!