mirror of
https://github.com/hanzoai/graph.git
synced 2026-10-30 18:35:37 +00:00
zeekay
f5aaeb712e
Derived from Dgraph (github.com/dgraph-io/dgraph) at commit 64804bd2, Apache-2.0. See NOTICE. WHAT THIS IS. The graph engine as a Go library: posting lists, the DQL parser, the type and tokenizer system, the index and schema layers, and the wire types. 39,170 lines of the upstream's 166,337. THE STORE is github.com/luxfi/zapdb, a Badger fork that kept the package name, the subpackages (options, pb, y) and the API — Open, OpenManaged, DB, Options — so the 74 import sites are aliased rather than rewritten. THE CODEC is ZAP. zapdb serializes with ZAP, not protobuf: its pb package builds the ZAP types by default and the protobuf ones only under `-tags grpc`, a path that does not compile (table/builder.go calls pb.Marshal, which that tag removes). One call site in posting needed converting; every other type here is Hanzo's own protobuf and is untouched. NO TRANSPORT. An embedded engine dials nothing, so nothing here imports google.golang.org/grpc. Removed: 20 transport functions in x, the generated service stubs for Raft, Zero and Worker (1,657 lines), and the JWT helper — identity belongs to IAM. The core called none of them. NOT KEPT: worker, conn, raftwal, the cluster commands, the GraphQL layer and the test harnesses. `query`, the DQL execution engine, went with them because it depends on worker; parsing DQL is available here, executing it is not. The history of the upstream project lives at github.com/dgraph-io/dgraph. This repository begins at the derivation because three quarters of that history describes code this fork does not carry.
50 lines
807 B
Go
50 lines
807 B
Go
/*
|
|
* SPDX-FileCopyrightText: © 2017-2026 Istari Digital, Inc.
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
package algo
|
|
|
|
import (
|
|
"container/heap"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func TestPush(t *testing.T) {
|
|
h := &uint64Heap{}
|
|
heap.Init(h)
|
|
|
|
e := elem{val: 5}
|
|
heap.Push(h, e)
|
|
e.val = 3
|
|
heap.Push(h, e)
|
|
e.val = 4
|
|
heap.Push(h, e)
|
|
|
|
require.Equal(t, h.Len(), 3)
|
|
require.EqualValues(t, (*h)[0].val, 3)
|
|
|
|
e.val = 10
|
|
(*h)[0] = e
|
|
heap.Fix(h, 0)
|
|
require.EqualValues(t, (*h)[0].val, 4)
|
|
|
|
e.val = 11
|
|
(*h)[0] = e
|
|
heap.Fix(h, 0)
|
|
require.EqualValues(t, (*h)[0].val, 5)
|
|
|
|
e = heap.Pop(h).(elem)
|
|
require.EqualValues(t, e.val, 5)
|
|
|
|
e = heap.Pop(h).(elem)
|
|
require.EqualValues(t, e.val, 10)
|
|
|
|
e = heap.Pop(h).(elem)
|
|
require.EqualValues(t, e.val, 11)
|
|
|
|
require.Equal(t, h.Len(), 0)
|
|
}
|