Popularity

0.9

Stable

Activity

0.0

Stable

Stars 7

Watchers 2

Forks 1

Last Commit over 4 years ago

Programming language: Go

License: Apache License 2.0

Tags: Data Structures

Latest version: v1.0.0

parsefields alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view parsefields alternatives based on common mentions on social networks and blogs.

gods

9.7 3.9 parsefields VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.5 6.6 parsefields VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

Free Global Payroll designed for tech teams

Building a great tech team takes more than a paycheck. Zero payroll costs, get AI-driven insights to retain best talent, and delight them with amazing local benefits. 100% free and compliant.

Promo try.revelo.com

golang-set

8.7 0.0 parsefields VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 parsefields VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.5 0.0 parsefields VS FSM for Go

Finite State Machine for Go
roaring

8.3 0.0 parsefields VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.3 0.0 parsefields VS willf/bloom

Go package implementing Bloom filters
gocache

8.2 0.0 parsefields VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
boomfilters

7.9 0.0 parsefields VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 0.0 parsefields VS bitset

Go package implementing bitsets
gostl

7.4 0.0 parsefields VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
cuckoofilter

7.4 0.0 parsefields VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
algorithms

7.3 0.0 parsefields VS algorithms

CLRS study. Codes are written with golang.
hyperloglog

7.2 0.0 parsefields VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
trie

7.1 0.0 parsefields VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 parsefields VS merkletree

A Merkle Tree implementation written in Go.
go-geoindex

6.6 0.0 parsefields VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
ttlcache

6.5 6.4 parsefields VS ttlcache

An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
conjungo

6.2 0.0 parsefields VS conjungo

A small flexible merge library in go
hilbert

6.0 0.0 parsefields VS hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
mafsa

6.0 0.0 parsefields VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 parsefields VS Bloomfilter

Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
go-adaptive-radix-tree

6.0 0.0 parsefields VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
goconcurrentqueue

5.9 0.0 parsefields VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
goskiplist

5.9 0.0 parsefields VS goskiplist

A skip list implementation in Go
levenshtein

5.7 0.0 parsefields VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.6 0.0 parsefields VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
binpacker

5.5 0.0 parsefields VS binpacker

A binary stream packer and unpacker
bitmap

5.4 0.0 parsefields VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.1 0.0 parsefields VS bit

Bitset data structure
iter

5.0 0.0 parsefields VS iter

Go implementation of C++ STL iterators and algorithms.
bloom

4.9 0.0 parsefields VS bloom

Bloom filters implemented in Go.
encoding

4.7 0.0 parsefields VS encoding

Integer Compression Libraries for Go
remember-go

4.6 0.0 parsefields VS remember-go

Cache Slow Database Queries
ring

4.6 0.0 parsefields VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
deque

4.6 0.0 parsefields VS deque

A highly optimized double-ended queue
go-rquad

4.4 0.0 parsefields VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
skiplist

4.4 0.0 parsefields VS skiplist

skiplist for golang
go-mcache

4.2 0.0 parsefields VS go-mcache

Fast in-memory key:value store/cache with TTL
memlog

4.0 0.0 parsefields VS memlog

A Kafka log inspired in-memory and append-only data structure
crunch

4.0 0.0 parsefields VS crunch

take bytes out of things easily ✨🍪
set

3.9 0.0 parsefields VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
nan

3.7 0.0 parsefields VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
goset

3.5 0.0 parsefields VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
timedmap

3.5 0.0 parsefields VS timedmap

A thread safe map which has expiring key-value pairs.
count-min-log

3.3 0.0 parsefields VS count-min-log

Go implementation of Count-Min-Log
cmap

3.3 0.0 parsefields VS cmap

a thread-safe concurrent map for go
go-tuple

3.2 0.0 parsefields VS go-tuple

Go 1.18 generic tuples
hide

3.2 0.0 parsefields VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
pipeline

3.1 0.0 parsefields VS pipeline

Pipelines using goroutines

Do you think we are missing an alternative of parsefields or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

parsefields

Tool for parse JSON-like logs for collecting unique fields. Main purpose to collect JSON-data with typical events and fields it is useful when you want to create mapping schema for database and you want to reduce the risks of forgotten fields. By default separator between to nested structs is "->", but you can change it with environment.

API consist:

-  POST /v1/json/
-  POST /v1/mjson/
-  GET /v1/fileds/
-  GET  /v1/events/
-  GET /v1/events/:logname/:eventid
-  DELETE /v1/events/:logname/:eventid
-  DELETE /v1/fields/:field

P.S. additionally info about all new events/fields will be show in stdout.

Deploy

docker build . -t parsefield
docker run -d -p 8000:8000 parsefield

docker-compose -p 8000:8000 -d up

Usage

Push new log for parse

Single message per request

curl -X POST -d '{"process_name": "calc.exe", "process_path":"C:\\windows\\system32"}'  127.0.0.1:8000/v1/json/

Multiple message per request

curl -X POST -d '[{"process_name": "calc.exe", "process_path":"C:\\windows\\system32"},{"process_image": "calc.exe", "process_path":"C:\\windows\\system32"},{"pid":"1"}]'  127.0.0.1:8000/v1/mjson/

All unique fields

curl 127.0.0.1:8000/v1/fields/

All unique events

curl 127.0.0.1:8000/v1/events/

Show body of event

curl 127.0.0.1:8000/v1/events/Sysmon/999

Delete events, fields

curl -X DELETE 127.0.0.1:8000/v1/events/Sysmon/999 - delete events with logname Sysmon and eventId 999
curl -X DELETE 127.0.0.1:8000/v1/fields/key - delete field with name key