The name given to the process of encoding data such that it uses lesser number of bits as compared to the original representation.
-1
votes
0answers
12 views
Serializing an object to a file using BinaryFormatter [on hold]
I have never used or even learned about using compression before. In my program I have a custom object and I am serializing that object to a file using ...
3
votes
1answer
107 views
Huffman algorithm implementation in C++
Lately, I have been working on this Huffman algorithm and it is finally done, though I think it is improvable due to the fact that people say you have got to use two priority queues but I ended up ...
0
votes
1answer
32 views
Compressing a file using zip or gzip
Write a Compress class defines two static methods, gzipFile(), which
compresses a file using GZIP compression format, and zipDirectory(),
which compresses the files (but not directories) in a ...
0
votes
1answer
82 views
Simplifying LZW compression & decompression
I have wrote code that takes an input file text that can be compressed, and should contain ascii values, and then a new file is created with an appended ".lzw" and that file can then be decompressed. ...
2
votes
1answer
40 views
Custom compression tool
I have made my own compression tool for a stack-based language that uses a dictionary compression method. The code for the decompression is the following:
...
1
vote
0answers
20 views
Adding information to a compressed file and compressing the output
I wrote this script for adding information to a compressed file and compressing the output:
...
5
votes
1answer
48 views
Uncompress archive, check contents, add missing files, recompress archive
The code looks for the specified .tgz file, if it's not present, it creates it. It looks for files ending in .txt in the cwd and adds them to a list. It decompresses the gzip, checks for the .txt ...
4
votes
1answer
55 views
SICP - exercise 2.69 - generate a huffman tree from a set of ordered leaves
From SICP
Exercise 2.69: The following procedure takes as its argument a list of
symbol-frequency pairs (where no symbol appears in more than one pair)
and generates a Huffman encoding tree ...
2
votes
1answer
46 views
RLE-like string compression in clojure
There have been already many similar questions to this one (e.g. this and this, just to point two), but I did not find any for clojure.
The goal is to compress a string in a RLE-like way: i.e. each ...
3
votes
2answers
98 views
Extracting RAR files in a directory
I just started programming, and something is telling me that this working function looks to big for what it does. Can you give a better version of the code so I can understand how to code faster, ...
1
vote
1answer
79 views
String compression implementation in C
I implemented basic string compression algorithm that uses the counts of repeated characters. For example: the string aabcccccaaa would become a2b1c5a3. What do you think about this, is there a better ...
1
vote
2answers
52 views
Simple compression on steroids - now with decompression
A third follow up to the simple compression implementation.
Adopted most of @holroy's suggestions. Main changes:
Compression now uses high-bit to indicate that additional length bytes are still ...
8
votes
2answers
210 views
Simple compression reloaded++
As a follow up to my previous question I've improved the code + algorithm. The compression now works the following way:
Each character is followed by a length byte. The top 3 bits of that byte denote ...
4
votes
2answers
52 views
Simple string compression reloaded
Inspired by this question I thought I provide my implementation. I tried to go with the spirit of the *nix tool chain - read from stdin and write to stdout. This has the added benefit of making ...
10
votes
4answers
549 views
Algorithm for simple string compression
I attempted a problem from the Cracking the Coding Interview book. The following input: aabcccaaa should give the following output: ...
11
votes
1answer
185 views
C++11 implementation of Huffman-encoding
This is a c++11 implementation of Huffman-encoding that I wrote as a hobby. My main goal in writing it was to get more accustomed to c++11 and STL in general, as well as stuff like bit-manipulation.
...
2
votes
0answers
80 views
Jacob's Ladder compression [closed]
I'm currently interested in a logical decay algorithm which will need me to have the correct coordination of 3 bytes. I have 2 of them, initially. After that, I have to get 2 from the one, but in that ...
2
votes
1answer
32 views
4
votes
2answers
157 views
lz77 is quick on strings but not on bytes
I ported a lz77 implementation from java to c#, and it's working fine. Now I want it to compress bytes and not strings, as I need it for another project.
This is the porting, operating on string:
...
3
votes
1answer
70 views
Run-length encoding in Haskell
I wrote a short Haskell script to compress and decompress via the use of run length encoding.
The concept is simple enough, n equal items ...
3
votes
1answer
82 views
4
votes
3answers
690 views
String compression by using repeated characters count
My task was to perform a basic string compression by replacing consecutive repeated characters by one instance of the character and integer denoting the number of repetitions.
For example the string ...
4
votes
1answer
350 views
Convert zip to gzip and upload to S3 bucket
My code accesses an FTP server, downloads a .zip file, pushes the file contents as .gz to an AWS S3 bucket.
...
1
vote
2answers
125 views
Brotli compression algorithm, translated from Python into Haskell
I have converted some code in Python into its Haskell equivalent.
Python implementation:
...
5
votes
1answer
75 views
Interop compression
This is a function definition from an external dll, that I'm calling from my code:
...
7
votes
2answers
123 views
Reverse engineering Darkstone game archives
Reverse engineering old games is something I do every now and then. This time, I took a shot at this old RPG called Darkstone.
The bulk of the game's data is stored in archive files with the ...
3
votes
2answers
103 views
LZW encoder and decoder
Recently, I reviewed this question about an LZW decoder. In order to properly review that question, I needed to write my own encoder and decoder to be able to test their program. Someone thought it ...
7
votes
2answers
170 views
LZW decompressor in C (II)
Here is an update to my previous thread which you can find here. Again, I'd very much appreciate any advice or comments about the structure/logic of the program, style of the code, or reusability of ...
11
votes
1answer
1k views
LZW decompressor in C
Here is a simple decompressor in C. I'd very much appreciate any advice or comments about the structure/logic of the program, style of the code, or reusability of the features. I'm a real novice and ...
3
votes
1answer
25 views
Bash Compress Managed Directory Ignoring .git, bower_components, node_modules, etc
Fairly easy way to compress a wordpress plugin (or similar) as a zip file without including all the dependencies used to create and manage the development, but which don't belong in the final product.
...
2
votes
1answer
66 views
Teamwork challenge for Timus Online Judge
Question is here:
Input
The first line contains an integer \$N\$, which is the quantity of numbers written down by Vasya (\$1 \le N \le 1000\$). The second line contains these numbers ...
4
votes
2answers
126 views
Transforming an array in Ruby
I watched a presentation by Dave Thomas on Elixir where he gave an example problem that he solved using functional programming. He mentioned using Ruby to solve the same problem, but did not show an ...
8
votes
1answer
3k views
Simple LZW compression algorithm
It's a simple version of LZW compression algorithm with 12 bit codes. I want to know what's good and what's bad about this code. Be as picky as you like.
...
2
votes
1answer
161 views
Huffman code generator in Haskell
This is problem 50 in https://wiki.haskell.org/99_questions/46_to_50. The website has more elegant Haskell solutions, but I wanted to get feedback on how the code I wrote on my own below could be ...
3
votes
1answer
71 views
Program for compacting other given code
I've just finished a small function that will reduce the size of code as much as possible without breaking anything. Obviously it makes everything a bit unreadable so it's not really for cleaning the ...
2
votes
1answer
50 views
2
votes
2answers
103 views
Using reduce twice in a row for Run Length Encoding
First of all, I'm new to Lisp (I currently use CLISP and SBCL). There probably are huge mistakes in this code so any guidelines are welcome :)
I'm very confused about how to do this. It's just about ...
3
votes
1answer
642 views
HTML Compressor with regex
I would like to compress a Magento HTML page using some regex, and this is what I have written:
...
3
votes
2answers
310 views
Process zip files
I have zip bundle, for example, abcd.zip, contains more zips like 1.zip, 2.zip etc. Inside of each child zip there is a .jpg file like 1.jpg, 2.jpg etc. There are so many other files but I need only ...
5
votes
3answers
384 views
Compress an ASCII string
Given an ASCII string create a 'compressed' version of it. For example, aabccccddddddde would output a2bc4d7e whereas abc would output abc.
This is how I've implemented it. Is there a smarter way ...
4
votes
1answer
321 views
Compressing a stream asynchronously, and returning a byte[]
Assuming I have to leave the contract intact (take byte[] and return byte[]), what's the correct way to structure this ...
0
votes
1answer
98 views
Converting Ocean to RunLengthEncoding object
For the problem statement shown below:
Part II(b):
Your run-length encodings will only be useful if other classes
have the ability to read them after you create them. Therefore, implement the
...
2
votes
1answer
538 views
Counting the lines of a compressed file
This is a Python script for counting the lines of a compressed file:
...
1
vote
2answers
192 views
Backing up an entire website with PHP
I'm attempting to backup lots of website using this php code. The script basically goes through the whole public_html directory and adds all the folders and files recursively and zips them.
Here's ...
3
votes
2answers
788 views
String compression using repeated character counts
Implement a method to perform basic string compression using the counts of
repeated characters. For example, the string aabcccccaaa would become
...
8
votes
1answer
162 views
Saving bytes instead of objects to write smaller files
This question is about reducing the size of files saved to disk in an infinite world 2D mining game.
I finally added code to my game to save and load distant chunks instead of keeping all of them ...
2
votes
2answers
1k views
Evaluation of a solution for Run-length encoding algorithm
I wrote an answer for the following question and wondering if there is any better approach to it.
Using the Java language, have the function RunLength(str) take ...
8
votes
4answers
8k views
Basic string compression counting repeated characters
My task was to implement a method which performs basic string compression by counting sequences of repeating characters. Given "aaabbbccc" it should return ...
6
votes
3answers
3k views
String compression implementation in C#
I wrote a method that reduces a string like aabcccccaaa to a2b1c5a3
My implementation:
...
8
votes
2answers
204 views
Lossy packing 32 bit integer to 16 bit
I am working on the lossy 16 bit representation for 32 bit integers that catches all 32 bit range with precision depending on absolute value.
My idea is to store integer ...
