README
¶
Hephaestus
Hephaestus is a Go library that provides a variety of util functions and message libraries for quickly building business applications. It is designed to quickly build event-driven applications based on an event-based message bus, which you can use with traditional pub/sub implementations like kafka or rabbitmq
Website | 简体中文
Features
- 👏 Easy to understand
- 🌍 Universal - Based on event-driven architecture, messaging, cqrs
- 💅 Flexible - with middlewares, plugins and Pub/Sub configurations
Getting Started
Installation:
go get github.com/aarchies/hephaestus
Example
- Basic
- Eventbus - start here!
Documentation
1.Message bus, can support kafka, rabbimq, chan . index
import "github.com/aarchie/hephaestus/messagec/cqrs"
Function list:
Directories
¶
| Path | Synopsis |
|---|---|
|
database
|
|
|
examples
|
|
|
message
|
|
|
old
|
|
|
Package structure is a subpackage that is dedicated to different implementations of data structures in the domain of computer science.
|
Package structure is a subpackage that is dedicated to different implementations of data structures in the domain of computer science. |
|
circularqueue
Package queue provides an implementation of a circular queue data structure.
|
Package queue provides an implementation of a circular queue data structure. |
|
deque
Package deque implements a Double Ended Queue data structure.
|
Package deque implements a Double Ended Queue data structure. |
|
dynamicarray
Package dynamicarray A dynamic array is quite similar to a regular array, but its Size is modifiable during program runtime, very similar to how a slice in Go works.
|
Package dynamicarray A dynamic array is quite similar to a regular array, but its Size is modifiable during program runtime, very similar to how a slice in Go works. |
|
fenwicktree
Fenwick Tree Data Structure for efficient range queries on an array of integers.
|
Fenwick Tree Data Structure for efficient range queries on an array of integers. |
|
linkedlist
Package linkedlist demonstrates different implementations on linkedlists.
|
Package linkedlist demonstrates different implementations on linkedlists. |
|
set
package set implements a Set using a golang map.
|
package set implements a Set using a golang map. |
|
trie
Package trie provides Trie data structures in golang.
|
Package trie provides Trie data structures in golang. |
Click to show internal directories.
Click to hide internal directories.