Thanks for the replies. It seemed “Cursor.Size.Height” could be used。

More so in the programming forums :) Cheers, Vikram. (Cracked not one CCC, but two!)

You already got the answer : http://stackoverflow.com/questions/1338913/c-equivalent-of-exceptioncontinueexecution-with-exception-filter[^]

Thanks for the reply. With the method I was able to see the previous stack trace that I can "step into", but when it came to untouchable third party calls in between, it didn't work. Thanks,

That was my intuitive understanding, too: You can teach everyone to sculpt. However, Michelangelo would break all the rules and right-ways-to-do-things taught to a "hobby sculptor". So to teach Michelangelo to sculpt (the way everyone does), you first have to teach him to not use his own way. Don't attribute to stupidity what can be equally well explained by buerocracy. My latest article | Linkify!| FoldWithUs! | sighist

Tried and True. Thank you very much! Thanks,

The newline character is a system dependent mix of the carriage return (\r) and line feed (\n) characters. On Unix newline is \n, on Macs newline is \r and on Windows newline is \r\n. If you're using .Net then you should be using Environment.NewLine instead of a specific character sequence.

You can't find out the path on the server. If you're running this code on your server, then you should be in the ASP.NET forum. Christian Graus Driven to the arms of OSX by Vista. "I am new to programming world. I have been learning c# for about past four weeks. I am quite acquainted with the fundamentals of c#. Now I have to work on a project which converts given flat files to XML using the XML serialization method" - SK64 ( but the forums have stuff like this posted every day )

There isn't such a thing built in the .NET framework class libraries. You could build your own like this: public static string GetStringWithoutEscapedSequences(string input) { var escapedSequences = new[] { "\r\n", "<br>" }; foreach(var sequence in escapedSequences) { input = input.Replace(sequence, string.Empty); } return input; } Then compare your strings like this: var first = GetStringWithoutEscapedSequences(strA); var second = GetStringWithoutEscapedSequences(strB); var areEqual = string.Equals(first, second); Religiously blogging on the intarwebs since the early 21st century: Kineti L'Tziyon Judah Himango

try this imageNode = document.createElement('img'); imageNode.src = strpath; 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)JKSQXUFYK[M`UKs*$GwU#(QDXBER@CBN% Rs0~53%eYrd8mt^7Z6]iTF+(EWfJ9zaK-i’TV.C\y<pŠjxsg-b$f4ia> -------------------------------------------------------- 128 bit encrypted signature, crack if you can

You should use the one SqlConnection (.NET) section Giorgi Dalakishvili #region signature My Articles Asynchronous Registry Notification Using Strongly-typed WMI Classes in .NET [^] My blog #endregion

If you have all the source code, you could simply add the following line very early in the exe: __asm { int 3 } This will fire a breakpoint for you to debug. Don't forgot to remove it! Iain.

a is an array of 5 ints. so a is the address of the 1st element of the array, and is of type int* (if we consider an int to be 4 bytes, incrementing a will move the pointer 4 bytes further). &a however is the address of the variable a itself, and is of type int[5] (if we consider an int to be 4 bytes, int[5] weights 20 bytes, so incrementing &a will move the pointer 20 bytes further). as suggested by CPallini, have you tried to print some sizeof to check that ? [VisualCalc][Binary Guide][CommDialogs] | [Forums Guidelines]

As has been pointed out, the array is sorted. If that's true, and not just a coincidence... (This assumes a /0 terminated string) TCHAR findfirstuniquechar_sorted (TCHAR *sz) { if (!sz) return 0; // loop through while safe for (int n = 0; sz \[n\]; n++) { if (sz \[n\] == sz \[n+1\]) // we're the same as the one after continue; if ( (n > 0) && (sz \[n\] == sz \[n-1\])) // we're the same as the one before! continue; // found one that's different from either side. return sz \[n\]; } return 0; // none found. } If the string is not sorted, the problem becomes harder. As you use TCHAR, I'm assuming unicode, so you can't just have a 26 array for placement... TCHAR findfirstuniquechar_unsorted (TCHAR *sz) { if (!sz) return 0; ; This line posts badly - it should be CMap less than TCHAR, TCHAR and, int, int and greater-then CharMap; hope that made sense... pre bug reported. CMap<TCHAR, TCHAR &, int, int &> CharMap; int nPos; int nCharPos; // One pass through string. for (nPos = 0; sz \[nPos\]; nPos++) { if (CharMap.Lookup (sz \[nPos\], nCharPos)) { // char already used, so signal is as not-counting-anymore CharMap \[sz\[nPos\]\] = -1; } else { // New one! CharMap \[sz\[nPos\]\] = nPos; } } // Now all chars are account for, look for the char with the lowest <= 0 position. POSITION pos = CharMap.GetStartPosition (); nPos = -1; TCHAR c, cFirst = 0; while (pos) { CharMap.GetNextAssoc (pos, c, nCharPos); if (nCharPos < 0) // not a unique char. continue; if ( (nPos == -1) || (nCharPos < nPos)) // is this the earliest, or the first unique one we've mapped? { cFirst = c; nPos = nCharPos; } } return cFirst; // either first unique, or 0; } OK, I've just spent FAR too much time on that. I hope it wasn't homework! Iain. Plz sir... CPallini CPallini abuz drugz, plz plz help urgent.