How to extract quantization matrices from a JPEG in C#

How to extract quantization matrices from a JPEG in C# - c#

Is it possible to extract the quantization matrices of a JPG file in C#? I have found the libjpeg.NET but I cannot figure out how to retrieve the QTs matrices. Please find below my code.
using System;
using System.Collections.Generic;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using BitMiracle.LibJpeg;
namespace ConsoleApp
{
class Program
{
static void Main(string[] args)
{
string file = #"PATH_TO_FILE";
JpegImage img = new JpegImage(file);
Console.Read();
// Ideally, there should be some img.GetQuantizationMatrix() method
}
}
}

If you just want the quantization tables (and nothing else), it is a simple matter to scan the JPEG stream for the DQT marker (FFDB-followed by a 2-byte length) and extract the values.
You do not need to decode the image to get this information.

Thanks to the suggestion by #user3344003, I managed to read the JPEG header to extract quantization matrix information. I followed the file layout spec presented in this web page.
void Main()
{
string folder = #"PATH_TO_FILE";
var files = Directory.GetFiles(folder, "*jpg", SearchOption.AllDirectories);
byte dqt = 0xDB;
foreach (string file in files)
{
file.Dump();
byte[] s = File.ReadAllBytes(file);
for (int i = 0; i < s.Length-1; i++) {
byte b1 = s[i];
byte b2 = s[i+1];
if (b1 == 0xff && b2 == 0xdb) {
int field_length = s[i + 2] + s[i + 3];
int matrix_length = field_length - 3;
int qt_info = s[i + 4];
("QT info" + qt_info).Dump();
("QT Matrix").Dump();
byte[] mat = new byte[matrix_length];
for (int k = 0; k < matrix_length; k++) {
mat[k] = s[i+5+k];
}
Print8x8Matrix(mat);
}
}
}
}
public static void Print8x8Matrix(byte[] bytes)
{
string s = "";
for (int i= 0; i < bytes.Length; i++) {
s += bytes[i] + " ";
if (i % 8 == 0)
{
s.Dump();
s="";
}
}
}

Related

C# Bitmap: System.ArgumentException "Invalid parameter."

