Announcing Go-TinyTime, Go-TinyDate’s Sister Package

time.Time is the perfect choice for most cases, it even comes in the standard library! The problem is that the time.Time{} struct uses more than 24 bytes of memory under most conditions. Go-TinyTime solves this problem by restricting the available dates to the range between 1970 – 2106, and only supporting UTC timezones. This brings data usage down to just 4 bytes of memory.

Go-TinyDate is its sister package that allows for a much larger date range but doesn’t get more than day precision. Between time.Time, go-tinydate, and go-tinytime all of our time problems can be solved using the same API.

Don’t forget to ⭐the GitHub: https://github.com/lane-c-wagner/go-tinytime

How Does It Work?

A normal time.Time object takes at least 16 bytes of memory:

type Time struct {
        wall uint64 // 8 bytes
        ext  int64 // b bytes
        loc *Location // 8 bytes if not nil, plus location memory
}

If there is a location set (which there usually is), then this can be higher, usually about 24 bytes.

TinyTime, on the other hand, uses on 4 bytes.

type TinyTime struct {
        unix uint32
}

We sacrifice timezones and dates older than the unix epoch of 1970, but if these are acceptable tradeoffs, we can save a lot of memory.

When Should It Be Used?

As the TinyTime Readme states, if you aren’t hurting for resources, better to stick with the standard time.Time. The following situations can be good reasons to use to TinyTime:

  • You are working in embedded systems and every byte counts
  • You are working on a system that stores thousands of dates, and reducing memory costs by >75% is significant
  • You are sure you will never need more than date precision

API

The tinytime.TinyTime API largely mirrors that of time.Time. The only methods missing are the ones that make no sense without timezone support. The vast majority can be swapped out without any changes. Check out the godoc for reference: https://godoc.org/github.com/lane-c-wagner/go-tinytime.

TinyDate

If you need a larger date range, be sure to check out the intro to Go-TinyDate:

https://qvault.io/2020/03/23/i-wrote-go-tinydate-the-missing-golang-date-package/

Thanks For Reading

Hit me up on twitter @wagslane if you have any questions or comments.

Follow me on Dev.to: wagslane

The post Announcing Go-TinyTime, Go-TinyDate’s Sister Package appeared first on Qvault.



source https://qvault.io/2020/04/02/announcing-go-tinytime-go-tinydates-sister-package/

Comments

Post a Comment

Popular posts from this blog

Why is Exclusive Or (XOR) Important in Cryptography?

Image
If you are getting into cryptography, or just trying to understand the fundamentals, you may have noticed that the exclusive-or operation is used quite often, especially in ciphers. What is XOR ( ⊕ )? XOR, or “exclusive or” operates on binary data. It returns true if both of its inputs are opposites (one false and one true), otherwise, it returns false. An example in go code would be something like: func exclusiveOr(a bool, b bool) bool { return a != b } XOR Cipher – The Perfect Cipher The XOR operation can be used as a simple cipher for encrypting and decrypting messages with a single key. This is known as symmetric encryption. It is interesting to note that if: The key is the same size as the message The key is kept secret and generated truly randomly Then the cipher is impossible to crack. This is known as a one time pad . However, a simple XOR shouldn’t be used in production due to the key length needing to be too long to be practical. Cipher Example A...
Read more

Base64 vs Base58 Encoding

Image
By Lane Wagner –  @wagslane  on Twitter Base64 is one of the most popular encoding formats for representing data. Have some binary data? Base64 encode it for convenient readability and parsing. Base58 is just another encoding format (with 58 characters instead of 64, and has gained popularity largely due to Bitcoin and other cryptocurrencies. When it comes to data encoding, there is typically a trade-off made between: Human Readability: Do humans have a good idea of what is being represented at a glance? Efficient data compression: How many bytes are used to represent the same data? Let’s rank Base58, Base64, and ASCII encoding against each other using these metrics! First: A Note on Binary All data is stored in a raw binary format on computers. These encoding formats (Base64, Base58, and ASCII) are just different ways of reading and writing binary data. For example, in Base64 the binary code 000000 represents the letter A , but in ASCII the binary 00000000 repres...
Read more

(Very) Basic Intro to Hash Functions (SHA-256, MD-5, etc)

Image
This is going to be a basic introduction to hash functions. I will assume most of my audience is here to gain an understanding of why hash functions are used and the basic idea of why they work. My goal is to explain it in a general sense, I will be omitting proofs and implementation details and instead focusing on the high-level principles. Why Use A Hash Function? Hash functions are used all over the internet in order to securely store passwords, find duplicate records, quickly store and retrieve data, and more. For example,  Qvault  uses hashes to extend master passwords into private encryption keys. A longer list of uses here:  https://en.wikipedia.org/wiki/Hash_function#Uses I want to focus on several important features of hash functions, arguably the most important features. Hash functions scramble data deterministically No matter the input, the output of a hash function always has the same size The original data can not be retrieved from the scrambled d...
Read more