GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages


Manual Reference Pages  -  SC_REDUNDANTCARTESIANITER (3)

NAME

sc::RedundantCartesianIter - RedundantCartesianIter objects loop through all possible combinations of a given number of axes.

CONTENTS

Synopsis

SYNOPSIS

#include <cartiter.h>

Inherited by sc::RedundantCartesianIterCCA, sc::RedundantCartesianIterCints, and sc::RedundantCartesianIterV3.

    Public Member Functions

    RedundantCartesianIter (int l)
Create a object for the given angular momentum.     virtual int bfn ()=0
Return the current Cartesian basis function number.     void start ()
Initialize the iterator.     void next ()
Move to the next combination of axes.     operator int ()
Returns nonzero if the iterator currently hold valid data.     int a ()
The current exponent of x.     int b ()
The current exponent of y.     int c ()
The current exponent of z.     int l ()
The angular momentum.     int l (int i)
Returns a() if i==0, b() if i==1, and c() if i==2.     int axis (int i)
Return the i’th axis.

Detailed Description

RedundantCartesianIter objects loop through all possible combinations of a given number of axes.

This is used to compute the transformation matrices that maps a set of Cartesian functions to another set of Cartesian functions in a rotated coordinate system.

Author

Generated automatically by Doxygen for MPQC from the source code.

Search for    or go to Top of page |  Section 3 |  Main Index


Version 2.3.1 SC::REDUNDANTCARTESIANITER (3) Sun Apr 3 2016

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.