Source Code (Use browser search to find items of interest.)

khelpcenter'khcHistory (./kdebase/khelpcenter/libkhc/khc_history.h:47)

class khcHistory
{
public:

  khcHistory();
  ~khcHistory();

  void append(khcHistoryItem *item);
  void setCurrent(khcHistoryItem *item);

  bool hasNext();
  bool hasPrev();
  khcHistoryItem* current() { return m_current; }
  khcHistoryItem* next();
  khcHistoryItem* prev();
  khcHistoryItem* back(int steps);
  khcHistoryItem* forward(int steps);

  QList<khcHistoryItem> backList();
  QList<khcHistoryItem> forwardList();
      
protected:
  
  QList<khcHistoryItem> m_list;
  khcHistoryItem *m_current;
};

khelpcenter'khcHistory::khcHistory() (./kdebase/khelpcenter/libkhc/khc_history.cc:48)

khcHistory::khcHistory()
{
  m_list.setAutoDelete(true);
  m_current = 0L;
}

khelpcenter'khcHistory::~khcHistory() (./kdebase/khelpcenter/libkhc/khc_history.cc:54)

khcHistory::~khcHistory()
{
  m_list.clear();
}

khelpcenter'khcHistory::append() (./kdebase/khelpcenter/libkhc/khc_history.cc:59)

void khcHistory::append (khcHistoryItem *item)
{
  if (item)
    {
      m_list.append(item);
      m_current = item;
    }
}

khelpcenter'khcHistory::setCurrent() (./kdebase/khelpcenter/libkhc/khc_history.cc:68)

void khcHistory::setCurrent(khcHistoryItem *item)
{
  if (item)
    {
      m_list.find(item);
      m_current = item;
    }
}

khelpcenter'khcHistory::hasNext() (./kdebase/khelpcenter/libkhc/khc_history.cc:77)

bool khcHistory::hasNext()
{
  khcHistoryItem *next = m_list.next();
  m_list.find(m_current);
  return (next != 0);
}

khelpcenter'khcHistory::hasPrev() (./kdebase/khelpcenter/libkhc/khc_history.cc:84)

bool khcHistory::hasPrev()
{
  khcHistoryItem *prev = m_list.prev();
  m_list.find(m_current);
  return (prev != 0);
}

khelpcenter'khcHistory::next() (./kdebase/khelpcenter/libkhc/khc_history.cc:91)

khcHistoryItem* khcHistory::next()
{
  khcHistoryItem *next = m_list.next();
  if (!next)
    m_list.find(m_current);
  else
    m_current = next;
  return next;
}

khelpcenter'khcHistory::prev() (./kdebase/khelpcenter/libkhc/khc_history.cc:101)

khcHistoryItem* khcHistory::prev()
{
  khcHistoryItem *prev = m_list.prev();
  if (!prev)
    m_list.find(m_current);
  else
    m_current = prev;
  return prev;
}

khelpcenter'khcHistory::back() (./kdebase/khelpcenter/libkhc/khc_history.cc:111)

khcHistoryItem* khcHistory::back(int steps)
{
  khcHistoryItem *item = m_current;
    
  for (int i = 0; i < steps; i++)
    item = m_list.prev();

  if (item)
    m_current = item;
  else
    m_list.find(m_current);

  return item;
}

khelpcenter'khcHistory::forward() (./kdebase/khelpcenter/libkhc/khc_history.cc:126)

khcHistoryItem* khcHistory::forward(int steps)
{
  khcHistoryItem *item = m_current;
    
  for (int i = 0; i < steps; i++)
    item = m_list.next();

  if (item)
    m_current = item;
  else
    m_list.find(m_current);

  return item;
}

khelpcenter'khcHistory::backList() (./kdebase/khelpcenter/libkhc/khc_history.cc:141)

QList<khcHistoryItem> khcHistory::backList()
{
  QList<khcHistoryItem> list;
  khcHistoryItem *item = m_list.prev();

  while(item)
    {
      list.append(item);
      item = m_list.prev();
    }
  
  m_list.find(m_current);
  return list;
}

khelpcenter'khcHistory::forwardList() (./kdebase/khelpcenter/libkhc/khc_history.cc:156)

QList<khcHistoryItem> khcHistory::forwardList()
{
  QList<khcHistoryItem> list;
  khcHistoryItem *item = m_list.next();

  while(item)
    {
      list.append(item);
      item = m_list.next();
    }
  
  m_list.find(m_current);
  return list;
}