Artifact [bf63450729]

Artifact bf634507299f3e9ca68f7843245d255d81d41678ec8d4dcefe4c16e71b786675:

• File dst/event.go — part of check-in [f5744359d3] at 2026-04-19 16:30:54 on branch trunk — Initial open source release

  libfossil is a pure-Go implementation of the Fossil SCM, reading and writing the same .fossil SQLite repository format as upstream Fossil.

  This is the first public release of code that previously lived in a private repository. The module path is github.com/danmestas/libfossil and the binary is named libfossil to avoid $PATH collisions with upstream fossil.

  Included: - Repo lifecycle (create, clone), checkout/checkin, timeline, merge, diff, annotate, shun, tag, branch, bisect, stash, undo/redo - Sync-over-HTTP protocol (client and handler) - Two SQLite drivers: modernc (pure Go, default) and ncruces (wasm-capable) - Observer interfaces (SyncObserver, CheckoutObserver) with an optional OpenTelemetry implementation in observer/otel (separate submodule) - Deterministic simulation testing harness with BUGGIFY fault injection - Kong-based embeddable CLI under cli/ and a standalone binary under cmd/libfossil/ (user: [email protected], size: 1445) [annotate] [blame] [check-ins using]

package dst

import (
	"container/heap"
	"time"
)

// NodeID identifies a node in the simulation.
type NodeID string

// EventType classifies simulation events.
type EventType int

const (
	EvTimer     EventType = iota // leaf poll timer fired
	EvSyncNow                    // manual sync trigger for a leaf
	EvUVWrite                    // write a UV file to a node's repo
	EvUVDelete                   // delete a UV file from a node's repo
)

// Event is a scheduled occurrence in the simulation.
type Event struct {
	Time    time.Time
	Type    EventType
	NodeID  NodeID
	UVName  string // for EvUVWrite/EvUVDelete: file name
	UVData  []byte // for EvUVWrite: file content
	UVMTime int64  // for EvUVWrite/EvUVDelete: mtime
}

// EventQueue is a min-heap of events ordered by time.
type EventQueue []*Event

func (q EventQueue) Len() int            { return len(q) }
func (q EventQueue) Less(i, j int) bool  { return q[i].Time.Before(q[j].Time) }
func (q EventQueue) Swap(i, j int)       { q[i], q[j] = q[j], q[i] }
func (q *EventQueue) Push(x any)         { *q = append(*q, x.(*Event)) }
func (q *EventQueue) Pop() any {
	old := *q
	n := len(old)
	item := old[n-1]
	old[n-1] = nil
	*q = old[:n-1]
	return item
}

// PushEvent adds an event to the queue.
func (q *EventQueue) PushEvent(e *Event) {
	heap.Push(q, e)
}

// PopEvent removes and returns the earliest event.
func (q *EventQueue) PopEvent() *Event {
	return heap.Pop(q).(*Event)
}