mirror of
https://github.com/dolthub/dolt.git
synced 2026-02-11 10:33:08 -06:00
3d9ebdf61e
It turns out that many large chunks are quite compressible, and writing smaller chunks to DynamoDB saves time, and allows more headroom before hitting the provisioned capacity on the backing table. Compressed chunks are tagged with the algorithm used to compress them, though we treat untagged chunks as uncompressed for backward compatibility.
53 lines
1.2 KiB
Go
53 lines
1.2 KiB
Go
package chunks
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/suite"
|
|
)
|
|
|
|
func TestDynamoStoreTestSuite(t *testing.T) {
|
|
suite.Run(t, &DynamoStoreTestSuite{})
|
|
}
|
|
|
|
type DynamoStoreTestSuite struct {
|
|
ChunkStoreTestSuite
|
|
ddb *fakeDDB
|
|
}
|
|
|
|
func (suite *DynamoStoreTestSuite) SetupTest() {
|
|
suite.ddb = createFakeDDB(suite.Assert())
|
|
suite.Store = newDynamoStoreFromDDBsvc("table", "namespace", suite.ddb)
|
|
suite.putCountFn = func() int {
|
|
return suite.ddb.numPuts
|
|
}
|
|
}
|
|
|
|
func (suite *DynamoStoreTestSuite) TearDownTest() {
|
|
suite.Store.Close()
|
|
}
|
|
|
|
func TestGetRetrying(t *testing.T) {
|
|
assert := assert.New(t)
|
|
store := newDynamoStoreFromDDBsvc("table", "namespace", createLowCapFakeDDB(assert))
|
|
|
|
c1 := NewChunk([]byte("abc"))
|
|
|
|
store.Put(c1)
|
|
store.UpdateRoot(c1.Ref(), store.Root()) // Commit writes
|
|
assert.True(store.Has(c1.Ref()))
|
|
store.Close()
|
|
}
|
|
|
|
func (suite *DynamoStoreTestSuite) TestChunkCompression() {
|
|
c1 := NewChunk(make([]byte, dynamoWriteUnitSize+1))
|
|
suite.Store.Put(c1)
|
|
suite.Store.UpdateRoot(c1.Ref(), suite.Store.Root()) // Commit writes
|
|
suite.True(suite.Store.Has(c1.Ref()))
|
|
suite.Equal(1, suite.ddb.numCompPuts)
|
|
|
|
roundTrip := suite.Store.Get(c1.Ref())
|
|
suite.Equal(c1.Data(), roundTrip.Data())
|
|
}
|