Dear All,
Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that
are stored in a hash table. (The nature of the processing and the
layout of the structs is irrelevant to this post, so I wont bore you
with the details).
My problem is that I need some way of distinguishing the processed
structs from those that are unprocessed. Obviously, I can add a
`processed' field to the struct definition - but, I don't want to do
this as the struct is part of a public API and I want to keep internal
details hidden.
Also, I could have some other form of data structure - to keep track
of what has been processed, but ideally, I would like to avoid or at
best minimise the additional complexity. Whatsmore, I need to keep the
original structs in the hash table.
Has anybody got a really neat solution to this ?
Thanks in advance,
James 6 1668
James Pascoe wrote: Dear All,
Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
This doesn't seem to be a C question, and there are
probably more appropriate newsgroups. Nonetheless, I'll
suggest a few approaches:
1: You've already considered and rejected putting a
marker of some kind in the struct itself.
2: If you are in control of the hash table implementation,
perhaps you could put your markers in the table itself.
3: Use two hash tables, and move the processed items
from one to the other. When you search for an arbitrary
item, search both tables.
4: Use a second hash table containing pointers to the
processed items. To determine whether a given item has or
has not been processed, look it up in the auxiliary table.
-- Er*********@sun.com
James Pascoe wrote: Dear All,
Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
Thanks in advance,
James
Use a super-structure which contains a 'processed' flag and either
the structure processed or a pointer to the processed structure.
struct Processed_Struct;
struct Envelope
{
unsigned char processed; /* or bool */
struct Processed_Struct content;
};
--
Thomas Matthews
C++ newsgroup welcome message: http://www.slack.net/~shiva/welcome.txt
C++ Faq: http://www.parashift.com/c++-faq-lite
C Faq: http://www.eskimo.com/~scs/c-faq/top.html
alt.comp.lang.learn.c-c++ faq: http://www.comeaucomputing.com/learn/faq/
Other sites: http://www.josuttis.com -- C++ STL Library book
"James Pascoe" <ja***@james-pascoe.com> wrote in message
news:fe**************************@posting.google.c om... Dear All,
Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
If you have malloc'ed string members in your struct you could use (some
would say)
an ugly hack of allocating 1 byte too much for the string and setting that
string's
first byte to be the "processed" flag. Of course you must remember to
free(mystruct.str-1);
in that case.
Or you could use some Reserved member in you structs. Name it like
dwReserved or fReserved (common way in winAPI) and you'll get everyone's
sympathy too ;-)
with respect,
Toni Uusitalo
James Pascoe wrote: Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
It is OT on c.l.c, and more suited to comp.programming. However,
take a look at:
<http://cbfalconer.home.att.net/download/hashlib.zip>
and the demonstrations of its use, including markov and wdfreq.
--
"I'm a war president. I make decisions here in the Oval Office
in foreign policy matters with war on my mind." - Bush.
"If I knew then what I know today, I would still have invaded
Iraq. It was the right decision" - G.W. Bush, 2004-08-02
On 8 Sep 2004 07:11:40 -0700, ja***@james-pascoe.com (James Pascoe)
wrote in comp.lang.c: Dear All,
Apologies if this is OT.
I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
Thanks in advance,
James
You could use a hash algorithm that generates an unsigned hash value
using one bit less than the size of the data type. For example, if
your longs are 32 bits, generate 32 bit hash values, then left shift
them by one bit for use.
When you process a structure, set the least significant bit of the
hash code by oring in 1UL.
Of course all your other hash code would need to ignore the least
significant bit.
--
Jack Klein
Home: http://JK-Technology.Com
FAQs for
comp.lang.c http://www.eskimo.com/~scs/C-faq/top.html
comp.lang.c++ http://www.parashift.com/c++-faq-lite/
alt.comp.lang.learn.c-c++ http://www.contrib.andrew.cmu.edu/~a...FAQ-acllc.html
>I have a C program which processes an arbitrary number of structs that are stored in a hash table. (The nature of the processing and the layout of the structs is irrelevant to this post, so I wont bore you with the details).
My problem is that I need some way of distinguishing the processed structs from those that are unprocessed. Obviously, I can add a `processed' field to the struct definition - but, I don't want to do this as the struct is part of a public API and I want to keep internal details hidden.
Also, I could have some other form of data structure - to keep track of what has been processed, but ideally, I would like to avoid or at best minimise the additional complexity. Whatsmore, I need to keep the original structs in the hash table.
Has anybody got a really neat solution to this ?
Store the pointers (in printable form, using sprintf() with "%p"
format) in the large SQL database in a Microsoft sub-dungeon. If
it's listed in the SQL table, it's processed. If it's not, it
isn't. (This might be the same database that malloc() and free()
use). Microsoft will, of course, charge for this service and
probably take your first-born child with the EULA.
Gordon L. Burditt This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Spartanicus |
last post by:
How to get help from this group, and how to construct a minimised test
case: http://www.spartanicus.utvinternet.ie/help_us_help_you.htm
--
Spartanicus
|
by: Paminu |
last post by:
Why make an array of pointers to structs, when it is possible to just make
an array of structs?
I have this struct:
struct test {
int a;
int b;
|
by: Bilgehan.Balban |
last post by:
Hi,
I am currently brushing up my c++ knowledge and I would like to ask you
about the differences between classes and C structs, in the
function/method perspective.
1) Is it correct to say...
|
by: Marty |
last post by:
I am new to C# and to structs so this could be easy or just not
possible.
I have a struct defined called Branch
If I use Branch myBranch = new Branch(i); // everything works
If I use Branch...
|
by: noblEnds |
last post by:
Hi. A quick thanks to those who try to help. here's what i'm trying
to do:
<?xml>
<stuff>
<theStory>
<p>aaklsjd fakljs fakjs faskldj a;klsjdf l;aksdj f THIS TEXT SHOULD BE
HIGHLIGHED...
|
by: Steve Carter |
last post by:
Can someone please explain why the following is not possible?
typedef foobar {
int x;
foobar *next; /* why can't we do this? */
};
Thanks
|
by: Dom |
last post by:
I'm really confused by the difference between a Struct and a Class?
Sometimes, I want just a group of fields to go together. A Class
without methods seems wrong, in that it carries too much...
|
by: JohnQ |
last post by:
Are a default constructor, destructor, copy constructor and assignment
operator generated by the compiler for a struct if they are not explicitely
defined?
I think the answer is yes, because...
|
by: Nokao |
last post by:
I'm having a lot of severe errors in my db2diag.log, (DB2 v9.1.0.0).
Googling I don't fin any information :(
What can I do?
I attach the first reports...:
2007-11-19-17.50.26.379948+060...
|
by: ryjfgjl |
last post by:
In our work, we often receive Excel tables with data in the same format. If we want to analyze these data, it can be difficult to analyze them because the data is spread across multiple Excel files...
|
by: emmanuelkatto |
last post by:
Hi All, I am Emmanuel katto from Uganda. I want to ask what challenges you've faced while migrating a website to cloud.
Please let me know.
Thanks!
Emmanuel
|
by: Sonnysonu |
last post by:
This is the data of csv file
1 2 3
1 2 3
1 2 3
1 2 3
2 3
2 3
3
the lengths should be different i have to store the data by column-wise with in the specific length.
suppose the i have to...
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing,...
| |