IRSet Class Reference

#include <Set.h>

Inheritance diagram for IRSet:

Public Member Functions
	IRSet ()
	~IRSet ()
void	unchecked_insert (InfoRecord *)
void	insert (InfoRecord *)
int	find (InfoRecord *)
int	remove (InfoRecord *)
void	myRemove (listNode **n, InfoRecord *r)
InfoRecord *	iterator (Iterator *)
InfoRecord *	next (Iterator *)
int	numElements ()
int	hasElements ()
void	print ()

Detailed Description

Definition at line 25 of file Set.h.

Constructor & Destructor Documentation

IRSet()

IRSet::IRSet

(

)

Copyright (c) 1995, 1996, 1997, 1998, 1999, 2000 by The Board of Trustees of the University of Illinois. All rights reserved.

Definition at line 17 of file Set.C.

{
  head = (listNode *) 0;
  nElements = 0;
}

~IRSet()

IRSet::~IRSet

(

)

Definition at line 23 of file Set.C.

References listNode::next.

              {
  // delete all links; don't delete the InfoRecord objects
  listNode *tmp;
  for (listNode *link = head; link; link = tmp) {
    tmp = link->next;
    delete link;
  }
}

Member Function Documentation

find()

int IRSet::find

(

InfoRecord *

r

)

Definition at line 112 of file Set.C.

References listNode::info, and listNode::next.

Referenced by Rebalancer::assign(), insert(), Rebalancer::isAvailableOn(), Rebalancer::numAvailable(), and unchecked_insert().

{
  listNode *p = head;
  while (p) {
    if (p->info == r) return 1;
    else p = p->next;
  }
  return 0;
}

hasElements()

int IRSet::hasElements

(

)

Definition at line 149 of file Set.C.

Referenced by RefineTorusLB::newRefine(), and Rebalancer::refine().

{
  return ! ! head;
}

insert()

void IRSet::insert

(

InfoRecord *

info

)

Definition at line 49 of file Set.C.

References find(), NAMD_bug(), and listNode::next.

Referenced by RefineTorusLB::newRefine(), and Rebalancer::refine().

{
  if (!find(info))
  {
    ++nElements;
    listNode *node = new listNode(info);
    node->next = head;
    head = node;
#ifdef DEBUG_IRSET
    int n = 0;
    while (node) { ++n; node = node->next; }
    if ( n != nElements ) NAMD_bug("IRSet::insert count");
#endif
  }
   
}

iterator()

InfoRecord * IRSet::iterator

(

Iterator *

iter

)

Definition at line 122 of file Set.C.

References listNode::info, listNode::next, and Iterator::next.

Referenced by RefineTorusLB::newRefine(), and Rebalancer::refine().

{
  if (head){
    iter->next = head->next;
    return head->info;
  }
  return 0;
}

myRemove()

void IRSet::myRemove	(	listNode **	n,
		InfoRecord *	r
	)

Definition at line 67 of file Set.C.

References listNode::next.

{
  if ((*n)->info == r)
    *n = (*n)->next;
  else 
    myRemove(&((*n)->next), r);
}

next()

InfoRecord * IRSet::next

(

Iterator *

iter

)

Definition at line 131 of file Set.C.

References listNode::info, listNode::next, and Iterator::next.

Referenced by RefineTorusLB::newRefine(), and Rebalancer::refine().

{
  //  std::cout << "set::next: " << iter->next << "\n";
  if (!iter->next)
    { return 0;
    }
  //  std::cout << "set::next: iter->next->info=" << iter->next->info << "\n";
  InfoRecord *temp = iter->next->info;
  iter->next = iter->next->next;
  return temp;
}

numElements()

int IRSet::numElements

(

)

Definition at line 144 of file Set.C.

Referenced by Rebalancer::InitProxyUsage(), Rebalancer::multirefine(), Rebalancer::numAvailable(), Rebalancer::printLoads(), and Rebalancer::printSummary().

{
  return nElements;
}

print()

void IRSet::print

(

)

Definition at line 154 of file Set.C.

References InfoRecord::Id, listNode::info, iout, and listNode::next.

{
  listNode *p = head;
  while (p){
    if ( p->info ) iout << p->info->Id << " ";
    else iout << "NULL ";
    p = p->next;
  }
}

remove()

int IRSet::remove

(

InfoRecord *

r

)

Definition at line 75 of file Set.C.

References listNode::info, NAMD_bug(), and listNode::next.

Referenced by Rebalancer::deAssign(), RefineTorusLB::newRefine(), and Rebalancer::refine().

{
#ifdef DEBUG_IRSET
    listNode *node = head;
    int n = 0;
    while (node) { ++n; node = node->next; }
    if ( n != nElements ) NAMD_bug("IRSet::remove count");
#endif

  if (!head)
    return 0;

  listNode *p = head;
  listNode *q = p->next;

  if (p->info == r){
    head = q;
    delete p;
    --nElements;
    return 1;
  }

  while (q){
    if (q->info == r){
      p->next = q->next;
      delete q;
      --nElements;
      return 1;
    }
    else {
      p = q;
      q = q->next;
    }
  }
  return 0;
}

unchecked_insert()

void IRSet::unchecked_insert

(

InfoRecord *

info

)

Definition at line 32 of file Set.C.

References find(), NAMD_bug(), and listNode::next.

Referenced by Rebalancer::assign(), and Rebalancer::Rebalancer().

{
#ifdef DEBUG_IRSET
  if (find(info)) NAMD_bug("IRSet::unchecked_insert duplicate");
#endif
    ++nElements;
    listNode *node = new listNode(info);
    node->next = head;
    head = node;
#ifdef DEBUG_IRSET
  int n = 0;
  while (node) { ++n; node = node->next; }
  if ( n != nElements ) NAMD_bug("IRSet::unchecked_insert count");
#endif
}

---

The documentation for this class was generated from the following files:

• Set.h
• Set.C