{
"Toolbox": {
"type": "stdio",
"command": "npx",
"args": [
"-y",
"mcp-remote",
"https://mcp.smithery.ai/pwdesignhtx"
]
}
}
{
"mcpServers": {
"exa": {
"url": "https://mcp.exa.ai/mcp?tools=web_search_exa,web_fetch_exa,agent_run,web_search_advanced_exa",
"headers": {
"x-api-key": "553c7346-dc41-4fe3-95b9-97cceb721ad1"
}
},
"Parallel Task MCP": {
"url": "https://task-mcp.parallel.ai/mcp"
},
"Parallel Search MCP": {
"url": "https://search.parallel.ai/mcp"
},
"Context7": {
"command": "npx",
"args": [
"-y",
"@u# Mastra
> Mastra is a framework for building AI-powered applications and agents with a modern TypeScript stack. It includes everything you need to go from early prototypes to production-ready applications. Mastra integrates with frontend and backend frameworks like React, Next.js, and Node, or you can deploy it anywhere as a standalone server. It's the easiest way to build, tune, and scale reliable AI products.
Below is a list of all available documentation pages.
## Docs
- [Get Sta/**
* @param {number} n
* @return {boolean}
*/
var winnerSquareGame = function(n) {
// dp[i] represents whether the current player can win with i stones remaining.
const dp = new Array(n + 1).fill(false);
// Evaluate all positions from 1 to n.
for (let i = 1; i <= n; i++) {
// Try removing every possible square number s*s ≤ i.
for (let s = 1; s * s <= i; s++) {
// If removing s*s stones leaves the opponent in a losing position
// then# Knowledge Schema 数据结构与使用指南
> 数据库:Zhouyang Database
> Schema:`knowledge`
> 文档版本:1.0
> 数据库迁移:`20260810140949_isolate_knowledge_by_project`
> 核对日期:2026-08-10
## 1. 文档目的
`knowledge` schema 用于保存项目开发过程中积累的知识,包括问题解决方案、技术文档、架构模式、功能模块、组件定义、提示词模板和可用于 RAG 的向量知识。
同一个数据库可以同时服务多个项目。所有知识记录都通过 `project_id` 归属于明确的项目,并由以下机制共同保证隔离:
1. 每张知识表都包含非空的 `project_id`。
2. 自然键和版本号按项目进行唯一约束。
3. 父子表之间使用包含 `project_id` 的复合外键,阻止跨项目关联。
4. RLS 根据 `knowledge.project_memberships` 判断当前用户可访问的项目。
5. 向量检索函数必须传入 `p_projec# Memory Schema 多项目长期记忆数据库说明
> 文档版本:1.0
> 数据库:Supabase / PostgreSQL 17
> Schema:`memory`
> 更新日期:2026-08-10
> 适用对象:Claude Code、Codex、后台 Agent、项目服务端和数据库维护人员
## 1. 文档目的
`memory` schema 是多个项目共享的长期记忆数据库。它负责保存项目资料、开发任务、Agent 会话、执行过程、长期记忆、关键决策、观察结果、摘要,以及记忆被检索和使用后的反馈。
多个项目共享同一组表,但数据通过 `project_id`、复合外键和 PostgreSQL Row Level Security(RLS)进行隔离。项目 A 无法查询、修改或关联项目 B 的数据。
本 schema 适合作为 Agent 的“外接大脑”:
1. Agent 开始任务时检索与当前项目相关的历史记忆。
2. Agent 在执行过程中记录任务、会话、运行过程和观察结果。
3. 任务完成后保存决策、摘要和新的长期记忆。
4. 系统记录哪# Ads Schema 多项目共享广告数据库架构文档
> 用途:Supabase `ads` schema 的长期数据库架构说明与 Claude 开发交接文档
> 数据库:Zhouyang Database
> Schema:`ads`
> 快照日期:2026-08-10
> 当前表数量:30
> 架构版本:Multi-Project Shared Resource Model v2
> 最终事实来源:实际 Supabase 数据库结构;本文档用于开发理解与约束说明
---
# 1. 文档目标
`ads` schema 用于构建一个跨项目、跨广告平台的 Creative Intelligence / Advertising Learning Engine。
当前系统不是“每个项目复制一套广告表”,而采用:
```text
Canonical Shared Resource
↓
Project Binding
↓
Project Execution
↓
Metrics / Revenue / Rewar/**
* Find the lexicographically smallest valid sequence of indices
* such that word2 can be matched inside word1 with at most ONE mismatch.
*
* @param {string} word1
* @param {string} word2
* @return {number[]} indices forming the valid sequence, or [] if impossible
*/
var validSequence = function(word1, word2) {
const n = word1.length;
const m = word2.length;
// suffix[i] = smallest index in word2 that can still be matched
// using the suffix word1[i:].
// Default v#include <Arduino.h>
#include "WiFi.h"
void setup()
{
Serial.begin(115200);
WiFi.mode(WIFI_STA);
Serial.print("MAC address: ");
Serial.println(WiFi.macAddress());
}
void loop()
{
}can you go to https://app.fivesurveys.com/ and login click the login button on the top right hand corner of the screen and use pwdesignhtx@gmail.com as the login then when the modal comes up and says login in with google/chrome click on the button, if it prompts you for an email use pwdesignhtx@gmail.com, the password is Wlaf3$!*13579 for the password. one you are in the site, click Desktop if it asks you what platform you are on then go and click on a survey and fill it in, use your best jugem/**
* @param {string} num
* @param {number} t
* @return {string}
*/
var smallestNumber = function (num, t) {
// ------------------------------------------------------------
// STEP 1 — Check if t contains only digit-prime factors (2–9)
// If t has any prime factor > 9, no digit product can ever reach it.
// ------------------------------------------------------------
let temp = t;
for (let i = 2; i <= 9; i++) {
while (temp % i === 0) {
temp /= i;
/**
* Samodejno zaključi brezplačna digitalna naročila (0,00 €).
* Deluje samo za naročila, ki vsebujejo izključno virtualne/prenosljive izdelke.
*/
add_filter( 'woocommerce_payment_complete_order_status', 'auto_complete_free_digital_orders', 10, 3 );
function auto_complete_free_digital_orders( $status, $order_id, $order ) {
// Varnostna preverba
if ( ! $order instanceof WC_Order ) {
return $status;
}
// Naročilo mora biti brezplačno
if ( (float) $order->get_tot<?php
/**
* Gravity Wiz // Gravity Forms // Display Field IDs Next to Field Labels in the Editor
* https://gravitywiz.com/
*
* Experimental Snippet 🧪
*
* Instruction Video: https://www.loom.com/share/0268993d0b6c429ba50686bd740093bc
*
*/
add_filter( 'gform_field_content', function( $content, $field ) {
if ( ! GFCommon::is_form_editor() ) {
return $content;
}
static $_gw_inline_field_id_style;
if ( ! $_gw_inline_field_id_style ) {
$content .= '
<style>
.gd#Requires AutoHotkey v2.0
SetTitleMatchMode(2)
Run('explorer.exe shell:AppsFolder\OpenAI.Codex_2p2nqsd0c76g0!App')
if WinWait("ChatGPT",,15)
{
WinRestore("ChatGPT")
WinActivate("ChatGPT")
}
#Requires AutoHotkey v2.0
SetTitleMatchMode(2)
Run("C:\Windows\System32\calc.exe")
if WinWait("Calculator",, 15)
{
WinRestore("Calculator")
WinActivate("Calculator")
}