mirror of
https://github.com/hanzoai/s3.git
synced 2026-11-02 10:33:22 +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.
40 lines
854 B
Go
40 lines
854 B
Go
package storage
|
|
|
|
import "testing"
|
|
|
|
func TestBinarySearch(t *testing.T) {
|
|
var testInput []int
|
|
testInput = []int{-1, 0, 3, 5, 9, 12}
|
|
|
|
if 3 != binarySearchForLargerThanTarget(testInput, 4) {
|
|
t.Errorf("failed to find target %d", 4)
|
|
}
|
|
if 3 != binarySearchForLargerThanTarget(testInput, 3) {
|
|
t.Errorf("failed to find target %d", 3)
|
|
}
|
|
if 6 != binarySearchForLargerThanTarget(testInput, 12) {
|
|
t.Errorf("failed to find target %d", 12)
|
|
}
|
|
if 1 != binarySearchForLargerThanTarget(testInput, -1) {
|
|
t.Errorf("failed to find target %d", -1)
|
|
}
|
|
if 0 != binarySearchForLargerThanTarget(testInput, -2) {
|
|
t.Errorf("failed to find target %d", -2)
|
|
}
|
|
|
|
}
|
|
|
|
func binarySearchForLargerThanTarget(nums []int, target int) int {
|
|
l := 0
|
|
h := len(nums)
|
|
for l < h {
|
|
m := (l + h) / 2
|
|
if nums[m] <= target {
|
|
l = m + 1
|
|
} else {
|
|
h = m
|
|
}
|
|
}
|
|
return l
|
|
}
|