mirror of
https://github.com/hanzoai/s3.git
synced 2026-10-30 14:59:09 +00:00
zooqueen
dd74d3e6d6
hanzoai/s3 was an AGPL-3.0 MinIO fork whose network-copyleft blocks embedding
and reselling as a managed service. Replace it wholesale with a fork of
SeaweedFS (github.com/seaweedfs/seaweedfs, Apache-2.0, Go) which ships a
built-in S3 gateway + Filer.
- License: AGPL-3.0 -> Apache-2.0 (upstream LICENSE kept verbatim, incl.
"Copyright 2025 Chris Lu"); NOTICE added crediting SeaweedFS. No AGPL/BUSL/
SSPL/GPL or enterprise ("ee") files remain.
- Module: go.mod path set to github.com/hanzoai/s3 with a self-replace
(replace github.com/seaweedfs/seaweedfs => ./) so the ~1800 internal Go files
keep their upstream import paths with zero churn. Internal identifiers and
import paths are intentionally NOT renamed.
- CLI rebrand: the binary is built as `s3` (was `weed`); root usage, per-command
help/usage/flag strings, shell autocomplete program name, and the product name
in CLI output now read "Hanzo S3" / `s3`. Users never see `weed`.
(e.g. `s3 server`, `s3 filer`, `s3 master`, `s3 volume`, `s3 s3`, `s3 mount`.)
- Build: `make` (or `go build -o s3 ./weed`) builds the `s3` binary green;
`cmd/weed-db` and `cmd/weed-sql` also build; `go vet ./weed/command/` clean.
- README/LLM.md rewritten for Hanzo S3; AGENTS.md/CLAUDE.md symlinks preserved.
- Dropped a 33MB prebuilt Mach-O `stress` binary upstream had committed; `.gitignore`
updated to ignore the `s3` build output.
129 lines
2.7 KiB
Go
129 lines
2.7 KiB
Go
package buffered_queue
|
|
|
|
import (
|
|
"sync"
|
|
"testing"
|
|
)
|
|
|
|
func TestJobQueue(t *testing.T) {
|
|
type Job[T any] struct {
|
|
ID int
|
|
Action string
|
|
Data T
|
|
}
|
|
|
|
queue := NewBufferedQueue[Job[string]](2) // Chunk size of 5
|
|
queue.Enqueue(Job[string]{ID: 1, Action: "task1", Data: "hello"})
|
|
queue.Enqueue(Job[string]{ID: 2, Action: "task2", Data: "world"})
|
|
|
|
if queue.Size() != 2 {
|
|
t.Errorf("Expected queue size of 2, got %d", queue.Size())
|
|
}
|
|
|
|
queue.Enqueue(Job[string]{ID: 3, Action: "task3", Data: "3!"})
|
|
queue.Enqueue(Job[string]{ID: 4, Action: "task4", Data: "4!"})
|
|
queue.Enqueue(Job[string]{ID: 5, Action: "task5", Data: "5!"})
|
|
|
|
if queue.Size() != 5 {
|
|
t.Errorf("Expected queue size of 5, got %d", queue.Size())
|
|
}
|
|
|
|
println("enqueued 5 items")
|
|
|
|
println("dequeue", 1)
|
|
job, ok := queue.Dequeue()
|
|
if !ok {
|
|
t.Errorf("Expected dequeue to return true")
|
|
}
|
|
if job.ID != 1 {
|
|
t.Errorf("Expected job ID of 1, got %d", job.ID)
|
|
}
|
|
|
|
println("dequeue", 2)
|
|
job, ok = queue.Dequeue()
|
|
if !ok {
|
|
t.Errorf("Expected dequeue to return true")
|
|
}
|
|
|
|
println("enqueue", 6)
|
|
queue.Enqueue(Job[string]{ID: 6, Action: "task6", Data: "6!"})
|
|
println("enqueue", 7)
|
|
queue.Enqueue(Job[string]{ID: 7, Action: "task7", Data: "7!"})
|
|
|
|
for i := 0; i < 5; i++ {
|
|
println("dequeue ...")
|
|
job, ok = queue.Dequeue()
|
|
if !ok {
|
|
t.Errorf("Expected dequeue to return true")
|
|
}
|
|
println("dequeued", job.ID)
|
|
}
|
|
|
|
if queue.Size() != 0 {
|
|
t.Errorf("Expected queue size of 0, got %d", queue.Size())
|
|
}
|
|
|
|
for i := 0; i < 5; i++ {
|
|
println("enqueue", i+8)
|
|
queue.Enqueue(Job[string]{ID: i + 8, Action: "task", Data: "data"})
|
|
}
|
|
for i := 0; i < 5; i++ {
|
|
job, ok = queue.Dequeue()
|
|
if !ok {
|
|
t.Errorf("Expected dequeue to return true")
|
|
}
|
|
if job.ID != i+8 {
|
|
t.Errorf("Expected job ID of %d, got %d", i, job.ID)
|
|
}
|
|
println("dequeued", job.ID)
|
|
}
|
|
|
|
}
|
|
|
|
func TestJobQueueClose(t *testing.T) {
|
|
type Job[T any] struct {
|
|
ID int
|
|
Action string
|
|
Data T
|
|
}
|
|
|
|
queue := NewBufferedQueue[Job[string]](2)
|
|
queue.Enqueue(Job[string]{ID: 1, Action: "task1", Data: "hello"})
|
|
queue.Enqueue(Job[string]{ID: 2, Action: "task2", Data: "world"})
|
|
|
|
wg := sync.WaitGroup{}
|
|
wg.Add(1)
|
|
go func() {
|
|
defer wg.Done()
|
|
for data, ok := queue.Dequeue(); ok; data, ok = queue.Dequeue() {
|
|
println("dequeued", data.ID)
|
|
}
|
|
}()
|
|
|
|
for i := 0; i < 5; i++ {
|
|
queue.Enqueue(Job[string]{ID: i + 3, Action: "task", Data: "data"})
|
|
}
|
|
|
|
queue.CloseInput()
|
|
wg.Wait()
|
|
|
|
}
|
|
|
|
func BenchmarkBufferedQueue(b *testing.B) {
|
|
type Job[T any] struct {
|
|
ID int
|
|
Action string
|
|
Data T
|
|
}
|
|
|
|
queue := NewBufferedQueue[Job[string]](1024)
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
queue.Enqueue(Job[string]{ID: i, Action: "task", Data: "data"})
|
|
}
|
|
for i := 0; i < b.N; i++ {
|
|
_, _ = queue.Dequeue()
|
|
}
|
|
|
|
}
|