Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F87033835
POEMSChain.h
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Thu, Oct 10, 03:31
Size
2 KB
Mime Type
text/x-c
Expires
Sat, Oct 12, 03:31 (1 d, 23 h)
Engine
blob
Format
Raw Data
Handle
21316546
Attached To
rLAMMPS lammps
POEMSChain.h
View Options
/*
*_________________________________________________________________________*
* POEMS: PARALLELIZABLE OPEN SOURCE EFFICIENT MULTIBODY SOFTWARE *
* DESCRIPTION: SEE READ-ME *
* FILE NAME: PoemsChain.h *
* AUTHORS: See Author List *
* GRANTS: See Grants List *
* COPYRIGHT: (C) 2005 by Authors as listed in Author's List *
* LICENSE: Please see License Agreement *
* DOWNLOAD: Free at www.rpi.edu/~anderk5 *
* ADMINISTRATOR: Prof. Kurt Anderson *
* Computational Dynamics Lab *
* Rensselaer Polytechnic Institute *
* 110 8th St. Troy NY 12180 *
* CONTACT: anderk5@rpi.edu *
*_________________________________________________________________________*/
#ifndef POEMSCHAIN_H_
#define POEMSCHAIN_H_
#include "poemslist.h"
struct
ChildRingData
{
List
<
int
>
*
childRing
;
int
entranceNodeId
;
};
struct
POEMSChain
{
~
POEMSChain
(){
for
(
int
i
=
0
;
i
<
childChains
.
GetNumElements
();
i
++
)
{
delete
childChains
(
i
);
}
}
//void printTreeStructure(int tabs);
//void getTreeAsList(List<int> * temp);
List
<
int
>
listOfNodes
;
List
<
POEMSChain
>
childChains
;
POEMSChain
*
parentChain
;
List
<
ChildRingData
>
childRings
;
void
printTreeStructure
(
int
tabs
){
for
(
int
i
=
0
;
i
<
tabs
;
i
++
)
{
cout
<<
"
\t
"
;
}
cout
<<
"Chain: "
;
for
(
int
i
=
0
;
i
<
listOfNodes
.
GetNumElements
();
i
++
)
{
cout
<<
*
(
listOfNodes
(
i
))
<<
" "
;
}
cout
<<
endl
;
for
(
int
i
=
0
;
i
<
childChains
.
GetNumElements
();
i
++
)
{
childChains
(
i
)
->
printTreeStructure
(
tabs
+
1
);
}
}
void
getTreeAsList
(
List
<
int
>
*
temp
)
{
for
(
int
i
=
0
;
i
<
listOfNodes
.
GetNumElements
();
i
++
)
{
int
*
integer
=
new
int
;
*
integer
=
*
(
listOfNodes
(
i
));
temp
->
Append
(
integer
);
}
for
(
int
i
=
0
;
i
<
childChains
.
GetNumElements
();
i
++
)
{
childChains
(
i
)
->
getTreeAsList
(
temp
);
}
}
};
#endif
Event Timeline
Log In to Comment