Update some ranges for data

This commit is contained in:
aya 2025-05-15 19:00:04 +03:00
parent f17a654158
commit 47c83091dc
2 changed files with 5 additions and 5 deletions

View File

@ -89,7 +89,7 @@ jobs:
shell: bash shell: bash
run: | run: |
set -euo pipefail set -euo pipefail
go test -p=1 -v ./waku -count=1 -timeout=360m -run '^(TestStressRandomNodesInMesh|TestStress2Nodes500IterationTearDown|TestPeerExchangePXLoad)$' | tee testlogs2.log go test -p=1 -v ./waku -count=1 -timeout=360m -run '^(TestStressRandomNodesInMesh|TestStress2Nodes2kIterationTearDown|TestPeerExchangePXLoad)$' | tee testlogs2.log
- name: Upload Test Logs (Group 2) - name: Upload Test Logs (Group 2)
uses: actions/upload-artifact@v4 uses: actions/upload-artifact@v4

View File

@ -86,7 +86,7 @@ func TestStressStoreQuery5kMessagesWithPagination(t *testing.T) {
}() }()
iterations := 3000 iterations := 4000
captureMemory(t.Name(), "at start") captureMemory(t.Name(), "at start")
@ -137,7 +137,7 @@ func TestStressHighThroughput10kPublish(t *testing.T) {
captureMemory(t.Name(), "at start") captureMemory(t.Name(), "at start")
totalMessages := 5 totalMessages := 2000
pubsubTopic := DefaultPubsubTopic pubsubTopic := DefaultPubsubTopic
for i := 0; i < totalMessages; i++ { for i := 0; i < totalMessages; i++ {
@ -169,7 +169,7 @@ func TestStressConnectDisconnect1kIteration(t *testing.T) {
node1.StopAndDestroy() node1.StopAndDestroy()
}() }()
iterations := 1000 iterations := 2000
for i := 1; i <= iterations; i++ { for i := 1; i <= iterations; i++ {
err := node0.ConnectPeer(node1) err := node0.ConnectPeer(node1)
require.NoError(t, err, "Iteration %d: node0 failed to connect to node1", i) require.NoError(t, err, "Iteration %d: node0 failed to connect to node1", i)
@ -196,7 +196,7 @@ func TestStressRandomNodesInMesh(t *testing.T) {
r := rand.New(rand.NewSource(time.Now().UnixNano())) r := rand.New(rand.NewSource(time.Now().UnixNano()))
minNodes := 5 minNodes := 5
maxNodes := 10 maxNodes := 20
nodes := make([]*WakuNode, 0, maxNodes) nodes := make([]*WakuNode, 0, maxNodes)
for i := 0; i < minNodes; i++ { for i := 0; i < minNodes; i++ {