Function TestIntersectCompressedWithBin

algo/uidlist_test.go:632–655

(t *testing.T)

}

func TestIntersectCompressedWithBin(t *testing.T) {
	//lengths := []int{0, 1, 3, 11, 100, 500, 1000}

	for _, N1 := range []int{11} {
		for _, N2 := range []int{3} {
			// Intersection of blockNums and otherNums is commonNums.
			commonNums, blockNums, otherNums := fillNumsDiff(N1/10, N1, N2)

			enc := codec.Encoder{BlockSize: 10}
			for _, num := range blockNums {
				enc.Add(num)
			}

			pack := enc.Done()
			dec := codec.Decoder{Pack: pack}
			dec.Seek(0, codec.SeekStart)

			actual := make([]uint64, 0)
			IntersectCompressedWithBin(&dec, otherNums, &actual)
			require.Equal(t, commonNums, actual)
			codec.FreePack(pack)
		}
	}
}

func TestIntersectCompressedWithBinMissingSize(t *testing.T) {
	lengths := []int{0, 1, 3, 11, 100, 500, 1000}