C / C++ / MFC

9-Apr-10 3:10

Message Removed

Saurabh.Garg9-Apr-10 3:56

Saurabh.Garg

9-Apr-10 3:56

You mean you can step through the entire code but running it doesn't work?

-Saurabh

browneyes869-Apr-10 4:04

9-Apr-10 4:04

i stepped through each line with less data points, am sure it has to do with the amount of data
am processing but i don't know else to go about memory allocation.....

Saurabh.Garg9-Apr-10 4:07

Saurabh.Garg

9-Apr-10 4:07

Oh that might be the problem. Why not use same dataset in both cases?
Also when you let the program run and it show the error dialog if you click on retry then it will take you to the line at which crash occurs. If you look at the stack trace then you might be able to find the offending code line.

-Saurabh

browneyes869-Apr-10 4:52

9-Apr-10 4:52

i used the smaller set to make sure my algorithm was right. when the unhandled exception msg box appears, i click on OK and takes me
some kind of assembly code: 7C812AFB pop esi.......i really don't know how to debug this

David Crow9-Apr-10 4:05

David Crow

9-Apr-10 4:05

In just a manner of minutes, you could have narrowed the problem down to just:

void main( void )
{
    vector<_variant_t*> Filtered_Average(9995);
  
    for(unsigned int k = 0; k < Filtered_Average.size(); ++k)
        Filtered_Average[k] = new _variant_t();
  
    for(k = 0; k < Filtered_Average.size(); ++k)
    {
        _variant_t *m = Filtered_Average[k];
  
        delete [] m;
    }
}

Hint: two extra characters are causing you grief.

"One man's wage rise is another man's price increase." - Harold Wilson

"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons

"Man who follows car will be exhausted." - Confucius

Chris Meech9-Apr-10 6:11

Chris Meech

9-Apr-10 6:11

At first look, I thought you had 'deleted' the hint. Smile | :)

Chris Meech
I am Canadian. [heard in a local bar]

In theory there is no difference between theory and practice. In practice there is. [Yogi Berra]

image processing toolkits | batch image processing

C^hris L^osinger9-Apr-10 4:24

C^hris L^osinger

9-Apr-10 4:24

expression ?

do you mean exception ?

if you're getting an unhandled exception, the easiest way to find out what it is is to.. handle it.

try
{
... do something
}
catch (CException *e)
{
   e->ReportError();
}

browneyes869-Apr-10 7:39

How can merge 2 CUIntArray?

9-Apr-10 7:39

I have just realised that the exception occurs in the block of code:
it comes up after running for sometime...

// Load the rows <br />
pRange = pSheet->GetRange( _bstr_t("A3"), _bstr_t("CQ9990") );<br />
<br />
for ( int iRow = 1;iRow <= N; iRow++)<br />
{<br />
for (int iColumn = 1; iColumn < N2; ++iColumn )<br />
{	<br />
_variant_t	vItem = pRange->Item[(long) iRow ][ (long) iColumn];<br />
_bstr_t	 bstrText( vItem );<br />
raw_data[iRow][iColumn] = vItem;<br />
<br />
}<br />
}

Le@rner9-Apr-10 0:59

Le@rner

9-Apr-10 0:59

Hi all,

i have two CUIntArray,i want to merge it and generate new CUIntArray,

but want no comman values are inserted in new array.

help me for this.

Eugen Podsypalnikov9-Apr-10 1:17

9-Apr-10 1:17

Le@rner wrote:
but want no comman values are inserted in new array

And... what do you want ? Smile | :)

(could you write some formula, like: C[i] = A[i] | B[i] ?)

virtual void BeHappy() = 0;

Re: How can merge 2 CUIntArray? [modified]

Le@rner9-Apr-10 1:27

Le@rner

9-Apr-10 1:27

i want if A[i]={a,c,e,d}

and B[i]={a,c,f,g}

than result is C[i]={a,c,d,e,f,g}

CPallini9-Apr-10 1:42

Re: How can merge 2 CUIntArray? [modified]

9-Apr-10 1:42

If the array are sorted (like the sample posted) then your task is almost trivial.
Smile | :)

[added]
OK, I see array A is actually NOT ordered.
What is your requirement about?
[/added]

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]

modified on Friday, April 9, 2010 8:30 AM

Eugen Podsypalnikov9-Apr-10 1:57

9-Apr-10 1:57

A (maybe needed to be optimized) version Smile | :)

void ProcessMerging(CUIntArray* pcaResult,
                    const CUIntArray& caFirst,
                    const CUIntArray& caSecond)
{
  if (pcaResult) {
    pcaResult->RemoveAll();
    int iFirstSize(caFirst.GetSize()),
        iSecondSize(caSecond.GetSize()),
        iMaxSize(max(iFirstSize, iSecondSize));
    for (int i = 0; i < iMaxSize; i++) {
      bool bFirstPresented(i < iFirstSize),
           bSecondPresented(i < iSecondSize);
      if (bFirstPresented) {
        pcaResult->Add(caFirst[i]);
        if (bSecondPresented &&
            caFirst[i] != caSecond[i]) {
          pcaResult->Add(caSecond[i]);
        }
      } else {
        pcaResult->Add(caSecond[i]);
      }
    }
  }
}

virtual void BeHappy() = 0;

modified on Friday, April 9, 2010 7:27 AM

CPallini9-Apr-10 2:08

9-Apr-10 2:08

I guess it doesn't work even for sorted arrays (I suppose you should use two different indices).
Smile | :)

Eugen Podsypalnikov9-Apr-10 2:13

Re: How can merge 2 CUIntArray? [updated]

9-Apr-10 2:13

Right, now it is a "per-index merging" only... Smile | :)

virtual void BeHappy() = 0;

CPallini9-Apr-10 3:36

9-Apr-10 3:36

The following function works (at least I suppose it does...) with increasing-ordered arrays (without duplicate items):

// merges arrays 'l' and 'r' into 'o'.
// precondition: 'l','r' should be increasing-ordered, (without duplicate items).
void MergeArrays(CUIntArray & l, CUIntArray & r, CUIntArray & o)
{
  int il = 0, ir = 0;
  int lcount, rcount;
  lcount = l.GetCount();
  rcount = r.GetCount();
  o.RemoveAll();
  for (;;)
  {
    if ( il == lcount)
    {
      if ( ir == rcount) return;
      o.Add(r[ir]);
      ir++;
    }
    else
    {
      if ( ir == rcount)
      {
        o.Add(l[il]);
        il++;
      }
      else
      {
        if (l[il] < r[ir])
        {
          o.Add(l[il]);
          il++;
        }
        else if (l[il] > r[ir])
        {
          o.Add(r[ir]);
          ir++;
        }
        else
        {
          o.Add(l[il]);
          il++; ir++;
        }
      }
    }
  }
}

modified on Friday, April 9, 2010 9:14 AM

Eugen Podsypalnikov9-Apr-10 4:05

9-Apr-10 4:05

Are the arrays increasing ordered ? Smile | :)

l{0,0,3}
r{0,1,4}

virtual void BeHappy() = 0;

CPallini9-Apr-10 4:17

9-Apr-10 4:17

Yes, they have duplicates though.
If you see my latest precondition... Roll eyes | :rolleyes:

Eugen Podsypalnikov9-Apr-10 4:34