reconstruct compress package

Author: howz97

README.md

@@ -54,8 +54,8 @@ Algorithm (Sedgewick, 4th) implemented in golang.
     * Rabin-Karp
   * [Regular Expression](strings/regexp)
   * Data Compression
-    * [Huffman](strings/compress/huffman)
-    * [LZW](strings/compress/lzw)
+    * [Huffman](strings/compress/huffman.go)
+    * [LZW](strings/compress/lzw.go)
 ## [Priority Queues](pq)
   * Heap
   * Leftist Heap

strings/compress/testdata/tale.txt assets/compress/tale.txt

@@ -24,6 +24,8 @@ import (
 	"github.com/howz97/algorithm/util"
 )
 
+const testDir = "../assets/graphs/"
+
 func TestSCC_IsStronglyConnected(t *testing.T) {
 	g := NewDigraph(13)
 	g.AddEdge(0, 1)
@@ -117,7 +119,7 @@ func TestDFS_Graph(t *testing.T) {
 }
 
 func TestDFS_Digraph(t *testing.T) {
-	dg, err := LoadDigraph(".\\testdata\\dfs.yml")
+	dg, err := LoadDigraph(testDir + "dfs.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -146,7 +148,7 @@ func checkDFSResults(t *testing.T, g *Digraph, dfsResults [][]int) {
 }
 
 func TestRevDFS(t *testing.T) {
-	g, err := LoadDigraph(".\\testdata\\dfs.yml")
+	g, err := LoadDigraph(testDir + "dfs.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -182,7 +184,7 @@ func ExampleDigraph_FindCycle() {
 }
 
 func ExampleDigraph_Topological() {
-	dg, err := LoadDigraph(`.\testdata\no_cycle.yml`)
+	dg, err := LoadDigraph(testDir + "no_cycle.yml")
 	if err != nil {
 		panic(err)
 	}
@@ -194,7 +196,7 @@ func ExampleDigraph_Topological() {
 }
 
 func ExampleDigraph_Bipartite() {
-	dg, err := LoadDigraph(`.\testdata\no_cycle.yml`)
+	dg, err := LoadDigraph(testDir + "no_cycle.yml")
 	if err != nil {
 		panic(err)
 	}
@@ -204,7 +206,7 @@ func ExampleDigraph_Bipartite() {
 }
 
 func ExampleReachable() {
-	dg, err := LoadDigraph(`.\testdata\no_cycle.yml`)
+	dg, err := LoadDigraph(testDir + "no_cycle.yml")
 	if err != nil {
 		panic(err)
 	}
@@ -218,7 +220,7 @@ func ExampleReachable() {
 }
 
 func ExampleBFS() {
-	dg, err := LoadDigraph(`.\testdata\no_cycle.yml`)
+	dg, err := LoadDigraph(testDir + "no_cycle.yml")
 	if err != nil {
 		panic(err)
 	}

strings/compress/testdata/tale.txt.lzw assets/compress/tale.txt.lzw

@@ -21,7 +21,7 @@ import (
 )
 
 func TestDijkstra_Simple(t *testing.T) {
-	g, err := LoadWDigraph(".\\testdata\\w_digraph.yml")
+	g, err := LoadWDigraph(testDir + "w_digraph.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -33,7 +33,7 @@ func TestDijkstra_Simple(t *testing.T) {
 }
 
 func TestTopological_Simple(t *testing.T) {
-	g, err := LoadWDigraph(".\\testdata\\no_cycle.yml")
+	g, err := LoadWDigraph(testDir + "no_cycle.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -45,7 +45,7 @@ func TestTopological_Simple(t *testing.T) {
 }
 
 func TestBellmanFord_Simple(t *testing.T) {
-	g, err := LoadWDigraph(".\\testdata\\w_digraph.yml")
+	g, err := LoadWDigraph(testDir + "w_digraph.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -57,7 +57,7 @@ func TestBellmanFord_Simple(t *testing.T) {
 }
 
 func TestNegativeCycle(t *testing.T) {
-	g, err := LoadWDigraph(".\\testdata\\negative_cycle.yml")
+	g, err := LoadWDigraph(testDir + "negative_cycle.yml")
 	if err != nil {
 		t.Fatal(err)
 	}
@@ -144,10 +144,10 @@ func RandWDigraph(edgeLimit int, negativeEdge float64) (wd *WDigraph) {
 }
 
 func ExampleWDigraph() {
-	g, _ := LoadWDigraph("testdata/no_cycle.yml")
+	g, _ := LoadWDigraph(testDir + "no_cycle.yml")
 	searcher, _ := g.SearcherDijkstra()
-	// searcher, _ = g.SearcherTopological()
-	// searcher, _ = g.SearcherBellmanFord()
+	// searcher, _ := g.SearcherTopological()
+	// searcher, _ := g.SearcherBellmanFord()
 	fmt.Println(searcher.GetPath(1, 2).Str(nil))
 
 	// Output:

strings/compress/testdata/tale_1.txt assets/compress/tale_1.txt

@@ -50,7 +50,7 @@ func TestMST_Prim(t *testing.T) {
 }
 
 func Example() {
-	g, err := LoadWGraph("testdata/mst.yml")
+	g, err := LoadWGraph(testDir + "mst.yml")
 	if err != nil {
 		panic(err)
 	}

examples/binarytree.go assets/examples/binarytree.go

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package huffman
+package compress
 
 import (
 	"io"

examples/graph_mst.go assets/examples/graph_mst.go

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package huffman
+package compress
 
 import (
 	"strconv"
@@ -71,8 +71,8 @@ func newNode(br *bitReader) (n *node) {
 	return
 }
 
-// Compress data using huffman algorithm
-func Compress(data []byte) []byte {
+// HuffmanCompress data using huffman algorithm
+func HuffmanCompress(data []byte) []byte {
 	bw, table := compile(data)
 	bw.WriteUint32(uint32(len(data)))
 	for _, b := range data {
@@ -129,8 +129,8 @@ func genHuffmanTree(data []byte) (huffmanTree *node) {
 	return pq.Pop()
 }
 
-// Decompress data compressed by huffman algorithm
-func Decompress(data []byte) ([]byte, error) {
+// HuffmanDecompress data compressed by huffman algorithm
+func HuffmanDecompress(data []byte) ([]byte, error) {
 	br := newBitReader(data)
 	huffmanTree := newNode(br)
 	size := br.ReadBits(32)

examples/pq_binomial.go assets/examples/pq_binomial.go

@@ -12,22 +12,22 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package huffman
+package compress
 
 import (
 	"fmt"
-	"io/ioutil"
+	"os"
 	"testing"
 )
 
 func TestCompress(t *testing.T) {
-	data, err := ioutil.ReadFile("..\\testdata\\tale.txt")
+	data, err := os.ReadFile("../../assets/compress/tale.txt")
 	if err != nil {
 		t.Fatal(err)
 	}
-	compressed := Compress(data)
+	compressed := HuffmanCompress(data)
 	t.Logf("compress performance %.4f", float64(len(compressed))/float64(len(data)))
-	decompressed, err := Decompress(compressed)
+	decompressed, err := HuffmanDecompress(compressed)
 	if err != nil {
 		t.Error(err)
 	}
@@ -48,7 +48,7 @@ func TestCompress(t *testing.T) {
 
 func TestSimple(t *testing.T) {
 	data := "zhang how 1997"
-	de, err := Decompress(Compress([]byte(data)))
+	de, err := HuffmanDecompress(HuffmanCompress([]byte(data)))
 	if err != nil {
 		t.Error(err)
 	}
@@ -60,9 +60,9 @@ func TestSimple(t *testing.T) {
 
 func Example() {
 	data := []byte("zhang how, zhang how, zhang how, zhang how,")
-	compressed := Compress(data)
+	compressed := HuffmanCompress(data)
 	fmt.Printf("performance %.4f\n", float64(len(compressed))/float64(len(data)))
-	de, _ := Decompress(compressed)
+	de, _ := HuffmanDecompress(compressed)
 	fmt.Println(string(de))
 
 	// Output:

examples/pq_leftist.go assets/examples/pq_leftist.go

@@ -12,15 +12,15 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package lzw
+package compress
 
 import (
 	"github.com/howz97/algorithm/search"
 	"github.com/howz97/algorithm/util"
 )
 
-// Compress data using LZW algorithm
-func Compress(data []byte) (out []byte) {
+// LzwCompress data using LZW algorithm
+func LzwCompress(data []byte) (out []byte) {
 	table := search.NewHashMap[util.Str, uint16]()
 	unused := uint16(0)
 	for b := 0; b <= 0xFF; b++ {
@@ -51,8 +51,8 @@ func Compress(data []byte) (out []byte) {
 	return
 }
 
-// Decompress data compressed by LZW algorithm
-func Decompress(data []byte) (out []byte) {
+// LzwDecompress data compressed by LZW algorithm
+func LzwDecompress(data []byte) (out []byte) {
 	table := search.NewHashMap[util.Int, []byte]()
 	i := uint16(0)
 	for b := 0; b <= 0xFF; b++ {

examples/str_search.go assets/examples/str_search.go

@@ -12,22 +12,22 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-package lzw
+package compress
 
 import (
 	"fmt"
-	"io/ioutil"
+	"os"
 	"testing"
 )
 
-func TestCompress(t *testing.T) {
-	data, err := ioutil.ReadFile("..\\testdata\\tale_1.txt")
+func TestCompressLZW(t *testing.T) {
+	data, err := os.ReadFile("../../assets/compress/tale_1.txt")
 	if err != nil {
 		t.Fatal(err)
 	}
-	compressed := Compress(data)
+	compressed := LzwCompress(data)
 	t.Logf("compress performance %v", float64(len(compressed))/float64(len(data)))
-	decompressed := Decompress(compressed)
+	decompressed := LzwDecompress(compressed)
 
 	if len(data) != len(decompressed) {
 		t.Fatalf("raw data length is %v, decompressed length is %v", len(data), len(decompressed))
@@ -43,11 +43,11 @@ func TestCompress(t *testing.T) {
 	}
 }
 
-func Example() {
+func ExampleCompressLZW() {
 	data := []byte("howhowhowhowhowhowhowhowhow")
-	compressed := Compress(data)
+	compressed := LzwCompress(data)
 	fmt.Printf("performance %.4f\n", float64(len(compressed))/float64(len(data)))
-	fmt.Println(string(Decompress(compressed)))
+	fmt.Println(string(LzwDecompress(compressed)))
 
 	// Output:
 	// performance 0.8889