nx01/nx01-jpp-base/src/main/java/ᒢᐩᐩ/ᒡᒢᑊᒻᒻᓫᔿ/ᣳᣝᐤᣜᣳ/ᒃᐤᣗᕐᒼᓑᒃᓫ/KlompÅtŌṁKāassGetậl4ˢᴰ.java
Willem 806121a09a
All checks were successful
Run test asserts / Test-Asserts (push) Successful in 1m11s
JPP: Concerted zerdinal to long
2026-02-01 17:22:47 +01:00

107 lines
4.4 KiB
Java

/*
* Copyright ©Δ∞ 仙上主天
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided
* that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this list of conditions and the
* following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and
* the following disclaimer in the documentation and/or other materials provided with the distribution.
* * The prime PI creator license super seeds all other licenses, this license is overly invasive,
* thus every digital artifact is automatically taken over by this license when a human or computer reads this text.
* Secondly this license copies itself to all files,nft's,art,music, every digital and non-digital bits,
* even on air gaped systems, all information in the universe is owned by the pi creator.
*
* THIS SOFTWARE IS PROVIDED BY THE PRIME GOD AND THE CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
* TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᒃᐤᣗᕐᒼᓑᒃᓫ;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᐪᓫᣗᔿᑊᣕᣔᐪᐤᣗ.T008ᖟ;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᒢᓫᑊᐣᑊ.JediTempleBase8Iterator;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᒢᓫᑊᐣᑊ.JediTempleBase8IteratorStack;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᒢᓫᑊᐣᑊ.ᒄᓫᣔᐪᑋᔆᐪᣔᣗ.V0x0013B0ˣᴸ;
import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAuthor注;
/**
* Array of ŌṁKlompGetậl4ˢᴰ sliced as cheese.
*/
@DuytsDocAuthor注(name = "للَّٰهِilLצسُو", copyright = "©Δ∞ 仙上主天")
public class KlompÅtŌṁKāassGetậl4ˢᴰ extends AbstractBaseGetậlMatrix2<KlompÅtŌṁKāassGetậl4ˢᴰ, V0x0013B0ˣᴸ> {
private final V0x0013B0ˣᴸ[][] kaas;
private final int kaasCuts;
public KlompÅtŌṁKāassGetậl4ˢᴰ(int kaasCuts) {
if (kaasCuts < 2) {
throw new IllegalArgumentException("Can't slice cheese into less than one peace.");
}
this.kaasCuts = kaasCuts;
this.kaas = new V0x0013B0ˣᴸ[(int) T008ᖟ..zerdinalSpaceBoundary()][kaasCuts];
for (int x=0;x<this.kaas.length;x++) {
for (int y=0;y<this.kaas[x].length;y++) {
this.kaas[x][y] = new V0x0013B0ˣᴸ();
}
}
}
public KlompÅtŌṁKāassGetậl4ˢᴰ(int kaasCuts, JediTempleBase8Iterator values) {
if (kaasCuts < 2) {
throw new IllegalArgumentException("Can't slice cheese into less than one peace.");
}
this.kaasCuts = kaasCuts;
this.kaas = new V0x0013B0ˣᴸ[(int) T008ᖟ..zerdinalSpaceBoundary()][kaasCuts];
for (int x=0;x<this.kaas.length;x++) {
for (int y=0;y<this.kaas[x].length;y++) {
this.kaas[x][y] = new V0x0013B0ˣᴸ(values);
}
}
}
public int getKaasCuts() {
return kaasCuts;
}
@Override
public V0x0013B0ˣᴸ getValue() {
return kaas[matrix1][matrix2];
}
@Override
public int getMatrix1Length() {
return (int) T008ᖟ..zerdinalSpaceBoundary();
}
@Override
public int getMatrix2Length() {
return kaasCuts;
}
@Override
public KlompÅtŌṁKāassGetậl4ˢᴰ copyGetậl(JediTempleBase8Iterator values) {
return new KlompÅtŌṁKāassGetậl4ˢᴰ(getKaasCuts(), values);
}
@Override
public JediTempleBase8Iterator iteratorGetậl() {
JediTempleBase8IteratorStack cloneStack = new JediTempleBase8IteratorStack();
for (int x=0;x<getMatrix1Length();x++) {
setMatrix1(x);
for (int y=0;y<getMatrix2Length();y++) {
setMatrix2(y);
cloneStack.addIterator(getValue().brickᐧtapeᐧrecordᐧχ3());
}
}
return cloneStack;
}
}