mirror of
https://github.com/Significant-Gravitas/Auto-GPT.git
synced 2025-01-08 11:57:32 +08:00
Added test for async bug
This commit is contained in:
SwiftyOS
parent
2c1275040f
commit
5f7822d5b7
@ -1,7 +1,17 @@
|
||||
import pytest
|
||||
from prisma.models import User
|
||||
|
||||
from autogpt_server.blocks.basic import ObjectLookupBlock, ValueBlock
|
||||
from autogpt_server.blocks.basic import (
|
||||
ObjectLookupBlock,
|
||||
ValueBlock,
|
||||
CreateListBlock,
|
||||
ObjectLookupBase,
|
||||
DictionaryAddEntryBlock,
|
||||
PrintingBlock,
|
||||
)
|
||||
from autogpt_server.blocks.iteration import ForEachBlock
|
||||
from autogpt_server.blocks.text import TextFormatterBlock
|
||||
from autogpt_server.blocks.time_blocks import WaitBlock
|
||||
from autogpt_server.blocks.maths import MathsBlock, Operation
|
||||
from autogpt_server.data import execution, graph
|
||||
from autogpt_server.executor import ExecutionManager
|
||||
@ -17,6 +27,7 @@ async def execute_graph(
|
||||
test_user: User,
|
||||
input_data: dict,
|
||||
num_execs: int = 4,
|
||||
timeout: int = 20,
|
||||
) -> str:
|
||||
# --- Test adding new executions --- #
|
||||
response = await agent_server.execute_graph(test_graph.id, input_data, test_user.id)
|
||||
@ -24,7 +35,7 @@ async def execute_graph(
|
||||
|
||||
# Execution queue should be empty
|
||||
assert await wait_execution(
|
||||
test_manager, test_user.id, test_graph.id, graph_exec_id, num_execs
|
||||
test_manager, test_user.id, test_graph.id, graph_exec_id, num_execs, timeout=timeout
|
||||
)
|
||||
return graph_exec_id
|
||||
|
||||
@ -239,3 +250,237 @@ async def test_static_input_link_on_graph(server):
|
||||
for exec_data in executions[-3:]:
|
||||
assert exec_data.status == execution.ExecutionStatus.COMPLETED
|
||||
assert exec_data.output_data == {"result": [9]}
|
||||
|
||||
|
||||
@pytest.mark.asyncio(scope="session")
|
||||
async def test_async_bug_graph_behavior(server):
|
||||
"""
|
||||
This test is asserting the behaviour of the Async Bug Graph.
|
||||
|
||||
Test scenario:
|
||||
The graph has multiple nodes performing object lookups, formatting texts, and processing lists.
|
||||
The graph links them in a specific sequence to test asynchronous operations and dependencies.
|
||||
"""
|
||||
nodes = [
|
||||
graph.Node( # Node 0 - executed once
|
||||
block_id=CreateListBlock().id,
|
||||
input_default={
|
||||
"items": [
|
||||
'{"item": "one"}',
|
||||
'{"item": "two"}',
|
||||
'{"item": "three"}',
|
||||
'{"item": "four"}',
|
||||
]
|
||||
},
|
||||
),
|
||||
graph.Node( # Node 1 - executed once
|
||||
block_id=ForEachBlock().id,
|
||||
input_default={"return_index": False},
|
||||
),
|
||||
graph.Node( # Node 2 - executed once per loop
|
||||
block_id=ObjectLookupBlock().id,
|
||||
input_default={"key": "item", "input": {}},
|
||||
),
|
||||
graph.Node( # Node 3 (TOP) - executed once per loop
|
||||
block_id=TextFormatterBlock().id,
|
||||
input_default={"format": "Fast Path Item is {item}"},
|
||||
),
|
||||
graph.Node( # Node 4 (BOTTOM) - executed once per loop
|
||||
block_id=TextFormatterBlock().id,
|
||||
input_default={"format": "Slow Path Item is {item}"},
|
||||
),
|
||||
graph.Node( # Node 5 (TOP) - executed once per loop
|
||||
block_id=DictionaryAddEntryBlock().id,
|
||||
input_default={"key": "path_string"},
|
||||
),
|
||||
graph.Node( # Node 6 (BOTTOM) - executed once per loop
|
||||
block_id=WaitBlock().id,
|
||||
input_default={"seconds": 1},
|
||||
),
|
||||
graph.Node( # Node 7 (TOP) - executed once per loop
|
||||
block_id=DictionaryAddEntryBlock().id,
|
||||
input_default={"key": "should_be_same"},
|
||||
),
|
||||
graph.Node( # Node 8 (BOTTOM) - executed once per loop
|
||||
block_id=DictionaryAddEntryBlock().id,
|
||||
input_default={"key": "path_string"},
|
||||
),
|
||||
graph.Node( # Node 9 (BOTTOM) - executed once per loop
|
||||
block_id=DictionaryAddEntryBlock().id,
|
||||
input_default={"key": "should_be_same"},
|
||||
),
|
||||
graph.Node( # Node 10 (TOP) - executed once per loop
|
||||
block_id=TextFormatterBlock().id,
|
||||
input_default={"format": "{path_string} same as {should_be_same}"},
|
||||
),
|
||||
graph.Node( # Node 11 (BOTTOM) - executed once per loop
|
||||
block_id=TextFormatterBlock().id,
|
||||
input_default={"format": "{path_string} same as {should_be_same}"},
|
||||
),
|
||||
graph.Node( # Node 12 (TOP) - executed once per loop
|
||||
block_id=PrintingBlock().id,
|
||||
),
|
||||
graph.Node( # Node 13 (BOTTOM) - executed once per loop
|
||||
block_id=PrintingBlock().id,
|
||||
),
|
||||
]
|
||||
# num execs = 2 initial + 9 per loop = 2 + 9*3 = 29
|
||||
|
||||
links = [
|
||||
graph.Link(
|
||||
source_id=nodes[0].id,
|
||||
sink_id=nodes[1].id,
|
||||
source_name="list",
|
||||
sink_name="items",
|
||||
is_static=False,
|
||||
),
|
||||
# ForEachBlock needs to be connected to 2x text formmater blocks and object lookup block
|
||||
graph.Link(
|
||||
source_id=nodes[1].id, # ForEachBlock
|
||||
sink_id=nodes[2].id, # ObjectLookupBlock
|
||||
source_name="item",
|
||||
sink_name="input",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[1].id, # ForEachBlock
|
||||
sink_id=nodes[3].id, # TextFormatterBlock
|
||||
source_name="item",
|
||||
sink_name="named_texts",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[1].id, # ForEachBlock
|
||||
sink_id=nodes[4].id, # TextFormatterBlock
|
||||
source_name="item",
|
||||
sink_name="named_texts",
|
||||
is_static=False,
|
||||
),
|
||||
# Top Execution Path
|
||||
graph.Link(
|
||||
source_id=nodes[3].id, # TextFormatterBlock
|
||||
sink_id=nodes[5].id, # DictionaryAddEntryBlock
|
||||
source_name="output",
|
||||
sink_name="value",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[5].id, # DictionaryAddEntryBlock
|
||||
sink_id=nodes[7].id, # DictionaryAddEntryBlock
|
||||
source_name="updated_dictionary",
|
||||
sink_name="dictionary",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[7].id, # DictionaryAddEntryBlock
|
||||
sink_id=nodes[10].id, # TextFormatterBlock
|
||||
source_name="updated_dictionary",
|
||||
sink_name="named_texts",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[10].id, # TextFormatterBlock
|
||||
sink_id=nodes[12].id, # PrintingBlock
|
||||
source_name="output",
|
||||
sink_name="text",
|
||||
is_static=False,
|
||||
),
|
||||
# Object Lookup Block needs to be connected to the DictionaryAddEntryBlock
|
||||
graph.Link(
|
||||
source_id=nodes[2].id, # ObjectLookupBlock
|
||||
sink_id=nodes[7].id, # DictionaryAddEntryBlock
|
||||
source_name="output",
|
||||
sink_name="value",
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[10].id, # TextFormatterBlock
|
||||
sink_id=nodes[12].id, # PrintingBlock
|
||||
source_name="output",
|
||||
sink_name="text",
|
||||
is_static=False,
|
||||
),
|
||||
# Bottom Execution Path
|
||||
graph.Link(
|
||||
source_id=nodes[4].id, # TextFormatterBlock
|
||||
sink_id=nodes[6].id, # WaitBlock
|
||||
source_name="output",
|
||||
sink_name="data",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[6].id, # WaitBlock
|
||||
sink_id=nodes[8].id, # DictionaryAddEntryBlock
|
||||
source_name="data",
|
||||
sink_name="value",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[8].id, # DictionaryAddEntryBlock
|
||||
sink_id=nodes[9].id, # DictionaryAddEntryBlock
|
||||
source_name="updated_dictionary",
|
||||
sink_name="dictionary",
|
||||
is_static=False,
|
||||
),
|
||||
# Object Lookup Block needs to be connected to the DictionaryAddEntryBlock
|
||||
graph.Link(
|
||||
source_id=nodes[2].id, # ObjectLookupBlock
|
||||
sink_id=nodes[9].id, # DictionaryAddEntryBlock
|
||||
source_name="output",
|
||||
sink_name="value",
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[9].id, # DictionaryAddEntryBlock
|
||||
sink_id=nodes[11].id, # TextFormatterBlock
|
||||
source_name="updated_dictionary",
|
||||
sink_name="named_texts",
|
||||
is_static=False,
|
||||
),
|
||||
graph.Link(
|
||||
source_id=nodes[11].id, # TextFormatterBlock
|
||||
sink_id=nodes[13].id, # PrintingBlock
|
||||
source_name="output",
|
||||
sink_name="text",
|
||||
is_static=False,
|
||||
),
|
||||
|
||||
]
|
||||
|
||||
test_graph = graph.Graph(
|
||||
name="Async Bug Graph",
|
||||
description="Agent Description",
|
||||
nodes=nodes,
|
||||
links=links,
|
||||
)
|
||||
|
||||
test_user = await create_test_user()
|
||||
test_graph = await graph.create_graph(test_graph, user_id=test_user.id)
|
||||
graph_exec_id = await execute_graph(
|
||||
server.agent_server, server.exec_manager, test_graph, test_user, {}, 54
|
||||
)
|
||||
executions = await server.agent_server.get_run_execution_results(
|
||||
test_graph.id, graph_exec_id, test_user.id
|
||||
)
|
||||
assert len(executions) == 54
|
||||
|
||||
expected_ouputs = set(
|
||||
[
|
||||
"Fast Path Item is one should be the same as one",
|
||||
"Fast Path Item is two should be the same as two",
|
||||
"Fast Path Item is three should be the same as three",
|
||||
"Fast Path Item is four should be the same as four",
|
||||
"Slow Path Item is one should be the same as one",
|
||||
"Slow Path Item is two should be the same as two",
|
||||
"Slow Path Item is three should be the same as three",
|
||||
"Slow Path Item is four should be the same as four",
|
||||
]
|
||||
)
|
||||
|
||||
actaul_outputs = set()
|
||||
|
||||
for exec_data in executions:
|
||||
if "text" in exec_data.input_data:
|
||||
output = exec_data.input_data["text"]
|
||||
actaul_outputs.add(output)
|
||||
|
||||
assert expected_ouputs.isdisjoint(actaul_outputs), f"Actual: {actaul_outputs}"
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user