C #. NET uses the third-party class library DotNetZip to decompress/compress the Zip rarfile,

C #. NET uses the third-party class library DotNetZip to decompress/compress the Zip rarfile,

DotNetZip on CodePlex: http://dotnetzip.codeplex.com/

For details, see the source code ...... In short, it feels better than SharpZipLib. In addition, DotNetZip supports VB, C #, and any. NET language.

Compression:

// Define the file path string filename = @ "d:/test.rar"; using (ZipFile zip = new ZipFile () {zip. addFile (@ "C:/text.txt", "txt"); // store the text file in the txt folder zip. addFile (@ "C:/ReadMe.txt"); // store the ReadMe file in the zip directory. addFile (@ "C:/test.jpg", "images"); // store the test file in the images folder}

　　

Decompress:

using (ZipFile zip = new ZipFile(filename))            {                zip.ExtractAll("d:\\test", ExtractExistingFileAction.OverwriteSilently);            }

　　

Symbol in C Language <Yes

Left shift operator (<)

Removes all the binary bits of an operation object from the left and adds 0 to the right ).

For example, a = a <2 shifts the binary bits of a two places to the left and complements 0 to the right,

Move 1 to the left and then a = a * 2;

If the left shift does not include 1 in the Discard high position, then shifts one bit left, which is equivalent to multiplying the number by 2.
Shift right operator (>)

Shifts all the binary bits of a number to several places to the right, and adds 0 to the left of the positive number, 1 to the left of the negative number, and discards the right of the negative number.

The operand shifts one digit to the right, which is equivalent to dividing the number by 2.

For example, a = a> 2 shifts the binary bit of a two places to the right,

0 or 1 to see whether the number is positive or negative.

Symbol in C Language <Yes

Left shift operator (<)

Removes all the binary bits of an operation object from the left and adds 0 to the right ).

For example, a = a <2 shifts the binary bits of a two places to the left and complements 0 to the right,

Move 1 to the left and then a = a * 2;

If the left shift does not include 1 in the Discard high position, then shifts one bit left, which is equivalent to multiplying the number by 2.
Shift right operator (>)

Shifts all the binary bits of a number to several places to the right, and adds 0 to the left of the positive number, 1 to the left of the negative number, and discards the right of the negative number.

The operand shifts one digit to the right, which is equivalent to dividing the number by 2.

For example, a = a> 2 shifts the binary bit of a two places to the right,

0 or 1 to see whether the number is positive or negative.