|
its not dictionary, its an array
TVMU^P[[IGIOQHG^JSH`A#@`RFJ\c^JPL>;"[,*/|+&WLEZGc`AFXc!L
%^]*IRXD#@GKCQ`R\^SF_WcHbORY87֦ʻ6ϣN8ȤBcRAV\Z^&SU~%CSWQ@#2
W_AD`EPABIKRDFVS)EVLQK)JKQUFK[M`UKs*$GwU#QDXBER@CBN%
R0~53%eYrd8mt^7Z6]iTF+(EWfJ9zaK-iTV.C\y<pjxsg-b$f4ia>
-----------------------------------------------
128 bit encrypted signature, crack if you can
|
|
|
|
|
It doesn't matter, indexing an array with a char works just as well
|
|
|
|
|
nice, never noticed.
Thanks btw
TVMU^P[[IGIOQHG^JSH`A#@`RFJ\c^JPL>;"[,*/|+&WLEZGc`AFXc!L
%^]*IRXD#@GKCQ`R\^SF_WcHbORY87֦ʻ6ϣN8ȤBcRAV\Z^&SU~%CSWQ@#2
W_AD`EPABIKRDFVS)EVLQK)JKQUFK[M`UKs*$GwU#QDXBER@CBN%
R0~53%eYrd8mt^7Z6]iTF+(EWfJ9zaK-iTV.C\y<pjxsg-b$f4ia>
-----------------------------------------------
128 bit encrypted signature, crack if you can
|
|
|
|
|
Works fins just with a char:
int[] array = new int[256];
Random r = new Random();
for (int i = 0; i < 256; i++)
{
array[i] = r.Next(256);
}
string s = "Hello there!";
int[] output = new int[s.Length];
int ind = 0;
foreach (char c in s)
{
output[ind++] = array[c];
}
}
You should never use standby on an elephant. It always crashes when you lift the ears. - Mark Wallace
C/C++ (I dont see a huge difference between them, and the 'benefits' of C++ are questionable, who needs inheritance when you have copy and paste) - fat_boy
|
|
|
|
|
yupp thanks
TVMU^P[[IGIOQHG^JSH`A#@`RFJ\c^JPL>;"[,*/|+&WLEZGc`AFXc!L
%^]*IRXD#@GKCQ`R\^SF_WcHbORY87֦ʻ6ϣN8ȤBcRAV\Z^&SU~%CSWQ@#2
W_AD`EPABIKRDFVS)EVLQK)JKQUFK[M`UKs*$GwU#QDXBER@CBN%
R0~53%eYrd8mt^7Z6]iTF+(EWfJ9zaK-iTV.C\y<pjxsg-b$f4ia>
-----------------------------------------------
128 bit encrypted signature, crack if you can
|
|
|
|
|
hellow
i m in a prob.
i hav a datagrid which has 3 columns.All the cell in first column will be in combobox when the form loads. but when the user selects a data from the combo then the Datagridcombo must be changed into datagridtextbox and selected data will be shown in the datagrid text box.
as well as the next row will show the datagridcombo in first column.
i need solution with code snippet.
thanks in advance and sorry for poor english.
Thanks
Tanim
|
|
|
|
|
I'm trying to stop a waitcallback in a threadpool within an event handler for a stop button. I've searched and searched and have not found a way to do this. Please help!
private void startbutton_Click(object sender, EventArgs e)
{
WaitCallback doLoadSequential = new WaitCallback this.loadsequential);
ThreadPool.QueueUserWorkItem(doLoadSequential);
}
private void stopbutton_Click(object sender, EventArgs e)
{
}
|
|
|
|
|
you need cooperative termination, e.g. add a volatile bool flag as a class member, set it false in startbutton_Click, set it true in stopbutton_Click, and test it regularly in doLoadSequential, so that method finishes as soon as the flag gets set.
|
|
|
|
|
Hi,
Let's say that I've a file and I would like to find a specific string's location inside it. It is logical to load my file into a byte array and then parse it into a string or a StringBuilder byte by byte, right? It is an easy issue if the file is small.
If the file is huge (like 400megabytes), it is not that easy. The application demands lots of RAM and it is annoying. I thought about copying the file into the byte array by 100 bytes, step by step. But this brings another problem, if the half of my string is inside the first 100 bytes, and the rest in the next 100 bytes; my application is not able to identify my string and therefore give its location to me.
How can I solve this, any ideas?
If there is anything unclear, feel free to ask.
Thanks.
|
|
|
|
|
Test it twice. First test it like usual, then test it again with the divisions offset by exactly half the batch size. As long as each batch is at least twice the size of the search string, you will be guaranteed to find the string in at least one of the two searches. More specifically, the offset MUST be less than or equal to Half the batch size AND greater than or equal to the size of the string being searched for.
|
|
|
|
|
I didn't exactly able to understand what you mean. I got the main idea but I still have the problem with the ratios.
My string is 17 characters long. Therefore what should be my search lengths?
|
|
|
|
|
100 bytes is just fine. Search once with a stride of 100 bytes starting at zero-indexed byte 0, then search with a stride of 100 bytes starting at zero-indexed byte 50. This works with strings up to 50 bytes in length.
|
|
|
|
|
|
So what you want to do, is to find only 1 string once?
Because then you could just stream the file, no buffers needed.
[almost]
To visualize this (in case anyone needs the explanation); you can look at it like a state machine, with a state for every character in the string you are searching for (lets call it X). The state machine will keep reading 1 character at a time until it exits. It starts in state 0, and will change to state 1 if it reads a character that matches X[0]. State n will transition to state n+1 if it reads X[n] or to state 0 if it reads anything else. The last state will return the position in the file if it reads X[last]. Every state will return "not found" if it runs out of characters to read.
[/but not quite]
Solution: use the Knuth-Morris-Pratt algorithm, at worst it has to evaluate the same character multiple times, but it never needs to go back (only forward, but skipping characters in a stream is trivial)
Essentially it's doing the same as what I described, but it jumps back to the right state instead of always 0.
That way you only need a constant amount of memory plus the string X.modified on Sunday, March 7, 2010 9:38 AM
|
|
|
|
|
It is a great idea. How come I've never thought it. Thanks.
|
|
|
|
|
You're welcome
|
|
|
|
|
You do know it gets a little bit more complex when the characters in the search string aren't all different, as in: find "anas" in "a long text containing ananas and other stuff"; returning to state 0 isn't always right.
|
|
|
|
|
Ok fine, spoil the fun
So maybe it isn't 0 but more like X.LastIndexOf(char that was read) (or 0 if it wasn't found) - or if it isn't that I might actually have to think and it's the weekend so no thanks
(exercise for the reader?)
My brain got unlazy for a second and remembered the solution - see the edit..modified on Saturday, March 6, 2010 9:56 PM
|
|
|
|
|
Yes, but I think that is not a problem for me. I am looking for a string in the file, no matter where it is.
I think code can express everything, in a better way. Here is my code:
private long DigBinary(string file, string strToDig)
{
FileStream fs = null;
char[] chAim = strToDig.ToCharArray();
char chTemp = '0';
long latestHitBeginningLocation = 0;
int locationInArray = 0;
try { fs = new FileStream(file, FileMode.Open, FileAccess.Read); }
catch { throw new Exception("An error occured while creating the stream."); }
try
{
while (locationInArray < chAim.Length)
{
chTemp = (char)fs.ReadByte();
if( chTemp != chAim[locationInArray] )
locationInArray = 0;
if (chTemp == chAim[locationInArray])
{
if (locationInArray == 0)
latestHitBeginningLocation = fs.Position - 1;
if (locationInArray == chAim.Length)
break;
locationInArray++;
}
else
{
locationInArray = 0;
latestHitBeginningLocation = 0;
}
}
}
catch { throw new Exception("An error occured while reading the file."); }
finally { if (fs != null) { fs.Close(); fs.Dispose(); } }
return latestHitBeginningLocation;
}
And yes, I know that my try-catch is useless.
|
|
|
|
|
that is a horrible piece of "code".
|
|
|
|
|
I am open to suggestions.
|
|
|
|
|
Here are some:
- unspecified catch = deadly sin
- store actual exception as inner exception in functional exception
- user-generated exceptions should inherit from ApplicationException
- two try blocks where one would suffice
- redundant chTemp initialization
- should use using statement
- char[] chAim = strToDig.ToCharArray(); is redundant; use strToDig[index]
And the algorithm is wrong, as I reported earlier.
|
|
|
|
|
Thanks for the advices. I will change the code accordingly.
This algorithm covers my needs. It works, it is fast and it doesn't consume much RAM.
|
|
|
|
|
Similar to StarBP:
use 2 rolling buffers which are the size of the search terms.
initialize by loading data into buffer 1
repeat the following steps:
clear buffer 2
dump buffer 1 into buffer 2
load fresh data into buffer 1
combine the buffers
search the combination
If the buffers are the correct size your search terms will always be in one combination.
The overhead is that you will be searching each buffer twice though.
hope it helps
Shane
|
|
|
|
|
Dear coders.
If you would not mind taking a look at this page...
http://www.licenturion.com/xp/fully-licensed-wpa.txt
If you see that the installation id is a string of digits, very long... e.g
234344-345656-898909-878766-567676-555655-454334-565556-77 etc
When the check digits are removed, it ends up as a 42 digit number, and this is represented as a byte array encoding of this, 17 bytes long.
How do i get the above long string of digits into its 17 byte representation?
I do not simply want a byte array the same lenght of the string (i.e. 41 digits) I need an actual byte array of 17 digits that represent the numer.
Basacaly, i need to be able to generate the byte array of the string above and vice versa (it may be a base-10 representation.
If no one can help, how can i do the following?
Have a byte array like
BYTE[] = {0x44, 0x34, 0x22, 0x47, 0x49, 0x78, 0x54, 0xf3, 0x2a, 0x44, 0x44, 0x28, 0x44, 0x83,
0x33, 0x22, 0x44}
17 bytes, to represent an encoding of a long number of forty something digits in a string of:
034333-495655-345444-090986-091232 etc....
Basacily as in the text above.
Thank you
Steve
|
|
|
|