2019-01-31 13:53:06 +03:00
|
|
|
|
/*
|
|
|
|
|
NAME
|
|
|
|
|
meta.go
|
|
|
|
|
|
|
|
|
|
DESCRIPTION
|
|
|
|
|
See Readme.md
|
|
|
|
|
|
|
|
|
|
AUTHOR
|
|
|
|
|
Saxon Nelson-Milton <saxon@ausocean.org>
|
|
|
|
|
|
|
|
|
|
LICENSE
|
|
|
|
|
meta.go is Copyright (C) 2017-2019 the Australian Ocean Lab (AusOcean)
|
|
|
|
|
|
|
|
|
|
It is free software: you can redistribute it and/or modify them
|
|
|
|
|
under the terms of the GNU General Public License as published by the
|
|
|
|
|
Free Software Foundation, either version 3 of the License, or (at your
|
|
|
|
|
option) any later version.
|
|
|
|
|
|
|
|
|
|
It is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
|
for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with revid in gpl.txt. If not, see http://www.gnu.org/licenses.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-01-31 14:00:08 +03:00
|
|
|
|
package meta
|
2019-01-31 13:53:06 +03:00
|
|
|
|
|
|
|
|
|
import (
|
2019-02-04 15:18:51 +03:00
|
|
|
|
"encoding/binary"
|
2019-01-31 13:53:06 +03:00
|
|
|
|
"errors"
|
|
|
|
|
"strings"
|
|
|
|
|
"sync"
|
|
|
|
|
)
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// This is the headsize of our metadata string,
|
|
|
|
|
// which is encoded int the data body of a pmt descriptor.
|
2019-01-31 13:53:06 +03:00
|
|
|
|
const headSize = 4
|
|
|
|
|
|
|
|
|
|
const (
|
|
|
|
|
majVer = 1
|
|
|
|
|
minVer = 0
|
|
|
|
|
)
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Indices of bytes for uint16 metadata length.
|
2019-01-31 13:53:06 +03:00
|
|
|
|
const (
|
2019-02-05 05:25:32 +03:00
|
|
|
|
dataLenIdx = 2
|
2019-01-31 13:53:06 +03:00
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
var (
|
2019-02-04 15:18:51 +03:00
|
|
|
|
errKeyAbsent = errors.New("Key does not exist in map")
|
|
|
|
|
errNoHeader = errors.New("Metadata string does not contain header")
|
|
|
|
|
errInvalidHeader = errors.New("Metadata string does not contain valid header")
|
2019-01-31 13:53:06 +03:00
|
|
|
|
)
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Metadata provides functionality for the storage and encoding of metadata
|
|
|
|
|
// using a map.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
type Data struct {
|
2019-02-05 05:25:32 +03:00
|
|
|
|
mu sync.RWMutex
|
|
|
|
|
data map[string]string
|
|
|
|
|
order []string
|
|
|
|
|
enc []byte
|
2019-01-31 13:53:06 +03:00
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// New returns a pointer to a new Metadata.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func New() *Data {
|
|
|
|
|
return &Data{
|
2019-01-31 13:53:06 +03:00
|
|
|
|
data: make(map[string]string),
|
|
|
|
|
enc: []byte{
|
|
|
|
|
0x00, // Reserved byte
|
|
|
|
|
(majVer << 4) | minVer, // MS and LS versions
|
|
|
|
|
0x00, // Data len byte1
|
|
|
|
|
0x00, // Data len byte2
|
|
|
|
|
},
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-06 04:46:44 +03:00
|
|
|
|
// NewWith creates a meta.Data and fills map with initial data given. If there
|
|
|
|
|
// is repeated key, then the latter overwrites the prior.
|
|
|
|
|
func NewWith(data [][2]string) *Data {
|
|
|
|
|
m := New()
|
|
|
|
|
m.order = make([]string, 0, len(data))
|
|
|
|
|
for _, d := range data {
|
|
|
|
|
if _, exists := m.data[d[0]]; !exists {
|
|
|
|
|
m.order = append(m.order, d[0])
|
|
|
|
|
}
|
|
|
|
|
m.data[d[0]] = d[1]
|
2019-02-06 02:49:12 +03:00
|
|
|
|
}
|
2019-02-06 04:46:44 +03:00
|
|
|
|
return m
|
2019-02-06 02:49:12 +03:00
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Add adds metadata with key and val.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func (m *Data) Add(key, val string) {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.mu.Lock()
|
2019-02-05 15:55:46 +03:00
|
|
|
|
defer m.mu.Unlock()
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.data[key] = val
|
2019-02-05 05:41:11 +03:00
|
|
|
|
for _, k := range m.order {
|
|
|
|
|
if k == key {
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-02-05 05:25:32 +03:00
|
|
|
|
m.order = append(m.order, key)
|
2019-02-05 15:55:46 +03:00
|
|
|
|
return
|
2019-01-31 13:53:06 +03:00
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// All returns the a copy of the map containing the meta data.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func (m *Data) All() map[string]string {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.mu.Lock()
|
|
|
|
|
cpy := make(map[string]string)
|
|
|
|
|
for k, v := range m.data {
|
|
|
|
|
cpy[k] = v
|
|
|
|
|
}
|
|
|
|
|
m.mu.Unlock()
|
|
|
|
|
return cpy
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Get returns the meta data for the passed key.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func (m *Data) Get(key string) (string, error) {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.mu.Lock()
|
|
|
|
|
val, ok := m.data[key]
|
|
|
|
|
m.mu.Unlock()
|
|
|
|
|
if !ok {
|
|
|
|
|
return "", errKeyAbsent
|
|
|
|
|
}
|
|
|
|
|
return val, nil
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Delete deletes a meta entry in the map and returns error if it doesn’t exist.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func (m *Data) Delete(key string) error {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.mu.Lock()
|
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
|
if _, ok := m.data[key]; ok {
|
|
|
|
|
delete(m.data, key)
|
2019-02-05 05:25:32 +03:00
|
|
|
|
for i, k := range m.order {
|
|
|
|
|
if k == key {
|
2019-02-05 15:59:07 +03:00
|
|
|
|
copy(m.order[:i], m.order[i+1:])
|
|
|
|
|
m.order = m.order[:len(m.order)-1]
|
2019-02-05 05:25:32 +03:00
|
|
|
|
break
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-01-31 13:53:06 +03:00
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
return errKeyAbsent
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Encode takes the meta data map and encodes into a byte slice with header
|
2019-01-31 13:53:06 +03:00
|
|
|
|
// describing the version, length of data and data in TSV format.
|
2019-02-06 02:29:55 +03:00
|
|
|
|
func (m *Data) Encode() []byte {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
m.enc = m.enc[:headSize]
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// Iterate over map and append entries, only adding tab if we're not on the
|
|
|
|
|
// last entry.
|
2019-01-31 13:53:06 +03:00
|
|
|
|
var entry string
|
2019-02-05 05:25:32 +03:00
|
|
|
|
for i, k := range m.order {
|
|
|
|
|
v := m.data[k]
|
2019-01-31 13:53:06 +03:00
|
|
|
|
entry += k + "=" + v
|
2019-02-05 05:25:32 +03:00
|
|
|
|
if i+1 < len(m.data) {
|
2019-01-31 13:53:06 +03:00
|
|
|
|
entry += "\t"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
m.enc = append(m.enc, []byte(entry)...)
|
|
|
|
|
|
|
|
|
|
// Calculate and set data length in encoded meta header.
|
|
|
|
|
dataLen := len(m.enc[headSize:])
|
2019-02-05 05:25:32 +03:00
|
|
|
|
binary.BigEndian.PutUint16(m.enc[dataLenIdx:dataLenIdx+2], uint16(dataLen))
|
2019-01-31 13:53:06 +03:00
|
|
|
|
return m.enc
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-04 15:08:11 +03:00
|
|
|
|
// ReadFrom extracts a value from a metadata string d, for the given key. If the
|
|
|
|
|
// key is not present in the metadata string, an error is returned. If the
|
|
|
|
|
// metadata header is not present in the string, an error is returned.
|
2019-01-31 13:53:06 +03:00
|
|
|
|
func ReadFrom(d []byte, key string) (string, error) {
|
2019-02-04 15:18:51 +03:00
|
|
|
|
if d[0] != 0 {
|
|
|
|
|
return "", errNoHeader
|
|
|
|
|
} else if d[0] == 0 && binary.BigEndian.Uint16(d[2:headSize]) != uint16(len(d[headSize:])) {
|
|
|
|
|
return "", errInvalidHeader
|
|
|
|
|
}
|
|
|
|
|
d = d[headSize:]
|
2019-01-31 13:53:06 +03:00
|
|
|
|
entries := strings.Split(string(d), "\t")
|
|
|
|
|
for _, entry := range entries {
|
|
|
|
|
kv := strings.Split(entry, "=")
|
|
|
|
|
if kv[0] == key {
|
|
|
|
|
return kv[1], nil
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-02-04 15:08:11 +03:00
|
|
|
|
return "", errKeyAbsent
|
2019-01-31 13:53:06 +03:00
|
|
|
|
}
|