代码模型横评：谁是最强编程助手？

# 评测维度：正确性、代码质量、边界处理、注释完整性

# DeepSeek-Coder-V2 输出（评分: 9/10）
class LRUCache:
    def __init__(self, capacity: int):
        self.capacity = capacity
        self.cache = OrderedDict()  # 利用 OrderedDict 的 LRU 特性

    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)  # 移到末尾表示最近使用
        return self.cache[key]

    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            self.cache.move_to_end(key)
        elif len(self.cache) >= self.capacity:
            self.cache.popitem(last=False)  # 弹出最久未使用的
        self.cache[key] = value

# Qwen2.5-Coder-32B 输出（评分: 9/10）
# 手动实现双向链表，更接近面试期望
class DLinkedNode:
    def __init__(self, key=0, value=0):
        self.key = key
        self.value = value
        self.prev = None
        self.next = None

class LRUCache:
    def __init__(self, capacity: int):
        self.capacity = capacity
        self.cache = {}
        self.head = DLinkedNode()  # 虚拟头节点
        self.tail = DLinkedNode()  # 虚拟尾节点
        self.head.next = self.tail
        self.tail.prev = self.head

    def _remove_node(self, node):
        node.prev.next = node.next
        node.next.prev = node.prev

    def _add_to_head(self, node):
        node.next = self.head.next
        node.prev = self.head
        self.head.next.prev = node
        self.head.next = node

    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        node = self.cache[key]
        self._remove_node(node)
        self._add_to_head(node)
        return node.value

    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            node = self.cache[key]
            node.value = value
            self._remove_node(node)
            self._add_to_head(node)
        else:
            if len(self.cache) >= self.capacity:
                tail = self.tail.prev
                self._remove_node(tail)
                del self.cache[tail.key]
            node = DLinkedNode(key, value)
            self.cache[key] = node
            self._add_to_head(node)

# 原始代码（有 bug）
class ThreadSafeCounter:
    def __init__(self):
        self.count = 0
        self.lock = threading.Lock()

    def increment(self):
        with self.lock:
            self.count += 1

    def get(self):
        return self.count  # 读取未加锁，可能读到中间状态

// VS Code Continue 插件配置
{
  "models": [{
    "title": "Codestral Local",
    "provider": "openai",
    "model": "codestral-22b",
    "apiBase": "http://localhost:8000/v1",
    "apiKey": "none",
    "completion": {
      "enabled": true,
      "prefix": "[PREFIX]",
      "suffix": "[SUFFIX]",
      "middle": "[MIDDLE]"
    }
  }]
}

# DeepSeek-Coder-V2（需要 8×A100）
python -m vllm.entrypoints.openai.api_server \
  --model deepseek-ai/DeepSeek-Coder-V2-Instruct \
  --tensor-parallel-size 8 \
  --gpu-memory-utilization 0.95 \
  --max-model-len 131072

# Qwen2.5-Coder-32B（单卡 A100 80GB）
python -m vllm.entrypoints.openai.api_server \
  --model Qwen/Qwen2.5-Coder-32B-Instruct \
  --tensor-parallel-size 1 \
  --gpu-memory-utilization 0.9 \
  --max-model-len 131072

# Codestral 22B（RTX 4090 可运行 INT4）
python -m vllm.entrypoints.openai.api_server \
  --model mistralai/Codestral-22B-v0.1 \
  --quantization awq \
  --gpu-memory-utilization 0.9 \
  --max-model-len 32768