C / C++ / MFC

pix_programmer wrote:

I've to parse an XML File using Tiny XML. My XML file contents are

pix_programmer wrote:

I've to pass "TicketID"

pix_programmer wrote:

How to pass the XML file name and the tag name and retrieve the value of that
tag?

Francis Paran wrote:

Second is that this won't work unless the first queue is sorted, and I have no
clue on how to sort this using an STL sort function or any other way.

bool comparater( const int& p1, const int& p2 )
{
    return p1 < p2;
}
  
std::deque<int> q;
  
std::sort(q.begin(), q.end(), comparater);

struct node
{
    char c;
    int count;
};
  
int comparater( const void *arg1, const void *arg2 )
{
    node a = *((node *) arg1);
    node b = *((node *) arg2);
  
    return a.count - b.count;
}
  
void main( void )
{
    node frequencies[256] = {0};
  
    // assign 'letters' to each node
    for (int x = 0; x < sizeof(frequencies) / sizeof(node); x++)
        frequencies[x].c = x;

    /*****[ populate frequency array with counts ]*****
    FILE *pFile = fopen("c:\\win.ini", "r");
    if (pFile != NULL)
    {
        while (feof(pFile) == 0)
        {
            int c = fgetc(pFile); // c will be in the -1..255 range
            if (c >= 0)
                frequencies[c].count++;
        }
  
        fclose(pFile);
    }
    */

    qsort(frequencies, sizeof(frequencies) / sizeof(node), sizeof(node), comparater);
  
    std::cout << "The two letters with the highest frequency are " 
              << frequencies[255].c 
              << " and " 
              << frequencies[254].c 
              << std::endl;
}

#include <iostream>
#include <fstream>

using namespace std;

int size, i, j;
void count_chars( int *counts );
double frequency (int char_count, int length);
void generateHuffman(Queue& q1, Queue& q2);

int main()
{
    char *stringChar;
    int *counts;
    ifstream infile( "project2input.txt" );
    infile.seekg (0, ios::end);
    
    int size = infile.tellg();
    
    stringChar = new char[size];
    
    for(i = 0; i<size; i++)
         infile.seekg(i)>>stringChar[i];
    
    infile.close();
 
    counts = new int[256];
    count_chars( counts );
    cout<<"\n\n";
    int newSize;
    
    for(j = 0; j<256; j++)
            if (counts[j] != 0)
            {  newSize++;
               cout<<(char) j<<"= "<<j<<" ("<<frequency (counts[j], 
                            size)*100<<")\n";
            }
            cout<<endl<<newSize<<" characters\n";
 
    cout<<endl;
    char c;
    cin>>c;
    
    return 0;
}
void count_chars( int *counts )
{
    for ( int i = 0 ; i <256 ; i++ )
        counts[ i ] = 0;
    
    ifstream file( "project2input.txt" );

    if ( !file ) {
        cerr <<"Couldn't open the input file!\n";
        throw "abort";
    }

    for ( ; ; ) 
    {
        unsigned char c;
        file>> c;    
        if ( file )   
           counts[ c ]++;
        else
            break;
   }
}

Francis Paran wrote:

However, the problem comes with sorting them where it changes their positions in
the array as well as the characters they will now represent.