--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
D++ New Compiler design for 21st century and adaptive method to standard template library (STL), Triangular Mesh Graphics Library, ...etc using a parser and a linker.
Triangular Mesh Graphics Library replacing OpenGL, Vulkan, DirectX, XBox One-Two, PlayStation I-VI, PSP, 3DS, Nintendo Wii, Wii U, Switch, battle.net and Steam library steam deck.
Expandable storage containers I. Single linked list II. Doubly linked list III. Binary search tree IV. Vector of arrays. Extensible Hashing I. Linear probing II. Quadratic probing III. Separate chaining IV. Collision resolution. Hash function rewrite H(f)= function(x1) + function(x2) + function(y1) + function(y2), memory mutex-mutex locked mutual exclusion principle.
Correct buffer overflow caused by reference by pointers [int *i;] and reference by address [int *ptr = &i;]; System locked down, entering critical section, fix buffer overflow, exiting critical section, data structures and algorithms update, reinitializing operating system.
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Not available for sale to industry military police FBI CIA NSA NASA or public distribution GNU license or private college university institution Harvard, Oxford, Tokyo, Beijing...etc FeatherPortal.com use only. FeatherPortal.com@All rights reserved. [2023]
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
class AiSearch {
public static int binary_search(int array[], int first, int last, int search_key)
{
int index = 0;
int mid = 0;
if (first > last) {
index = -1;
} else {
mid = (first + last) / 2;
}
if (search_key == array[mid]) {
index = mid;
} else {
if (search_key < array[mid]) {
index = binary_search(array, first, mid-1, search_key);
} else {
index = binary_search(array, mid+1, last, search_key);
}
}
return index;
}// end binarySearch
public static void main(String args[]) {
int[] list = new int[11];
int search = 0;
for (int k=0; k<list.length; k++) {
list[k]=2*k+1;
System.out.println("list[ "+k+" ] = "+list[k]);
}
System.out.println("list[] size = "+list.length);
search = binary_search(list, 0, 10, 1);
System.out.println( "binary_search(list, 0, 10, 1) results: "+ search );
search = binary_search(list, 0, 10, 7);
System.out.println( "binary_search(list, 0, 10, 7) results: "+ search );
search = binary_search(list, 0, 10, 17);
System.out.println( "binary_search(list, 0, 10, 17)results: "+ search );
search = binary_search(list, 0, 10, 21);
System.out.println( "binary_search(list, 0, 10, 21) results: "+ search );
}//end of main
}//end AiSearch
list[ 0 ] = 1
list[ 1 ] = 3
list[ 2 ] = 5
list[ 3 ] = 7
list[ 4 ] = 9
list[ 5 ] = 11
list[ 6 ] = 13
list[ 7 ] = 15
list[ 8 ] = 17
list[ 9 ] = 19
list[ 10 ] = 21
list[] size = 11
binary_search(list, 0, 10, 1) results: 0
binary_search(list, 0, 10, 7) results: 3
binary_search(list, 0, 10, 17)results: 8
binary_search(list, 0, 10, 21) results: 10
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
//package com.featherportal.readfile;
//import java.sql.*;
import java.io.*;
import java.util.*;
public class ReadFile {
public static void main(String[] args) throws Exception {
BufferedReader reader;
FileWriter file = new FileWriter("upperName.txt");
BufferedWriter creator= new BufferedWriter(file);
try {
reader = new BufferedReader(new FileReader("filename.txt"));
String line = reader.readLine();
while (line != null) {
System.out.println(line);
creator.write(line.toUpperCase());
creator.newLine();
line = reader.readLine();
}
creator.close();
reader.close();
} catch (Exception e) {
e.getStackTrace();
}
}
}
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
D++ NEW COMPILER DESIGN FOR 21ST CENTURY AND ADAPTIVE METHOD TO STANDARD TEMPLATE LIBRARY (STL), TRIANGULAR MESH GRAPHICS LIBRARY, ...ETC USING A PARSER AND A LINKER.
TRIANGULAR MESH GRAPHICS LIBRARY REPLACING OPENGL, VULKAN, DIRECTX, XBOX ONE-TWO, PLAYSTATION I-VI, PSP, 3DS, NINTENDO WII, WII U, SWITCH, BATTLE.NET AND STEAM LIBRARY STEAM DECK.
EXPANDABLE STORAGE CONTAINERS I. SINGLE LINKED LIST II. DOUBLY LINKED LIST III. BINARY SEARCH TREE IV. VECTOR OF ARRAYS. EXTENSIBLE HASHING I. LINEAR PROBING II. QUADRATIC PROBING III. SEPARATE CHAINING IV. COLLISION RESOLUTION. HASH FUNCTION REWRITE H(F)= FUNCTION(X1) + FUNCTION(X2) + FUNCTION(Y1) + FUNCTION(Y2), MEMORY MUTEX-MUTEX LOCKED MUTUAL EXCLUSION PRINCIPLE.
CORRECT BUFFER OVERFLOW CAUSED BY REFERENCE BY POINTERS [INT *I;] AND REFERENCE BY ADDRESS [INT *PTR = &I;]; SYSTEM LOCKED DOWN, ENTERING CRITICAL SECTION, FIX BUFFER OVERFLOW, EXITING CRITICAL SECTION, DATA STRUCTURES AND ALGORITHMS UPDATE, REINITIALIZING OPERATING SYSTEM.
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------