sc::RedundantCartesianSubIter(3)

🎀 NAME 🎀

okay so this is the page for sc::RedundantCartesianSubIter(3), from the MPQC manual, bestie 💖

sc::RedundantCartesianSubIter — literally like RedundantCartesianIter, except a, b, and c are fixed to a given value. That's the whole vibe. Periodt ✨

---

🌸 SYNOPSIS 🌸

#include <cartiter.h>

Inherited by sc::RedundantCartesianSubIterCCA, sc::RedundantCartesianSubIterCints, and sc::RedundantCartesianSubIterV3. slay, the whole family is here 👑

✨ Public Member Functions ✨

• RedundantCartesianSubIter (int l) — creates an object for the given angular momentum. constructor moment ✨
• virtual int bfn ()=0 — returns the current Cartesian basis function number. iykyk 🫶
• void start (int a, int b, int c) — initializes the iterator. get it started 💅
• void next () — moves to the next combination of axes. next bestie, next 🦋
• operator int () const — returns nonzero if the iterator currently holds valid data. vibe check ✅
• int a () const — the current exponent of x. x is giving main character energy 🌈
• int b () const — the current exponent of y. y said hold my crown 👑
• int c () const — the current exponent of z. z is iconic, no cap ⭐
• int l () const — the angular momentum. math bestie 🧚
• int l (int i) — returns a() if i==0, b() if i==1, and c() if i==2. choose your fighter 🎀
• int axis (int i) — returns the i'th axis. axis reveal 🔥

---

💖 Detailed Description 💖

Like RedundantCartesianIter, except a, b, and c are fixed to a given value. lowkey simple, highkey useful 💜

---

🦋 Member Function Documentation 🦋

💅 void sc::RedundantCartesianSubIter::start (int a, int b, int c)

Initializes the iterator. The constraints on a, b, and c are given as arguments. args said make it make sense ✨

---

👑 Author 👑

Generated automatically by Doxygen for MPQC from the source code. not me writing a whole novel, that's literally the author line 😭🫶

---

xoxo, bestie 💜 — this page is from MPQC, version 2.3.1, dated Sun Oct 4 2020. mwah 🎀