| ??? 06/13/06 12:04 Read: times |
#118219 - hash table unefective Responding to: ???'s previous message |
Thank you for the inputs Christoph,
according using a bit as a flag, you are right, it's a bit but there are also more flags in that byte, which I didn't mention in my message. According to the hash-table, yes I guess it really makes no sence. The comparision algorithm is implemented as you mentioned, as far a byte does not match the algorithm aborts. Thanks again, greetings Attila |
| Topic | Author | Date |
| Buffer management optimalization | 01/01/70 00:00 | |
| Simple things first ... | 01/01/70 00:00 | |
| You can use circular buffer | 01/01/70 00:00 | |
| Fragmentation problem... | 01/01/70 00:00 | |
| all methods have some problems | 01/01/70 00:00 | |
| Start of package or End of package | 01/01/70 00:00 | |
| Packages explanation | 01/01/70 00:00 | |
| Individual buffers | 01/01/70 00:00 | |
| Good Idea | 01/01/70 00:00 | |
| New packages | 01/01/70 00:00 | |
| hash table unefective | 01/01/70 00:00 | |
| why keep that many | 01/01/70 00:00 | |
| Reason of 5 or more buffer | 01/01/70 00:00 | |
| Protocol specifics | 01/01/70 00:00 | |
| One way protocol | 01/01/70 00:00 | |
| One way protocol | 01/01/70 00:00 | |
| never | 01/01/70 00:00 | |
| Definition of need | 01/01/70 00:00 | |
| Grant, I agree with what you post re thi | 01/01/70 00:00 | |
| Simply reason why one way transmission | 01/01/70 00:00 | |
then why not just do it the easy way | 01/01/70 00:00 |