Data structure problem.....

[adil.mohd]

Hi All,

This is my first to this group. I have a linklist implementation. I
want to put some checks in the implementation code
so that i can detect any problem with the list and capture some data
to prove the problem.

Any suggestion or code fragments are welcome .

Thanks,
Adil

[Victor Bazarov]

ad*******@gmail.com wrote:

This is my first to this group.

Have you read the FAQ yet?

I have a linklist implementation.

I guess you're asking us to take your word for it. OK.

I
want to put some checks in the implementation code
so that i can detect any problem with the list and capture some data
to prove the problem.

What would you consider a "problem with the list"?

Any suggestion or code fragments are welcome .

Yes. Please post some code fragments so we could actually make some
suggestions.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[adil.mohd]

On Jul 31, 6:03 pm, "Victor Bazarov" <[e-mail]:

[e-mail] wrote:

This is my first to this group.

Have you read the FAQ yet?

I have a linklist implementation.

I guess you're asking us to take your word for it. OK.

I
want to put some checks in the implementation code
so that i can detect any problem with the list and capture some data
to prove the problem.

What would you consider a "problem with the list"?

Any suggestion or code fragments are welcome .

Yes. Please post some code fragments so we could actually make some
suggestions.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

Basically, I want to inroduce some sanity checks in
implementation....
I would like to know if I can do that. Also if it is a standard
practice.

Example of these consistency or sanity checks would be
, after adding or deleting a node If I can somehow find that the list
has been corrupted or not.
In case the list got corrupted I would like to capture some
information
regarding the nodes involved in the list corruption.
By corruption I mean if the list got broken or anything bad.

The implementation is based on a fast fail strategy. I would like to
fail in the
implementation as soon as some sanity check failed rather than
continue and corrupt
other data structures if anything goes bad with the list.

[Colander]

On Jul 31, 11:40 pm, [e-mail] wrote:

Hi All,

This is my first to this group. I have a linklist implementation. I
want to put some checks in the implementation code
so that i can detect any problem with the list and capture some data
to prove the problem.

Any suggestion or code fragments are welcome .

As others have mentioned it's difficult to give examples without
anything from you to go on, but a try:

LinkedList::clear()
{
// some of your code that clears the list
....
// the end of your code

// Then add something like this:
assert(size() == 0);
}