I know, I had to think very carefully about that one. This query used to work but only because it was a bug (in other words you thought it was good, but in fact we knew it was bad), so we fixed the bug and now your query doesn't work anymore (which you may think is bad, but really it's not, because we know it's good). If I follow the argument correctly, it has something to do with ANSI standards: you should not be able to do this in ANSI-standard SQL. So in order for Oracle to be ANSI-standard, they had to stop you from doing this. I think that's the reason.

You are making this out to be much more difficult that it really is. This issue in particular and the entire architecture of your application from the sounds of it. If the client can call the database to update the records why are you placing this intermediary step in between, access from the client, or better yet from a properly constructed dta accsss layer. hadad wrote: invented by my sql script and it does not belong to table YES it does. If it's in the select statement is will be in the dataset. RTFM!! I know the language. I've read a book. - _Madmatt

You can not serialize a dictionary, if this is your dictionary, use KeyedCollection Natza Mitzi Analysis Studio Statistical Analysis Software

Shouldn't be too difficult to figure out an algorithm for it... Some hints: 1) To check the rightmost bit of a number: (x % 2) // Remainder when dividing by 2) The generic form would be (x % (1 << numBits)) to get any number of bits. 2) To remove the rightmost bit: (x >> 1) // Shift right one bit 3) To add a bit to the left of a number: (x + (newBit << currentBitCount)) As for the algorithm, you know exactly how many bits are moving into and out of each byte... Each group of eight septets turns into 7 octets... So the formulae are: oct0 = s0 + ((s1 % (1 << 1)) << 7) (Start with septet 0, get 1 bit from septet 1, shift it 7 places left, and add it to septet 0) oct1 = (s1 >> 1) + ((s2 % (1 << 2)) << 6) (Shift out one bit, since we moved it to octet 0, grab 2 bits from the next byte, shift 6 places, since we're one place shorter, and add) oct3 = (s2 >> 2) + ((s3 % (1 << 3)) << 5) See the pattern? (A = this byte, B = next byte) octN = (A >> N) + ((B % (1 << (N + 1))) << (7 - N)) Do that for 7 bytes, skip the 8th byte (All 7 bits from the 8th byte would be shifted to the 7th byte), and start over. Proud to have finally moved to the A-Ark. Which one are you in? Developer, Author (Guardians of Xen)

Depends on the handset. The one I use supports avi, mp3 and may be more. It's not necessary to be so stupid, either, but people manage it. - Christian Graus, 2009 AD

But I gave an answer to 1 of the two conversions, surely that is allowed? Life goes very fast. Tomorrow, today is already yesterday.

Chars already are in unicode

Yes, since if the result set based on the select statement is changed, the OnChange event is triggered. This actually means that all modifications (updates, inserts and deletes) are notified as long as they change the result. Or at least this is my understanding :) There's a bit old but quite good documentation about this: Query Notifications in ADO.NET 2.0 [^] Mika The need to optimize rises from a bad design.My articles[^]

If you are talking about server replication, that is built in, and you should use the built in system. If you are wanting another program to do certain things when certain things happen, you should have those 2 apps talk to each other and not have one constantly look at the database. The best way to accelerate a Macintosh is at 9.8m/sec² - Marcus Dolengo

Hi hadad ... Environment.CurrentDirectory .... if(Human.live) { Human.peaceful = false; while(true) { Human.love(Human girl, Human Boy); } }

yes ! stupid melody that you hear when you weak up in the morning. BinnaryWriter :laugh: ..nice class we shoud ask Microsoft to bring us a 'Binnary' Namespace

Not for me ;)

You will have to remove the element from it's parent. I dont think setting OuterHtml will have any effect. xacc.ide - now with TabsToSpaces support IronScheme - 1.0 alpha 4a out now (29 May 2008)

Thanks a lot, I know that the pattern works well in the way you use it for getting the attributes inside these two braces {} but what I've failed to do is to match the whole rule like this: #DTEST { border-style : solid ; border-width : thin ; position:relative; right:10px; left:900px; width:50px; } This is the whole pattern: [\\.#]?[a-zA-Z0-9_]+[\n\t\\s]*{[\n\t\\s]*[a-zA-Z\\-]+[\\s]*:[\\s]*[a-zA-Z\\-]+[\n\t\\s]*;[\n\t\\s]*} but it works only if the css rule contains only one attribute like this: .Red { color:Blue; } the question is how can I let it match the css rule even if it has multiple attributes. Dad

Have a look at this: Registering the Extension[^] Giorgi Dalakishvili #region signature my articles #endregion