Faced such a problem "System.ArgumentException", while writing an envelope from an image (.jpg) in a text file with a picture (ASCII). Did according to the instructions (https://www.bilibili.com/video/av5862027/)
For the second or third day I try to solve this problem.
Code:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Drawing;
using System.IO;
namespace ayy
{
class Program
{
static void Main(string[] args)
{
FileStream stream = new FileStream(#"meme.txt", FileMode.OpenOrCreate, FileAccess.Write);
StreamWriter writer = new StreamWriter(stream);
for (int imageNumber = 0; imageNumber <= 7600; imageNumber++)
{
string url = #"C:\Users\Admin\source\repos\badapple\ayy\ba\ba";
if (imageNumber < 10)
{
url += "00000";
}
else if (imageNumber < 100)
{
url += "0000";
}
else if (imageNumber < 1000)
{
url += "000";
}
else
{
url += "00";
}
url += imageNumber.ToString() + ".jpg";
Bitmap image = new Bitmap(url, true);
for (int y = 0; y < image.Height; y++)
{
string str = "";
for (int x = 0; x < image.Width; x++)
{
Color pixel = image.GetPixel(x, y);
if (pixel.R > 200)
{
str += "#";
}
else
{
str += " ";
}
writer.WriteLine(str);
}
Console.WriteLine(url);
}
writer.Close();
}
}
}
}

using, using, using
Every time you go to play with something (or create an object) check if you can use a using statement
If you expect a file to be there, do some due diligence and check if it exists
If you want to join paths and file names, use Path.Combine()
GetPixel is extremely slow, so probably better to use LockBits
Why use lots of ifs to add 0's when you can use a format specifier $"{imageNumber:D5}.jpg"
Truthfully, i am not sure if this will fix your problem, but you are much better place regardless
using (var stream = new FileStream(#"meme.txt", FileMode.OpenOrCreate, FileAccess.Write))
{
using (var writer = new StreamWriter(stream))
{
for (var imageNumber = 0; imageNumber <= 7600; imageNumber++)
{
var dir = #"C:\Users\Admin\source\repos\badapple\ayy\ba\ba";
var fileName = Path.Combine(dir, $"{imageNumber:D5}.jpg");
if (File.Exists(fileName))
{
throw new FileNotFoundException($"Woah, what now : {fileName}");
}
using (var image = new Bitmap(fileName, true))
{
for (var y = 0; y < image.Height; y++)
{
for (var x = 0; x < image.Width; x++)
{
var pixel = image.GetPixel(x, y);
writer.Write(pixel.R > 200 ? "#" : " ");
}
writer.WriteLine();
}
}
}
}
}
If you are still having problems, work out what file is causing the problem, check to see if it is actually an image and loads. My spidey senses tells me its not

HeapSort Algorythm from txt file to list of arrays doesn't Sort the numbers

So I have to make HeapSort Algorythm for University using pseudocode I was given (only for heapsort). And I have to use input and output file. But for now I have only made input file which is working fine since it loads the txt file and writes down all the numbers in Console. So the problem is that after adding sorting methods to Main nothing changes. Also I decided to make a test for every method and all of them writes down my numbers once and that is it. I am not really good with sorting so it is hard for me to find the issue. Also because it is from pseudocode I had to use and no the code I could do for myself. So Do You know what cause thats issue that the sorting doesn't occure?
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Microsoft.Win32;
using System.IO;
using System.Windows.Forms;
namespace Zad4
{
class Program
{
void Heapify(List<int> array, int i, int n)
{
int largest, temp;
int parent = i;
int left = 2 * i + 1;
int right = 2 * i + 2;
if (left < n && array[left] > array[parent])
{
largest = left;
}
else
{
largest = parent;
}
if (right < n && array[right] > array[largest])
{
largest = right;
}
if (largest != i)
{
temp = array[i];
array[i] = array[largest];
array[largest] = temp;
Heapify(array, largest, n);
}
}
void BuildHeap(List<int> array, int n)
{
int i;
for (i = (n - 1) / 2; i >= 0; i--)
{
Heapify(array, i, n);
}
}
void HeapSort(List<int> array, int n)
{
int i, temp;
for (i = n - 1; i >= 0; i--)
{
temp = array[0];
array[0] = array[n - 1];
array[n - 1] = temp;
n = n - 1;
Heapify(array, 0, n);
Console.WriteLine(string.Join(" ", array));
}
}
static void Main(string[] args)
{
int n = 0;
Program A = new Program();
StreamReader myFile =
new StreamReader("C:\\Users\\dawid\\Desktop\\C#\\Heapsort\\dane.txt");
string myString = myFile.ReadToEnd();
myFile.Close();
char rc = (char)10;
String[] listLines = myString.Split(rc);
List<List<int>> listArrays = new List<List<int>>();
for (int i = 0; i < listLines.Length; i++)
{
List<int> array = new List<int>();
String[] listInts = listLines[i].Split(' ');
for (int j = 0; j < listInts.Length; j++)
{
if (listInts[j] != "\r")
{
array.Add(Convert.ToInt32(listInts[j]));
}
}
listArrays.Add(array);
A.BuildHeap(array, n);
A.HeapSort(array, n);
}
foreach (List<int> array in listArrays)
{
foreach (int i in array)
{
Console.WriteLine(string.Join(" ", array));
}
}
Console.WriteLine();
Console.ReadLine();
}
}
}

So the solution I found is just changing the way I read my txt file and the most important one was bad use of my methods. So that is how it looks now and it sorting well. Maybe I shouldn't ask a question since I got an answer on my own. But well. There You go:
static void Main(string[] args)
{
Program A = new Program();
string[] array = System.IO.File.ReadAllLines(#"C:\Users\dawid\Desktop\C#\Heapsort\dane.txt");
int[] arrayInt = Array.ConvertAll(array, int.Parse);
A.BuildHeap(arrayInt, arrayInt.Length);
A.HeapSort(arrayInt, arrayInt.Length);
Console.WriteLine(string.Join(" ", arrayInt));
Console.ReadLine();
}

Problems converting an array to a two dimensional array

I have a text file called Labyrint, that I read into a char array. After that I read the char array into a list without the \n (line break character). After I did that I convert the list to an array. Now I want this array to be a two dimensional array, but how do I do that. Here is an image of the labyrint that is 21x21 in size Labyrint. And below is my code:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Threading.Tasks;
namespace ConsoleApplication25
{
class Program
{
static char[] FloridaArray;
static string DenverString;
static string[,] names = new string[21, 21];
static List<object> wrd = new List<object>();
static void Main(string[] args)
{
//Increase Console Buffer Height
Console.BufferHeight = Int16.MaxValue - 1;
DenverString = ConvertStringArrayToString();
FloridaArray = DenverString.ToArray();
Console.WriteLine(DenverString);
for (int i = 0; i < FloridaArray.Length; i++)
{
if (FloridaArray[i] != '\n')
{
wrd.Add(FloridaArray[i].ToString());
}
}
foreach (object o in wrd)
{
Console.WriteLine(o);
}
//Here I check what index 21 contain in the list called wrd
Console.WriteLine("Here I check if index 21 contain character B: " + wrd[21]);
Console.WriteLine(wrd.GetType());
// Here I convert the list called wrd to an array.
object[] myArray = wrd.ToArray();
// Here I check what character is in index 21 in the array called myArray.
Console.WriteLine(myArray[21]);
//Here I look up the data type of myArray
Console.WriteLine(myArray.GetType());
for (int j = 0; j < 21; j++)
{
for (int i = 0; i <= 21; i++)
{
// how do I put the value from my char array into the two dimensional array?
names[j, i] = myArray[i].ToString();
Console.WriteLine(j + " names " + i);
}
}
}
static string ConvertStringArrayToString()
{
// Concatenate all the elements into a StringBuilder.
StringBuilder builder = new StringBuilder();
foreach (var value in File.ReadAllLines("Labyrint.txt", Encoding.UTF8).Skip(1))
{
builder.Append(value);
builder.Append('\n');
}
return builder.ToString();
}
}
}

I think the important point here is that your index into the main array needs to be calculated. From your nested loop indexers, the value you need is:
j*21 + i
So that makes you loop look like this:
for (int j = 0; j < 21; j++)
{
for (int i = 0; i <= 21; i++)
{
names[j, i] = myArray[j*21 + i].ToString();
Console.WriteLine(j + " names " + i);
}
}
You may need to adjust your indexes though, I cannot tell exactly as you haven't provided any example input.

Error when trying decompress byte array ( C#)

I am trying to decompress byte array into a bitmap. but getting error.
This my coding....when execute it produce the error that "Index was outside the bounds of the array."
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
namespace ConsoleApplication2
{
class Program
{
private static byte[] minbuffer;
static void Main(string[] args)
{
byte[] buffer = new byte[] { 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x83,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x1B,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,0x7B,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFC,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xBF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF9,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0x87,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF9,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xC3,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFB,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xF0,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC3,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xF8,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC3,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xF8,0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC3,0xF9,0xFC,0xFF,0xE3,0xFF,0xFF,0xC3,0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE7,0xFB,0xC0,0x07,0x83,0xFF,0xFE,0x1F,0x1F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE7,0xF3,0x1F,0xF3,0x07,0xFF,0xF0,0xFF,0xCF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE3,0xF4,0x7F,0xF8,0x6F,0xFF,0x87,0xFF,0xE7,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE3,0xE1,0xFF,0xF8,0xCF,0xFE,0x3F,0xFF,0xF3,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF3,0xE3,0xFF,0xF0,0x9F,0xF0,0xFF,0xFF,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF3,0xC7,0xFF,0xC6,0xBF,0xC3,0xFF,0xFF,0xFC,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF3,0xCF,0xFF,0x9E,0x3E,0x1F,0xFF,0xFF,0xF6,0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF9,0x9F,0xFF,0x3E,0x78,0xFF,0xFF,0xFF,0xC7,0x1F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF9,0x3F,0xFE,0x7E,0x78,0xFF,0xFF,0xFE,0x0F,0xCF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFD,0x7F,0xFC,0xFC,0xF0,0xF7,0xFF,0xF8,0x3F,0xE7,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFC,0xFF,0xF9,0xF8,0xF8,0xF7,0xFF,0xE0,0xFF,0xF9,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFC,0xFF,0xF3,0xF1,0xFC,0x77,0xFF,0x81,0xFF,0xFC,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,0x7F,0xE7,0xF1,0xFC,0x13,0xFE,0x33,0xFF,0xFE,0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,0x7F,0x9F,0xC3,0xF8,0xC1,0xF8,0xC7,0xFE,0x1F,0x1F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x7F,0xBF,0x9B,0xF0,0xF0,0x03,0x9F,0xF8,0xFF,0xCF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x3E,0x3F,0x33,0xF4,0xF7,0x8E,0x3F,0xE3,0xFF,0xE7,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xBC,0xFE,0x73,0xE4,0xF6,0x3C,0xFF,0x82,0x00,0x03,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x99,0xFC,0xFB,0xCE,0xE0,0xF9,0xFE,0x20,0x1F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xCB,0xF1,0xFB,0x1E,0x63,0xF3,0xF8,0x07,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC3,0xE3,0xFC,0x7F,0x0F,0xE7,0xC0,0xCF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC7,0xCF,0xFF,0xFE,0x3F,0xE0,0x0F,0x9F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xEF,0x9F,0xFF,0xF8,0xFF,0xE0,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xEE,0x3F,0xFF,0xF1,0xFF,0x0F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE0,0xFF,0xFF,0xC7,0xF8,0x3F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF3,0xFF,0xFF,0x9F,0xE1,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,0x3E,0x0F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFC,0xF0,0x7F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF1,0xC3,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC6,0x1F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x90,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,0x03,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFC,0x3F,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xF0,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xE3,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF };
buffer = decompress(buffer, 168, 44);
Console.ReadLine();
}
private static byte[] decompress(byte[] raw, int width, int height)
{
byte[] signdecompress = new byte[width * height];
for (int h = 0; h < height; h++)
{
for (int w = 0; w < (width / 8); w++)
{
byte num = raw[h * (width / 8) + w];
int ByteIndex = (h * width + w * 8);
string str = Convert.ToString(num);
for (byte s = 0; s < 8; s++)
{
if (str[s] == '1')
{
signdecompress[ByteIndex + s] = (byte)(255);
}
else
signdecompress[ByteIndex + s] = (byte)(0);
}
}
}
return signdecompress;
}
}
}
please help. i need the result to become
0xFF,0xD8,0xFF,0xE0,0x00,0x10,0x4A,0x46,0x49,0x46,0x00,0x01,0x01,0x00,0x00,0x01,0x00,0x01,0x00,0x00,0xFF,0xDB,0x00,0x43,0x00,0x02,0x02,0x02,0x02,0x02,0x01,0x02,0x02,0x02,0x02,0x03,0x02,0x02,0x03,0x03,0x06,0x04,0x03,0x03,0x03,0x03,0x07,0x05,0x05,0x04,0x06,0x08,0x07,0x09,0x08,0x08,0x07,0x08,0x08,0x09,0x0A,0x0D,0x0B,0x09,0x0A,0x0C,0x0A,0x08,0x08,0x0B,0x0F,0x0B,0x0C,0x0D,0x0E,0x0E,0x0F,0x0E,0x09,0x0B,0x10,0x11,0x10,0x0E,0x11,0x0D,0x0E,0x0E,0x0E,0xFF,0xC0,0x00,0x0B,0x08,0x00,0x2C,0x00,0xA8,0x01,0x01,0x11,0x00,0xFF,0xC4,0x00,0x1F,0x00,0x00,0x01,0x05,0x01,0x01,0x01,0x01,0x01,0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,0x0A,0x0B,0xFF,0xC4,0x00,0xB5,0x10,0x00,0x02,0x01,0x03,0x03,0x02,0x04,0x03,0x05,0x05,0x04,0x04,0x00,0x00,0x01,0x7D,0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xA1,0x08,0x23,0x42,0xB1,0xC1,0x15,0x52,0xD1,0xF0,0x24,0x33,0x62,0x72,0x82,0x09,0x0A,0x16,0x17,0x18,0x19,0x1A,0x25,0x26,0x27,0x28,0x29,0x2A,0x34,0x35,0x36,0x37,0x38,0x39,0x3A,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4A,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5A,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6A,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7A,0x83,0x84,0x85,0x86,0x87,0x88,0x89,0x8A,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9A,0xA2,0xA3,0xA4,0xA5,0xA6,0xA7,0xA8,0xA9,0xAA,0xB2,0xB3,0xB4,0xB5,0xB6,0xB7,0xB8,0xB9,0xBA,0xC2,0xC3,0xC4,0xC5,0xC6,0xC7,0xC8,0xC9,0xCA,0xD2,0xD3,0xD4,0xD5,0xD6,0xD7,0xD8,0xD9,0xDA,0xE1,0xE2,0xE3,0xE4,0xE5,0xE6,0xE7,0xE8,0xE9,0xEA,0xF1,0xF2,0xF3,0xF4,0xF5,0xF6,0xF7,0xF8,0xF9,0xFA,0xFF,0xDA,0x00,0x08,0x01,0x01,0x00,0x00,0x3F,0x00,0xFD,0xFB,0xA2,0x8A,0x28,0xAF,0x90,0x3F,0x68,0x9F,0x8E,0xFA,0x8E,0x99,0xE2,0x2F,0x0A,0xFC,0x0B,0xF8,0x17,0xE3,0x0F,0x0A,0xDC,0x7E,0xD0,0x7E,0x30,0xF1,0x55,0xB7,0x87,0xE5,0xB6,0x93,0x55,0xB4,0xBA,0xD4,0x3C,0x1B,0x65,0x2D,0xA4,0xD7,0xB7,0x5A,0xDC,0x9A,0x6B,0xC8,0xA6,0x6F,0x22,0xD6,0x13,0x22,0x45,0x21,0x55,0x76,0x92,0x2F,0xBF,0x91,0x14,0x9F,0x38,0x7C,0x57,0xF8,0x31,0xF0,0xC3,0xF6,0x45,0xF1,0x9F,0xEC,0x91,0xE2,0xDF,0x85,0xBE,0x10,0xB5,0xD4,0x7E,0x20,0xEB,0xDF,0xB4,0x56,0x95,0xA4,0x78,0x93,0xC6,0x9E,0x29,0x92,0x4D,0x4F,0x5D,0xD6,0x86,0xAF,0xA7,0x5F,0x58,0x5F,0xCF,0x71,0x7A,0xED,0xE6,0x6F,0x93,0xCC,0x37,0x1B,0x14,0xAC,0x1E,0x7F,0xCF,0xE5,0x75,0x07,0xF5,0x3A,0x8A,0x28,0xA2,0xBE,0x00,0xF1,0xEF,0xED,0x99,0xE2,0x9F,0xD9,0xD7,0xF6,0x8E,0x6D,0x03,0xF6,0xA6,0xF8,0x51,0xFF,0x00,0x08,0x3F,0xC1,0x9D,0x4F,0x55,0xD4,0x2D,0xFC,0x2F,0xF1,0x87,0xC3,0x77,0xF2,0x6A,0xBA,0x6D,0xD6,0x09,0xB8,0xB3,0xB7,0xBA,0xB1,0x8E,0x26,0xB8,0xB5,0x98,0xDB,0x7E,0xED,0x8F,0xCD,0xBE,0x78,0x65,0x68,0xD3,0xC9,0xDC,0xF1,0x7D,0xFF,0x00,0x45,0x14,0x51,0x45,0x14,0x51,0x45,0x14,0x51,0x5F,0x94,0x3E,0x3A,0xF8,0x7F,0xA1,0x78,0x1F,0xFE,0x0E,0xD1,0xF8,0x1D,0xF1,0x0A,0xE3,0xC0,0x1F,0x6B,0x87,0xE2,0x57,0x80,0x35,0x2B,0x7B,0x0D,0x7B,0xFB,0x71,0xD3,0xEC,0xFA,0xED,0x85,0x94,0xCB,0x71,0x73,0xE4,0x6E,0x3B,0xB1,0xA6,0xAD,0xAD,0xAF,0x96,0x55,0x22,0x3F,0x69,0xF3,0x06,0x64,0x8D,0xAB,0xA0,0xFD,0xAA,0x3E,0x29,0x7F,0xC2,0x79,0xFF,0x00,0x05,0x57,0xFD,0x9E,0x7F,0x66,0xFF,0x00,0x03,0xFC,0x3F,0xFF,0x00,0x85,0xBD,0xE2,0x6F,0x05,0xEA,0xB1,0x7C,0x45,0xD6,0x34,0xC8,0xEF,0xBE,0xC7,0x69,0xA7,0xDE,0xC5,0xFB,0x8D,0x39,0xAF,0xF5,0x08,0xA5,0x66,0xD3,0xE1,0xB7,0x4B,0x99,0xAF,0xA4,0x0D,0x6B,0x33,0x4A,0x46,0x9D,0x0A,0x23,0x7D,0xAC,0xD7,0xBF,0xCD,0xF0,0x1B,0xE3,0xAF,0xC4,0x7F,0x85,0x9A,0x8D,0xA7,0xC6,0x2F,0xDA,0x9B,0xC5,0x5E,0x14,0xD5,0xB5,0x7F,0xB3,0xC9,0x73,0xA5,0x7C,0x17,0xB2,0xB2,0xF0,0xFE,0x9F,0xA4,0xEC,0x8E,0x12,0xD0,0x5B,0x5E,0x5C,0xDB,0xDC,0xEA,0x4F,0xFB,0xF8,0xE4,0x63,0x37,0xDA,0x23,0xF3,0x16,0x4D,0xBE,0x54,0x6B,0x94,0xAF,0x9C,0x3F,0x68,0x9F,0xDA,0x3B,0xC6,0xFF,0x00,0xB2,0x87,0xC4,0xCD,0x2A,0x5F,0x07,0xFC,0x59,0xD7,0xFF,0x00,0x6B,0x5D,0x6F,0x4D,0xB5,0xBD,0x9F,0xE2,0x0F,0xC2,0x8B,0xED,0x37,0x4A,0xFB,0x7E,0x89,0xA5,0xAD,0xB4,0x73,0x8D,0x6A,0x4B,0xBD,0x1F,0x4D,0x8D,0xB4,0xC4,0x81,0x9E,0xDC,0x1F,0xB5,0xC7,0x22,0x4D,0x1D,0xE6,0x57,0x6F,0x97,0xE6,0x0D,0x0F,0xD9,0x9B,0xC2,0x1F,0xB4,0x77,0xC4,0x4F,0xF8,0x28,0xE7,0x8C,0x7E,0x2E,0xFC,0x59,0xF8,0xFF,0x00,0xE2,0xAF,0x10,0xF8,0x27,0xC1,0x1E,0x6E,0x83,0x6B,0xE1,0xFD,0x0B,0x48,0x6D,0x03,0xC2,0x1A,0x9E,0xB7,0xBA,0xEA,0x2D,0x4A,0xD2,0xDA,0xDD,0xA5,0xF3,0x35,0x0B,0x3D,0x36,0x46,0x30,0x25,0xEC,0xF0,0xAC,0x93,0xCC,0xA3,0xE7,0x22,0xD0,0xEF,0xFA,0xBF,0xE2,0x7F,0xED,0x5F,0xF0,0x4B,0xE1,0x57,0xC4,0xC1,0xF0,0xFB,0x53,0xF1,0x1D,0xD7,0x8B,0xBE,0x2C,0x4D,0x6B,0x71,0x35,0x8F,0xC3,0xEF,0x05,0x69,0x33,0xEB,0xBA,0xFD,0xD3,0x43,0x6C,0x2E,0xBC,0x9F,0xB2,0xDA,0xAB,0x79,0x0E,0xF1,0x32,0xBA,0x7D,0xA0,0xC4,0xAC,0xB9,0x6D,0xDB,0x55,0x99,0x79,0xF9,0xEF,0x3F,0x6C,0x0F,0x89,0x5A,0x75,0xD4,0x7A,0x3E,0x93,0xE0,0xAF,0xD9,0x8B,0x44,0xB8,0xB5,0xD4,0x61,0x82,0xF7,0x5E,0x63,0xE3,0x0F,0x12,0x46,0xDE,0x68,0x8A,0xCA,0x6F,0xB2,0x5B,0xBC,0x1A,0x7D,0xAB,0xF9,0x62,0x49,0xCF,0xFA,0x55,0xF2,0xE5,0xA2,0x42,0xA7,0x0F,0x5A,0x1F,0xF0,0xC9,0xBF,0x0E,0x3C,0x41,0xE2,0x2F,0xED,0x8F,0x8C,0x5A,0xDF,0x8A,0xBF,0x68,0x8B,0xF4,0xD5,0x7F,0xB4,0x6D,0xA0,0xF8,0x8F,0xAC,0x8B,0xAD,0x22,0xDA,0x4F,0xB2,0x7D,0x91,0x76,0x68,0xD6,0xC9,0x06,0x97,0xF2,0xA1,0x90,0x87,0xFB,0x27,0x99,0xBE,0x67,0x7D,0xD9,0xC6,0x3C,0xBF,0x46,0xD7,0x3C,0x4D,0xFB,0x17,0x6A,0x3E,0x16,0xF0,0x47,0xC4,0x7F,0x12,0x5D,0x78,0xCF,0xF6,0x51,0x92,0xD6,0xC3,0x43,0xF0,0xBF,0x8F,0xF5,0x3B,0x6B,0x68,0xAF,0x7C,0x01,0x34,0x71,0x47,0x69,0x05,0x86,0xB2,0x6D,0xE2,0x8A,0x37,0xB0,0x9B,0x62,0x79,0x5A,0x8E,0xC0,0x62,0x95,0xFC,0xBB,0x9E,0x1E,0x39,0xAB,0xEE,0xFA,0x28,0xA2,0x8A,0x28,0xA2,0x8A,0x28,0xA2,0xBE,0x30,0xFD,0xB8,0x3C,0x37,0x71,0x6B,0xFB,0x30,0x68,0xDF,0x1E,0xFC,0x35,0xA2,0xDD,0x6A,0xDF,0x10,0x7E,0x09,0x6B,0xF6,0xDE,0x35,0xD2,0xD7,0x4E,0xD4,0xA2,0xD3,0x6E,0x2E,0xB4,0xF8,0x24,0x5F,0xED,0x8B,0x17,0xBA,0x65,0x2C,0xB6,0xD3,0x69,0xFF,0x00,0x68,0xF3,0x23,0x4F,0xF5,0x86,0x28,0xBE,0x59,0x31,0xE5,0xB7,0xA0,0x7E,0xCC,0x9F,0x0E,0x7C,0x1B,0xE1,0x6F,0x80,0x76,0xDF,0x10,0x74,0x3F,0x15,0x5D,0x7C,0x52,0xF1,0x5F,0xC4,0x9B,0x5B,0x4F,0x12,0x78,0x9B,0xE2,0x4E,0xAD,0x68,0x6D,0xEF,0xFC,0x54,0xD3,0x40,0x1E,0xDE,0x5F,0x28,0x81,0xF6,0x5B,0x68,0xE2,0x70,0x96,0xF6,0x40,0x05,0xB7,0x8F,0xE5,0xC6,0xED,0xEC,0xDC,0xFF,0x00,0xC4,0xFF,0x00,0x8B,0xDE,0x32,0xF1,0x97,0x8A,0x47,0xC1,0xFF,0x00,0xD9,0x8E,0x6B,0x5D,0x5B,0xC7,0x17,0x57,0x57,0x16,0x3E,0x27,0xF8,0x8A,0x6D,0x85,0xF6,0x81,0xF0,0xED,0x60,0x60,0x97,0x3E,0x7B,0x0F,0xDD,0xDC,0xEA,0xCB,0xB8,0x08,0x74,0xBD,0xDB,0xB7,0x11,0x25,0xC0,0x8E,0x11,0xFB,0xCF,0x90,0x3F,0x68,0x9F,0x13,0xF8,0x37,0xE0,0x9F,0xC0,0x3D,0x2B,0xF6,0x0A,0xFD,0x9B,0xAC,0x2D,0x7C,0x7F,0xF1,0xBB,0xE3,0x25,0xD5,0xEE,0x87,0xE2,0x3B,0xCD,0x57,0x57,0x3A,0x8D,0xFD,0x83,0x6A,0x10,0x47,0xFD,0xA3,0xAF,0x6B,0xED,0x0E,0xEB,0xA6,0xB9,0x96,0x0B,0x9F,0x3C,0x48,0xD1,0xED,0x11,0xA3,0xC9,0xFE,0xAA,0xDD,0x60,0x7E,0x7F,0xFE,0x0A,0x43,0xF0,0xF7,0x54,0xF8,0x15,0xFF,0x00,0x04,0x2B,0xF0,0x47,0x81,0x3E,0x0E,0x7C,0x41,0xB5,0xF8,0x6F,0xF0,0xFB,0xC2,0x77,0x56,0xDA,0x3E,0xAB,0xA5,0x9B,0xB6,0xD3,0xF5,0x4F,0x17,0x43,0x34,0x32,0x5B,0x34,0x01,0xED,0x8C,0x71,0xDC,0x3C,0xBE,0x74,0xF7,0x57,0x50,0x34,0x38,0x9F,0xF7,0x93,0x65,0x3C,0x92,0xB2,0xFD,0x01,0xF0,0xC3,0xF6,0xA2,0xFD,0x9A,0x7C,0x29,0xFB,0x4F,0xFC,0x30,0xF8,0x27,0xF0,0xF7,0x43,0xD0,0x3E,0x04,0x5A,0x78,0xC2,0xD7,0x52,0x7D,0x6B,0xC1,0x3A,0x97,0x83,0x1F,0xC2,0xFA,0xC6,0x9B,0xE2,0x4F,0x2F,0x48,0x92,0xC6,0xD2,0xE6,0xD7,0x64,0x69,0x1B,0xDC,0x5B,0x5C,0xDC,0x28,0x94,0x86,0x49,0xDE,0xDE,0x38,0xE1,0x99,0xC8,0xDA,0xDF,0x67,0xFC,0x4B,0xF8,0xAB,0xF0,0xE3,0xE0,0xDF,0xC2,0xCB,0xAF,0x1A,0xFC,0x51,0xF1,0x9E,0x95,0xE0,0x7F,0x0C,0xC1,0xB8,0x7D,0xB3,0x54,0xBA,0x11,0xF9,0xF2,0x08,0xDE,0x5F,0x26,0x14,0xFB,0xD3,0xCC,0x52,0x39,0x0A,0xC3,0x18,0x69,0x1B,0x69,0xDA,0xA6,0xBF,0x38,0x3E,0x2E,0x7E,0xDA,0x9F,0xB4,0x0F,0x8F,0xBF,0x68,0xED,0x23,0xF6,0x7D,0xFD,0x92,0xFE,0x0F,0xFF,0x00,0x64,0xF8,0xDB,0x5B,0xFB,0x52,0x5C,0x78,0xA3,0xE2,0x04,0xB1,0x43,0x77,0xE1,0xFB,0x68,0x8B,0x45,0x26,0xA3,0x73,0xA2,0xEE,0x37,0x3A,0x74,0x38,0x96,0xCA,0xE6,0xDE,0x6D,0x4A,0x34,0x33,0x07,0x08,0xB6,0x72,0x97,0x4D,0xDF,0x4F,0xF8,0x07,0xF6,0x76,0xB3,0xF8,0x7D,0xFF,0x00,0x09,0xAF,0xC4,0xFF,0x00,0xDA,0x37,0xE3,0x5E,0xAB,0xF1,0xE3,0xC4,0xD7,0xBE,0x15,0xBB,0xD2,0xFC,0x45,0xAB,0x78,0xD3,0xEC,0xFA,0x77,0x85,0xF4,0xDD,0x21,0xF6,0xB5,0xE4,0x70,0x69,0x4B,0xFE,0x89,0x69,0x0C,0xB1,0x5A,0xDA,0x7D,0xA4,0xB9,0x7D,0xE6,0xDB,0x7E,0x57,0x7B,0x83,0xE7,0xFE,0x0C,0x9B,0xFE,0x14,0xE7,0xC2,0xCF,0x12,0xF8,0xE7,0xF6,0x56,0xF1,0x77,0xFC,0x35,0x17,0xEC,0xF9,0xA7,0x7D,0x8A,0xCE,0x5F,0x86,0x7A,0x3F,0x8B,0xBF,0xB7,0xB5,0x0F,0x0C,0xFD,0x9A,0x38,0xD2,0xE8,0xE8,0x7A,0x83,0xCD,0x31,0x9B,0x6D,0xAF,0x90,0xE3,0x45,0x98,0x8C,0xB7,0x30,0x4D,0x16,0xF1,0x04,0xBF,0x60,0x7C,0x34,0xF8,0xAB,0xF0,0xE3,0xE3,0x27,0xC2,0xCB,0x5F,0x1A,0xFC,0x2E,0xF1,0x9E,0x95,0xE3,0x8F,0x0C,0xCF,0xB4,0x7D,0xB3,0x4B,0xBA,0x12,0x79,0x12,0x18,0xD2,0x5F,0x26,0x64,0xFB,0xD0,0x4C,0x12,0x48,0xCB,0x43,0x20,0x59,0x17,0x70,0xDC,0xA2,0xBB,0xFA,0x28,0xA2,0x8A,0x28,0xA2,0x8A,0x28,0xAF,0xCA,0x1F,0x0B,0xDC,0x7C,0x70,0xB2,0xF8,0xEB,0xE3,0x3F,0xF8,0x27,0xCF,0x81,0xAD,0xBC,0x55,0xE0,0xAF,0x01,0x78,0x73,0x55,0x86,0xF2,0xCB,0xE2,0xFD,0x8D,0xB4,0xCD,0x36,0x8F,0xE0,0x6B,0xD8,0x6E,0x2E,0x53,0x4E,0xB6,0xB8,0xBC,0xB8,0x72,0xB7,0x91,0x4F,0xB7,0x48,0xB5,0xBB,0x4F,0x3B,0xF7,0x50,0xCE,0xE2,0x28,0xDE,0xC8,0x9A,0xF5,0xF7,0xF1,0x9F,0x8A,0x46,0xB1,0xAB,0xFE,0xCD,0x3F,0xB1,0x47,0x86,0xB7,0xD8,0x68,0x9A,0xAD,0xDD,0x97,0x8E,0x3E,0x30,0x78,0x87,0x5A,0x93,0x54,0xD3,0x7C,0x11,0xA9,0xDE,0x5C,0x3D,0xED,0xD8,0x5F,0xB5,0xBC,0x93,0x6B,0x7A,0x98,0x32,0xDC,0x3B,0xC5,0xE6,0x6C,0x86,0x79,0xED,0x84,0xED,0x86,0x91,0x13,0xA0,0xD4,0xBF,0x66,0x6B,0x3F,0x84,0xB7,0x5F,0x00,0x3C,0x53,0xF0,0x9B,0x4F,0xF1,0x57,0x8C,0x3F,0xE1,0x5D,0x78,0xAB,0x55,0xD6,0xBC,0x4D,0xA1,0xA6,0xBD,0x6E,0xDA,0x97,0x8E,0x2E,0x75,0x5D,0x2E,0xE2,0xCA,0xE3,0x56,0xBC,0x92,0xF1,0xE1,0x8A,0xEF,0x53,0x13,0x4B,0x13,0xF9,0xD3,0x4F,0x10,0x58,0x1A,0xED,0x23,0xFF,0x00,0x96,0x50,0xD7,0xCE,0x1F,0xB5,0x5F,0xC2,0x3B,0x8F,0x8B,0x9F,0xB2,0x47,0xC4,0x3F,0x8A,0x7F,0xB6,0x6F,0x8A,0xFC,0x15,0xF0,0x2A,0x45,0xF0,0x54,0xBA,0x67,0xC2,0xBF,0x0A,0xFF,0x00,0x6C,0x45,0x79,0x0F,0x86,0x75,0x09,0x12,0xDF,0x52,0x9A,0x4B,0x8D,0x41,0xAD,0x0C,0xD7,0x97,0xF3,0x4D,0xA7,0x2D,0xBB,0x43,0x61,0x11,0xC5,0xA4,0x73,0xA4,0x3E,0x7B,0xCE,0xD2,0x56,0x87,0x88,0x7C,0x1D,0xFB,0x40,0xFE,0xDB,0x1F,0x14,0xFE,0x1D,0x78,0xE2,0xFF,0x00,0xE0,0x87,0x85,0x7E,0x08,0xFC,0x39,0xD3,0x7C,0x01,0x7F,0xA6,0x4B,0x1F,0xC7,0x0F,0x04,0xC5,0xAF,0xEA,0xF6,0x1A,0xBE,0xA1,0x20,0xFB,0x55,0xD6,0x9D,0xA6,0x3C,0xA1,0x5F,0xEC,0xEF,0xA6,0xD9,0xAC,0x32,0xDF,0x47,0x6D,0x94,0xB8,0x99,0xFC,0xA9,0x95,0xC2,0x0F,0x9F,0xFE,0x32,0x68,0x7F,0xB2,0xA7,0xEC,0x65,0xFB,0x53,0x78,0x7B,0xE0,0xE6,0x8D,0xAA,0xFF,0x00,0xC2,0x98,0xF1,0x7F,0x8B,0xB4,0xA9,0x7C,0x4B,0xE3,0x4F,0x8E,0xD7,0xBA,0x1F,0xDB,0xB5,0xED,0x3F,0x4E,0x9E,0xE6,0xEE,0x0F,0xB0,0x78,0x7A,0x1B,0x0B,0x53,0x0E,0x99,0x79,0x38,0x6B,0x98,0x3C,0xE8,0x2D,0xAD,0xA1,0x82,0xD9,0x41,0x02,0x69,0x7C,0xB0,0x9F,0x60,0x59,0x7C,0x4D,0xF1,0x4F,0xC3,0xFF,0x00,0x85,0x9E,0x39,0xF0,0x37,0xEC,0x53,0xFB,0x1A,0x78,0xFF,0x00,0xC4,0xFA,0xB4,0x5A,0xAB,0xEA,0x37,0x5E,0x20,0xF8,0x86,0x92,0x78,0x67,0x4F,0xD4,0xEF,0x75,0x08,0xE4,0x96,0x4D,0x46,0x4B,0x8D,0x6E,0x68,0xF5,0x2D,0x56,0x65,0x9C,0x22,0x4A,0xAE,0x15,0xB6,0xAE,0x3C,0xE4,0x5F,0x27,0x77,0xCB,0xFA,0x67,0xEC,0xE1,0xFB,0x6A,0xFE,0xD3,0xFF,0x00,0xB6,0x4F,0x8A,0x35,0x6F,0x8F,0x1E,0x3D,0xD2,0xB4,0x2F,0x08,0x78,0x1F,0xED,0x9A,0x75,0x95,0xAE,0xBB,0xE1,0x09,0x35,0x9F,0x08,0x6A,0xBA,0xBC,0xAB,0x76,0x89,0x73,0xA5,0x68,0x37,0x90,0xD9,0x09,0x61,0xB2,0x82,0xFF,0x00,0x62,0x5F,0x5E,0x7D,0xA7,0x7C,0xD6,0xEA,0x56,0x5B,0xB8,0x89,0x58,0xBF,0x43,0xFC,0x15,0xF0,0x3B,0xF6,0x83,0xB1,0xF0,0xB4,0xF1,0x7C,0x45,0xFD,0xB5,0xBC,0x6B,0xE2,0x9D,0x6C,0xDD,0x16,0x86,0xEB,0xC3,0x9E,0x03,0xF0,0xBE,0x8D,0x6E,0x90,0xED,0x5C,0x21,0x86,0x6D,0x3E,0xED,0x99,0xF7,0x6F,0x3B,0xFC,0xC0,0x30,0x40,0xDA,0x31,0x96,0xD0,0xF0,0x37,0xEC,0xC7,0x07,0x82,0x3F,0x6C,0x9D,0x53,0xE3,0x87,0xFC,0x2E,0x7F,0x1F,0xF8,0x93,0xC5,0xBA,0xC6,0x95,0x1E,0x9B,0xE2,0x3B,0x4B,0xF8,0xF4,0x3B,0x6D,0x3F,0x5E,0x8A,0x15,0x61,0x6E,0xD7,0x90,0xD9,0x69,0x96,0xFE,0x6C,0xD0,0xEE,0xFD,0xDD,0xC6,0x44,0xAA,0xA3,0xCB,0xDF,0xE5,0x66,0x33,0xF4,0xFD,0x14,0x51,0x45,0x14,0x51,0x45,0x14,0x57,0xCE,0x1F,0x15,0xFF,0x00,0x65,0xDF,0x87,0x9F,0x19,0x3E,0x32,0x5A,0x78,0xBF,0xC5,0x5A,0xE7,0x8D,0x74,0xE8,0xE4,0xD0,0x1F,0x40,0xF1,0x26,0x81,0xE1,0xCF,0x19,0xDE,0x69,0x3A,0x5F,0x8A,0xF4,0xFC,0x4F,0xE5,0x5B,0x6A,0x51,0x5B,0xBA,0xB4,0xA9,0x0B,0x5D,0xDD,0x32,0x6C,0x64,0xCF,0x9E,0xE1,0xFC,0xC4,0xF9,0x2B,0xDC,0x3C,0x2F,0xE1,0x3F,0x0B,0x78,0x1F,0xC0,0xB6,0x3E,0x17,0xF0,0x57,0x86,0xB4,0xAF,0x07,0xF8,0x66,0xCB,0x7F,0xD8,0xF4,0x8D,0x13,0x4F,0x8E,0xCE,0xD2,0xDF,0x7B,0x99,0x1F,0x64,0x51,0x80,0xAB,0x97,0x66,0x63,0x81,0xC9,0x62,0x6B,0xE1,0xFF,0x00,0xDA,0x1B,0xF6,0xF9,0xF8,0x71,0xF0,0xBB,0xFE,0x12,0x9F,0x07,0xF8,0x0B,0x50,0xD2,0xBC,0x47,0xF1,0x1B,0x4F,0xFB,0x75,0xA4,0xBA,0xA6,0xBB,0x78,0x2C,0x3C,0x2F,0xA2,0xDE,0x5A,0x7D,0x93,0xED,0x49,0x73,0x76,0xEC,0xAD,0x7F,0x35,0xBA,0x5F,0x47,0x23,0xE9,0xFA,0x62,0xDD,0x5E,0x12,0x86,0x2D,0x91,0xB3,0x03,0x5E,0x41,0xA4,0xF8,0x6F,0xE2,0x9F,0x8C,0xFE,0x3A,0x9F,0x1A,0x69,0x1F,0x03,0xF5,0x5F,0xDA,0x1B,0xE2,0x64,0x3A,0xAE,0xA4,0xDA,0x6F,0xC5,0x4F,0x8E,0x50,0xDC,0xF8,0x37,0xC2,0x1E,0x0B,0xB8,0x30,0xDA,0x5C,0xD9,0x0D,0x13,0xC3,0x17,0x3E,0x7D,0xEA,0x43,0x1B,0x41,0x6F,0x13,0x5C,0x2C,0x09,0x70,0xF3,0x44,0xE7,0xED,0x6C,0x1D,0xDE,0x2F,0xA7,0xE4,0xF8,0x11,0xF1,0xC3,0xE2,0x6F,0xFC,0x23,0xF7,0xBF,0x1D,0x3F,0x68,0xBD,0x57,0x41,0x86,0xCF,0xFB,0x3E,0xEE,0x5F,0x09,0x7C,0x12,0x8E,0x6F,0x0A,0xE9,0xF2,0x5C,0xC5,0xE6,0x9B,0xA8,0xEE,0x35,0x07,0x96,0x6D,0x42,0xEA,0x19,0x3C,0xD1,0x17,0xEE,0xE5,0xB4,0x1B,0x62,0x0F,0xE5,0xAC,0x98,0x64,0xF6,0x0F,0x83,0xBF,0x00,0xBE,0x0D,0xFE,0xCF,0xFE,0x05,0x97,0xC3,0xBF,0x07,0xBE,0x1E,0xE9,0x5E,0x07,0xB0,0x9F,0x1F,0x6C,0x96,0xD1,0x1A,0x4B,0xBB,0xDC,0x3C,0x8E,0x9F,0x68,0xBA,0x90,0xB4,0xD3,0xEC,0x33,0x49,0xB3,0xCC,0x76,0xD8,0x1B,0x6A,0xE0,0x71,0x5E,0xBF,0x45,0x14,0x51,0x45,0x14,0x51,0x45,0x14,0x51,0x45,0x14,0x57,0xE5,0x0F,0xED,0x6F,0xE3,0x2F,0x1D,0x7C,0x52,0xFF,0x00,0x82,0xC9,0x7C,0x1E,0xFD,0x86,0x1F,0xC6,0xFA,0xAF,0x81,0x3E,0x09,0xFC,0x43,0xF0,0x05,0xE5,0xFF,0x00,0x8C,0x25,0xF0,0xAF,0x93,0x06,0xAF,0xA8,0xFE,0xEF,0x51,0x7F,0x23,0xED,0x53,0x47,0x2E,0xC8,0x7F,0xE2,0x5B,0x1A,0x94,0x45,0x5D,0xE9,0x3C,0xE9,0x26,0xF5,0x60,0x17,0xED,0xFF,0x00,0x85,0xDF,0xB2,0xAF,0xEC,0xE3,0xF0,0x5F,0xFB,0x0E,0x6F,0x86,0x9F,0x06,0x3C,0x2B,0xE1,0xBD,0x5B,0x47,0xF3,0xBF,0xB3,0xB5,0xCF,0xEC,0xB5,0xB9,0xD5,0xE1,0xF3,0xB7,0xF9,0x9F,0xE9,0xF3,0x6F,0xB9,0x39,0x12,0xBA,0x73,0x21,0xF9,0x0E,0xCF,0xBB,0xC5,0x7B,0xFD,0x14,0x51,0x45,0x14,0x51,0x45,0x14,0x51,0x5F,0xFF,0xD9

I'm not entirely clear on what you are trying to do here, but the reason for the error is down to this line here:
for (byte s = 0; s < 8; s++)
It assumes that the string str is always eight characters long. This will prevent the error.
for (byte s = 0; s < str.Length; s++)
But it may not give you the output you are after..?

Your program breaks at the line:
if (str[s] == '1')
At this line, str == 255. The loop tries to iterate through 8 places in a string containing 3. Therefore, when it hit index 3, it becomes out of bounds (we always start at 0).
Your 3rd and most inner for loop should be:
for (byte s = 0; s < str.Length; s++;)
{
if (str[s] == '1')
signdecompress[ByteIndex + s] = (byte)255;
else
signdecompress[ByteIndex + s] = (byte)0;
}
Iterating based on the Length of the string or Count of something is always best practice, unless you know definitively that you will always only have a given number of indices.

Insertion sort algorithm c#

I am trying to implement the Insertion sort in one of my programs. What I have been trying to create is a sorting program (in both ascending or descending order) However I have tried with algorithms such as quicksort and merge-sort, I am really new to c# and coding. The problem I am facing here is the fact that my files includes both a string of code, as well as a double/integer (example: 75.350, 74.430, Thursday, Friday) and since this algorithm is designed for integers. Is there a way to convert it please?
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;
namespace ConsoleApplication3
{
class Program
{
static void Main(string[] args)
{
StreamReader sh1Open = new StreamReader("c:..\\Files\\SH1_Open.txt");
string Sh1OpenString = sh1Open.ReadToEnd();
int[] x = { Convert.ToInt32(Sh1OpenString) };
int j;
int temp;
for (int i = 1; i < x.Length; i++)
{
j = i - 1;
while (j >= 0 && x[j]>x[j+1])
{
temp = x[j];
x[j] = x[j + 1];
x[j + 1] = temp;
j = j - 1;
}
}
for (int i = 0; i < x.Length; i++)
{
Console.WriteLine(x[i]);
}
Console.ReadKey();
}
}
}

The best way is probably using generic method with IComparable constraint.
T[] InsertionSort(T[] x) where T : IComparable<T>
{
for (int i = 0; i < x.Length-1; i++)
{
int j = i+1;
while (j>0)
{
if (x[j-1].CompareTo(x[j]) > 1)
{
T temp = x[j-1];
x[j - 1] = x[j];
x[j] = temp;
}
j--;
}
}
return x;
}
or using algorithm from http://www.codecodex.com/wiki/Insertion_sort
static void InsertSort(IComparable[] array)
{
int i, j;
for (i = 1; i < array.Length; i++)
{
IComparable value = array[i];
j = i - 1;
while ((j >= 0) && (array[j].CompareTo(value) > 0))
{
array[j + 1] = array[j];
j=j-1;
}
array[j + 1] = value;
}
}
Also, there is probably a bug in this line:
int[] x = { Convert.ToInt32(Sh1OpenString) };
because you're trying to convert whole file to one integer.

Since in C# the comparison operators are defined for strings you could just replace all relevant int variables with string variables. The algorithm should run the same (albeit a bit slower)

Develop Reference

C# (C-Sharp) is a programming language developed by Microsoft that runs on the .NET Framework.

How to extract quantization matrices from a JPEG in C# - c#

If you just want the quantization tables (and nothing else), it is a simple matter to scan the JPEG stream for the DQT marker (FFDB-followed by a 2-byte length) and extract the values. You do not need to decode the image to get this information.

Related

C# Bitmap: System.ArgumentException "Invalid parameter."

HeapSort Algorythm from txt file to list of arrays doesn't Sort the numbers

Problems converting an array to a two dimensional array

Error when trying decompress byte array ( C#)

Insertion sort algorithm c#

Categories

Resources