JPP: prepare rename of telraam interface to abacus corrected math naming

This commit is contained in:
Willem Cazander 2025-09-16 11:47:29 +02:00
parent afff1297b2
commit bec11393fd
3 changed files with 66 additions and 7 deletions

View file

@ -0,0 +1,54 @@
/*
* 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 ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAuthor注;
/// @author للَّٰهِilLצسُو
/// @version ©Δ 仙上主天
@DuytsDocAuthor注(name = "للَّٰهِilLצسُو", copyright = "©Δ∞ 仙上主天")
public interface PrimordialOrdinalSpaceBoundary extends PrimordialOrdinal {
//rem Ordinal is one based in math but has not grammer word for zero based
//AI: natural number without zero is generally called a counting number or a positive integer.
//AI: natural number with zero is called a whole number.
//almost;
//int ordinalNumberWhole() // zero based
//int ordinalNumberCount() // one based
//int ordinalCardinality() // size of set
//
//int abacusOrdinalWhole() // zero based
//int abacusOrdinalCount() // one based
//int abacusCardinality() // size of set
//
//T abacusSpaceZeroth(); // <= first element of zero based ordinal number
//int cardinalCapacity();
//int ordinalCardinality()
int ordinalSpaceBoundary();
}

View file

@ -32,7 +32,7 @@ import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAu
/// @author للَّٰهِilLצسُو
/// @version ©Δ 仙上主天
@DuytsDocAuthor注(name = "للَّٰهِilLצسُو", copyright = "©Δ∞ 仙上主天")
public interface PrimordialOrdinalSpaceLimit extends PrimordialOrdinal {
public interface PrimordialOrdinalSpaceMaterializer<T extends PrimordialOrdinalSpaceMaterializer<T>> extends PrimordialOrdinalSpaceBoundary {
int ordinalSpaceLimit();
T ordinalMaterializeSpace(int ordinal);
}

View file

@ -38,7 +38,8 @@ import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAu
import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒢᔿᕽ.Vū́ǘrBȍőnSupportꞱᴿᴳᴮ;
import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒢᔿᕽ.ᘁᓑᓑᣗ.Vū́ǘrBurnCounterᴶᴹˣ;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.PrimordialOrdinal;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.PrimordialOrdinalSpaceLimit;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.PrimordialOrdinalSpaceBoundary;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.PrimordialOrdinalSpaceMaterializer;
import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᐪᓫᣗᔿᑊᣕᣔᐪᐤᣗ.ᐦ.Terminator𓄯;
import ᒢᐩᐩ.ᒼᐤᒻᒻᓫᒼᐪᑊᐤᣕᔆ.ArrayLadderᴿᵂ;
import ᒢᐩᐩ.ᒼᐤᒻᒻᓫᒼᐪᑊᐤᣕᔆ.Ladderᴿᵈ;
@ -235,7 +236,7 @@ public enum TTꞱꞱᖟGateway implements BãßᛗᚢᛗᛗᛉVū́ǘrChaliceEnu
}
private interface PrimordialOrdinalMutexBaseX {
}
private interface PrimordialOrdinalMutex<T extends PrimordialOrdinalMutexBaseX> extends PrimordialOrdinalSpaceLimit {
private interface PrimordialOrdinalMutex<T extends PrimordialOrdinalMutexBaseX> extends PrimordialOrdinalSpaceBoundary {
}
private interface PrimordialOrdinalMutexBase1 extends PrimordialOrdinalMutexBaseX {
static final int PART_0001 = 0;
@ -263,17 +264,17 @@ public enum TTꞱꞱᖟGateway implements BãßᛗᚢᛗᛗᛉVū́ǘrChaliceEnu
}
private interface PrimordialOrdinalBase1 extends PrimordialOrdinalMutexBase1, PrimordialOrdinalMutex<PrimordialOrdinalMutexBase1> {
@Override
default int ordinalSpaceLimit() {
default int ordinalSpaceBoundary() {
return PART_0001;
}
}
private interface PrimordialOrdinalBase2 extends PrimordialOrdinalMutexBase2, PrimordialOrdinalMutex<PrimordialOrdinalMutexBase2> {
@Override
default int ordinalSpaceLimit() {
default int ordinalSpaceBoundary() {
return PART_0002;
}
}
static private class BoneOrdinalBase1 extends BoneTerminatorBaseX<BoneOrdinalBase1> implements PrimordialOrdinalBase1 {
static private class BoneOrdinalBase1 extends BoneTerminatorBaseX<BoneOrdinalBase1> implements PrimordialOrdinalBase1, PrimordialOrdinalSpaceMaterializer<BoneOrdinalBase1> {
private BoneOrdinalBase1(int slices, int slice, Ladderᵂʳ<BoneOrdinalBase1> values) {
super(slices, slice, values);
}
@ -281,6 +282,10 @@ public enum TTꞱꞱᖟGateway implements BãßᛗᚢᛗᛗᛉVū́ǘrChaliceEnu
super(1, slice); // TODO: make anno optional and add slice count in an drum constructor
those((v, i) -> new BoneOrdinalBase1(slices, i, v));
}
@Override
public BoneOrdinalBase1 ordinalMaterializeSpace(int ordinal) {
return valueOf(ordinal);
}
static public BoneOrdinalBase1 valueOf(int ordinal) {
return new BoneOrdinalBase1(ordinal);
}