Managed C++/CLI

BOOL CMainFrame::PreCreateWindow(CREATESTRUCT& cs)
{
     cs.cx = 1000;
     cs.cy = 730;

     if(!CFrameWnd::PreCreateWindow(cs))
          return false;

     return TRUE;
}

void CMainFrame::OnSize(UINT nType, int cx, int cy)
{
     CFrameWnd::OnSize(nType, cy, cy);

     if(!m_ResizeFlag)  // Resizing only occurs in initial creation
     {
          MoveWindow(300, 300, 1000, 730);  
          
          // I also tried SetWindowPos(this, 300, 300, 1000, 730, SWP_SHOWWINDOW);

          m_ResizeFlag = true;
     }
}

<br />
include <string><br />
#include "KeyValue.h"<br />
using namespace std;<br />
<br />
class OrderedList<br />
{<br />
     public:<br />
           OrderedList();  // constructor ? initialise empty list<br />
           ~OrderedList();  // destructor<br />
<br />
          /* insert data into the list in ascending word order.<br />
              If the word is already present in the list, update the existing <br />
              definition by concatenating the current one */<br />
         void insert( string word, string definition);<br />
<br />
         /* return definition associated with key 'w'.<br />
             return null string if 'w' is not present in the list */<br />
         const string inspect( string w ) const;<br />
<br />
         // whether 'w' is present in the list<br />
         bool isIn( string w ) const;<br />
<br />
         // whether the list is empty<br />
         bool isEmpty() const;<br />
<br />
         // take a keyValue object containing a word and <br />
         // its definition(s). Print it.<br />
        void printEntry() const;<br />
<br />
     public:<br />
            KeyValue* head;<br />
};<br />

<br />
#include <iostream><br />
#include <stddef.h><br />
#include "OrderedList.h"<br />
#include <string> <br />
<br />
using namespace std;<br />
<br />
KeyValue::KeyValue()<br />
{<br />
  word = "\0";<br />
  definition = "\0";<br />
  next = NULL;<br />
}<br />
<br />
OrderedList::OrderedList()<br />
<br />
{<br />
head = NULL;<br />
}<br />
<br />
OrderedList::~OrderedList()<br />
{<br />
   KeyValue* Current;<br />
   KeyValue* it;<br />
<br />
   it = head;<br />
   while (it != NULL);<br />
<br />
     {<br />
       Current = it;<br />
       it = it->next;<br />
       delete Current;<br />
   }<br />
}<br />
<br />
bool OrderedList::isEmpty() const<br />
{<br />
return head == NULL;<br />
}<br />
<br />
<br />
<br />
void OrderedList::insertBefore(const int newval, const int val)<br />
{<br />
KeyValue* p = new KeyValue;<br />
    KeyValue* iterator = NULL; <br />
KeyValue* previous = NULL;<br />
<br />
p->word = newval;<br />
p->next = NULL;<br />
if (isEmpty())<br />
{<br />
 cout << "List is empty\n";<br />
}<br />
else<br />
{<br />
 for (iterator = head; iterator != NULL; iterator = iterator->next)<br />
 {<br />
  if (iterator->word == val) <br />
  {<br />
                           if (iterator == head)<br />
                           { <br />
                               head = p;<br />
                           }<br />
                           else<br />
                           {<br />
                               previous->next = p;<br />
                           }<br />
                           p->next = iterator;<br />
      break;<br />
  }<br />
  else <br />
  {<br />
   previous = iterator;<br />
  }<br />
 }<br />
}<br />
}<br />
<br />
void OrderedList::printEntry() const<br />
{<br />
if (isEmpty())<br />
{<br />
 cout << "List empty" << endl;<br />
}<br />
else // walk along list<br />
{<br />
 KeyValue* p = NULL;<br />
 for (p=head; p!=NULL; p=p->next)<br />
 {<br />
  cout << p->word << endl; <br />
 }<br />
}<br />
}<br />