Files
group_fqcd_jr/app/infrastructure/vector_memory.py
T
张胜宇 e239eb778b docs: 品牌全量口径统一为「南方基金」+ 作废文档清理
1) 客服 Agent 四份交付文档 + 构建脚手架:品牌由包装占位 XX科技 / 旧名 南方财富
   统一为南方基金(热线 400-889-8899 / 官网 nffund.com),系统名改为「智能服务系统」;
   同步追加 §0.4 修订记录行,工程记录行保留原占位字面以支撑硬编码扫描验收。
2) 开发文档:清理 28 份已作废/残留文档(14 份移出归档 + 14 份仓库副本),
   新增《文档规整方案与开发前待决事项-2026-09-17》。
3) 客服agent 四份交付文档首次纳入本分支。
2026-09-17 15:15:22 +08:00

143 lines
5.3 KiB
Python

from dataclasses import dataclass
from typing import Any, Protocol
class VectorClient(Protocol):
def search(
self, collection_name: str, data: list[list[float]], limit: int,
filter: str | None = None,
) -> Any: ...
class VectorSearchResult:
def __init__(self, hits: Any, degraded: bool = False) -> None:
self.hits = hits
self.degraded = degraded
@dataclass(frozen=True)
class VectorHit:
"""标准化后的向量命中;`memory_uuid` 用于回表,`score` 为集合内相似度。"""
memory_uuid: str
score: float
class VectorMemoryAdapter:
"""Milvus 读边界:查询失败一律降级,绝不让向量库故障冒泡到主链路。"""
# `memory_uuid` 的候选字段名,覆盖实体列与常见别名。
_UUID_FIELDS = ("memory_uuid", "uuid", "memory_id", "id")
_SCORE_FIELDS = ("score", "distance", "similarity")
def __init__(self, client: VectorClient, collection: str) -> None:
self.client = client
self.collection = collection
def search(
self,
embedding: list[float],
limit: int = 10,
*,
customer_id: int | None = None,
) -> VectorSearchResult:
"""按向量检索;给了 `customer_id` 就**在集合内按客户过滤**。
过滤必须下推到 Milvus:召回服务回表时虽然也会按客户筛一次,但不过滤的话
别家客户的命中会白占 `limit` 名额,本客户能拿到的条数被稀释甚至清零——
这在多客户数据集上会表现成"语义召回时有时无"。
过滤表达式在 `try` **之外**求值:`customer_id` 不是整数属调用方编码错误,
应当直接抛出,不能伪装成"Milvus 不可用"而被降级吞掉。
"""
expr = None if customer_id is None else f"customer_id == {int(customer_id)}"
try:
kwargs: dict[str, Any] = {} if expr is None else {"filter": expr}
hits = self.client.search(
collection_name=self.collection,
data=[embedding],
limit=max(1, min(limit, 100)),
**kwargs,
)
return VectorSearchResult(hits)
except Exception:
return VectorSearchResult([], degraded=True)
def parse_hits(self, hits: Any) -> list[VectorHit]:
"""把 pymilvus 的嵌套命中结构折叠为 `VectorHit` 列表(纯函数,不抛异常)。
pymilvus 返回 `[[{id, distance, entity}]]`(每查询一组),行内既有实体字典
也有命名为 `id` / `distance` 的字段,这里两种形态都吸收;没有可识别
`memory_uuid` 的行被丢弃而不是猜造标识,避免召回无法回表的假引用。
"""
parsed: list[VectorHit] = []
for row in self._flatten(hits):
hit = self._parse_hit(row)
if hit is not None:
parsed.append(hit)
return parsed
def _flatten(self, hits: Any) -> list[Any]:
rows: list[Any] = []
for group in hits if isinstance(hits, (list, tuple)) else [hits]:
if isinstance(group, (list, tuple)):
rows.extend(group)
else:
rows.append(group)
return rows
def _parse_hit(self, row: Any) -> VectorHit | None:
if isinstance(row, dict):
fields = dict(row)
elif isinstance(row, (list, tuple)) and len(row) >= 2:
# 无实体字典时的裸数组形态:约定 (主键, 距离)。
return self._hit_from_pair(str(row[0]), row[1])
else:
fields = self._object_fields(row)
entity = fields.get("entity")
if isinstance(entity, dict):
merged = dict(entity)
merged.update({key: value for key, value in fields.items() if key != "entity"})
fields = merged
uuid = self._first_string(fields, self._UUID_FIELDS)
if uuid is None:
return None
return VectorHit(memory_uuid=uuid, score=self._score(fields))
def _hit_from_pair(self, raw_id: str, raw_score: Any) -> VectorHit | None:
if not raw_id:
return None
return VectorHit(memory_uuid=raw_id, score=self._as_float(raw_score) or 0.0)
def _object_fields(self, row: Any) -> dict[str, Any]:
fields: dict[str, Any] = {}
for name in (*self._UUID_FIELDS, *self._SCORE_FIELDS, "entity"):
if hasattr(row, name):
fields[name] = getattr(row, name)
return fields
def _first_string(self, fields: dict[str, Any], names: tuple[str, ...]) -> str | None:
for name in names:
value = fields.get(name)
if value is None:
continue
if isinstance(value, str) and value.strip():
return value.strip()
if isinstance(value, int):
return str(value)
return None
def _score(self, fields: dict[str, Any]) -> float:
for name in self._SCORE_FIELDS:
score = self._as_float(fields.get(name))
if score is not None:
return score
return 0.0
def _as_float(self, value: Any) -> float | None:
try:
return float(value)
except (TypeError, ValueError):
return None