sc::RedundantCartesianIter(3)

🎀 NAME 🎀

okay so sc::RedundantCartesianIter — from the MPQC manual — is the iterator bestie that loops through all possible combinations of a given number of axes. periodt. 💅

---

🌸 SYNOPSIS 🌸

#include <cartiter.h>

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

🫶 Public Member Functions 🫶

• RedundantCartesianIter (int l) — creates an object for the given angular momentum. constructor slay. ✨
• virtual int bfn ()=0 — returns the current Cartesian basis function number. 💫
• void start () — initializes the iterator. 🎀
• void next () — moves to the next combination of axes. 🌀
• operator int () — returns nonzero if the iterator currently holds 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. the little index-to-exponent mapping, love that. 🔥
• int axis (int i) — returns the i'th axis. 🍓

---

🦋 Detailed Description 🦋

okay so picture this: RedundantCartesianIter objects loop through all possible combinations of a given number of axes. Every single combo, no skips. 🌀

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. Rotated coordinate system, bestie — that's the whole assignment. 💫

---

👑 Author 👑

Generated automatically by Doxygen for MPQC from the source code. (yup, the robots handled this one, no cap 🤖)

mwah 💋 — signed off with version 2.3.1, date Sun Oct 4 2020, and page sc::RedundantCartesianIter(3). bye bestie, go loop those axes 💖✨