gCycleMemory Class Reference

#include <gCycle.h>

Collaboration diagram for gCycleMemory:

[legend]

List of all members.

Public Member Functions
gCycleMemoryEntry *	Remember (const gCycle *cycle)
int	Len () const
gCycleMemoryEntry *	operator() (int i) const
gCycleMemoryEntry *	Latest (int side) const
gCycleMemoryEntry *	Earliest (int side) const
void	Clear ()
	gCycleMemory ()
	~gCycleMemory ()
Private Attributes
tList< gCycleMemoryEntry >	memory
Friends
class	gCycleMemoryEntry

---

Detailed Description

Definition at line 67 of file gCycle.h.

---

Constructor & Destructor Documentation

gCycleMemory::gCycleMemory

(

)

Definition at line 925 of file gAIBase.cpp.

{
}

gCycleMemory::~gCycleMemory

(

)

Definition at line 930 of file gAIBase.cpp.

References Clear().

{
    Clear();
}

Here is the call graph for this function:

---

Member Function Documentation

gCycleMemoryEntry * gCycleMemory::Remember

(

const gCycle *

cycle

)

Definition at line 916 of file gAIBase.cpp.

References GrowingArrayBase::Len(), memory, and tNEW.

{
    for (int i=memory.Len()-1; i>=0; i--)
        if (memory(i)->cycle == cycle)
            return memory(i);

    return tNEW(gCycleMemoryEntry)(this, cycle);
}

Here is the call graph for this function:

int gCycleMemory::Len

(

void

)

const [inline]

Definition at line 75 of file gCycle.h.

References GrowingArrayBase::Len(), and memory.

Referenced by operator()().

{return memory.Len();}

Here is the call graph for this function:

Here is the caller graph for this function:

gCycleMemoryEntry * gCycleMemory::operator()

(

int

i

)

const

Definition at line 941 of file gAIBase.cpp.

References Len(), memory, and tASSERT.

{
    tASSERT(0 <= i && i < Len());
    return memory(i);
}

Here is the call graph for this function:

gCycleMemoryEntry * gCycleMemory::Latest

(

int

side

)

const

Definition at line 886 of file gAIBase.cpp.

References gCycleMemoryEntry::cycle, gCycleTouchEvent::dist, GrowingArrayBase::Len(), gCycleMemoryEntry::max, memory, and NULL.

Referenced by CheckLoop().

{
    side = (side > 0 ? 1 : 0);
    gCycleMemoryEntry* ret = NULL;
    for (int i=memory.Len()-1; i>=0; i--)
    {
        gCycleMemoryEntry* m = memory(i);
        if ((!ret || (m->max[side].dist > ret->max[side].dist)
                && bool( m->cycle ) && m->cycle->Alive() ))
            ret = memory(i);
    }

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

gCycleMemoryEntry * gCycleMemory::Earliest

(

int

side

)

const

Definition at line 901 of file gAIBase.cpp.

References gCycleMemoryEntry::cycle, gCycleTouchEvent::dist, GrowingArrayBase::Len(), memory, gCycleMemoryEntry::min, and NULL.

Referenced by CheckLoop().

{
    side = (side > 0 ? 1 : 0);
    gCycleMemoryEntry* ret = NULL;
    for (int i=memory.Len()-1; i>=0; i--)
    {
        gCycleMemoryEntry* m = memory(i);
        if ((!ret || (m->min[side].dist < ret->min[side].dist)
                && bool( m->cycle ) && m->cycle->Alive()))
            ret = memory(i);
    }
    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void gCycleMemory::Clear

(

void

)

Definition at line 935 of file gAIBase.cpp.

References GrowingArrayBase::Len(), and memory.

Referenced by ~gCycleMemory().

{
    for (int i = memory.Len()-1; i>=0; i--)
        delete memory(i);
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

Friends And Related Function Documentation

friend class gCycleMemoryEntry [friend]

Definition at line 68 of file gCycle.h.

---

Member Data Documentation

tList<gCycleMemoryEntry> gCycleMemory::memory [private]

Definition at line 70 of file gCycle.h.

Referenced by Clear(), Earliest(), Latest(), Len(), operator()(), and Remember().

---

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

• src/tron/gCycle.h
• src/tron/gAIBase.cpp

---