This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
------------------ | |
System Information | |
------------------ | |
Time of this report: 6/6/2022, 19:01:18 | |
Machine name: TENSA-ZANGETSU | |
Machine Id: {9A3A0E71-1F04-44A6-933F-477295F6DA82} | |
Operating System: Windows 11 Pro 64-bit (10.0, Build 22000) (22000.co_release.210604-1628) | |
Language: English (Regional Setting: English) | |
System Manufacturer: Gigabyte Technology Co., Ltd. | |
System Model: Z370 AORUS Gaming 3 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private Type appendTypes(Type atype, Type btype) { | |
if (atype.is_bool || atype.is_int()) | |
return Type.EMPTY; | |
if (btype.is_bool || btype.is_int()) | |
return Type.EMPTY; | |
List<ProductType> rtypes = new LinkedList<>(); | |
AtomicInteger arities = new AtomicInteger(0); | |
Iterator<ProductType> atypesIt = atype.iterator(); | |
Iterator<ProductType> btypesIt = btype.iterator(); | |
atypesIt.forEachRemaining(at -> { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static IFinitization finStackAr(int size) { | |
return finStackAr(0, size, 0, size); | |
} | |
public static IFinitization finStackAr(int minSize, int maxSize, int valuesMin, int valuesMax) { | |
IFinitization f = FinitizationFactory.create(StackAr.class); | |
int stackMin = 0; | |
int stackMax = maxSize + 1; | |
IIntSet sizes = f.createIntSet(minSize, maxSize); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class List<T> { | |
private Node<T> header; | |
private int size; | |
public void insert(T e){ | |
if (size == 0) header = new Node<T>(e); | |
else { | |
Node current = header; | |
while (current.next != null) { | |
current = current.next |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class FindEvenNumbers { | |
public static int countEvens(int[] values) { | |
int count = 0; | |
for (int i = 0; i < values.length; i++) { | |
int value = values[i]; | |
if (value % 2 != 0) { | |
count = count + 1; | |
} | |
} |