C / C++ / MFC

Quote:

SQL_SUCCESS, SQL_SUCCESS_WITH_INFO, SQL_NEED_DATA, SQL_STILL_EXECUTING, SQL_ERROR, SQL_NO_DATA, SQL_INVALID_HANDLE, or SQL_PARAM_DATA_AVAILABLE.

Quote:

When SQLExecute returns either SQL_ERROR or SQL_SUCCESS_WITH_INFO, an associated SQLSTATE value can be obtained by calling SQLGetDiagRec with a HandleType of SQL_HANDLE_STMT and a Handle of StatementHandle.

ret = SQLGetDiagRec(SQL_HANDLE_STMT, stmt, 1, sql_state, &native_error, message, sizeof(message), &msg_len)

SureshBL wrote:

But even that is returning -2 and not giving any other details, hence I commented it. Am I missing anything? How can I get more details from ret object apart from -2.

Tim ONeil wrote:

// then add a reasonable set of unit tests, with output, to main.cpp.

typedef int T; // I am not sure about this, but it seems to work.
#include "stack.h"
#include <iostream>

template <class t>
stack<t>::stack()
{
    _head = nullptr;
    _size = 0;
}

template <class t>
stack<t>::~stack()
{
    // empty destructor
}

template <class t>
size_t stack<t>::size() const
{
    //return the size of the stack
    return _size;
}

template <class t>
T& stack<t>::top() const
{
    //return a reference to the top value. Throw an exception if the stack is empty.
    return _head->_data;
}

template <class t>
void stack<t>::push(const T& item)
{
    //push a new value onto the stack
}

template <class t>
void stack<t>::pop()
{
    //remove the top value from the stack. Do nothing if the stack is empty.
}

template <class t>
void stack<t>::invert()
{
    //reverse the order of the entire stack, so that 1,2,3,4,5 becomes 5,4,3,2,1 and so on.
}

int main()
{
    stack<int> myStack;
    std::cout << "stack size = " << myStack.size() << std::endl;

    return 0;
}

template<class T>
_node<T>::_node (const T& dat, _node<T>* ptr) :
  _data (dat),
  _next (ptr)
{
}

template<class T>
_node<T>::~_node ()
{
}

template<class T>
stack<T>::stack () :
  _size (0),
  _head (nullptr)
{
}


template<class T>
stack<T>::~stack ()
{
  while (_head)
  {
    _node<T>* ptr = _head->_next;
    delete _head;
    _head = ptr;
  }
}

template<class T>
size_t stack<T>::size () const
{
  return _size;
}

template<class T>
T& stack<T>::top () const
{
  if (!_size)
    throw std::exception ("empty_stack");

  return _head->_data;
}

template<class T>
void stack<T>::push (const T& data)
{
  _node<T>* node = new _node<T> (data, _head);
  _head = node;
  _size++;
}

template<class T>
void stack<T>::pop ()
{
  if (!_size)
    return;

  _node<T>* ptr = _head->_next;
  delete _head;
  _head = ptr;
  --_size;
}

template<class T>
void stack<T>::invert ()
{
  _node<T>* prev = nullptr;
  _node<T>* crt = _head;
  while (crt)
  {
    _node<T>* next = crt->_next;
    crt->_next = prev;
    prev = crt;
    crt = next;
  }
  _head = prev;
}

int main (int argc, char** argv)
{
  stack<int> the_stack;

  cout << "Empty stack has size " << the_stack.size () << endl;
  
  the_stack.push (1);
  the_stack.push (2);
  the_stack.push (3);
  the_stack.push (4);
  the_stack.push (5);
  cout << "5 elements pushes, size is " << the_stack.size () << endl;
  cout << "Top element is " << the_stack.top () << endl;

  the_stack.invert ();
  cout << "Stack inverted elements are (from top):" << endl;
  int n = the_stack.size ();
  for (int i = 0; i < n; i++)
  {
    cout << "Element " << i + 1 << " is " << the_stack.top () << endl;
    the_stack.pop ();
  }

  return 0;
}