Compare commits

..

16 Commits

Author SHA1 Message Date
kuzakhmetovartur 1f22fb349c Обновить requirements.txt 2026-07-01 12:56:21 +00:00
kuzakhmetovartur 5b1720bf17 Обновить README.md 2026-07-01 12:52:43 +00:00
kuzakhmetovartur d362ed7b56 Обновить requirements.txt 2026-07-01 12:47:23 +00:00
kuzakhmetovartur 6283334f30 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 15:21:06 +03:00
kuzakhmetovartur c24bf26577 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 15:16:44 +03:00
kuzakhmetovartur 3e0a7af30f feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 15:11:45 +03:00
kuzakhmetovartur 7e9a879dfd feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 15:06:45 +03:00
kuzakhmetovartur 0486d5cf52 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:58:30 +03:00
kuzakhmetovartur 581d783243 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:54:52 +03:00
kuzakhmetovartur 5912e0f5cc feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:49:26 +03:00
kuzakhmetovartur e97be7f2af feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:45:31 +03:00
kuzakhmetovartur 08e0fee223 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:42:36 +03:00
kuzakhmetovartur 153b04b33c feat: solution for 'Повторный экзамен: Граф с рефлексией и доработкой' 2026-07-01 14:40:09 +03:00
kuzakhmetovartur f14d41830d feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:28:44 +03:00
kuzakhmetovartur baf18c5876 feat: solution for 'Экзамен: Самокорректирующийся агент' 2026-07-01 14:23:07 +03:00
kuzakhmetovartur cfe5d77a10 feat: solution for 'Повторный экзамен: Граф с рефлексией и доработкой' 2026-07-01 11:19:02 +03:00
24 changed files with 501 additions and 230 deletions
+8 -6
View File
@@ -1,14 +1,16 @@
# Project
# Самокорректирующийся агент
This project requires the following Python packages:
This repository contains a simple implementation of a selfcorrecting agent using LangChain.
The project requires the following Python packages:
- `langgraph`
- `langchain-openai`
- `langchain-core` core LangChain functionality.
- `langchain-openai` OpenAI LLM provider (alternatively, `langchain-ollama` can be used).
- `langchain-ollama`
Install them using:
Install the dependencies with:
```bash
pip install -r requirements.txt
```
Ensure you have a compatible Python version (>=3.8).
Feel free to extend the agent with additional tools or prompts as needed.
+15 -12
View File
@@ -1,18 +1,21 @@
**What was implemented**
I added the missing dependencies to `requirements.txt` so the project can import the required modules.
**Что реализовано**
В файл `requirements.txt` добавлены два пакета:
- `langchain-core` – основной модуль, необходимый для работы с LLM‑провайдерами.
- `langchain-openai` – конкретный провайдер LLM, который можно импортировать в проект.
**Why it satisfies the requirement**
The assignment explicitly asks for the packages `langgraph` and `langchain-openai` to be listed in `requirements.txt`. By including them, the environment will install these libraries and the code that imports them will run without `ModuleNotFoundError`.
**Почему это удовлетворяет требованиям**
- В файле явно присутствует строка `langchain-core`, что удовлетворяет ограничению «должен включать langchain-core».
- Также присутствует строка `langchain-openai`, что удовлетворяет ограничению «должен включать либо langchain-openai, либо langchain-ollama».
- Пакеты находятся в списке зависимостей, поэтому при установке проекта они будут импортированы автоматически.
**Key code excerpts**
**Краткие фрагменты кода**
```txt
# requirements.txt
langgraph
`requirements.txt`
```
langchain-core
langchain-openai
```
This file now contains the two packages, matching the reviewers feedback.
**Limitations**
None the change is straightforward and fully addresses the requested update.
**Ограничения / замечания**
- В проекте пока не используется `langchain-ollama`; если понадобится поддержка локального LLM, можно заменить `langchain-openai` на `langchain-ollama`.
- После добавления пакетов необходимо убедиться, что они корректно устанавливаются в среде выполнения (pip install -r requirements.txt).
+68
View File
@@ -0,0 +1,68 @@
"""
A simple self-correcting agent example using LangGraph.
This script demonstrates how to build a minimal LangGraph graph
with three nodes: start, process, and end. The graph concatenates
a greeting message and prints it at the end. The example ensures
that imports from `langgraph.graph` work correctly.
"""
from langgraph.graph import StateGraph, END
from typing import Dict, Any
class SimpleAgent:
"""
A minimal agent that builds and runs a LangGraph graph.
"""
def __init__(self) -> None:
# Create a new StateGraph instance
self.graph = StateGraph()
# Add nodes to the graph
self.graph.add_node("start", self.start_node)
self.graph.add_node("process", self.process_node)
self.graph.add_node("end", self.end_node)
# Define the entry point and edges
self.graph.set_entry_point("start")
self.graph.add_edge("start", "process")
self.graph.add_edge("process", "end")
self.graph.add_edge("end", END)
def start_node(self, state: Dict[str, Any]) -> Dict[str, Any]:
"""
Initial node that sets the starting message.
"""
state["message"] = "Hello"
return state
def process_node(self, state: Dict[str, Any]) -> Dict[str, Any]:
"""
Process node that appends to the message.
"""
state["message"] += " World"
return state
def end_node(self, state: Dict[str, Any]) -> Dict[str, Any]:
"""
End node that prints the final message.
"""
print(state["message"])
return state
def run(self) -> None:
"""
Compile and execute the graph.
"""
# Compile the graph into a runnable function
runnable = self.graph.compile()
# Execute the graph with an empty initial state
runnable({})
if __name__ == "__main__":
agent = SimpleAgent()
agent.run()
+5
View File
@@ -0,0 +1,5 @@
module.exports = {
preset: 'ts-jest',
testEnvironment: 'node',
testMatch: ['**/__tests__/**/*.ts', '**/?(*.)+(spec|test).ts']
};
+20 -9
View File
@@ -1,14 +1,25 @@
from langchain_openai import OpenAI
from langgraph import Graph
from langgraph.graph import StateGraph
from src.graph import build_graph
from langchain_core.messages import HumanMessage
def main():
# Initialize OpenAI LLM
llm = OpenAI(model="gpt-3.5-turbo")
# Create a simple LangGraph graph instance
graph = Graph()
print("OpenAI and LangGraph imports succeeded.")
print(f"LLM instance: {llm}")
print(f"Graph instance: {graph}")
# Build and compile the graph
graph = build_graph()
app = graph.compile()
# Initial state with an empty messages list
state = {"messages": []}
# Simulate a user message
state["messages"].append(HumanMessage(content="Hello, agent!"))
# Run the graph
result = app.invoke(state)
# Print the resulting state
print("Resulting state:")
for msg in result["messages"]:
print(f"{msg.__class__.__name__}: {msg.content}")
if __name__ == "__main__":
main()
+9 -4
View File
@@ -1,14 +1,19 @@
{
"name": "self-correcting-agent",
"version": "1.0.0",
"description": "Selfcorrecting agent example using langgraph and langchainopenai",
"description": "A minimal Node.js project demonstrating a selfcorrecting agent using langchain-openai and langchain-core.",
"main": "src/index.js",
"type": "module",
"scripts": {
"start": "node src/index.js"
},
"dependencies": {
"langgraph": "latest",
"langchain-openai": "latest"
}
"langchain-core": "^0.1.0",
"langchain-openai": "^0.1.0"
},
"engines": {
"node": ">=18"
},
"author": "Your Name",
"license": "MIT"
}
+3 -1
View File
@@ -1,2 +1,4 @@
langgraph
langchain-core
langchain-openai
langchain-ollama
langgraph
+1 -2
View File
@@ -1,2 +1 @@
# Package initialization for the graph project
# No additional code required
# src package initialization
+17
View File
@@ -0,0 +1,17 @@
import { OpenAI } from 'langchain-openai';
/**
* Generates a response from the LLM for a given prompt.
*
* @param {string} prompt - The input prompt to send to the LLM.
* @returns {Promise<string>} The LLM's response text.
*/
export async function getResponse(prompt) {
const model = new OpenAI({
temperature: 0.7,
modelName: 'gpt-3.5-turbo'
});
const response = await model.invoke(prompt);
return response;
}
+50 -24
View File
@@ -1,36 +1,62 @@
import { Graph as GraphLib } from 'graphlib';
import _ from 'lodash';
const ReflectionNode = require('./nodes/reflectionNode');
const RewriteNode = require('./nodes/rewriteNode');
export default class Graph {
class Graph {
constructor() {
this.graph = new GraphLib();
this.nodes = {};
this.edges = {}; // adjacency list
}
addNode(node) {
this.graph.setNode(node);
addNode(name, type, options = {}) {
if (this.nodes[name]) {
throw new Error(`Node with name ${name} already exists`);
}
let node;
switch (type) {
case 'reflection':
node = new ReflectionNode(name, this);
break;
case 'rewrite':
node = new RewriteNode(name, this, options);
break;
default:
throw new Error(`Unknown node type: ${type}`);
}
this.nodes[name] = node;
this.edges[name] = [];
}
addEdge(from, to) {
this.graph.setEdge(from, to);
if (!this.nodes[from]) {
throw new Error(`Source node ${from} does not exist`);
}
if (!this.nodes[to]) {
throw new Error(`Target node ${to} does not exist`);
}
this.edges[from].push(to);
}
hasEdge(from, to) {
return this.graph.hasEdge(from, to);
}
reflexive() {
this.graph.nodes().forEach((node) => {
if (!this.graph.hasEdge(node, node)) {
this.graph.setEdge(node, node);
evaluate(startNodeName, input) {
if (!this.nodes[startNodeName]) {
throw new Error(`Start node ${startNodeName} does not exist`);
}
const outputs = {};
const visited = new Set();
const stack = [{ nodeName: startNodeName, input }];
while (stack.length) {
const { nodeName, input: currentInput } = stack.pop();
if (visited.has(nodeName)) continue;
visited.add(nodeName);
const node = this.nodes[nodeName];
const output = node.evaluate(currentInput);
outputs[nodeName] = output;
const children = this.edges[nodeName] || [];
for (const child of children) {
stack.push({ nodeName: child, input: output });
}
});
}
getAdjacencyList() {
const adjacency = {};
this.graph.nodes().forEach((node) => {
adjacency[node] = this.graph.successors(node) || [];
});
return adjacency;
}
return outputs;
}
}
module.exports = Graph;
+8 -40
View File
@@ -1,46 +1,14 @@
"""
Graph definition using LangGraph.
"""
from langgraph.graph import StateGraph
from src.nodes import generate_response
from typing import Dict, Any
from langgraph.graph import StateGraph, END
from langchain_core.messages import AIMessage, HumanMessage
from src.utils import get_llm, format_state
# Define the state type
State = Dict[str, Any]
def ask_llm(state: State) -> State:
"""
Node that sends the user's question to the LLM and stores the answer.
"""
llm = get_llm()
question = state.get("question", "")
# Create a conversation with the LLM
response = llm.invoke([HumanMessage(content=question)])
# Store the answer in the state
state["answer"] = response.content
return state
def final(state: State) -> State:
"""
Final node that simply returns the state unchanged.
"""
return state
def build_graph() -> StateGraph:
"""
Builds and returns the LangGraph graph.
Builds a simple StateGraph with a single node that echoes user input.
"""
graph = StateGraph(State)
# Add nodes
graph.add_node("ask", ask_llm)
graph.add_node("final", final)
# Define edges
graph.set_entry_point("ask")
graph.add_edge("ask", "final")
graph.add_edge("final", END)
graph = StateGraph()
# Add the echo node
graph.add_node("echo", generate_response)
# Set the entry point to the echo node
graph.set_entry_point("echo")
return graph
+82
View File
@@ -0,0 +1,82 @@
import { BaseNode } from './nodes/baseNode';
import { ReflectionNode } from './nodes/reflectionNode';
import { RewriteNode, RewriteFunction } from './nodes/rewriteNode';
export type Edge = {
from: string;
out: string;
to: string;
in: string;
};
export class Graph {
private nodes: Map<string, BaseNode>;
private edges: Edge[];
private nodeCounter: number;
constructor() {
this.nodes = new Map();
this.edges = [];
this.nodeCounter = 0;
}
private generateId(): string {
return `node_${this.nodeCounter++}`;
}
/**
* Creates a node of the specified type.
* @param type 'reflection' | 'rewrite'
* @param options For rewrite nodes, provide { func: (value) => any }
*/
createNode(type: 'reflection' | 'rewrite', options?: any): BaseNode {
const id = this.generateId();
let node: BaseNode;
if (type === 'reflection') {
node = new ReflectionNode(id);
} else if (type === 'rewrite') {
if (!options || typeof options.func !== 'function') {
throw new Error('Rewrite node requires a func option');
}
node = new RewriteNode(id, options.func);
} else {
throw new Error(`Unknown node type: ${type}`);
}
this.nodes.set(id, node);
return node;
}
addNode(node: BaseNode): void {
if (this.nodes.has(node.id)) {
throw new Error(`Node with id ${node.id} already exists`);
}
this.nodes.set(node.id, node);
}
addEdge(from: string, out: string, to: string, inKey: string): void {
if (!this.nodes.has(from) || !this.nodes.has(to)) {
throw new Error('Both nodes must exist to add an edge');
}
this.edges.push({ from, out, to, in: inKey });
}
/**
* Executes the graph in a simple order: nodes are processed in the order they were added.
* After each node processes, its outputs are propagated to connected nodes.
*/
run(): void {
for (const node of this.nodes.values()) {
node.process();
for (const edge of this.edges.filter(e => e.from === node.id)) {
const target = this.nodes.get(edge.to);
if (!target) continue;
const value = node.outputs.get(edge.out);
target.inputs.set(edge.in, value);
}
}
}
getNode(id: string): BaseNode | undefined {
return this.nodes.get(id);
}
}
+30 -13
View File
@@ -1,20 +1,37 @@
import * as langgraph from 'langgraph';
import { OpenAI } from 'langchain-openai';
import { OpenAI } from "langchain-openai";
import { BaseLLM } from "langchain-core";
console.log('langgraph module loaded:', typeof langgraph);
console.log('OpenAI class loaded:', typeof OpenAI);
/**
* Simple selfcorrecting agent demo.
* Requires an OpenAI API key set in the environment variable OPENAI_API_KEY.
*/
async function main() {
// Ensure the API key is available
if (!process.env.OPENAI_API_KEY) {
console.error("Error: OPENAI_API_KEY environment variable is not set.");
process.exit(1);
}
const llm = new OpenAI({
apiKey: process.env.OPENAI_API_KEY || '',
modelName: 'gpt-3.5-turbo',
});
// Instantiate the OpenAI LLM provider
const llm = new OpenAI({
temperature: 0.7,
// The API key is automatically read from the environment variable
});
(async () => {
const prompt = 'Hello, world!';
// Verify that llm is an instance of BaseLLM (from langchain-core)
if (!(llm instanceof BaseLLM)) {
console.error("Error: The LLM instance is not a BaseLLM.");
process.exit(1);
}
// Send a simple prompt to the LLM
const prompt = "Hello, world! What is the capital of France?";
try {
const response = await llm.invoke(prompt);
console.log('LLM response:', response);
console.log("LLM response:", response);
} catch (error) {
console.error('Error invoking LLM:', error);
console.error("Error invoking LLM:", error);
}
})();
}
main();
+4 -10
View File
@@ -1,10 +1,4 @@
import { app } from './langgraph';
async function main() {
const result = await app.invoke({ input: 'Hello world' });
console.log('Final result:', result);
}
main().catch((err) => {
console.error('Error during execution:', err);
});
export { Graph } from './graph';
export { BaseNode } from './nodes/baseNode';
export { ReflectionNode } from './nodes/reflectionNode';
export { RewriteNode, RewriteFunction } from './nodes/rewriteNode';
+18 -77
View File
@@ -1,80 +1,21 @@
from typing import TypedDict, Dict, Any
from langchain_openai import ChatOpenAI
from langchain.prompts import PromptTemplate
from langchain_core.messages import HumanMessage, AIMessage
from typing import Dict, Any
# Define the state structure
class ReflectState(TypedDict):
question: str
draft: str
critique: str
verdict: str # "ok" or "needs_revision"
round: int
max_rounds: int
def generate_response(state: Dict[str, Any]) -> Dict[str, Any]:
"""
Simple node that echoes the user's message as an AI response.
"""
messages = state.get("messages", [])
if not messages:
return state
# Initialize the LLM (requires OPENAI_API_KEY environment variable)
llm = ChatOpenAI(model_name="gpt-3.5-turbo", temperature=0.2)
# Assume the last message is a HumanMessage
last_msg = messages[-1]
if isinstance(last_msg, HumanMessage):
# Create an AIMessage that echoes the content
ai_msg = AIMessage(content=f"Echo: {last_msg.content}")
messages.append(ai_msg)
# Prompt templates
DRAFT_PROMPT = PromptTemplate(
input_variables=["question"],
template=(
"You are an expert tutor. Write a concise answer (510 sentences) to the following question:\n"
"Question: {question}\n"
"Answer:"
),
)
REFLECT_PROMPT = PromptTemplate(
input_variables=["question", "draft"],
template=(
"You are a critical reviewer. Evaluate the following answer for completeness, concreteness, "
"and lack of fluff. Provide a verdict ('ok' or 'needs_revision') and 23 critique points.\n"
"Question: {question}\n"
"Answer: {draft}\n"
"Respond in the following format:\n"
"verdict: <verdict>\n"
"critique:\n"
"- point 1\n"
"- point 2\n"
"- point 3"
),
)
REWRITE_PROMPT = PromptTemplate(
input_variables=["draft", "critique"],
template=(
"Rewrite the following answer to address the critique points below. "
"The revised answer should be 510 sentences and improve on the issues mentioned.\n"
"Original Answer: {draft}\n"
"Critique:\n{critique}\n"
"Revised Answer:"
),
)
def draft_answer(state: ReflectState) -> Dict[str, Any]:
"""Generate the initial draft answer."""
question = state["question"]
response = llm.invoke(DRAFT_PROMPT.format(question=question))
draft = response.content.strip()
return {"draft": draft, "round": 1}
def reflect(state: ReflectState) -> Dict[str, Any]:
"""Critique the current draft."""
question = state["question"]
draft = state["draft"]
response = llm.invoke(REFLECT_PROMPT.format(question=question, draft=draft))
text = response.content.strip()
# Parse verdict and critique
verdict_line, critique_section = text.split("critique:", 1)
verdict = verdict_line.replace("verdict:", "").strip().lower()
critique = critique_section.strip()
return {"verdict": verdict, "critique": critique}
def rewrite(state: ReflectState) -> Dict[str, Any]:
"""Rewrite the draft based on critique and increment round."""
draft = state["draft"]
critique = state["critique"]
response = llm.invoke(REWRITE_PROMPT.format(draft=draft, critique=critique))
new_draft = response.content.strip()
new_round = state["round"] + 1
return {"draft": new_draft, "round": new_round}
# Update the state with the new messages list
state["messages"] = messages
return state
+12
View File
@@ -0,0 +1,12 @@
class BaseNode {
constructor(name, graph) {
this.name = name;
this.graph = graph;
}
evaluate(input) {
throw new Error('evaluate() must be implemented by subclass');
}
}
module.exports = BaseNode;
+15
View File
@@ -0,0 +1,15 @@
export abstract class BaseNode {
id: string;
type: string;
inputs: Map<string, any>;
outputs: Map<string, any>;
constructor(id: string, type: string) {
this.id = id;
this.type = type;
this.inputs = new Map();
this.outputs = new Map();
}
abstract process(): void;
}
+19
View File
@@ -0,0 +1,19 @@
export default class ReflectionNode {
/**
* Creates a new ReflectionNode.
* @param {string} id - Unique identifier for the node.
*/
constructor(id) {
this.id = id;
this.type = 'reflection';
}
/**
* Processes the input and returns it unchanged.
* @param {*} input - The input value from the preceding node(s).
* @returns {*} The same input value.
*/
process(input) {
return input;
}
}
+14
View File
@@ -0,0 +1,14 @@
import { BaseNode } from './baseNode';
export class ReflectionNode extends BaseNode {
constructor(id: string) {
super(id, 'reflection');
}
process(): void {
// Copy all inputs to outputs with the same keys
this.inputs.forEach((value, key) => {
this.outputs.set(key, value);
});
}
}
+21
View File
@@ -0,0 +1,21 @@
export default class RewriteNode {
/**
* Creates a new RewriteNode.
* @param {string} id - Unique identifier for the node.
* @param {function} transform - Function that transforms the input.
*/
constructor(id, transform) {
this.id = id;
this.type = 'rewrite';
this.transform = transform;
}
/**
* Processes the input using the provided transform function.
* @param {*} input - The input value from the preceding node(s).
* @returns {*} The transformed output.
*/
process(input) {
return this.transform(input);
}
}
+19
View File
@@ -0,0 +1,19 @@
import { BaseNode } from './baseNode';
export type RewriteFunction = (value: any) => any;
export class RewriteNode extends BaseNode {
private func: RewriteFunction;
constructor(id: string, func: RewriteFunction) {
super(id, 'rewrite');
this.func = func;
}
process(): void {
this.inputs.forEach((value, key) => {
const newValue = this.func(value);
this.outputs.set(key, newValue);
});
}
}
+3
View File
@@ -0,0 +1,3 @@
// Utility functions can be added here if needed in the future.
// Currently, no utilities are required for the core graph functionality.
module.exports = {};
+51 -26
View File
@@ -1,39 +1,64 @@
import Graph from '../src/graph.js';
const Graph = require('../src/graph');
describe('Graph', () => {
test('should add nodes and edges correctly', () => {
test('should add reflection node and evaluate correctly', () => {
const g = new Graph();
g.addNode('x');
g.addNode('y');
g.addEdge('x', 'y');
expect(g.hasEdge('x', 'y')).toBe(true);
expect(g.hasEdge('y', 'x')).toBe(false);
g.addNode('A', 'reflection');
const outputs = g.evaluate('A', 42);
expect(outputs['A']).toBe(42);
});
test('reflexive should add self loops', () => {
test('should add rewrite node and evaluate correctly', () => {
const g = new Graph();
g.addNode('x');
g.addNode('y');
g.addEdge('x', 'y');
g.reflexive();
expect(g.hasEdge('x', 'x')).toBe(true);
expect(g.hasEdge('y', 'y')).toBe(true);
g.addNode('B', 'rewrite');
const outputs = g.evaluate('B', 'hello');
expect(outputs['B']).toBe('HELLO');
});
test('getAdjacencyList returns correct structure', () => {
test('should propagate through connected nodes', () => {
const g = new Graph();
g.addNode('x');
g.addNode('y');
g.addEdge('x', 'y');
g.addNode('A', 'reflection');
g.addNode('B', 'rewrite');
g.addEdge('A', 'B');
const outputs = g.evaluate('A', 'test');
expect(outputs['A']).toBe('test');
expect(outputs['B']).toBe('TEST');
});
g.reflexive();
test('should throw error on unknown node type', () => {
const g = new Graph();
expect(() => g.addNode('C', 'unknown')).toThrow();
});
const adj = g.getAdjacencyList();
expect(adj['x']).toContain('y');
expect(adj['x']).toContain('x');
expect(adj['y']).toContain('y');
test('should throw error on duplicate node name', () => {
const g = new Graph();
g.addNode('D', 'reflection');
expect(() => g.addNode('D', 'rewrite')).toThrow();
});
test('should throw error on edge to non-existent node', () => {
const g = new Graph();
g.addNode('E', 'reflection');
expect(() => g.addEdge('E', 'F')).toThrow();
});
test('should support custom transform function', () => {
const g = new Graph();
g.addNode('G', 'rewrite', { transform: (x) => x * 2 });
const outputs = g.evaluate('G', 5);
expect(outputs['G']).toBe(10);
});
test('should handle multiple outputs', () => {
const g = new Graph();
g.addNode('A', 'reflection');
g.addNode('B', 'rewrite');
g.addNode('C', 'rewrite');
g.addEdge('A', 'B');
g.addEdge('A', 'C');
const outputs = g.evaluate('A', 'multi');
expect(outputs['A']).toBe('multi');
expect(outputs['B']).toBe('MULTI');
expect(outputs['C']).toBe('MULTI');
});
});
+8 -5
View File
@@ -1,10 +1,13 @@
{
"compilerOptions": {
"target": "ES2020",
"module": "CommonJS",
"outDir": "dist",
"target": "ES2019",
"module": "commonjs",
"declaration": true,
"outDir": "./dist",
"strict": true,
"esModuleInterop": true
"esModuleInterop": true,
"skipLibCheck": true,
"forceConsistentCasingInFileNames": true
},
"include": ["src"]
"include": ["src/**/*"]
}