v0.5.0-rc.1

Here is the first release candidate of v0.5.x tree. It includes the following improvements:

• Increase the verbosity level of some log messages.
• Upgrade hashicorp/memberlist to v0.5.0

v0.4.8

This release includes the following fixes and improvements:

• Prevent data race while reading storage engine statistics.

v0.4.7

This release includes the following fixes and improvements:

• Factory failure drains available connection max from pool #4
• Backported a fix from fluxninja/olric. See #172

Thank you for your contributions:

• @randall-fulton
• @hasit
• @harjotgill

v0.4.6

This release includes the following fixes and improvements:

• Shutdown() panic under certain conditions #177

v0.5.0-beta.8

Here is the eighth beta of the v0.5.x tree. It includes the following improvements:

• Honor current TTL in DMap.Incr and DMap.Decr methods #172
• refactor: copy encoded value into a new byte slice #180

Thank you @hasit for your contributions!

v0.5.0-beta.7

What is Olric?

Olric is a distributed, in-memory data structure store. It's designed from the ground up to be distributed, and it can be used both as an embedded Go library and as a language-independent service.

With Olric, you can instantly create a fast, scalable, shared pool of RAM across a cluster of computers.

Olric is implemented in Go and uses the Redis protocol. That means Olric has client implementations in all major programming languages.

Olric is highly scalable and available. Distributed applications can use for distributed caching, clustering, and Publish-Subscribe messaging.

It is designed to scale out to hundreds of members and thousands of clients. When you add new members, they automatically discover the cluster and linearly increase the memory capacity. Olric offers simple scalability, partitioning (sharding), and re-balancing out-of-the-box. It does not require any extra coordination processes. With Olric, when you start another process to add more capacity, data and backups are automatically and evenly balanced.

See Samples section, and API docs on pkg.go.dev to get started!

Here is the seventh beta of the v0.5.x tree. It includes the following improvements:

• Bring back pipelining feature to Golang client #174,
• Add RefreshMetadata method to the Client interface,
• Add ErrConnRefused error type,
• Delete returns the number of deleted keys,
• Smart routing: ClusterClient can calculate the partition owner for the given key,
• Improve documentation.

Sample pipelining

func ExamplePipeline() {
	c, err := NewClusterClient([]string{"127.0.0.1:3320"})
	if err != nil {
		// Handle this error
	}
	dm, err := c.NewDMap("mydmap")
	if err != nil {
		// Handle this error
	}

	ctx := context.Background()

	pipe, err := dm.Pipeline()
	if err != nil {
		// Handle this error
	}

	futurePut, err := pipe.Put(ctx, "key-1", "value-1")
	if err != nil {
		// Handle this error
	}

	futureGet := pipe.Get(ctx, "key-1")

	err = pipe.Exec(context.Background())
	if err != nil {
		// Handle this error
	}

	err = futurePut.Result()
	if err != nil {
		// Handle this error
	}

	gr, err := futureGet.Result()
	if err != nil {
		// Handle this error
	}
	value, err := gr.String()
	if err != nil {
		// Handle this error
	}
	fmt.Println(value)
}

v0.5.0-beta.6

Here is the sixth beta of the v0.5.x tree. It includes the following improvements:

• Add DM.INCRBYFLOAT command,
• Fix corrupt cursor problems in DM.SCAN implementation in the clients.

v0.5.0-beta.5

Here is the fifth beta of the v0.5.x tree. It includes the following improvements:

• DM.DEL takes multiple keys

v0.5.0-beta.4

Here is the forth beta of the v0.5.x tree. It includes the following improvements:

• Fix wrong cursor alignment in iterator implementations

v0.4.5

This release includes the following fixes and improvements:

• Memory leak, related to 137 (bug: dead loop while expand kvstore)

Thank you @justinfx and @ShawnHsiung for their contributions!