|
No. Both numbers carry an amount of "information", and you need memory ("bits") to store it; as long as there are no restrictions to the values (one number can have a value in some range, and the other can also have an arbitrary value in some range), you need a number of bits to store that information, no matter what reversible transformations you apply; and turning two numbers in one is just a transformation, not necessarily a reversible one.
Therefore, assuming a domain of [0, max-1] then z = x * max + y is as good as it gets.
BTW: having one or a few examples of something that seems to provide a valid approach, in general is inconclusive.
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
But then the answer is yes, right? You can turn two numbers into one in a unique way.. It's just usually useless since you're still using at least as many bits as the input used to be
|
|
|
|
|
right, the answer is "yes; and probably no for all practical purposes"
BTW: I wonder why, this kind of questions pops up a couple of times each year. Often someone convinces himself he can compress two bytes into one, which is unlikely as if that worked well, one could recurse and stuff the world into a single bit.
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
yes, sometimes all we want is to avoid using pair or map and use only an array. Why this question is so common is probably that this kind of situation occurs commonly.
For me, it was just that I was solving a common grid problem in which every cell visited has to be marked and I wondered if I can just store a single no. in array to quickly check if that cell is already visited. Just like that as I said before Thanks for your answer btw.
Luc Pattyn wrote: one could recurse and stuff the world into a single bit.
funny. i have no such intentions. for me two 16 bit integers [screensize < 65536] into one 32 bit integer is cool enough.
|
|
|
|
|
That's easy then, just append them
|
|
|
|
|
in graphic or board oriented applications, I often find it useful to use a one-dimensional array rather than a 2D one. That is how a lot of chess games are handled BTW. It saves a lot of code in move generation and the like.
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
Does that mean that if my range is two 32 bit integers, then I can store them in a 64 bit integer like this
//say +ve integeres only.
unsigned long long l;
unsigned int a = SomeValue;
unsigned int b = SomeValue;
l = a | (b<<32)
and store this l.
Then while retrieving,
a = l & 0xFFFFFFFF
b = (l>>32) & 0xFFFFFFFF
That's cool! thinking in terms of bits and informations helps
|
|
|
|
|
That should not be surprising.
|
|
|
|
|
Windows does that itself, it often stores both x and y coordinates in "lParam", the good old 32-bit parameter in Windows messages.
Two remarks;
1. If your x and y values are within [ -2^15, 2^15), you could do with a 32-bit signed integer, so no need for "long long". Similar for unsigned.
2. If your app is graphics oriented, you may want to use signed variables; you then must be careful about sign propagation effects in right shifts!
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
theCPkid wrote: Then while retrieving,
a = l & 0xFFFFFFFF
b = (l>>32) & 0xFFFFFFFF
I would remove the antiaesthetic & 0xFFFFFFFF stuff.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
[My articles]
|
|
|
|
|
Oh yes you can. We invented the square root of -1 some time ago just for this...
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
[My articles]
|
|
|
|
|
Pallini, help plz plz plz.. it's urgent urgent urgent.
my program outputs garbage whenever I try to get the sqrt of -1 using squareroot function in Cmath
moreover, plz explain why it's a unique value for every x,y. i feel it's value does not change with change in x & y.
Thanks for your inputs btw.
|
|
|
|
|
lol
Just another way to say: "if you need a pair then use a pair"
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
[My articles]
|
|
|
|
|
In a socket application guess we define a protocol for messages like this:
+----------+----------------------+----------+
| DataSize | Data(Not Fixed size) | Checksum |
+----------+----------------------+----------+
In a socket server I receive an array of bytes and need to:
- Finds frames that match my predefined protocol(e.g above image).
Is there any efficient and clean algorithm/design-pattern for finding(and parsing) matching packets in a byte array? I don't even know which terms/phrases to search.
Thank you so much in advanced.
"I hope you live a life you're proud of. If you find that you're not, I hope you have the strength to start all over again." - I wish I knew who is this quote from
|
|
|
|
|
Hamed Mosavi wrote: matching packets
I see nothing to match; you said the message would start with a size, so the first 1/2/4/? bytes should be aggregated into a size value (maybe BitConverter.ToInt32 comes in handy), then that number of bytes of data are expected, then the next 1/2/4/? bytes should be aggregated into a checksum value, which when it matches the local checksum calculation will make the message acceptable, otherwise unacceptable.
You may apply extra checks, such as upper/lower limits to datasize. When multiple systems (and maybe multiple implementations) are going to be used, you should carefully specify the checksum algorithm used, and the byte order ("endianness") in multi-byte values (probably size and checksum).
If you need syncing capabilities (e.g. because some bytes may get lost underway), you should start with a fixed header, sometimes called an eye catcher, akin to the start bit of RS232C. Then your receiver should check the data starts with a correct header, and ignore anything that does not.
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
Thank you so much for your very fast reply. It's very kind of you.
Luc Pattyn wrote: If you need syncing capabilities (e.g. because some bytes may get lost underway)
This is the exact reason for what I'm seeking. If byte array I receive contains broken message at the beginning then I need to find next packet and ignore what's before.
Luc Pattyn wrote: you should start with a fixed heade
Is this like a beginning flag(like preamble in Ethernet frames)? If it is, It's not possible for me to use this solution since it's possible that the data field contains those(flag) byte sequence either, so message header shall be big enough to decrease such probability and in most systems that I'm working with, too much overhead is not accepted.
Luc Pattyn wrote: If you need syncing capabilities
This looks like what I need to search. I'll take a closer look at the syncing mechanisms to see if there's any better scape way. Thank you for this help.
"I hope you live a life you're proud of. If you find that you're not, I hope you have the strength to start all over again." - I wish I knew who is this quote from
|
|
|
|
|
Without a fixed header, you'll have a hard time getting bits/bytes in sync, as nothing of your message is cast in stone, the only thing you have is a checksum. So all you can do is assume the message starts at byte index 0, read its length and data, and check the checksum; and when that fails, start again at index 1, etc, until something happens to match. With a header (even if it is only a single byte), you only have to investigate potential messages starting with the right byte value.
Longer headers cause easier syncing at the expense of more overhead (less effective bandwidth); RS232C uses a single bit for syncing, and that too can and obviously will appear in almost every byte transmitted, but all that means is it may take several bytes to get in sync. So there is no real need for a long header, and there sure is no need to forbid the accidental appearance of a header-look-alike inside a message, as headers are only used to find the start of a message; once you (think you) are holding a message, just process the data and check the checksum.
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
Yes. You're right. It's a trade off between server efficiency and data overhead. To have a good system it must be balanced, I believe. A syncing bit(or even byte) in each packet can be a great help to increase server performance.
By the way, have you seen any good open source server implementation of message transmitting processing? I'll definitely learn a lot from that (to have a cleaner with better performance server.) I have written some four socket applications in last 5 to 6 years and it had always been a pain to implement this part.
Thank you again Luc Pattyn for your helps. It's really appreciated.
"I hope you live a life you're proud of. If you find that you're not, I hope you have the strength to start all over again." - I wish I knew who is this quote from
|
|
|
|
|
You're welcome.
One thing that isn't clear to me, is why you would not (to a rather high degree) trust incoming messages? If your network is using say Ethernet, and your messages are less than 1500 bytes in length, then they would fit in a single Ethernet packet, and hence the lower network layers would deal with bad packets, the app would only get real ones, probably containing exactly one message.
Things are entirely different on a serial port such as RS232C, where you may not have packets, and just inserting/removing/powercycling the peripheral may well result in a couple of spurious bytes. Or maybe you are implementing something like SLIP[^]?
Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles]
I only read formatted code with indentation, so please use PRE tags for code snippets.
I'm not participating in frackin' Q&A, so if you want my opinion, ask away in a real forum (or on my profile page).
|
|
|
|
|
No it's not in a local area network. Clients are micro-controller applications which rely on cellphone GPRS to connect through internet to a remote server. They're transmitters that receive data on a serial port and need to transfer it to a remote server. More info about the amount of data and what's inside is not given to me. All I know is that GPRS and cell network in general, in the area they use it, has a very low quality. I can't risk much about reliability.
Even though things are not that good in a LAN. Based on experience I've seen multiple copies of a packet or data loss and disconnects even in a LAN. It had been wireless LAN though. But the first experience was annoying. I still remember that day!
I didn't know about SLIP. It looks, in some ways, similar to my project except that I'm not working that much low level. I'm working at application level, if I'm not wrong.
"I hope you live a life you're proud of. If you find that you're not, I hope you have the strength to start all over again." - I wish I knew who is this quote from
|
|
|
|
|
|
Yes.
But I still don't know who said it first. Not that It changes the beauty of the sentence but to mention her/his name under the quote.
"I hope you live a life you're proud of. If you find that you're not, I hope you have the strength to start all over again." - I wish I knew who is this quote from
|
|
|
|
|
I'm in need of an implementation of a decision tree algorithm. I checked this, ID3 Decision Tree Algorithm in C#[^] , but the comments are in some other language and I really can't understand it.
I managed to get code for "drawing" the decision tree, it's in Java by the way, I need to know how to use it to get results from my own data. Or if possible the full implementation of this, i.e. I should be able to train the tree and then enter new data and get the result.
I searched in Google and stuff but did not get a proper code sample.
btw: I need this in either VB, Java or any .Net language.
Thanks.
|
|
|
|
|
Enter two integers n and m, from the series 1,2,3 ....... n ,get a few numbers at random, it is equal to m, called for all possible combinations of them
|
|
|
|
|
can you form a few seperated sentences? Or explain what you really want to do?
|
|
|
|
|