commit 3fc3554899b453c193edc743f10e9a53db3242a5 Author: Rushil Umaretiya <2023rumareti@tjhsst.edu> Date: Fri Dec 4 22:00:49 2020 -0500 initial commit diff --git a/01 Strings/01 Modes/First Day Warm Up.doc b/01 Strings/01 Modes/First Day Warm Up.doc new file mode 100644 index 0000000..80f4841 Binary files /dev/null and b/01 Strings/01 Modes/First Day Warm Up.doc differ diff --git a/01 Strings/01 Modes/Modes.class b/01 Strings/01 Modes/Modes.class new file mode 100644 index 0000000..be1e71b Binary files /dev/null and b/01 Strings/01 Modes/Modes.class differ diff --git a/01 Strings/01 Modes/Modes.doc b/01 Strings/01 Modes/Modes.doc new file mode 100644 index 0000000..1b150d9 Binary files /dev/null and b/01 Strings/01 Modes/Modes.doc differ diff --git a/01 Strings/01 Modes/Modes.java b/01 Strings/01 Modes/Modes.java new file mode 100644 index 0000000..6992f9b --- /dev/null +++ b/01 Strings/01 Modes/Modes.java @@ -0,0 +1,90 @@ +// Name: Rushil Umaretiya +// Date: 08/26/19 + +public class Modes +{ + public static void main (String[] args) + { + int[] tally = {0,0,10,5,10,0,7,1,0,6,0,10,3,0,0,1}; + display(tally); + int[] modes = calculateModes(tally); + display(modes); + int sum = 0; + for(int k = 0; k < tally.length; k++) + sum += tally[k]; + System.out.println("kth \tindex"); + for(int k = 1; k <= sum; k++) + System.out.println(k + "\t\t" + kthDataValue(tally, k)); +} + + /** + * precondition: tally.length > 0 + * postcondition: returns an int array that contains the modes(s); + * the array's length equals the number of modes. + */ + public static int[] calculateModes(int[] tally) + { + int maxValue = findMax(tally); + int modeCount = 0; + for (int x = 0; x 0 + * 0 < k <= total number of values in data collection + * postcondition: returns the kth value in the data collection + * represented by tally + */ + public static int kthDataValue(int[] tally, int k) + { + int dataLength = 0; + for (int x = 0; x 0 + * postcondition: returns the maximal value in nums + */ + public static int findMax(int[] nums) + { + int pos = 0; + for(int k = 1; k < nums.length; k++) + if(nums[k] > nums[pos]) + pos = k; + return nums[pos]; + } + + public static void display(int[] args) + { + for(int k = 0; k < args.length; k++) + System.out.print(args[k] + " "); + System.out.println(); + System.out.println(); + } +} diff --git a/01 Strings/02 SmartCard/SmartCard.class b/01 Strings/02 SmartCard/SmartCard.class new file mode 100644 index 0000000..75dd120 Binary files /dev/null and b/01 Strings/02 SmartCard/SmartCard.class differ diff --git a/01 Strings/02 SmartCard/SmartCard.docx b/01 Strings/02 SmartCard/SmartCard.docx new file mode 100644 index 0000000..dd48eb6 Binary files /dev/null and b/01 Strings/02 SmartCard/SmartCard.docx differ diff --git a/01 Strings/02 SmartCard/SmartCard_Driver.class b/01 Strings/02 SmartCard/SmartCard_Driver.class new file mode 100644 index 0000000..769e7c6 Binary files /dev/null and b/01 Strings/02 SmartCard/SmartCard_Driver.class differ diff --git a/01 Strings/02 SmartCard/SmartCard_Driver.java b/01 Strings/02 SmartCard/SmartCard_Driver.java new file mode 100644 index 0000000..083512d --- /dev/null +++ b/01 Strings/02 SmartCard/SmartCard_Driver.java @@ -0,0 +1,197 @@ +// Name: B6-24 +// Date: 08/28/19 + +import java.text.DecimalFormat; +public class SmartCard_Driver +{ + public static void main(String[] args) + { + Station downtown = new Station("Downtown", 1); + Station center = new Station("Center City", 1); + Station uptown = new Station("Uptown", 2); + Station suburbia = new Station("Suburb", 4); + + SmartCard jimmy = new SmartCard(20.00); + jimmy.board(center); //Boarded at Center City. SmartCard has $20.00 + jimmy.disembark(suburbia); //From Center City to Suburb costs $2.75. SmartCard has $17.25 + jimmy.disembark(uptown); //Error: did not board?! + System.out.println(); + + SmartCard susie = new SmartCard(1.00); + susie.board(uptown); //Boarded at Uptown. SmartCard has $1.00 + susie.disembark(suburbia); //Insuffient funds to exit. Please add more money. + System.out.println(); + + SmartCard kim = new SmartCard(.25); + kim.board(uptown); //Insuffient funds to board. Please add more money. + System.out.println(); + + SmartCard b = new SmartCard(10.00); + b.board(center); //Boarded at Center City. SmartCard has $10.00 + b.disembark(downtown); //From Center City to Downtown costs $0.50. SmartCard has $9.50 + System.out.println(); + + SmartCard mc = new SmartCard(10.00); + mc.board(suburbia); //Boarded at Suburbia. SmartCard has $10.00 + mc.disembark(downtown); //From Suburbia to Downtown costs $2.75. SmartCard has $7.25 + System.out.println(); + + //Make more test cases. What else needs to be tested? + Station zone1Station = new Station("Zone 1", 1); + Station zone4Station = new Station("Zone 4", 4); + SmartCard johnDoe = new SmartCard(.49); + + System.out.printf("Current Balance is %s. Passenger Boarded: %s.%n", johnDoe.getBalance(), johnDoe.getIsOnBoard()); + johnDoe.board(zone1Station); + johnDoe.addMoney(.01); + johnDoe.board(zone1Station); + System.out.printf("Current Balance is %s. Passenger Boarded: %s.%n", johnDoe.getBalance(), johnDoe.getIsOnBoard()); + johnDoe.board(zone4Station); + System.out.printf("Current Station is %s.(Expected Zone 1)%n", johnDoe.getBoardedAt().getName()); + johnDoe.disembark(zone4Station); + System.out.printf("Current Balance is %s. Passenger Boarded: %s.%n", johnDoe.getBalance(), johnDoe.getIsOnBoard()); + johnDoe.addMoney(5.0); + johnDoe.disembark(zone4Station); + johnDoe.disembark(zone1Station); + } +} + +//Note SmartCard is not denoted as public. Why? +class SmartCard +{ + public final static DecimalFormat df = new DecimalFormat("$0.00"); + public final static double MIN_FARE = 0.5; + /* enter your code below */ + + private double balance; + private Station stationBoarded; + private boolean isBoarded; + + public SmartCard(double d) { + balance = d; + stationBoarded = null; + isBoarded = false; + } + + void addMoney(double d) { + balance += d; + } + + String getBalance() { + return df.format(balance); + } + + void board(Station s) { + if (isBoarded) { + System.out.println("Error: already boarded?!"); + return; + } + + if (balance < .5) { + System.out.println("Insufficient funds to board. Please add more money."); + return; + } + + stationBoarded = s; + isBoarded = true; + System.out.printf("Boarded at %s. SmartCard has %s.%n", s.getName(), df.format(balance)); + } + + double cost(Station s) { + return 0.50 + (0.75 * (Math.abs(s.getZone() - stationBoarded.getZone()))); + } + + void disembark(Station s) { + if (!isBoarded) { + System.out.println("Error: Did not board?!"); + return; + } + + double cost = cost(s); + if (cost > balance) { + System.out.println("Insufficient funds to exit. Please add more money."); + return; + } + + isBoarded = false; + balance -= cost; + System.out.printf("From %s to %s costs %s. SmartCard has %s%n", stationBoarded.getName(), s.getName(), df.format(cost), df.format(balance)); + stationBoarded = null; + } + + boolean isBoarded() { + return isBoarded; +` } + + //the next 3 methods are for use ONLY by Grade-It + //these accessor methods only return your private data + //they do not make any changes to your data + double getMoneyRemaining() + { + //enter your code here and replace the return with yours + return balance; + } + + Station getBoardedAt() + { + //enter your code here and replace the return with yours + return stationBoarded; + } + + boolean getIsOnBoard() + { + //enter your code here and replace the return with yours + return isBoarded; + } +} + +//Note Station is not a public class. Why? +class Station +{ + private int zone; + private String name; + + public Station(String n, int z) { + name = n; + zone = z; + } + + String getName() { + return name; + } + + int getZone() { + return zone; + } + + void setName(String n) { + name = n; + } + + void setZone(int z) { + zone = z; + } + + public String toString() { + return String.format("Name: %s Zone: %d", name, zone); + } +} + +/******************* Sample Run ************ + + Boarded at Center City. SmartCard has $20.00 + From Center City to Suburb costs $2.75. SmartCard has $17.25 + Error: did not board?! + + Boarded at Uptown. SmartCard has $1.00 + Insufficient funds to exit. Please add more money. + + Insufficient funds to board. Please add more money. + + Boarded at Center City. SmartCard has $10.00 + From Center City to Downtown costs $0.50. SmartCard has $9.50 + + Boarded at Suburb. SmartCard has $10.00 + From Suburb to Downtown costs $2.75. SmartCard has $7.25 + + ************************************************/ \ No newline at end of file diff --git a/01 Strings/02 SmartCard/Station.class b/01 Strings/02 SmartCard/Station.class new file mode 100644 index 0000000..673644f Binary files /dev/null and b/01 Strings/02 SmartCard/Station.class differ diff --git a/01 Strings/02a StringMethods/FrodoStringDemo.doc b/01 Strings/02a StringMethods/FrodoStringDemo.doc new file mode 100644 index 0000000..a89fc6e Binary files /dev/null and b/01 Strings/02a StringMethods/FrodoStringDemo.doc differ diff --git a/01 Strings/02a StringMethods/StringMethods.class b/01 Strings/02a StringMethods/StringMethods.class new file mode 100644 index 0000000..313cde6 Binary files /dev/null and b/01 Strings/02a StringMethods/StringMethods.class differ diff --git a/01 Strings/02a StringMethods/StringMethods.doc b/01 Strings/02a StringMethods/StringMethods.doc new file mode 100644 index 0000000..fe7d763 Binary files /dev/null and b/01 Strings/02a StringMethods/StringMethods.doc differ diff --git a/01 Strings/02a StringMethods/StringMethods.java b/01 Strings/02a StringMethods/StringMethods.java new file mode 100644 index 0000000..a8f771a --- /dev/null +++ b/01 Strings/02a StringMethods/StringMethods.java @@ -0,0 +1,152 @@ +//Name: +//Date: +public class StringMethods +{ + public static void main(String[] args) + { + String s = "Internet", s2 = "net", s3 = " Internet "; + + String s7 = s.substring(5); // + String s8 = s.substring(0, 5); // + String s9 = s.substring(2, 6); // + + int pos11 = s.indexOf('e'); // + int pos12 = s.indexOf('x'); // + int pos13 = s.indexOf('e', 4); // + int pos14 = s.lastIndexOf('e'); // + int pos15 = s.lastIndexOf('e', 4); // + int pos16 = s.lastIndexOf('e', 2); // + int pos17 = s.indexOf(s2); // + int pos18 = s.indexOf(s2, 6); // + int pos19 = s.lastIndexOf(s2); // + int pos20 = s.lastIndexOf(s2, 6); // + + boolean isSame22 = s.equals(s2); // + boolean isSame23 = s.equalsIgnoreCase("internet");// + int result24 = s.compareTo("internet");// + int result25 = s2.compareTo(s); // + int result26 = s.compareToIgnoreCase("internet");// + + String s28 = s.toUpperCase(); // + String s29 = s.replace('n', 'N'); // + String s30 = s3.trim(); // + // no String method changes the String object for which they are + // called. They build and return a new string instead. For example, + // s3.replace('a','A') by itself is useless, because s3 remains unchanged. + // The technical term is "immutable," as in "Strings are immutable." + + char ch = s.charAt(0); // + boolean isSame36 = (ch == 'I'); // + boolean isLetter37 = Character.isLetter(ch); // + boolean isCap38 = Character.isUpperCase(ch); // + char ch39 = Character.toLowerCase(ch); // + String s40 = ch39 + s.substring(1); // + // three ways to visit each character of a string + for(int i = 0; i < s.length(); i++) + System.out.print(s.substring(i, i+1)+" ");// + for(int i = 0; i < s.length(); i++) + System.out.print(s.charAt(i)+" "); // + char[] chArray = s.toCharArray(); + for(int i = 0; i < chArray.length; i++) + System.out.print(chArray[i]+" "); // + System.out.println(); + + // Strings can be split: String[] split(String separator) + // The method split() returns an array of substrings split around + // the specified separator, which is then removed + String[] abra = "ABRACADABRA".split("A"); + for(String str : abra) + System.out.print(str+" "); // + System.out.println(); + String[] abra2 = "ABRACADABRA".split("BR"); + for(String str : abra2) + System.out.print(str+" "); // + System.out.println(); + String[] abra3 = "A B R A C A D A B R A".split(" "); + for(String str : abra3) + System.out.println(str+" "); // + // + + /* String Methods #1 + 1. The string dateStr represents a date in the format "mm/dd/yyyy". + Write a code fragment that changes dateStr to the format "dd-mm-yy". + For example, "09/16/2008" becomes "16-09-08". + */ + String dateStr = "10/11/2005"; + String[] times = dateStr.split("/"); + dateStr = times[1] + "-" + times[0] + "-" + times[2].substring(2); + System.out.println(dateStr); + + /* String Methods #2 + 2. Given a line of text, print each word on its own line, but don't + print the blank lines. + */ + System.out.println(); + String text = "How are you doing?"; + String[] words = text.split(" "); + for (int i = 0; i < words.length; i++) + if (words[i].equals(" ")) + System.out.println(words[i]); + + /* String Methods #3 + 3. Given a line of text, remove all punctuation from that line. + One way is to replace each punctuation mark with "". + */ + String str = "RT @TJCheer2015: Freshman & Sophomores: Interested in cheer at TJ? Email: thomasjeffersoncheer@gmail.com"; + String punct = ",./;:'\"?<>[]{}|`~!@#$%^&*()"; + for (int i = 0; i < punct.length(); i++) { + str = str.replace(""+punct.charAt(i), ""); + } + + System.out.println(str); + /* String Methods #4 + 4. Given a line of text, remove all punctuation from that line. + One way is to keep all characters that are letters or a space. + */ + String str2 = "a @galaxy far, far away --right there! on the (TJ planetarium} ceiling. https://t.co/XfoqbyA9JY"; + String letters = " ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; + String cleaned = ""; + for (int i = 0; i < str2.length(); i++) + for (int j = 0; j < letters.length(); j++) + if (str2.charAt(i) == letters.charAt(j)) + cleaned += Character.toString(str2.charAt(i)); + + System.out.println(cleaned); + + } +} + + /****************************** +I n t e r n e t I n t e r n e t I n t e r n e t + BR C D BR + A ACADA A + A + B + R + A + C + A + D + A + B + R + A + 16-09-08 + Fall + Sports + (football, + golf, + cheerleading, + volleyball, + field + hockey, + cross + country) + start + in + 1 + week. + RT TJCheer2015 Freshman Sophomores Interested in cheer at TJ Email thomasjeffersoncheergmailcom + a galaxy far far away right there on the TJ planetarium ceiling httpstcoXfoqbyAJY + + ********************************/ \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/LittleFrog.txt b/01 Strings/03-04 PigLatin/LittleFrog.txt new file mode 100644 index 0000000..639d921 --- /dev/null +++ b/01 Strings/03-04 PigLatin/LittleFrog.txt @@ -0,0 +1,11 @@ +I have a little frog, +His name is Tiny Tim. +I put him in the bathtub, +to see if he could swim. + +He drank up all the water, +and gobbled up the soap! +And when he tried to talk +He had a BUBBLE in his throat! + +Hey little froggy tell me what do you say!? \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/LittleFrogBetter.txt b/01 Strings/03-04 PigLatin/LittleFrogBetter.txt new file mode 100644 index 0000000..b659507 --- /dev/null +++ b/01 Strings/03-04 PigLatin/LittleFrogBetter.txt @@ -0,0 +1,12 @@ + +Iway avehay away ittlelay ogfray, +Ishay amenay isway Inytay Imtay. +Iway utpay imhay inway ethay athtubbay, +otay eesay ifway ehay ouldcay imsway. + +Ehay ankdray upway allway ethay aterway, +andway obbledgay upway ethay oapsay! +Andway enwhay ehay iedtray otay alktay +Ehay adhay away UBBLEbay inway ishay oatthray! + +Eyhay ittlelay oggyfray elltay emay atwhay oday ouyay aysay!? \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/LittleFrogEvenBetter.txt b/01 Strings/03-04 PigLatin/LittleFrogEvenBetter.txt new file mode 100644 index 0000000..868da72 --- /dev/null +++ b/01 Strings/03-04 PigLatin/LittleFrogEvenBetter.txt @@ -0,0 +1,11 @@ +Iway avehay away ittlelay ogfray, +Ishay amenay isway Inytay Imtay. +Iway utpay imhay inway ethay athtubbay, +otay eesay ifway ehay ouldcay imsway. + +Ehay ankdray upway allway ethay aterway, +andway obbledgay upway ethay oapsay! +Andway enwhay ehay iedtray otay alktay +Ehay adhay away UBBLEbay inway ishay oatthray! + +Eyhay ittlelay oggyfray elltay emay atwhay oday ouyay aysay! \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/LittleFrogOut.txt b/01 Strings/03-04 PigLatin/LittleFrogOut.txt new file mode 100644 index 0000000..6b67ec9 --- /dev/null +++ b/01 Strings/03-04 PigLatin/LittleFrogOut.txt @@ -0,0 +1,11 @@ +Iway avehay away ittlelay ogfray, +Ishay amenay isway Inytay Imtay. +Iway utpay imhay inway ethay athtubbay, +otay eesay ifway ehay ouldcay imsway. + +Ehay ankdray upway allway ethay aterway, +andway obbledgay upway ethay oapsay! +Andway enwhay ehay iedtray otay alktay +Ehay adhay away UBBLEbay inway ishay oatthray! + +Eyhay ittlelay oggyfray elltay emay atwhay oday ouyay aysay!? diff --git a/01 Strings/03-04 PigLatin/PigLatin.class b/01 Strings/03-04 PigLatin/PigLatin.class new file mode 100644 index 0000000..1eaceeb Binary files /dev/null and b/01 Strings/03-04 PigLatin/PigLatin.class differ diff --git a/01 Strings/03-04 PigLatin/PigLatin.docx b/01 Strings/03-04 PigLatin/PigLatin.docx new file mode 100644 index 0000000..ab7206b Binary files /dev/null and b/01 Strings/03-04 PigLatin/PigLatin.docx differ diff --git a/01 Strings/03-04 PigLatin/PigLatin.java b/01 Strings/03-04 PigLatin/PigLatin.java new file mode 100644 index 0000000..89c87b5 --- /dev/null +++ b/01 Strings/03-04 PigLatin/PigLatin.java @@ -0,0 +1,281 @@ +// Name: B6-24 +// Date: 9/7/19 +import java.util.*; +import java.io.*; +public class PigLatin +{ + public static void main(String[] args) + { + //part_1_using_pig(); + part_2_using_piglatenizeFile(); + + /* extension only */ + //String str = "Atwhay!?"; + //System.out.print(str + "\t\t" + pigReverse(str)); + //str = "{(Ellohay!)}"; + //System.out.print("\n" + str + "\t\t" + pigReverse(str)); + //str = "\"OnaldmcDay???\""; + //System.out.println("\n" + str + " " + pigReverse(str)); + } + + public static void part_1_using_pig() + { + Scanner sc = new Scanner(System.in); + while(true) + { + System.out.print("\nWhat word? "); + String s = sc.next(); + if(s.equals("-1")) + { + System.out.println("Goodbye!"); + System.exit(0); + } + String p = pig(s); + System.out.println( p ); + } + } + + public static final String punct = ",./;:'\"?<>[]{}|`~!@#$%^&*()"; + public static final String letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; + public static final String vowels = "AEIOUaeiou"; + public static String pig(String s) + { + if(s.length() == 0) + return ""; + + //remove and store the beginning punctuation + String beginPunct, endPunct; + int index = 0; + for(int i = 0; i < s.length( ); i++){ + if(Character.isLetter(s.charAt(i))) { + break; + } else if(punct.contains("" + s.charAt(i))) { + index++; + } else { + break; + } + } + + beginPunct = s.substring(0, index); + s = s.substring(index); + + //remove and store the ending punctuation + index = s.length(); + + for(int i = s.length() - 1; i < s.length(); i--){ + if(Character.isLetter(s.charAt(i))) { + break; + } else if(punct.contains("" + s.charAt(i))) { + index--; + } else { + break; + } + } + + endPunct = s.substring(index); + s = s.substring(0,index); + + //START HERE with the basic case: + //find the index of the first vowel + // y is a vowel if it is not the first letter + // qu is a consonant + String newWord = ""; + + for (int i = 0; i < s.length(); i++) { + String currentChar = "" + s.charAt(i); + if (vowels.contains(currentChar) || currentChar.toLowerCase().equals("y")) { + //checks if first character is vowel + if (i == 0) { + if (!currentChar.toLowerCase().equals("y")) { + newWord = s + "way"; + break; + } + } else if (vowels.contains(currentChar) || currentChar.toLowerCase().equals("y")) { + if (currentChar.toLowerCase().equals("u")) { + if (Character.toLowerCase(s.charAt(i-1)) == 'q') { + if (Character.isUpperCase(s.charAt(0))) { + newWord = s.substring(i+1) + Character.toLowerCase((s.substring(0, i+1)).charAt(0)) + s.substring(1, i+1) + "ay"; + newWord = Character.toUpperCase(newWord.charAt(0)) + newWord.substring(1); + break; + } else { + newWord = s.substring(i+1) + s.substring(0, i+1) + "ay"; + break; + } + } else { + if (Character.isUpperCase(s.charAt(0))) { + + newWord = s.substring(i) + Character.toLowerCase((s.substring(0, i)).charAt(0)) + s.substring(1, i) + "ay"; + newWord = Character.toUpperCase(newWord.charAt(0)) + newWord.substring(1); + break; + } else { + newWord = s.substring(i) + s.substring(0, i) + "ay"; + break; + } + } + + } else { + if (Character.isUpperCase(s.charAt(0))) { + + newWord = s.substring(i) + Character.toLowerCase((s.substring(0, i)).charAt(0)) + s.substring(1, i) + "ay"; + newWord = Character.toUpperCase(newWord.charAt(0)) + newWord.substring(1); + break; + } else { + newWord = s.substring(i) + s.substring(0, i) + "ay"; + break; + } + } + } + } + } + + if (newWord.equals("")) + newWord = "**** NO VOWEL ****"; + + newWord = beginPunct + newWord + endPunct; + + return newWord; + + //if no vowel has been found + + + //is the first letter capitalized? + + + //return the piglatinized word + + + } + + + public static void part_2_using_piglatenizeFile() + { + Scanner sc = new Scanner(System.in); + System.out.print("input filename including .txt: "); + String fileNameIn = sc.next(); + System.out.print("output filename including .txt: "); + String fileNameOut = sc.next(); + piglatenizeFile( fileNameIn, fileNameOut ); + System.out.println("Piglatin done!"); + } + +/****************************** +* piglatinizes each word in each line of the input file +* precondition: both fileNames include .txt +* postcondition: output a piglatinized .txt file +******************************/ + public static void piglatenizeFile(String fileNameIn, String fileNameOut) + { + Scanner infile = null; + try + { + infile = new Scanner(new File(fileNameIn)); + } + catch(IOException e) + { + System.out.println("oops"); + System.exit(0); + } + + PrintWriter outfile = null; + try + { + outfile = new PrintWriter(new FileWriter(fileNameOut)); + } + catch(IOException e) + { + System.out.println("File not created"); + System.exit(0); + } + //process each word in each line + String newFile = ""; + while(infile.hasNextLine()) { + String[] words = infile.nextLine().split(" "); + for (int i = 0; i < words.length; i++) + words[i] = (pig(words[i])); + + newFile += String.join(" ", words) + "\n"; + } + + outfile.print(newFile.substring(0, newFile.length() - 2)); + + outfile.close(); + infile.close(); + } + + /** EXTENSION: Output each PigLatin word in reverse, preserving before-and-after + punctuation. + */ + public static String pigReverse(String s) + { + //s = pig(s); + + if(s.length() == 0) + return ""; + + //remove and store the beginning punctuation + String beginPunct, endPunct; + int index = 0; + for(int i = 0; i < s.length( ); i++){ + if(Character.isLetter(s.charAt(i))) { + break; + } else if(punct.contains("" + s.charAt(i))) { + index++; + } else { + break; + } + } + + beginPunct = s.substring(0, index); + s = s.substring(index); + + //remove and store the ending punctuation + index = s.length(); + + for(int i = s.length() - 1; i < s.length(); i--){ + if(Character.isLetter(s.charAt(i))) { + break; + } else if(punct.contains("" + s.charAt(i))) { + index--; + } else { + break; + } + } + + endPunct = s.substring(index); + s = s.substring(0,index); + + //store capitalization order + boolean[] caps = new boolean[s.length()]; + for (int i = 0; i < s.length(); i++) { + if (Character.isUpperCase(s.charAt(i))) + caps[i] = true; + else + caps[i] = false; + } + + //reverse String + String reversed = ""; + for (int i = s.length() - 1; i >= 0; i--) { + reversed += s.charAt(i); + } + + //fix capitalization + + char[] reversedArray = reversed.toCharArray(); + + for (int i = 0; i < reversedArray.length; i++) { + + if (caps[i]) + reversedArray[i] = Character.toUpperCase(reversedArray[i]); + else + reversedArray[i] = Character.toLowerCase(reversedArray[i]); + + } + reversed = beginPunct + new String(reversedArray) + endPunct; + + //return reversed string + return reversed; + } + + +} \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/PigLatin.txt b/01 Strings/03-04 PigLatin/PigLatin.txt new file mode 100644 index 0000000..33e7194 --- /dev/null +++ b/01 Strings/03-04 PigLatin/PigLatin.txt @@ -0,0 +1,25 @@ +pig +latin + +this +strange +apple +a +upper +sfghjkl +question +squeeze +yellow +rhyme +eye +Thomas +Question +McDonald +I +BUBBLES +what? +Oh!!! +"hello" +([Hello]) +don't +pell-mell \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/PigLatinOUt.txt b/01 Strings/03-04 PigLatin/PigLatinOUt.txt new file mode 100644 index 0000000..0a6bb43 --- /dev/null +++ b/01 Strings/03-04 PigLatin/PigLatinOUt.txt @@ -0,0 +1,26 @@ + +igpay +atinlay + +isthay +angestray +appleway +away +upperway +**** NO VOWEL **** +estionquay +eezesquay +ellowyay +ymerhay +eyeway +Omasthay +Estionquay +OnaldmcDay +Iway +UBBLESbay +atwhay? +Ohway!!! +"ellohay" +([Ellohay]) +on'tday +ell-mellpay \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/Scanner and PrintWriter Classes.docx b/01 Strings/03-04 PigLatin/Scanner and PrintWriter Classes.docx new file mode 100644 index 0000000..7b8bc46 Binary files /dev/null and b/01 Strings/03-04 PigLatin/Scanner and PrintWriter Classes.docx differ diff --git a/01 Strings/03-04 PigLatin/ScannerPractice.class b/01 Strings/03-04 PigLatin/ScannerPractice.class new file mode 100644 index 0000000..0e48e08 Binary files /dev/null and b/01 Strings/03-04 PigLatin/ScannerPractice.class differ diff --git a/01 Strings/03-04 PigLatin/ScannerPractice.java b/01 Strings/03-04 PigLatin/ScannerPractice.java new file mode 100644 index 0000000..418633f --- /dev/null +++ b/01 Strings/03-04 PigLatin/ScannerPractice.java @@ -0,0 +1,21 @@ +import java.util.*; +import java.io.*; + +public class ScannerPractice { + public static void main(String[] args) throws Exception{ + Scanner sc = new Scanner(System.in); + System.out.println("What is ur filename?"); + String filename = sc.next(); + Scanner infile = new Scanner(new File(filename)); + String fileout = "results.txt"; + PrintWriter outfile = new PrintWriter(new FileWriter(fileout)); + while(infile.hasNext()) { + String s = infile.nextLine(); + outfile.print(s + ", "); + } + + outfile.close(); + infile.close(); + } + +} \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/declaration.txt b/01 Strings/03-04 PigLatin/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/01 Strings/03-04 PigLatin/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/01 Strings/03-04 PigLatin/out.txt b/01 Strings/03-04 PigLatin/out.txt new file mode 100644 index 0000000..e69de29 diff --git a/01 Strings/03-04 PigLatin/outt.txt b/01 Strings/03-04 PigLatin/outt.txt new file mode 100644 index 0000000..e69de29 diff --git a/01 Strings/03-04 PigLatin/results.txt b/01 Strings/03-04 PigLatin/results.txt new file mode 100644 index 0000000..6759760 --- /dev/null +++ b/01 Strings/03-04 PigLatin/results.txt @@ -0,0 +1 @@ +I have a little frog,, His name is Tiny Tim. , I put him in the bathtub,, to see if he could swim., , He drank up all the water, , and gobbled up the soap!, And when he tried to talk, He had a BUBBLE in his throat! , , Hey little froggy tell me what do you say!?, \ No newline at end of file diff --git a/01 Strings/03-04 PigLatin/testing.txt b/01 Strings/03-04 PigLatin/testing.txt new file mode 100644 index 0000000..174dc79 --- /dev/null +++ b/01 Strings/03-04 PigLatin/testing.txt @@ -0,0 +1,5 @@ +It's a text file + +We have to turn it into pig latin + +But I like BUBBLES! \ No newline at end of file diff --git a/01 Strings/05 Sentence/Sentence.class b/01 Strings/05 Sentence/Sentence.class new file mode 100644 index 0000000..b0bde33 Binary files /dev/null and b/01 Strings/05 Sentence/Sentence.class differ diff --git a/01 Strings/05 Sentence/Sentence.doc b/01 Strings/05 Sentence/Sentence.doc new file mode 100644 index 0000000..8a19656 Binary files /dev/null and b/01 Strings/05 Sentence/Sentence.doc differ diff --git a/01 Strings/05 Sentence/Sentence_Driver.class b/01 Strings/05 Sentence/Sentence_Driver.class new file mode 100644 index 0000000..5a74ade Binary files /dev/null and b/01 Strings/05 Sentence/Sentence_Driver.class differ diff --git a/01 Strings/05 Sentence/Sentence_Driver.java b/01 Strings/05 Sentence/Sentence_Driver.java new file mode 100644 index 0000000..a79d60d --- /dev/null +++ b/01 Strings/05 Sentence/Sentence_Driver.java @@ -0,0 +1,178 @@ +// Name: B6-24 +// Date: 09/13/19 + +import java.util.Scanner; + +public class Sentence_Driver +{ + public static void main(String[] args) + { + System.out.println("PALINDROME TESTER"); + Sentence s = new Sentence( "\"Hello there!\" she said." ); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + s = new Sentence( "A Santa lived as a devil at NASA." ); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + + s = new Sentence( "Flo, gin is a sin! I golf." ); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + + s = new Sentence( "Eva, can I stab bats in a cave?" ); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + s = new Sentence( "Madam, I'm Adam." ); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + // Lots more test cases. Test every line of code. Test + // the extremes, test the boundaries. How many test cases do you need? + s = new Sentence("REd ru????M, SiR, i..................s !m!u!r!d!e!r!"); + System.out.println( s.getSentence() ); + System.out.println( s.getNumWords() ); + System.out.println( s.isPalindrome() ); + System.out.println(); + + + // Scanner sc = new Scanner(System.in); +// while(true) { +// System.out.print("\nWhat sentence? "); +// s = new Sentence(sc.nextLine()); +// System.out.println( s.getSentence() ); +// System.out.println( s.getNumWords() ); +// System.out.println( s.isPalindrome() ); +// System.out.println(); +// +// +// } + + } +} + +class Sentence +{ + private String mySentence; + private int myNumWords; + + //Precondition: str is not empty. + // Words in str separated by exactly one blank. + public Sentence( String str ) + { + mySentence = str; + String[] words = str.split(" "); + myNumWords = words.length; + } + + public int getNumWords() + { + return myNumWords; + } + + public String getSentence() + { + return mySentence; + } + + //Returns true if mySentence is a palindrome, false otherwise. + public boolean isPalindrome() + { + String s = removeBlanks(lowerCase(removePunctuation(mySentence))); + return isPalindrome(s, 0, s.length() - 1); + } + //Precondition: s has no blanks, no punctuation, and is in lower case. + //Returns true if s is a palindrome, false otherwise. + public static boolean isPalindrome( String s, int start, int end ) + { + if (start >= end) { + return true; + } else if (s.charAt(start) == s.charAt(end)) { + start++; end--; + return isPalindrome(s, start, end); + + } else { + return false; + } + } + //Returns copy of String s with all blanks removed. + //Postcondition: Returned string contains just one word. + public static String removeBlanks( String s ) + { + return s.replace(" ", ""); + } + + //Returns copy of String s with all letters in lowercase. + //Postcondition: Number of words in returned string equals + // number of words in s. + public static String lowerCase( String s ) + { + return s.toLowerCase(); + } + + //Returns copy of String s with all punctuation removed. + //Postcondition: Number of words in returned string equals + // number of words in s. + public static String removePunctuation( String s ) + { + String punct = ".,'?!:;\"(){}[]<>-"; + String noPunct = ""; + + String[] words = s.split(" "); + for (int i = 0; i < words.length; i++) { + char[] letters = words[i].toCharArray(); + String newWord = ""; + for (int j = 0; j < letters.length; j++) { + if (!punct.contains("" + letters[j])){ + newWord += letters[j]; + } + } + noPunct += newWord; + if (i != (words.length - 1)) + noPunct += " "; + } + + return noPunct; + } + + +} + + /***************************************** + + PALINDROME TESTER + "Hello there!" she said. + 4 + false + + A Santa lived as a devil at NASA. + 8 + true + + Flo, gin is a sin! I golf. + 7 + true + + Eva, can I stab bats in a cave? + 8 + true + + Madam, I'm Adam. + 3 + true + + **********************************************/ + diff --git a/01 Strings/06 LogMessage/Log Message.doc b/01 Strings/06 LogMessage/Log Message.doc new file mode 100644 index 0000000..ab6ee5f Binary files /dev/null and b/01 Strings/06 LogMessage/Log Message.doc differ diff --git a/01 Strings/06 LogMessage/LogMessage.class b/01 Strings/06 LogMessage/LogMessage.class new file mode 100644 index 0000000..b3e6d14 Binary files /dev/null and b/01 Strings/06 LogMessage/LogMessage.class differ diff --git a/01 Strings/06 LogMessage/LogMessageTest.class b/01 Strings/06 LogMessage/LogMessageTest.class new file mode 100644 index 0000000..7884a65 Binary files /dev/null and b/01 Strings/06 LogMessage/LogMessageTest.class differ diff --git a/01 Strings/06 LogMessage/LogMessageTest.java b/01 Strings/06 LogMessage/LogMessageTest.java new file mode 100644 index 0000000..134a5f7 --- /dev/null +++ b/01 Strings/06 LogMessage/LogMessageTest.java @@ -0,0 +1,184 @@ +// Name: B6-24 +// Date: 09/16/19 +import java.util.*; + +public class LogMessageTest +{ + public static void main(String[] args) + { + String[] messages = { + "CLIENT3:security alert - repeated login failures", + "Webserver:disk offline", + "SERVER1:file not found", + "SERVER2:read error on disk DSK1", + "SERVER1:write error on disk DSK2", + "Webserver:error on /dev/disk", + "True:disk", + "True:error on disk", + "True:error on /dev/disk disk", + "True:error on disk DSK1", + "False:DISK", + "False:error on disk3", + "False:error on /dev/disk", + "False:diskette"}; + + // Parts A and B + for (String s : messages) + { + LogMessage msg = new LogMessage(s); + System.out.println(msg.getMachineId() + ":" + msg.getDescription() + " ==> " + msg.containsWord("disk")); + } + + // Part C +// SystemLog theLog = new SystemLog(messages); +// LogMessage[] removed = theLog.removeMessages("disk"); +// +// System.out.println(); +// +// System.out.println("Removed messages:\n"); +// for (LogMessage msg : removed) +// System.out.println(msg); +// System.out.println(); +// +// System.out.println("Remaining messages:\n"); +// System.out.println(theLog); + + } +} + +class LogMessage +{ + private String machineId; + private String description; + + /* Part (a) */ + public LogMessage(String message) + { + String[] messageParts = message.split(":"); + machineId = messageParts[0]; + description = messageParts[1]; + } + + /* Part (b) */ + public boolean containsWord(String keyword) + { + String[] words = description.split(" "); + for (String word : words) + if (word.equals(keyword)) + return true; + + return false; + } + + public String getMachineId() + { + return machineId; + } + + public String getDescription() + { + return description; + } + + public String toString() + { + return getMachineId() + ":" + getDescription(); + } +} + +class SystemLog +{ + private LogMessage[] messageList; + + public SystemLog(String[] messages) + { + messageList = new LogMessage[messages.length]; + for (int i=0;i false + Webserver:disk offline ==> true + SERVER1:file not found ==> false + SERVER2:read error on disk DSK1 ==> true + SERVER1:write error on disk DSK2 ==> true + Webserver:error on /dev/disk ==> false + True:disk ==> true + True:error on disk ==> true + True:error on /dev/disk disk ==> true + True:error on disk DSK1 ==> true + False:DISK ==> false + False:error on disk3 ==> false + False:error on /dev/disk ==> false + False:diskette ==> false + + + // Part c + + Removed messages: + + Webserver:disk offline + SERVER2:read error on disk DSK1 + SERVER1:write error on disk DSK2 + True:disk + True:error on disk + True:error on /dev/disk disk + True:error on disk DSK1 + + Remaining messages: + + CLIENT3:security alert - repeated login failures + SERVER1:file not found + Webserver:error on /dev/disk + False:DISK + False:error on disk3 + False:error on /dev/disk + False:diskette + + ********************************************/ \ No newline at end of file diff --git a/01 Strings/06 LogMessage/SystemLog.class b/01 Strings/06 LogMessage/SystemLog.class new file mode 100644 index 0000000..02598a9 Binary files /dev/null and b/01 Strings/06 LogMessage/SystemLog.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$1.class b/01 Strings/07 Cemetery/Cemetery$1.class new file mode 100644 index 0000000..7735925 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$1.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$searchGUI$1.class b/01 Strings/07 Cemetery/Cemetery$searchGUI$1.class new file mode 100644 index 0000000..dc332f1 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$searchGUI$1.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$searchGUI$2.class b/01 Strings/07 Cemetery/Cemetery$searchGUI$2.class new file mode 100644 index 0000000..005ea7a Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$searchGUI$2.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$searchGUI$3.class b/01 Strings/07 Cemetery/Cemetery$searchGUI$3.class new file mode 100644 index 0000000..6fa3bd2 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$searchGUI$3.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$searchGUI$4.class b/01 Strings/07 Cemetery/Cemetery$searchGUI$4.class new file mode 100644 index 0000000..7e5196c Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$searchGUI$4.class differ diff --git a/01 Strings/07 Cemetery/Cemetery$searchGUI.class b/01 Strings/07 Cemetery/Cemetery$searchGUI.class new file mode 100644 index 0000000..1539210 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery$searchGUI.class differ diff --git a/01 Strings/07 Cemetery/Cemetery.class b/01 Strings/07 Cemetery/Cemetery.class new file mode 100644 index 0000000..6daecc2 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery.class differ diff --git a/01 Strings/07 Cemetery/Cemetery.docx b/01 Strings/07 Cemetery/Cemetery.docx new file mode 100644 index 0000000..1e4d2d5 Binary files /dev/null and b/01 Strings/07 Cemetery/Cemetery.docx differ diff --git a/01 Strings/07 Cemetery/Cemetery.java b/01 Strings/07 Cemetery/Cemetery.java new file mode 100644 index 0000000..d077538 --- /dev/null +++ b/01 Strings/07 Cemetery/Cemetery.java @@ -0,0 +1,534 @@ + // Name: B6-24 +// Date: 09/18/19 +import java.util.Scanner; +import java.io.File; +import java.text.DecimalFormat; +//here any additional imports that you may need +import java.io.FileNotFoundException; + +import java.awt.*; +import java.awt.event.*; +import javax.swing.*; + +public class Cemetery +{ + public static void main (String [] args) + { + File file = new File("cemetery_short.txt"); + int numEntries = countEntries(file); + Person[] cemetery = readIntoArray(file, numEntries); + int min = locateMinAgePerson(cemetery); + int max = locateMaxAgePerson(cemetery); + //for testing only + for (int i = 0; i < cemetery.length; i++) + System.out.println(cemetery[i]); + System.out.println("In the St. Mary Magdelene Old Fish Cemetery --> "); + System.out.println("Name of youngest person: " + cemetery[min].getName()); + System.out.println("Age of youngest person: " + cemetery[min].getAge()); + System.out.println("Name of oldest person: " + cemetery[max].getName()); + System.out.println("Age of oldest person: " + cemetery[max].getAge()); + //you may create other testing cases here + //comment them out when you submt your file to gradeit + + + /* Extension: + + For the extension, I made two ways to search the data, for I've got + much too much time on the bus ride home. Both methods only require + a Person array as arguments. + + runSearch() allows the user to search via a text-based interface by + age, burial date, and name + + searchGUI() starts a GUI(not the prettiest thing) made with swing to + be able to search by age, burial date, and name + + */ + //Run TUI + runSearch(cemetery); + + //Run GUI + //new searchGUI(cemetery); + + } + + + // + public static class searchGUI extends JFrame { + + public searchGUI (Person[] arr) { + + JPanel panel = new JPanel(); + panel.setLayout(new BorderLayout()); + + JLabel title = new JLabel("Cemetery Search System"); + title.setHorizontalAlignment(JLabel.CENTER); + title.setVerticalAlignment(JLabel.CENTER); + title.setFont(title.getFont().deriveFont(18.0f)); + + panel.add(title , BorderLayout.NORTH); + + + GridLayout gridLayout = new GridLayout(3,3); + JPanel gridPanel = new JPanel(); + gridPanel.setLayout(gridLayout); + + JLabel searchAgeLabel, searchNameLabel, searchBurialDateLabel; + searchAgeLabel = new JLabel("Search by age:"); + searchNameLabel = new JLabel("Search by name:"); + searchBurialDateLabel = new JLabel("Search by burial date:"); + + searchAgeLabel.setFont(searchAgeLabel.getFont().deriveFont(15f)); + searchBurialDateLabel.setFont(searchBurialDateLabel.getFont().deriveFont(15.0f)); + searchNameLabel.setFont(searchNameLabel.getFont().deriveFont(15.0f)); + + searchAgeLabel.setHorizontalAlignment(JLabel.CENTER); + searchNameLabel.setHorizontalAlignment(JLabel.CENTER); + searchBurialDateLabel.setHorizontalAlignment(JLabel.CENTER); + + JButton searchAgeButton, searchNameButton, searchBurialDateButton; + searchAgeButton = new JButton("SEARCH"); + searchNameButton = new JButton("SEARCH"); + searchBurialDateButton = new JButton("SEARCH"); + + JTextField searchAgeField, searchNameField, searchBurialDateField; + searchAgeField = new JTextField(8); + searchNameField = new JTextField(10); + searchBurialDateField = new JTextField(11); + + JPanel[] gridPanels = new JPanel[9]; + for (int i = 0; i < gridPanels.length; i++) + gridPanels[i] = new JPanel(); + + gridPanels[0].add(searchAgeLabel); + gridPanels[1].add(searchNameLabel); + gridPanels[2].add(searchBurialDateLabel); + gridPanels[3].add(searchAgeField); + gridPanels[4].add(searchNameField); + gridPanels[5].add(searchBurialDateField); + gridPanels[6].add(searchAgeButton); + gridPanels[7].add(searchNameButton); + gridPanels[8].add(searchBurialDateButton); + + for (int i = 0; i < gridPanels.length; i++) + gridPanel.add(gridPanels[i]); + + JTextArea results = new JTextArea(7, 45); + JButton clearButton = new JButton("Clear"); + JPanel bottomPanel = new JPanel(); + bottomPanel.setPreferredSize(new Dimension(500, 150)); + bottomPanel.add(results); + bottomPanel.add(clearButton); + panel.add(bottomPanel, BorderLayout.SOUTH); + + panel.add(gridPanel, BorderLayout.CENTER); + + add(panel); + + searchAgeButton.addActionListener( + new ActionListener(){ + @Override + public void actionPerformed(ActionEvent e) { + results.setText(searchAge(arr, searchAgeField.getText())); + searchAgeField.setText(""); + } + }); + + searchNameButton.addActionListener( + new ActionListener(){ + @Override + public void actionPerformed(ActionEvent e) { + + results.setText(searchName(arr, searchNameField.getText())); + searchNameField.setText(""); + } + }); + + searchBurialDateButton.addActionListener( + new ActionListener(){ + @Override + public void actionPerformed(ActionEvent e) { + results.setText(searchBurialDate(arr, searchBurialDateField.getText())); + searchBurialDateField.setText(""); + + } + }); + + clearButton.addActionListener( + new ActionListener() { + @Override + public void actionPerformed(ActionEvent e) { + results.setText(""); + searchAgeField.setText(""); + searchNameField.setText(""); + searchBurialDateField.setText(""); + } + }); + + setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); + + setSize(500, 300); + + setVisible(true); + } + + + public static String searchName(Person[] arr, String searchTerm) { + + searchTerm = searchTerm.toLowerCase().trim(); + + + String queryResults = ""; + + boolean nameFound = false; + for (int i = 0; i < arr.length; i++) { + String currentName = arr[i].getName().toLowerCase().trim(); + if (currentName.equals(searchTerm)) { + queryResults += arr[i].toString() + "\n"; + nameFound = true; + } + } + + if (!nameFound) + queryResults = "NO PEOPLE FOUND"; + + return queryResults; + } + + public String searchBurialDate(Person[] arr, String searchTerm) { + searchTerm = searchTerm.toLowerCase().trim(); + String queryResults = ""; + boolean dateFound = false; + for (int i = 0; i < arr.length; i++) { + String currentDate = arr[i].getBurialDate().toLowerCase().trim(); + if (currentDate.equals(searchTerm)) { + queryResults += arr[i].toString() + "\n"; + dateFound = true; + } + } + + if (!dateFound) + queryResults = "NO PEOPLE FOUND"; + return queryResults; + } + + public String searchAge(Person[] arr, String searchTerm) { + + String queryResults = ""; + + Person holder = new Person("", "", 0.0); + double searchValue = holder.calculateAge(searchTerm); + boolean ageFound = false; + for (int i = 0; i < arr.length; i++) { + double currentAge = arr[i].getAge(); + if (currentAge == searchValue) { + queryResults += arr[i].toString() + "\n"; + ageFound = true; + } + } + + if (!ageFound) + queryResults = "NO PEOPLE FOUND"; + + return queryResults; + + } + + } + + + + /* Counts and returns the number of entries in File f. + Returns 0 if the File f is not valid. + Uses a try-catch block. + @param f -- the file object + */ + public static int countEntries(File f) + { + Scanner file = null; + + try { + file = new Scanner(f); + int counter = 0; + while (file.hasNextLine()) { + file.nextLine(); + counter++; + } + return counter; + + } catch(FileNotFoundException e) { + return 0; + } + } + + /* Reads the data from file f (you may assume each line has same allignment). + Fills the array with Person objects. If File f is not valid return an empty array. + Uses a try-catch block. + @param f -- the file object + @param num -- the number of lines in the File f + */ + public static Person[] readIntoArray (File f, int num) + { + Scanner file = null; + + try { + file = new Scanner(f); + } catch(FileNotFoundException e) { + return new Person[0]; + } + + Person[] dataArr = new Person[num]; + + int counter = 0; + while (file.hasNextLine()) { + Person person = makeObjects(file.nextLine()); + System.out.println(person.toString()); + dataArr[counter] = person; + counter++; + + } + + return dataArr; + } + + /* A helper method that instantiates one Person object. + @param entry -- one line of the input file. + This method is made public for gradeit testing purposes. + This method should not be used in any other class!!! + */ + public static Person makeObjects(String entry) + { + String name = entry.substring(0, 25); + String date = entry.substring(25, 37); + String age = entry.substring(37, 42).trim(); + Person person = new Person(name, date, 0.0); + person.setAge(person.calculateAge(age)); + return person; + } + + /* Finds and returns the location (the index) of the Person + who is the youngest. (if the array is empty it returns -1) + If there is a tie the lowest index is returned. + @param arr -- an array of Person objects. + */ + public static int locateMinAgePerson(Person[] arr) + { + if (arr.length == 0) + return -1; + + int index = 0; + double lowestValue = 99999999.0; + + for (int i = 0; i < arr.length; i++) { + if (arr[i].getAge() < lowestValue) { + index = i; + lowestValue = arr[i].getAge(); + } + } + + return index; + } + + /* Finds and returns the location (the index) of the Person + who is the oldest. (if the array is empty it returns -1) + If there is a tie the lowest index is returned. + @param arr -- an array of Person objects. + */ + public static int locateMaxAgePerson(Person[] arr) + { + if (arr.length == 0) + return -1; + + int index = 0; + double highestValue = 0.0; + + for (int i = 0; i < arr.length; i++) { + if (arr[i].getAge() > highestValue) { + index = i; + highestValue = arr[i].getAge(); + } + } + + return index; + } + + + /* Extension: + + The methods below allows the user to search the cemetery by name, burial date, or age of death with a text based interface. + + + */ + + + public static void runSearch(Person[] arr) { + Scanner sc = new Scanner(System.in); + + System.out.println("Would you like to run a search on the cemetery(y/n)?"); + String s = sc.nextLine().trim(); + if (s.equals("n") || s.equals("no")) + System.exit(0); + + + while(true) { + System.out.println("\n"); + System.out.println("Welcome to the search system for your cemetery!\nType in a field you want to search by(name, burialdate, or age) or type exit to exit:"); + + s = sc.nextLine().trim(); + System.out.println("\n\n\n\n\n\n\n\n"); + if (s.toLowerCase().equals("exit")) { + System.out.println("Goodbye!"); + System.exit(0); + } else if (s.toLowerCase().equals("name")) { + searchName(arr); + } else if (s.toLowerCase().equals("burialdate") || s.toLowerCase().equals("burial date")) { + searchBurialDate(arr); + } else if (s.toLowerCase().equals("age")) { + searchAge(arr); + } + } + } + + public static void searchName(Person[] arr) { + Scanner sc = new Scanner(System.in); + + System.out.println("You chose NAME! Type in a name to search by, case doesn't matter(or type back to return)"); + String searchTerm = sc.nextLine().toLowerCase().trim(); + System.out.println("\n"); + if (!searchTerm.equals("back")) { + System.out.println("Here are the results of your query:"); + boolean nameFound = false; + for (int i = 0; i < arr.length; i++) { + String currentName = arr[i].getName().toLowerCase().trim(); + if (currentName.equals(searchTerm)) { + System.out.println(arr[i].toString()); + nameFound = true; + } + } + + if (!nameFound) + System.out.println("NO PEOPLE FOUND"); + } + } + + public static void searchBurialDate(Person[] arr) { + Scanner sc = new Scanner(System.in); + + System.out.println("You chose BURIAL DATE! Type in a date to search by as follows: 03 Apr 1850(or type back to go back)"); + String searchTerm = sc.nextLine().toLowerCase().trim(); + System.out.println("\n"); + if (!searchTerm.equals("back")) { + System.out.println("Here are the results of your query:"); + boolean dateFound = false; + for (int i = 0; i < arr.length; i++) { + String currentDate = arr[i].getBurialDate().toLowerCase().trim(); + if (currentDate.equals(searchTerm)) { + System.out.println(arr[i].toString()); + dateFound = true; + } + } + + if (!dateFound) + System.out.println("NO PEOPLE FOUND"); + } + } + + public static void searchAge(Person[] arr) { + Scanner sc = new Scanner(System.in); + + System.out.println("You chose AGE! You can search by weeks(14w), days(6d), years(34), or a decimal value(.011). Type the age below: (or type back to go back)"); + String searchTerm = sc.nextLine().toLowerCase().trim(); + + System.out.println("\n"); + + if (!searchTerm.equals("back")) { + System.out.println("Here are the results of your query:"); + Person holder = new Person("", "", 0.0); + double searchValue = holder.calculateAge(searchTerm); + boolean ageFound = false; + for (int i = 0; i < arr.length; i++) { + double currentAge = arr[i].getAge(); + if (currentAge == searchValue) { + System.out.println(arr[i].toString()); + ageFound = true; + } + } + + if (!ageFound) + System.out.println("NO PEOPLE FOUND"); + } + } +} + +class Person +{ + //constant that can be used for formatting purpose + private static final DecimalFormat df = new DecimalFormat("0.0000"); + /* private fields */ + private double myAge; + private String myName, myBurialDate; + + + + /* a three-arg constructor + @param name, birthdate may have leading or trailing spaces + It creates a valid Person object in which each field has the leading and trailing + spaces eliminated*/ + public Person(String name, String burialDate, double age) + { + myName = name; + myBurialDate = burialDate; + myAge = age; + + } + /* any necessary accessor methods (at least "double getAge()" and "String getName()" ) + make sure your get and/or set methods use the same datat type as the field */ + + double getAge() { + return myAge; + } + + String getName() { + return myName; + } + + String getBurialDate() { + return myBurialDate; + } + + void setAge(double age) { + myAge = age; + } + + void setName(String name) { + myName = name; + } + + void setBurialDate(String date) { + myBurialDate = date; + } + + public String toString() { + return myName+myBurialDate+myAge; + } + + /*handles the inconsistencies regarding age + @param a = a string containing an age from file. Ex: "12", "12w", "12d" + returns the age transformed into year with 4 decimals rounding + */ + public double calculateAge(String a) + { + double ageValue = 0.0; + if (!Character.isLetter(a.charAt(a.length() - 1))) { + ageValue = Double.parseDouble(a); + } else { + if (a.charAt(a.length() - 1) == 'd') { + ageValue = Double.parseDouble(df.format(Double.parseDouble(a.substring(0, a.length() - 1)) / 365)); + } else if (a.charAt(a.length() - 1) == 'w') { + ageValue = Double.parseDouble(df.format((Double.parseDouble(a.substring(0, a.length() - 1)) * 7) / 365)); + } + } + + return Double.parseDouble(df.format(ageValue)); + } +} \ No newline at end of file diff --git a/01 Strings/07 Cemetery/Person.class b/01 Strings/07 Cemetery/Person.class new file mode 100644 index 0000000..6a2c17c Binary files /dev/null and b/01 Strings/07 Cemetery/Person.class differ diff --git a/01 Strings/07 Cemetery/cemetery.txt b/01 Strings/07 Cemetery/cemetery.txt new file mode 100644 index 0000000..37e098e --- /dev/null +++ b/01 Strings/07 Cemetery/cemetery.txt @@ -0,0 +1,612 @@ +John William ALLARDYCE 17 Mar 1844 2.9 Little Knight Ryder Street +Frederic Alex. ALLARDYCE 21 Apr 1844 0.17 Little Knight Ryder Street +Philip AMIS 03 Aug 1848 1 18 1/2 Knight Rider Street +Thomas ANDERSON 06 Jul 1845 27 2, Bennet's Hill +Edward ANGEL 20 Nov 1842 22 Crane Court Lambeth Hill +Sarah ANGELL 09 Oct 1836 42 Lambeth Hill +Sarah ANSELL 31 May 1829 29 High Timber St, Upper Thames St +Charles ANTHONY 22 Jul 1849 6 3,Taylor's Court, Lambeth Hill +Sarah Ann ANTHONY 06 Aug 1828 47 Lambeth Hill +Sarah ARLETT 27 May 1849 2 5, Little Knight Rider Street +Hannah AUSTIN 23 Feb 1819 41 Box MDX +Oliver AUSTIN 19 Feb 1816 0.5 Mile End +Rosina AUSTIN 07 Mar 1833 20 Mile End MDX +Hannah AYLIFF 18 Jul 1832 11 Lambeth Hill +Hannah AYLIFF 10 Dec 1834 44 Crane Court Lambeth Hill +William James AYLIFF 31 Jan 1819 0.2 Crane Court Lambeth Hill +George BAKER 08 Jan 1839 46 Knight Ryder Court +Caroline BARHAM 11 Jul 1851 56 6, Pelham Place, Brompton +Richard Harris BARHAM 21 Jun 1845 57 Residentary Ho. Amen Corner +Ann BARRY 21 Sep 1842 64 Bucks Head Court +Frederick BARTLETT 29 Nov 1839 0.11 Crane Court +Mary BATEMAN 31 Oct 1847 67 24, Lambeth Hill +John Gardner BATTEN 08 Dec 1819 0.18 Westham ESS +George BAXTER 08 Sep 1835 30 Knight Rider Court +Susanna BAXTER 05 Sep 1830 40 Crane Court Lambeth Hill +Mary BEARNARD 19 Oct 1834 21 Little Knight Ryder Street +Henry BEAUMONT 21 Nov 1813 1.9 Old Change +Mary Ann BEAUMONT 15 Dec 1813 27 Old Change +Thomas BEAUMONT 08 Jun 1833 0.4 Knowles Court +George Jacob BECK 19 Apr 1846 0.7 Sermon Lane +Eleanor BECKLEY 17 Nov 1850 1 4, Lambeth Hill +Mary Ann BECKWITH 29 Jun 1828 0.10 Crane Court Lambeth Hill +Sarah BECKWITH 21 Jan 1828 2.6 Crane Court Lambeth Hill +Henry Charles BENNET 01 Aug 1847 0.15 6, Lambeth Hill +Hannah BENNETT 26 Sep 1841 0.10 Lambeth Hill +Mary Wicks BENNETT 14 Apr 1850 38 6, Lambeth Hill +William BENNETT 05 Jul 1837 0.6 Lambeth Hill +William Perkins BENNETT 28 Dec 1845 3 Lambeth Hill +Wm. Geo. Perkins BENNETT 27 Mar 1836 0.5 Lambeth Hill +George BENSTEAD 02 Apr 1837 0.7 Lambeth Hill +John Stephen BENSTEAD 29 Mar 1839 0.8 Lambeth Hill +Ann Elizabeth BENYON 04 Jan 1814 26 Crane Court Lambeth Hill +Charles James BERRY 03 Mar 1841 34 Sermon Lane +Sarah BERRY 26 Jan 1817 0.21 Little Knight, Ryder Street +Philemon BETTS 11 Apr 1820 35 Upper Thames Street +Ann BIRCH 30 Oct 1850 75 1,Taylor's Court, Lambeth Hill +Elizabeth BIRCH 09 Aug 1829 58 Lambeth Hill +Elizabeth Ann BIRCH 07 Jul 1832 2w Lambeth Hill +Sarah BIRCH 12 Aug 1832 32 Green Dragon Crt, St Andrews Hill +Sarah Lucy BIRCH 26 Feb 1834 30 Lambeth Hill +Jane BIRCHILL 31 Mar 1839 18 New Street, St Bride's +Alfred BLACKLEDGE 26 Sep 1848 21 6,Green Arbour Court, Lambeth Hill +Charles BLACKLEDGE 07 Jan 1835 2 Green Arbour Court +Charles BLACKLEDGE 07 Aug 1831 0.18 Green Arbour Court +George BLACKLEDGE 30 Aug 1831 6 Green Arbour Court +Jane BLACKLEDGE 03 Jun 1821 32 Green Arbour Court +John BLACKLEDGE 27 Sep 1835 44 Green Arbour Court +Elizabeth BLACKMORE 24 Jan 1830 52 Lambeth Hill +Thomas BODKIN 13 May 1821 23 Crane Court Lambeth Hill +Frances BOTLEY 24 Dec 1816 8 Lambeth Hill +John BOWLES 17 Aug 1817 22 Green Arbour Court +Mary BOWLES 09 May 1838 33 Green Arbour Court +Mary BOWLES 01 Dec 1850 78 Green Arbour Court, Lambeth Hill +Ann BOX 08 Feb 1815 0.15 Crane Court Lambeth Hill +Jane BRADSHAW 09 Dec 1833 0.3 Crane Court Lambeth Hill +William BRAINTRUMP 15 Sep 1839 5 Lambeth Hill +Sarah BRINDLE 11 Aug 1816 74 Taylor's Court +William BROOKES 24 Feb 1822 1 Green Arbour Court, Lambeth Hill +Elizabeth BROWN 13 Oct 1839 33 High Holborn +John BROWN 11 May 1845 26 Parr's Head Corner Peters Hill +Angelina BUCKLEY 28 Jan 1851 38 3, Morris Yard, Old Fish Street +Jacob George BUCKLEY 22 Nov 1840 0.3 Lambeth Hill +Ann BUCKMASTER 06 Apr 1817 3.10 Lambeth Hill +Mary Ann BUFFHAM 25 Jun 1839 3 Green Arbour Court, Lambeth Hill +Sarah BUNKER 01 Jul 1817 47 Little Knight Ryder Street +William BURCH 02 May 1847 71 4, Lambeth Hill +Lucy BURGESS 21 Dec 1834 45 Little Knight Ryder Street +Henry BURGMAN 21 Jan 1838 76 Little Knight Ryder Street +Ann BURGOYNE 28 Aug 1823 5 White Cross St, Cripplegate +Ann BURGOYNE 02 Sep 1833 55 Little Knight Ryder Street +John BURGOYNE 20 Nov 1814 3.9 Friars Streets Blackfriars +John BURGOYNE 05 Jan 1834 53 Little Knight Ryder Street +Mary BURGOYNE 20 Jun 1813 33 Lambeth Hill +Thomas BURGUIN 17 Mar 1816 62 Knight Rider Court +Ann CARDWELL 24 Jul 1842 48 Green Arbour Court, Lambeth Hill +Jane CAREY 31 Jan 1830 0.3 Taylor's Court, Lambeth Hill +Ann Charlotte CARPENTER 21 Nov 1851 76 14, Park Place Peckham +James CARPENTER 05 Jun 1838 67 Peckham SRY +Joseph CARPENTER 18 Jun 1829 13 Peckham SRY +Elizabeth CARTER 17 May 1842 74 Green Arbour Court, Lambeth Hill +Henry Eli CASTLEMAN 24 Sep 1839 30 Old Change +Priscilla Mary Ann CAVE 08 Mar 1814 1.2 Lambeth Hill +Mary CHAMBERS 21 Nov 1830 70 Lambeth Hill +William CHAMBERS 13 Mar 1827 75 Lambeth Hill +Charles CLARK 26 Mar 1826 2.3 Brew Street Hill +Elizabeth CLARK 23 Aug 1818 64 Lambeth Hill +Emma CLARK 14 Oct 1849 4 15, Old Change +George CLARK 09 Dec 1821 68 Lambeth Hill +Isabella CLARK 08 Apr 1813 7d Little Knight Ryder Street +Mary Jane CLARK 12 May 1838 20 Old Change +William Penn CLARK 21 Apr 1833 40 Bell Square, Bishopsgate +Thomas CLOSE 29 Jun 1824 55 Little Knight Ryder Street +Ellen COCHRAM 11 Jun 1848 42 27, Addle Hill +John COCKERING 19 Dec 1849 7 18, Old Change +Elizabeth COCKHEAD 09 Jun 1850 21 New Street, Blackfriars +Eliza Erinder COGGER 04 Nov 1823 0.10 Peters Hill +Lucy Ann COLEBACK 23 Jul 1843 4w Lambeth Hill +Charles COLES 01 Dec 1833 2 Great Carter Lane +Eliza COLES 16 Apr 1826 10 Crane Court Lambeth Hill +Jane COLES 05 Jul 1832 5 Great Carter Lane +John COLES 09 Oct 1836 17 Great Carter Lane, Doctors Commos +William COLES 28 Apr 1833 3.10 Great Carter Lane +Richard COLLETT 01 Oct 1843 39 Old Change +Thomas William COLLEY 08 Aug 1833 4d Lambeth Hill +Joseph COLLIER 03 Apr 1831 58 Lambeth Hill +James Robert COLLINS 25 Mar 1834 1.6 Lambeth Hill +Sarah COLLINSON 15 Sep 1839 0.2 Knight Rider Court +John Speechley COOK 09 Mar 1817 2 Great Carter Lane +Elizabeth COOKE 27 Aug 1825 39 Crew Lane +Emma COOKSON 16 Jul 1826 0.3 Old Change +Emma COOKSON 16 Jul 1826 0.3 Old Change +Elizabeth COSTER 24 Sep 1826 42 Crane Court Lambeth Hill +Mary COWLING 13 Nov 1825 0.10 Lambeth Hill +Mary Ann COX 08 Aug 1833 4d St Peters Hill +Alice CRAGG 11 Aug 1834 2 Taylor's Court, Lambeth Hill +John CRAGG 19 Aug 1832 34 Green Arbour Court, Lambeth Hill +John CROCKFORD 16 Jul 1834 67 Crane Court Lambeth Hill +Harriot CROFT 08 Oct 1819 31 Portpool Street St Andrews Holbon +Margaret CROFT 20 Jan 1819 0.2 Little Knight Ryder Street +James CROLL 19 Apr 1829 43 Lambeth Hill +Charles CROOT 09 Jun 1818 2 Windsor Crt Little Knight Rider Court +Charles Neal CUMMINGS 12 Dec 1825 18 Great Carter Lane +Ann CUMMINS 16 Jun 1832 66 Great Carter Lane +Thomas CUNNINGHAM 07 Jun 1846 17 21, Lambeth Hill +Ann DALBY 11 Aug 1839 60 Green Arbour Court, Lambeth Hill +Thomas DALBY 18 Apr 1841 25 Green Arbour Court, Lambeth Hill +William DALBY 29 May 1842 65 Green Arbour Court, Lambeth Hill +William DAVIS 28 Jun 1845 71 Ludgate Street +William DAWES 25 Aug 1833 65 Taylor's Court, Lambeth Hill +Mary DAWSON 20 Oct 1850 62 14, Sermon Lane +James DAY 22 Jan 1815 0.13 Sermon Lane +John DAY 17 Nov 1819 1 Sermon Lane +Richard DAY 29 Apr 1819 36 Sermon Lane +Mary Ann DEACH 29 Oct 1843 0.22 Lambeth Hill +Jane DERBYSHIRE 19 Jan 1817 2 Old Change +William DEVEY 21 Dec 1834 0.3 Green Arbour Court, Lambeth Hill +Henry DIAL 07 Jun 1836 2w Crane Court Lambeth Hill +Frederick DILLAY 04 May 1834 2 Little Carter Lane +Richard DILLEY 26 Jan 1837 46 Little Carter Lane +William DOLBY 20 Jul 1824 5.6 Green Arbour Court, Lambeth Hill +Charles DORSETT 01 Oct 1848 0.6 4, Lambeth Hill +Mary DOUGLAS 26 Jan 1839 0.14 Knight Rider Street +Elizabeth DOWNES 04 Jun 1837 48 Taylor's Court, Lambeth Hill +John DRAKE 21 Apr 1833 50 Lambeth Hill +Elizabeth DUDLEY 03 Oct 1847 73 1,Taylor's Court, Lambeth Hill +Sarah DUNN 27 Oct 1816 55 Christ Church SRY +Amelia DYSON 06 Dec 1814 0.6 Old Change +Hannah DYSON 24 Mar 1819 60 High Street. Marylebone MDX +Robert Joseph DYSON 05 Jan 1813 1.6 Old Change +Thomas DYSON 18 Sep 1813 0.10 Old Change +William EADES 19 Aug 1818 5 Taylors Court Lambeth Hill +Edwin EARDLEY 08 Dec 1833 25 Little Knight Rider Street +Henry EDMONDS 09 Apr 1826 38 Old Change +William EDMUNDS 03 Feb 1825 60 Lambeth Hill +George EDWARDS 11 Jul 1813 49 Taylors Court Lambeth Hill +Harriet Sarah ELLARD 16 Jun 1844 0.11 Lambeth Hill +John Yates ELLIS 29 Nov 1830 5d Little Knight Rider Street +Thomas ELLIS 15 Mar 1829 0.10 Knight Rider Court +James ENTWISLE 22 May 1819 40 Little Knight Ryder Street +Mary Ann ESCOTT 26 Aug 1821 0.3 Crane Court Lambeth Hill +John EVANS 26 Aug 1819 11 Lambeth Hill +William EVANS 13 Nov 1814 1.2 Green Arbour Court, Lambeth Hill +Jane EXTON 26 Mar 1815 54 Green Arbour Court, Lambeth Hill +Lewis FACHE 28 Dec 1823 0.10 Crane Court Lambeth Hill +Mary FACHE 09 Jun 1822 0.18 Crane Court Lambeth Hill +Mary FARMFIELD 05 Mar 1843 64 Lambeth Hill +Elizabeth FARROW 20 Dec 1819 65 Green Arbour Court, Lambeth Hill +Edward FELLOWES 28 Apr 1833 2 Taylor's Court, Lambeth Hill +Lydia FELLOWS 28 Jan 1844 33 Lambeth Hill +William Henry FELLOWS 28 Jun 1837 0.13 Lambeth Hill +Mary Ann FERRIDAY 16 Mar 1851 69 2, Fish Street +Mary FIELD 20 Feb 1829 0.3 Lambeth Hill +Harriett FINCH 01 Feb 1852 0.9 Green Arbour Court, Lambeth Hill +George FLANDERS 16 Aug 1837 0.3 St Peters Hill +Louisa FLANDERS 25 Jun 1839 9.3 St Peters Hill +William FLANDERS 19 May 1833 2.6 St Peters Hill +William FLANDERS 28 Nov 1847 50 15 Labour in Vain Yard Lambeth Hill +Elizabeth FLINTAN 20 Jul 1832 39 Green Arbour Court, Lambeth Hill +Jane FLUDE 01 Nov 1832 58 Little Knight Ryder Street +Elizxabeth FOON 25 Aug 1833 14 Green Arbour Court, Lambeth Hill +George FOON 28 May 1816 0.19 Green Arbour Court, Lambeth Hill +John FOON 09 Jun 1816 4 Green Arbour Court, Lambeth Hill +John FOON 10 Jan 1841 60 Green Arbour Court, Lambeth Hill +William FOONE 16 May 1847 24 3, Green Arbour Court, Lambeth Hill +Levina FRANCIS 11 Aug 1844 6 Bennetts Hill +William FROSTICK 06 Nov 1825 1.8 Lambeth Hill +Elizabeth GABRIEL 30 Apr 1834 18 Lambeth Hill +George GALE 17 Nov 1833 6 Crane Court Lambeth Hill +Elizabeth GALLANT 27 Aug 1848 11 10, Crane Court +Esther GALLERY 01 Jun 1813 62 Taylor's Court, Lambeth Hill +Elizabeth GARDENER 13 Mar 1836 30 Knight Riders Court +James GARDNER 05 Jan 1826 0.16 Taylor's Court, Lambeth Hill +Sarah GARDNER 24 Nov 1831 50 Crane Court Lambeth Hill +Augusta Sophia GAUGIN 04 Nov 1821 16 Knowles Court +Jane GIBBS 10 Jul 1839 0.11 Green Arbour Court, Lambeth Hill +Martha GILES 12 Dec 1813 25 Green Arbour Court, Lambeth Hill +Thos Henry David GILHAM 17 Apr 1853 37 12,Little Knight Ryder Street +Eliza GLEESON 12 Mar 1815 0.18 Knight Rider Court +Caroline GODFREY 29 May 1821 0.4 Taylor's Court, Lambeth Hill +Elizabeth GODFREY 09 Jul 1818 2 Taylor's Court, Lambeth Hill +John GODFREY 24 Apr 1817 2 Crane Court Lambeth Hill +Louisa GODFREY 29 May 1821 0.4 Taylor's Court, Lambeth Hill +Eliza GOODALL 06 Apr 1845 28 Little Carter Lane +James GOODHALL 08 Oct 1843 49 Green Arbour Court, Lambeth Hill +Johanna GOODWIN 12 May 1815 86 Green Arbour Court, Lambeth Hill +Henry GOODYEAR 28 Jul 1850 14.9 12, Little Carter Lane +Abraham GOYMER 02 Sep 1839 48 Globe Road, Mile End +Abraham GOYMER 11 Dec 1823 5d Old Fish Street +Abraham Frederic GOYMER 06 Nov 1825 0.11 Old Fish Street +Amelia GOYMER 01 Mar 1831 0.10 Old Fish Street +Henry Robert GOYMER 20 May 1821 1.11 Old Fish Street +Sarah Augusta GOYMER 21 Nov 1833 0.8 Old Fish Street +Elizabeth GREEN 28 Dec 1814 2.9 Carter Lane +John GREEN 09 Dec 1814 4.6 Little Carter Lane +Sarah GREEN 25 Mar 1821 53 Little Carter Lane +William GREEN 07 Feb 1830 61 Old Change +William George GREEN 22 May 1839 35 Little Carter Lane +Charles GREENWOOD 18 Feb 1814 33 Old Fish Street +William GRIFFIN 12 Aug 1827 0.10 Lambeth Hill +Sarah Jane GRIFFITHS 13 Oct 1833 2.8 Sermon Lane +John GROVER 01 Feb 1814 5 Taylor's Court, Lambeth Hill +Sarah GROVER 04 Feb 1849 30 4, Taylor's Court, Lambeth Hill +Amelia GYDE 10 Nov 1839 0.1 Lambeth Hill +Thomas HALL 02 Mar 1845 64 Green Arbour Court, Lambeth Hill +Clara HANDLEY 19 Nov 1845 1 Lambeth Hill +John HARRIS 02 Jul 1837 62 Lambeth Hill +John Francis HARRIS 16 Jan 1842 0.20 Peter's Hill +Rosetta HARRIS 22 Jan 1837 74 Lambeth Hill +John HART 22 Jan 1826 51 Old Change +Henry HARTRUP 24 Oct 1813 1.7 Green Arbour Court, Lambeth Hill +Joseph HARTRUP 23 Dec 1818 2 Green Arbour Court, Lambeth Hill +Samuel HARTRUP 19 Mar 1815 0.2 Green Arbour Court, Lambeth Hill +William Matthew HASSALL 28 Nov 1852 0.3 2, Old Fish Street +Jane Charlotte HAWARD 22 Sep 1821 2w Little Carter Lane +Eleanor HAWKINS 14 Sep 1817 0.13 Canterbury Court, St Andrews Hil +Elizabeth Sarah HAWKINS 26 Nov 1838 4.2 Green Arbour Court, Lambeth Hill +Mary HAWKINS 01 Jul 1821 53 Knight Rider Court +Sarah Jane HAWKINS 30 Nov 1817 3 Canterbury Court, St Andrews Hill +Thomas HAWKINS 13 Dec 1818 55 Sermon Lane +Alice HAY 17 Nov 1850 57 6, Green Arbour Court, Lambeth Hill +James HEALD 13 Apr 1847 56 24, Old Change +Martha HEALD 03 Mar 1841 48 Lambeth Hill +William HEALD 21 Jul 1850 14 Old Change +Thomas HEATH 22 May 1836 72 Lambeth Hill +Robert HENDRY 28 Nov 1824 43 Labour in Vain Yard +William HENLEY 11 Dec 1814 43 Bottle Hay Yard +Robert HENRY 30 Jan 1814 66 Lambeth Hill +Ann HIBBLE 28 Aug 1833 53 Lambeth Hill +James HIBBLE 24 Jul 1833 75 Lambeth Hill +James HILLUM 26 Sep 1839 39 Knight Rider Court +James HINES 17 Jan 1813 40 Lambeth Hill +Elizabeth HOBART 19 Apr 1833 36 Little Knight Ryder Street +Janes HOLLOWAY 15 Jul 1818 0.10 Lambeth Hill +John HOLLOWAY 05 Jun 1821 6 Lambeth Hill +Elizabeth HOLMAN 08 Nov 1835 1.5 Little Carter Lane +William Henry HOLMAN 26 Apr 1835 14 Little Carter Lane +John HOOD 15 Dec 1844 51 Carter Lane +Robert HOOPER 16 Sep 1824 0.9 Green Arbour Court, Lambeth Hill +William HOOPER 25 Sep 1839 19 Green Arbour Court, Lambeth Hill +Martha HOPKINS 18 Mar 1825 84 Taylor's Court, Lambeth Hill +Henry HORNER 06 Apr 1847 45 Knowles Court +Benjamin HOTINE 15 Feb 1829 53 Little Knight Rider Street +Mary HOTINE 27 Oct 1819 49 Lambeth Hill +John HUGGINS 09 May 1849 47 6, Lambeth Hill +Edwin HUGHES 11 Sep 1829 5d Lambeth Hill +Hannah HUGHES 11 Sep 1829 25 Lambeth Hill +Elizabeth HULCUP 09 Jan 1814 2.6 Old Change +William HURN 06 Feb 1826 0.2 Lambeth Hill +Mary Harris HUTCHINSON 14 May 1837 2 Little Carter Lane +Mary Ann ISLIP 20 Dec 1840 4 Lambeth Hill +James JACKSON 19 May 1822 0.10 Friday Street +Mary Ann JACKSON 31 Jul 1814 1.3 Knowles Court +Sarah JACKSON 05 Dec 1819 68 Labour in Vain Crt, Little Fish +Simmons JACKSON 24 Oct 1819 4 Friday Street +Mary JARRAL 04 Oct 1824 69 Lambeth Hill +James JARRETT 11 May 1851 39 12,Crane Court Lambeth Hill +Thomas JARVIS 23 Apr 1825 39 Little Knight Ryder Street +Susan JEWELL 17 Mar 1850 0.5 10, Little Carter Lane +James JOHNS 13 Jan 1842 51 Lambeth Hill +Richard JOHNS 13 Mar 1827 28 Knight Rider Court +Eliza Sarah JOHNSON 06 Jan 1822 2.6 Lambeth Hill +George JOHNSON 05 Feb 1817 64 Taylor's Court, Lambeth Hill +Sarah JOHNSON 28 Jan 1827 41 Lambeth Hill +Caroline JONES 31 Oct 1821 0.15 St Peters Hill +Elizabeth JONES 12 Jul 1815 0.21 Lambeth Hill +Elizabeth JONES 20 Jan 1822 61 Little Carter Lane +George JONES 18 Mar 1827 0.13 Bell Inn Yard, Friday Street +James John JONES 12 Aug 1832 37 Knight Rider Court +John JONES 27 May 1819 60 Windsor Crt, Little Knight Rider +John Amos JONES 02 Nov 1828 0.9 Bell Inn Yard, Friday Street +Margaret JONES 14 Apr 1833 58 Crane Court Lambeth Hill +Martha JONES 09 Jun 1850 7 9, Little Carter Lane +Mary Ann JONES 27 Sep 1849 8 20,Lambeth Hill +Rebecca JONES 01 Dec 1833 86 Green Arbour Court, Lambeth Hill +William JONES 08 Nov 1835 40 St Bartholomew's Hospital +William JOPP 10 Sep 1833 24 Great Trinity Lane +William JOPP 01 May 1834 0.8 Oxford Street +Anne JORDAN 25 Nov 1832 36 Knight Ryder Court +Frances Ann JORDAN 14 May 1827 3.4 Knight Ryder Court +Joseph KELLY 31 Dec 1815 27 Little Knight Ryder Street +Clara KEMSHEAD 21 May 1843 3.6 25, Lambeth Hill +Richard KEMSHEAD 21 Feb 1841 35 Lambeth Hill +Hannah KENDRICK 27 Nov 1831 71 Crane Court Lambeth Hill +Hannah KENDRICK 06 Dec 1821 0.11 Old Change +Daniel KENSEY 04 Nov 1825 3d Knight Rider Court +Thomas Joel James KENSEY 27 Mar 1822 4 Lambeth Hill +Henry KERR 05 Dec 1823 3 Little Knight Ryder Street +William KNIGHT 30 Mar 1828 35 Knight Rider Court +Frederick KOPP 20 Dec 1818 45 Kings Head Crt, Little Carter Lane +Mary LANGDON 15 Mar 1813 36 Blackheath Hill Kent +William LANGLEY 27 Feb 1820 42 Old Change +Henry Richard LAVIS 24 Oct 1848 0.5 7, Lambeth Hill +Sarah Ann LAVIS 15 Oct 1848 2 7, Lambeth Hill +Chas Nathaniel LAWRENCE 02 Dec 1838 10 Old Change +Frances LEAVER 25 Nov 1830 28 Little Knight Ryder Street +Charles LEE 16 Mar 1828 0.13 Sermon Lane +George Edwin LEE 22 Apr 1830 5 Little Carter Lane +Hannah LEE 21 Apr 1844 53 Sermon Lane +Hannah LEE 30 May 1852 22 17,Sermon Lane +Samuel LEE 26 Jul 1834 5.9 Sermon Lane +Jane LEGG 10 Feb 1833 26 Green Arbour Court, Lambeth Hill +John LESTER 22 May 1814 61 St Mary, Lambeth +Mary LEWIN 18 Aug 1850 63 7,Little Knight Ryder Street +Catherine LINCH 27 May 1813 0.2 Green Arbour Court, Lambeth Hill +John LINCK 22 May 1814 0.7 Taylor's Court, Lambeth Hill +Martin LINCK 05 Mar 1817 0.7 Taylor's Court, Lambeth Hill +Sarah LINSELL 24 Dec 1828 62 Taylor's Court, Lambeth Hill +Thomas LINSELL 15 Jan 1832 63 At Andrews Hill +Mary LINSELL 22 Dec 1844 43 Crane Court Lambeth Hill +Samuel LITTLE 23 Feb 1851 2 3, Taylor's Court, Lambeth Hill +Harriet LLOYD 17 Aug 1831 1.9 Lambeth Hill +Richard LLOYD 03 Feb 1830 40 Lambeth Hill +James LOOKER 01 Dec 1825 2.6 Lambeth Hill +John LOOKER 11 Sep 1831 45 Lambeth Hill +John Edward LOOKER 20 Jul 1831 0.20 Lambeth Hill +Thomas LOOKER 09 May 1824 2.10 Lambeth Hill +Wilhelmina Lydia LOVE 22 Aug 1820 0.10 Lambeth Hill +Hannah LUCAS 27 Dec 1829 67 Taylor's Court, Lambeth Hill +William LYALL 05 Jan 1851 63 23 Peter's Hill +Daniel LYONS 27 Apr 1834 1.6 Green Arbour Court, Lambeth Hill +Thomas LYONS 03 Apr 1833 2 Green Arbour Court, Lambeth Hill +Elizabeth MACKEY 10 Apr 1853 77 193, Upper Thames Street +Richard Jebb MADELEY 18 Jul 1813 1.4 Green Arbour Court, Lambeth Hill +John Sadler MAIL 07 Mar 1816 3 Sermon Lane +Richard MALLON 17 Feb 1850 0.2 23, Lambeth Hill +George Henry MANN 16 Jun 1822 0.13 Lambeth Hill +Elizabeth MANNING 07 Oct 1818 0.10 Little Carter Lane +Sarah MARCHANT 20 May 1850 87 12, Sermon Lane +William MARCHUM 15 Dec 1822 22 Taylor's Court, Lambeth Hill +Ann MARECHAL 07 May 1837 73 Little Knight Ryder Street +Caroline MARECHAL 23 Apr 1820 22 Little Knight Ryder Street +Anthony Romney MARSHALL 05 Aug 1839 0.19 Little Knight Ryder Street +Frederick MARSHALL 05 Aug 1839 4 Little Knight Ryder Street +Mary Ann MARSHALL 25 Aug 1814 5 St Mildreds Crt Bread Street +Mary Louise MARSHALL 20 Dec 1839 5 Little Knight Ryder Street +Francis MARTIMORE 27 Jun 1824 64 Lambeth Hill +Edward MARTIN 09 Aug 1825 49 Lambeth Hill +Mary MARYON 06 Feb 1842 38 Boss Court Upper Thames Street +Simon MARYON 03 Mar 1841 41 Crane Court Lambeth Hill +Emma MASDON 13 Nov 1825 0.10 Lambeth Hill +George MASON 26 Oct 1837 0.5 Knight Rider Court +James MASON 12 Jun 1839 0.3 Crane Court Lambeth Hill +John MASON 23 Jun 1846 18 Crane Court Lambeth Hill +Richard MASON 12 Oct 1826 49 Lambeth Hill +Sarah MASON 02 Jun 1839 3.10 Crane Court Lambeth Hill +Sophie McGOWAN 06 Mar 1836 55 St Peters Hill +Nathaniel McGOWEN 20 Jan 1841 76 Lambeth Hill +Christianus MEADOWS 03 Apr 1823 67 Bell Court +Mary MEADOWS 07 Feb 1823 74 Taylor's Court, Lambeth Hill +Hannah MELLOR 20 Feb 1825 60 Bell Court, Great Carter Lane +Elizabeth MILLINGTON 23 Jan 1818 0.13 Lambeth Hill +Sarah MILLWARD 29 Oct 1841 84 Little Carter Lane +James MILNER 05 Apr 1830 61 Crown Court Old Change +Mary MILNER 14 Jul 1822 56 Old Change +Thomas MILWARD 02 Nov 1834 84 Lambeth Hill +Caroline MOLE 15 Nov 1840 63 Holiday Yard +Ann MOORES 02 Jul 1817 43 Fleet Market +Henry MORE 06 Jun 1814 0.14 Lambeth Hill +Charles MORGAN 22 Feb 1824 0.14 Crane Court Lambeth Hill +William James MORGAN 26 Jul 1833 0.15 Crane Court Lambeth Hill +Ann MORRIS 10 Jan 1819 76 Green Arbour Court, Lambeth Hill +Mary MORRIS 30 Mar 1828 96 Lambeth Hill +Thomas MORRIS 07 Apr 1815 71 Carter Lane, Old Change +Job MORTON 17 Dec 1813 45 St Bartholomews Hospital +Edward MOULL 25 Apr 1821 6w Green Arbour Court, Lambeth Hill +Robert MULLIS 29 Jun 1828 38 Sermon Lane +Ann MURRAY 13 Mar 1821 62 Green Arbour Court, Lambeth Hill +James MURRAY 15 Jan 1815 27 Taylor's Court, Lambeth Hill +Thomas William NEALE 03 Sep 1828 1 Lambeth Hill +Eliza NEGUS 12 Dec 1847 43 5, Lambeth Hill +Mary NETTLETON 02 Jan 1845 69 Knight Rider Court +Philadelphia NEWBLE 12 Jun 1818 25 Green Arbour Court, Lambeth Hill +John NEWHALE 04 Nov 1833 58 Woolwich Kent +Joseph NEWHALL 08 Jul 1833 61 Little Knight Ryder Street +Joseph NEWMAN 24 Sep 1843 1 Old Change +Caroline NICHOLAS 06 Feb 1834 6 Little Carter Lane +Francis NORIS 05 Feb 1837 45 Lambeth Hill +Mary Ann NORRIS 03 Oct 1849 18 7, Little Knight Ryder Street +Elizabeth Webb NORTWYCK 06 May 1818 37 Little Knight Ryder Street +Elizabeth NOTLEY 28 Jan 1819 5 Upper Thames Street +William NOTTLEY 30 Apr 1818 0.11 Printing Ho Yard Water Lane +Thomas Ebenezer OGILVY 19 Mar 1843 2.5 Little Knight Ryder Street +Jane Elizabeth ORAM 06 Apr 1817 0.22 Lambeth Hill +Sarah ORAM 21 Feb 1819 37 Lambeth Hill +Susannah ORAM 27 Apr 1817 60 Crane Court Lambeth Hill +Elizabeth ORTSON 03 Jan 1819 46 Crane Court Lambeth Hill +Susan OXFORD 08 Nov 1826 0.15 Crane Court Lambeth Hill +Elizabeth PARRY 12 Mar 1826 41 Old Change +Maria PARTRIDGE 20 Nov 1842 60 Great Trinity Lane +Amy PAYNE 29 Mar 1839 42 Little Carter Lane +Hannah PAYNE 02 Jul 1816 40 New Street, Shoe Lane +Elizabeth PEASTON 11 Dec 1842 0.11 Taylor's Court, Lambeth Hill +Alice Elizabeth PERKINS 30 Nov 1845 68 Bell Court, Temple Bar +Elizabeth PERKINS 25 Oct 1816 0.16 Green Arbour Court, Lambeth Hill +Emma PERKINS 11 Jul 1827 14w Lambeth Hill +Mary PERKINS 21 Sep 1814 1.3 Green Arbour Court, Lambeth Hill +Mary PERKINS 02 May 1833 45 Lambeth Hill +Robert PERKINS 29 Jun 1821 3 Green Arbour Court, Lambeth Hill +Stephen PERKINS 25 Mar 1838 19 Old Fish Street +Thomas PERKINS 31 Mar 1833 50 Lambeth Hill +Thomas Robert PERKINS 04 Sep 1814 6.7 Green Arbour Court, Lambeth Hill +Elizabeth Ann PETTIT 23 Mar 1819 38 Little Knight Ryder Street +Susannah PETTIT 14 May 1817 69 Blackheath Kent +Sarah PHILLIPS 26 Oct 1834 59 Lambeth Hill +Susan PHILLIPS 06 Jan 1828 61 Lambeth Hill +William PHILLIPS 22 Feb 1829 66 Crane Court Lambeth Hill +James PHILP 03 Aug 1837 0.4 Knight Rider Court +Mary PHILP 23 Dec 1838 46 Knight Rider Court +William PHILP 07 Jul 1833 16 St Peters Hill +William Andrew PINK 02 Jun 1816 1.9 Lambeth Hill +James PITT 07 Oct 1849 3 2,Lambeth Hill +William Earl PITT 07 Oct 1849 3 2,Lambeth Hill +Charles PLUMRIDGE 21 Nov 1849 0.14 4, Green Arbour Court +William PLUMRIDGE 25 Aug 1833 75 Taylor's Court, Lambeth Hill +George POCOCK 09 Jun 1814 35 St Bartholomew's Hospital +Georgina POWELL 24 Jul 1830 43 Little Carter Lane +Robert POWELL 13 Oct 1837 1 Knight Rider Court +Henry PRESCOTT 17 Sep 1817 0.11 Lambeth Hill +Elizabeth PRICE 30 Jan 1825 53 Noble Street, St Lukes MDX +Hiram PRICE 01 Aug 1820 60 Lambeth Hill +Mary Ann PRICE 18 Jul 1832 9 Lambeth Hill +William PRICE 16 Mar 1828 30 Knight Rider Court +Philip John PRUDORN 19 Dec 1838 40 Sermon Lane +Alfred PRYCE 17 Nov 1850 1 1, Sermon Lane +Jane PUZEY 27 Aug 1829 0.13 Crane Court Lambeth Hill +George RADFORD 23 Sep 1824 18 St Peters Hill +William RADFORD 13 Feb 1826 57 St Peters Hill +George READ 20 Aug 1833 66 Green Arbour Court, Lambeth Hill +Mary Ann READ 30 Apr 1815 0.9 Little Knight Ryder Street +Sarah READ 05 May 1833 65 Green Arbour Court, Lambeth Hill +John REDDALL 22 Aug 1834 72 Sermon Lane +Jane REDHALL 28 Dec 1816 59 Sermon Lane +Alfred RENWELL 22 May 1842 0.18 Crane Court Lambeth Hill +Jane RICHARDS 21 Aug 1831 7w Green Arbour Court, Lambeth Hill +Mary RICHARDS 07 Feb 1819 3 Stepney MDX +Mary RICHARDS 26 Oct 1819 82 Lambeth SRY +Thomas RICHARDS 06 May 1819 44 Taylor's Court, Lambeth Hill +William RICHARDS 09 Jan 1818 43 John Street, St George MDX +Hubert Paul RIVOUS 07 Apr 1835 15 Little Knight Rider Street +Elizabeth ROBERTS 28 May 1839 1.11 Green Arbour Court, Lambeth Hill +Geroge Henry ROBERTS 20 Oct 1839 0.3 Green Arbour Court, Lambeth Hill +John ROCKELL 09 Aug 1835 69 Taylor's Court, Lambeth Hill +Jane ROCKLE 03 Aug 1845 74 6, Lambeth Hill +Harriet RODGERS 06 Jan 1820 61 Pratt Street, Lambeth +Hannah ROGERS 10 Nov 1824 5 Knight Rider's Court +Maria ROSE 29 Jun 1828 8 Taylor's Court, Lambeth Hill +Henry ROSS 22 Aug 1841 37 Little Carter Lane +Charles ROWLEY 03 Nov 1822 79 Old Change +Martha RUSS 20 Jun 1816 66 Green Arbour Court +Richard RUSS 13 Sep 1818 68 Little Fish Street Hill +Alfred RYDER 15 Jan 1843 2.6 Sermon Lane +Margaret RYDER 03 Jul 1814 64 Knight Rider Court +Emma SALIS 23 Jul 1833 2w Knight Rider Court +Nicholas SANDELL 08 Apr 1821 50 Old Change +Mary Ann SARGENT 14 Dec 1835 0.10 Taylor's Court, Lambeth Hill +William SARGENT 15 Feb 1829 0.5 Lambeth Hill +William John SARJANT 08 Jun 1838 5w Taylor's Court, Lambeth Hill +Mary SARTINE xx Sep 1815 64 Taylor's Court, Lambeth Hill +Ann SAUNDERS 21 May 1852 90 1, Taylor's Court, Lambeth Hill +George SAYER 21 Aug 1813 3.3 Old Change +Christian SCHINDLER 27 Jan 1830 58 Knowles Court Little Carter Lane +Bella SCOTT 04 Jun 1840 11 Lambeth Hill +Henry SEATORN 22 Feb 1814 4.9 Lambeth Hill +Jane SEATORN 08 Feb 1814 1.11 Lambeth Hill +Sarah SEDGWICK 31 Jul 1821 49 St Peter's Hill +Henry SHIPMAN 02 Nov 1826 39 Little Carter Lane +Martha SHIPMAN 28 Apr 1850 69 9, Crane Court Lambeth Hill +Ann SHIRMER 17 Feb 1822 26 St Peter's Hill +James SHORT 22 Sep 1822 22 Little Knight Ryder Street +William SHURRY 25 Jan 1818 0.1 Little Carter Lane +Ann SKATES 08 Oct 1837 50 Green Arbour Court, Lambeth Hill +Janet SKEENE 31 Dec 1829 63 Little Knight Rider Street +John SMALE 22 Jul 1832 51 Green Arbour Court, Lambeth Hill +Ann SMITH 26 Jan 1845 31 Sermon Lane +Ann Harriett SMITH 16 Oct 1847 3 25, Lambeth Hill +George Trinity SMITH 18 Aug 1822 29 Lambeth Hill +Mary Ann SMITH 26 Nov 1813 2 Workhouse +Richard SMITH 04 Aug 1817 35 Crane Court Lambeth Hill +Richard Ann SMITH 01 Apr 1813 0.3 Lambeth Hill +Sophia SMITH 05 Feb 1815 18 Little Knight Ryder Street +Thomas SMITH 20 Oct 1823 28 Old Change +Thomas SNOWDEN 05 Aug 1814 43 Knowles Court +Clara Emmeline SPEECHLEY 16 Dec 1838 3.5 Christ Church Surrey +Eliza Ellen SPEECHLEY 28 Feb 1836 3 Prujean Square Old Bailey +John SPEECHLEY 03 May 1821 68 Sidney Street, Islington MDX +John Edward SPEECHLEY 09 Nov 1828 4 Sermon Lane +Thomas Henry SPEECHLEY 07 Mar 1830 3.6 Sermon Lane +William SPEED 07 Jun 1846 0.3 24, Peters Hill +Mary SPRINGH 24 Mar 1816 4d St Peter's Hill +Maria STAINES 28 Nov 1840 0.3 Lambeth Hill +William STEDMAN 17 Feb 1813 0.7 Crane Court +Eliza STEVENS 06 Mar 1822 0.11 Bells Court, Docotr's Commons +Elizabeth STEVENS 23 Mar 1817 66 Green Arbour Court, Lambeth Hill +Emily Esther STEVENS 22 Apr 1832 1.7 Bell Court, Doctors Commons +John Paul STEVENS 17 Jan 1827 66 Crane Arbour Court +Maria STEVENS 16 Nov 1820 1.9 Bell Court, Doctor's Commons +William Nick STEVENS 07 Feb 1847 21 Bell Court +James STEWART 05 Apr 1829 4w Sermon Lane +Sarah STEWART 11 Dec 1831 1.9 St Johns Street, Smithfield +Mary STRAITON 08 Nov 1835 2.10 Little Knight Ryder Street +William STRANGE 03 Apr 1853 44 19, Little Knight Ryder Street +Elizabeth Lydia STRATTON 17 Aug 1834 25 Sermon Lane +Joseph STRICKFIELD 19 Jul 1835 0.4 Lambeth Hill +Thomas STRICKLAND 11 Sep 1835 73 Little Knight Ryder Street +Margaret TALBOTT 01 Dec 1833 31 Little Carter Lane +Henry TAPP 17 Aug 1845 57 Crane Court Lambeth Hill +Mary TAYLOR 23 Jan 1814 22 Knight Rider Court +Joseph TEMPEST 26 Dec 1841 73 Taylor's Court, Lambeth Hill +Henry THEED 17 Mar 1842 37 Sermon Lane +John THEOBALD 23 Mar 1817 45 Lambeth Hill +Mary THOMPSON 21 Mar 1844 82 Sermon Lane +Sarah THOMPSON 07 May 1844 78 Lambeth Hill +William THOMPSON 10 Oct 1839 75 Green Arbour Court, Lambeth Hill +Ann THOMSON 26 Mar 1820 63 Red Lion Street, Holborn +David THOMSON 29 Jan 1837 5 Old Change +Robert THOMSON 04 Aug 1813 25 Fleet Market +George THORNTON 03 Sep 1820 60 Lambeth Hill +Agnes TINDALL 15 Mar 1818 0.19 Kings Head Crt Little Carter Lan +John TINDALL 19 Oct 1815 0.7 Green Arbour Court, Lambeth Hill +Elizabeth TINKLER 22 Mar 1846 66 Little Carter Lane +William TRACEY 31 May 1849 2 8, Green Arbour Court +James Frederick TRAYLEN 10 Jul 1828 0.4 Little Carter Lane +Charles TRIMMING 17 Aug 1837 15 Taylor's Court, Lambeth Hill +Maria Ann TUCKER 30 Aug 1815 0.8 Green Arbour Court, Lambeth Hill +William TYRRELL 25 Dec 1822 0.2 Lambeth Hill +Moot VALENTINE 14 Sep 1832 43 Crane Court Lambeth Hill +Joseph VERE 11 Feb 1819 65 Cloth Fair, Smithfield +George Frederick VIGOR 23 Nov 1828 2 Little Knight Ryder Street +Sarah VINCE 14 Aug 1831 1 Lambeth Hill +Penfold WAKEFIELD 18 Feb 1844 4.8 Knight Rider Court +Stephen C WAKEFIELD 12 Aug 1851 53 1, Knight Rider Court +Caroline Lydia WALKER 17 Mar 1817 0.1 Little Knight Ryder Street +Charlotte WALKER 17 Aug 1851 0.7 20, Lambeth Hill +John Henry WALKER 08 Jul 1829 0.5 Knight Rider Court +Mary WALKER 27 Nov 1817 30 Little Knight Ryder Street +Eliza WALLINGER 20 May 1821 0.10 Taylor's Court, Lambeth Hill +Mary Ann WALLINGER 02 Aug 1818 1.6 Taylor's Court, Lambeth Hill +William Isaac WALSHAM 21 Jan 1849 0.9 2, Lambeth Hill +Peter WARBURTON 13 Mar 1823 47 Old Change +George WARD 30 Jul 1820 21d Lambeth Hill +Maria WARD 11 Dec 1849 43 2, Lambeth Hill +Martha WARD 12 Mar 1815 36 St Peter's Hill +Joseph WARHAM 22 Nov 1818 0.18 Green Arbour Court, Lambeth Hill +Edward WATERLANE 14 Sep 1826 32 Bread Street Hill +Henry Samuel WATT 01 Oct 1823 0.10 St Peter's Hill +John Francis WATTS 08 Dec 1813 3 Old Change +Mary WEEKS 23 Dec 1849 57 11, Little Carter Lane +Joshua WELCH 21 Apr 1828 25 Little Knight Rider Street +Sarah WELCH 23 Feb 1840 20 Old Fish Street +Sarah WELCH 23 Feb 1840 20 Old Fish Street +George WESTCOTT 04 Apr 1838 40 Crane Court Lambeth Hill +Mary WESTCOTT 17 Aug 1833 26 Knight Rider Court +Ann WHIFFEN 15 Dec 1824 42 St Peter's Hill +Peter WHITE 30 Nov 1851 70 5, Knight Rider Street +Ann WHITEHOUSE 18 Feb 1814 42 Lambeth Hill +William WHITEKER 02 Feb 1845 43 Peter's Hill +James Fredrk. WHITTAKER 05 Mar 1820 0.16 Little Fish Street Hill +John Butler WHITTAKER 20 Aug 1817 15w Lambeth Hill +Elizabeth WILD 22 Dec 1835 23 Lambeth Hill +John WILD 17 Aug 1817 64 St George's Court, St Bennets Hil +John WILLIAMS 18 May 1834 40 Old Change +Susannah WILLIAMS 13 Nov 1842 56 Green Arbour Court +Ann WILLOUGHBY 04 Feb 1818 67 Green Arbour Court, Lambeth Hill +John WILLSON 16 Apr 1826 25 Little Carter Lane +Robert WILLSON 04 Jan 1817 19 Crane Court Lambeth Hill +Samuel WILLWARD 25 Apr 1813 63 Lambeth Hill +Jane WILSON 01 Nov 1816 46 Little Knight Ryder Street +Joseph WILSON 06 Jun 1835 2 Green Arbour Court, Lambeth Hill +Samuel John WINDSOR 30 Apr 1817 0.2 Lambeth Hill +Jonathan WINSON 17 Feb 1822 34 Taylor's Court, Lambeth Hill +Charles WISE 22 Dec 1816 49 Lambeth Hill +Mary WISE 25 Jan 1820 44 Lambeth Hill +Jane WISHER 28 Apr 1833 0.11 Lambeth Hill +Jane WISHER 19 Dec 1851 50 4, Lambeth Hill +Sarah WISHER 27 Jan 1835 1 Lambeth Hill +Hannah WOOD 03 Mar 1830 7w Knight Rider Court +Samuel WOOLFE 05 Mar 1846 76 4, Lambeth Hill +Jacob WRAGG 23 Sep 1818 62 Little Knight Ryder Street +Margaret WRAGG 30 Oct 1819 73 Stangate Lambeth +William WRIGHT 24 Jan 1844 74 Greeham, East Kent +Benjamin Day YATES 16 Feb 1819 1.8 Sermon Lane +George YOUNG 11 May 1845 73 Peter's Hill diff --git a/01 Strings/07 Cemetery/cemetery_orig.txt b/01 Strings/07 Cemetery/cemetery_orig.txt new file mode 100644 index 0000000..2937212 --- /dev/null +++ b/01 Strings/07 Cemetery/cemetery_orig.txt @@ -0,0 +1,616 @@ + ST MARY MAGDALENE OLD FISH STREET CITY OF LONDON + Burials 5th Jan 1813 - 10th July 1853 +NAME BURIAL DATE AGE RESIDENTIAL ADDRESS +----------------------- ----------- --- ---------------------------- +John William ALLARDYCE 17 Mar 1844 2.9 Little Knight Ryder Street +Frederic Alex. ALLARDYCE 21 Apr 1844 0.17 Little Knight Ryder Street +Philip AMIS 03 Aug 1848 1 18 1/2 Knight Rider Street +Thomas ANDERSON 06 Jul 1845 27 2, Bennet's Hill +Edward ANGEL 20 Nov 1842 22 Crane Court Lambeth Hill +Sarah ANGELL 09 Oct 1836 42 Lambeth Hill +Sarah ANSELL 31 May 1829 29 High Timber St, Upper Thames St +Charles ANTHONY 22 Jul 1849 6 3,Taylor's Court, Lambeth Hill +Sarah Ann ANTHONY 06 Aug 1828 47 Lambeth Hill +Sarah ARLETT 27 May 1849 2 5, Little Knight Rider Street +Hannah AUSTIN 23 Feb 1819 41 Box MDX +Oliver AUSTIN 19 Feb 1816 0.5 Mile End +Rosina AUSTIN 07 Mar 1833 20 Mile End MDX +Hannah AYLIFF 18 Jul 1832 11 Lambeth Hill +Hannah AYLIFF 10 Dec 1834 44 Crane Court Lambeth Hill +William James AYLIFF 31 Jan 1819 0.2 Crane Court Lambeth Hill +George BAKER 08 Jan 1839 46 Knight Ryder Court +Caroline BARHAM 11 Jul 1851 56 6, Pelham Place, Brompton +Richard Harris BARHAM 21 Jun 1845 57 Residentary Ho. Amen Corner +Ann BARRY 21 Sep 1842 64 Bucks Head Court +Frederick BARTLETT 29 Nov 1839 0.11 Crane Court +Mary BATEMAN 31 Oct 1847 67 24, Lambeth Hill +John Gardner BATTEN 08 Dec 1819 0.18 Westham ESS +George BAXTER 08 Sep 1835 30 Knight Rider Court +Susanna BAXTER 05 Sep 1830 40 Crane Court Lambeth Hill +Mary BEARNARD 19 Oct 1834 21 Little Knight Ryder Street +Henry BEAUMONT 21 Nov 1813 1.9 Old Change +Mary Ann BEAUMONT 15 Dec 1813 27 Old Change +Thomas BEAUMONT 08 Jun 1833 0.4 Knowles Court +George Jacob BECK 19 Apr 1846 0.7 Sermon Lane +Eleanor BECKLEY 17 Nov 1850 1 4, Lambeth Hill +Mary Ann BECKWITH 29 Jun 1828 0.10 Crane Court Lambeth Hill +Sarah BECKWITH 21 Jan 1828 2.6 Crane Court Lambeth Hill +Henry Charles BENNET 01 Aug 1847 0.15 6, Lambeth Hill +Hannah BENNETT 26 Sep 1841 0.10 Lambeth Hill +Mary Wicks BENNETT 14 Apr 1850 38 6, Lambeth Hill +William BENNETT 05 Jul 1837 0.6 Lambeth Hill +William Perkins BENNETT 28 Dec 1845 3 Lambeth Hill +Wm. Geo. Perkins BENNETT 27 Mar 1836 0.5 Lambeth Hill +George BENSTEAD 02 Apr 1837 0.7 Lambeth Hill +John Stephen BENSTEAD 29 Mar 1839 0.8 Lambeth Hill +Ann Elizabeth BENYON 04 Jan 1814 26 Crane Court Lambeth Hill +Charles James BERRY 03 Mar 1841 34 Sermon Lane +Sarah BERRY 26 Jan 1817 0.21 Little Knight, Ryder Street +Philemon BETTS 11 Apr 1820 35 Upper Thames Street +Ann BIRCH 30 Oct 1850 75 1,Taylor's Court, Lambeth Hill +Elizabeth BIRCH 09 Aug 1829 58 Lambeth Hill +Elizabeth Ann BIRCH 07 Jul 1832 2w Lambeth Hill +Sarah BIRCH 12 Aug 1832 32 Green Dragon Crt, St Andrews Hill +Sarah Lucy BIRCH 26 Feb 1834 30 Lambeth Hill +Jane BIRCHILL 31 Mar 1839 18 New Street, St Bride's +Alfred BLACKLEDGE 26 Sep 1848 21 6,Green Arbour Court, Lambeth Hill +Charles BLACKLEDGE 07 Jan 1835 2 Green Arbour Court +Charles BLACKLEDGE 07 Aug 1831 0.18 Green Arbour Court +George BLACKLEDGE 30 Aug 1831 6 Green Arbour Court +Jane BLACKLEDGE 03 Jun 1821 32 Green Arbour Court +John BLACKLEDGE 27 Sep 1835 44 Green Arbour Court +Elizabeth BLACKMORE 24 Jan 1830 52 Lambeth Hill +Thomas BODKIN 13 May 1821 23 Crane Court Lambeth Hill +Frances BOTLEY 24 Dec 1816 8 Lambeth Hill +John BOWLES 17 Aug 1817 22 Green Arbour Court +Mary BOWLES 09 May 1838 33 Green Arbour Court +Mary BOWLES 01 Dec 1850 78 Green Arbour Court, Lambeth Hill +Ann BOX 08 Feb 1815 0.15 Crane Court Lambeth Hill +Jane BRADSHAW 09 Dec 1833 0.3 Crane Court Lambeth Hill +William BRAINTRUMP 15 Sep 1839 5 Lambeth Hill +Sarah BRINDLE 11 Aug 1816 74 Taylor's Court +William BROOKES 24 Feb 1822 1 Green Arbour Court, Lambeth Hill +Elizabeth BROWN 13 Oct 1839 33 High Holborn +John BROWN 11 May 1845 26 Parr's Head Corner Peters Hill +Angelina BUCKLEY 28 Jan 1851 38 3, Morris Yard, Old Fish Street +Jacob George BUCKLEY 22 Nov 1840 0.3 Lambeth Hill +Ann BUCKMASTER 06 Apr 1817 3.10 Lambeth Hill +Mary Ann BUFFHAM 25 Jun 1839 3 Green Arbour Court, Lambeth Hill +Sarah BUNKER 01 Jul 1817 47 Little Knight Ryder Street +William BURCH 02 May 1847 71 4, Lambeth Hill +Lucy BURGESS 21 Dec 1834 45 Little Knight Ryder Street +Henry BURGMAN 21 Jan 1838 76 Little Knight Ryder Street +Ann BURGOYNE 28 Aug 1823 5 White Cross St, Cripplegate +Ann BURGOYNE 02 Sep 1833 55 Little Knight Ryder Street +John BURGOYNE 20 Nov 1814 3.9 Friars Streets Blackfriars +John BURGOYNE 05 Jan 1834 53 Little Knight Ryder Street +Mary BURGOYNE 20 Jun 1813 33 Lambeth Hill +Thomas BURGUIN 17 Mar 1816 62 Knight Rider Court +Ann CARDWELL 24 Jul 1842 48 Green Arbour Court, Lambeth Hill +Jane CAREY 31 Jan 1830 0.3 Taylor's Court, Lambeth Hill +Ann Charlotte CARPENTER 21 Nov 1851 76 14, Park Place Peckham +James CARPENTER 05 Jun 1838 67 Peckham SRY +Joseph CARPENTER 18 Jun 1829 13 Peckham SRY +Elizabeth CARTER 17 May 1842 74 Green Arbour Court, Lambeth Hill +Henry Eli CASTLEMAN 24 Sep 1839 30 Old Change +Priscilla Mary Ann CAVE 08 Mar 1814 1.2 Lambeth Hill +Mary CHAMBERS 21 Nov 1830 70 Lambeth Hill +William CHAMBERS 13 Mar 1827 75 Lambeth Hill +Charles CLARK 26 Mar 1826 2.3 Brew Street Hill +Elizabeth CLARK 23 Aug 1818 64 Lambeth Hill +Emma CLARK 14 Oct 1849 4 15, Old Change +George CLARK 09 Dec 1821 68 Lambeth Hill +Isabella CLARK 08 Apr 1813 7d Little Knight Ryder Street +Mary Jane CLARK 12 May 1838 20 Old Change +William Penn CLARK 21 Apr 1833 40 Bell Square, Bishopsgate +Thomas CLOSE 29 Jun 1824 55 Little Knight Ryder Street +Ellen COCHRAM 11 Jun 1848 42 27, Addle Hill +John COCKERING 19 Dec 1849 7 18, Old Change +Elizabeth COCKHEAD 09 Jun 1850 21 New Street, Blackfriars +Eliza Erinder COGGER 04 Nov 1823 0.10 Peters Hill +Lucy Ann COLEBACK 23 Jul 1843 4w Lambeth Hill +Charles COLES 01 Dec 1833 2 Great Carter Lane +Eliza COLES 16 Apr 1826 10 Crane Court Lambeth Hill +Jane COLES 05 Jul 1832 5 Great Carter Lane +John COLES 09 Oct 1836 17 Great Carter Lane, Doctors Commos +William COLES 28 Apr 1833 3.10 Great Carter Lane +Richard COLLETT 01 Oct 1843 39 Old Change +Thomas William COLLEY 08 Aug 1833 4d Lambeth Hill +Joseph COLLIER 03 Apr 1831 58 Lambeth Hill +James Robert COLLINS 25 Mar 1834 1.6 Lambeth Hill +Sarah COLLINSON 15 Sep 1839 0.2 Knight Rider Court +John Speechley COOK 09 Mar 1817 2 Great Carter Lane +Elizabeth COOKE 27 Aug 1825 39 Crew Lane +Emma COOKSON 16 Jul 1826 0.3 Old Change +Emma COOKSON 16 Jul 1826 0.3 Old Change +Elizabeth COSTER 24 Sep 1826 42 Crane Court Lambeth Hill +Mary COWLING 13 Nov 1825 0.10 Lambeth Hill +Mary Ann COX 08 Aug 1833 4d St Peters Hill +Alice CRAGG 11 Aug 1834 2 Taylor's Court, Lambeth Hill +John CRAGG 19 Aug 1832 34 Green Arbour Court, Lambeth Hill +John CROCKFORD 16 Jul 1834 67 Crane Court Lambeth Hill +Harriot CROFT 08 Oct 1819 31 Portpool Street St Andrews Holbon +Margaret CROFT 20 Jan 1819 0.2 Little Knight Ryder Street +James CROLL 19 Apr 1829 43 Lambeth Hill +Charles CROOT 09 Jun 1818 2 Windsor Crt Little Knight Rider Court +Charles Neal CUMMINGS 12 Dec 1825 18 Great Carter Lane +Ann CUMMINS 16 Jun 1832 66 Great Carter Lane +Thomas CUNNINGHAM 07 Jun 1846 17 21, Lambeth Hill +Ann DALBY 11 Aug 1839 60 Green Arbour Court, Lambeth Hill +Thomas DALBY 18 Apr 1841 25 Green Arbour Court, Lambeth Hill +William DALBY 29 May 1842 65 Green Arbour Court, Lambeth Hill +William DAVIS 28 Jun 1845 71 Ludgate Street +William DAWES 25 Aug 1833 65 Taylor's Court, Lambeth Hill +Mary DAWSON 20 Oct 1850 62 14, Sermon Lane +James DAY 22 Jan 1815 0.13 Sermon Lane +John DAY 17 Nov 1819 1 Sermon Lane +Richard DAY 29 Apr 1819 36 Sermon Lane +Mary Ann DEACH 29 Oct 1843 0.22 Lambeth Hill +Jane DERBYSHIRE 19 Jan 1817 2 Old Change +William DEVEY 21 Dec 1834 0.3 Green Arbour Court, Lambeth Hill +Henry DIAL 07 Jun 1836 2w Crane Court Lambeth Hill +Frederick DILLAY 04 May 1834 2 Little Carter Lane +Richard DILLEY 26 Jan 1837 46 Little Carter Lane +William DOLBY 20 Jul 1824 5.6 Green Arbour Court, Lambeth Hill +Charles DORSETT 01 Oct 1848 0.6 4, Lambeth Hill +Mary DOUGLAS 26 Jan 1839 0.14 Knight Rider Street +Elizabeth DOWNES 04 Jun 1837 48 Taylor's Court, Lambeth Hill +John DRAKE 21 Apr 1833 50 Lambeth Hill +Elizabeth DUDLEY 03 Oct 1847 73 1,Taylor's Court, Lambeth Hill +Sarah DUNN 27 Oct 1816 55 Christ Church SRY +Amelia DYSON 06 Dec 1814 0.6 Old Change +Hannah DYSON 24 Mar 1819 60 High Street. Marylebone MDX +Robert Joseph DYSON 05 Jan 1813 1.6 Old Change +Thomas DYSON 18 Sep 1813 0.10 Old Change +William EADES 19 Aug 1818 5 Taylors Court Lambeth Hill +Edwin EARDLEY 08 Dec 1833 25 Little Knight Rider Street +Henry EDMONDS 09 Apr 1826 38 Old Change +William EDMUNDS 03 Feb 1825 60 Lambeth Hill +George EDWARDS 11 Jul 1813 49 Taylors Court Lambeth Hill +Harriet Sarah ELLARD 16 Jun 1844 0.11 Lambeth Hill +John Yates ELLIS 29 Nov 1830 5d Little Knight Rider Street +Thomas ELLIS 15 Mar 1829 0.10 Knight Rider Court +James ENTWISLE 22 May 1819 40 Little Knight Ryder Street +Mary Ann ESCOTT 26 Aug 1821 0.3 Crane Court Lambeth Hill +John EVANS 26 Aug 1819 11 Lambeth Hill +William EVANS 13 Nov 1814 1.2 Green Arbour Court, Lambeth Hill +Jane EXTON 26 Mar 1815 54 Green Arbour Court, Lambeth Hill +Lewis FACHE 28 Dec 1823 0.10 Crane Court Lambeth Hill +Mary FACHE 09 Jun 1822 0.18 Crane Court Lambeth Hill +Mary FARMFIELD 05 Mar 1843 64 Lambeth Hill +Elizabeth FARROW 20 Dec 1819 65 Green Arbour Court, Lambeth Hill +Edward FELLOWES 28 Apr 1833 2 Taylor's Court, Lambeth Hill +Lydia FELLOWS 28 Jan 1844 33 Lambeth Hill +William Henry FELLOWS 28 Jun 1837 0.13 Lambeth Hill +Mary Ann FERRIDAY 16 Mar 1851 69 2, Fish Street +Mary FIELD 20 Feb 1829 0.3 Lambeth Hill +Harriett FINCH 01 Feb 1852 0.9 Green Arbour Court, Lambeth Hill +George FLANDERS 16 Aug 1837 0.3 St Peters Hill +Louisa FLANDERS 25 Jun 1839 9.3 St Peters Hill +William FLANDERS 19 May 1833 2.6 St Peters Hill +William FLANDERS 28 Nov 1847 50 15 Labour in Vain Yard Lambeth Hill +Elizabeth FLINTAN 20 Jul 1832 39 Green Arbour Court, Lambeth Hill +Jane FLUDE 01 Nov 1832 58 Little Knight Ryder Street +Elizxabeth FOON 25 Aug 1833 14 Green Arbour Court, Lambeth Hill +George FOON 28 May 1816 0.19 Green Arbour Court, Lambeth Hill +John FOON 09 Jun 1816 4 Green Arbour Court, Lambeth Hill +John FOON 10 Jan 1841 60 Green Arbour Court, Lambeth Hill +William FOONE 16 May 1847 24 3, Green Arbour Court, Lambeth Hill +Levina FRANCIS 11 Aug 1844 6 Bennetts Hill +William FROSTICK 06 Nov 1825 1.8 Lambeth Hill +Elizabeth GABRIEL 30 Apr 1834 18 Lambeth Hill +George GALE 17 Nov 1833 6 Crane Court Lambeth Hill +Elizabeth GALLANT 27 Aug 1848 11 10, Crane Court +Esther GALLERY 01 Jun 1813 62 Taylor's Court, Lambeth Hill +Elizabeth GARDENER 13 Mar 1836 30 Knight Riders Court +James GARDNER 05 Jan 1826 0.16 Taylor's Court, Lambeth Hill +Sarah GARDNER 24 Nov 1831 50 Crane Court Lambeth Hill +Augusta Sophia GAUGIN 04 Nov 1821 16 Knowles Court +Jane GIBBS 10 Jul 1839 0.11 Green Arbour Court, Lambeth Hill +Martha GILES 12 Dec 1813 25 Green Arbour Court, Lambeth Hill +Thos Henry David GILHAM 17 Apr 1853 37 12,Little Knight Ryder Street +Eliza GLEESON 12 Mar 1815 0.18 Knight Rider Court +Caroline GODFREY 29 May 1821 0.4 Taylor's Court, Lambeth Hill +Elizabeth GODFREY 09 Jul 1818 2 Taylor's Court, Lambeth Hill +John GODFREY 24 Apr 1817 2 Crane Court Lambeth Hill +Louisa GODFREY 29 May 1821 0.4 Taylor's Court, Lambeth Hill +Eliza GOODALL 06 Apr 1845 28 Little Carter Lane +James GOODHALL 08 Oct 1843 49 Green Arbour Court, Lambeth Hill +Johanna GOODWIN 12 May 1815 86 Green Arbour Court, Lambeth Hill +Henry GOODYEAR 28 Jul 1850 14.9 12, Little Carter Lane +Abraham GOYMER 02 Sep 1839 48 Globe Road, Mile End +Abraham GOYMER 11 Dec 1823 5d Old Fish Street +Abraham Frederic GOYMER 06 Nov 1825 0.11 Old Fish Street +Amelia GOYMER 01 Mar 1831 0.10 Old Fish Street +Henry Robert GOYMER 20 May 1821 1.11 Old Fish Street +Sarah Augusta GOYMER 21 Nov 1833 0.8 Old Fish Street +Elizabeth GREEN 28 Dec 1814 2.9 Carter Lane +John GREEN 09 Dec 1814 4.6 Little Carter Lane +Sarah GREEN 25 Mar 1821 53 Little Carter Lane +William GREEN 07 Feb 1830 61 Old Change +William George GREEN 22 May 1839 35 Little Carter Lane +Charles GREENWOOD 18 Feb 1814 33 Old Fish Street +William GRIFFIN 12 Aug 1827 0.10 Lambeth Hill +Sarah Jane GRIFFITHS 13 Oct 1833 2.8 Sermon Lane +John GROVER 01 Feb 1814 5 Taylor's Court, Lambeth Hill +Sarah GROVER 04 Feb 1849 30 4, Taylor's Court, Lambeth Hill +Amelia GYDE 10 Nov 1839 0.1 Lambeth Hill +Thomas HALL 02 Mar 1845 64 Green Arbour Court, Lambeth Hill +Clara HANDLEY 19 Nov 1845 1 Lambeth Hill +John HARRIS 02 Jul 1837 62 Lambeth Hill +John Francis HARRIS 16 Jan 1842 0.20 Peter's Hill +Rosetta HARRIS 22 Jan 1837 74 Lambeth Hill +John HART 22 Jan 1826 51 Old Change +Henry HARTRUP 24 Oct 1813 1.7 Green Arbour Court, Lambeth Hill +Joseph HARTRUP 23 Dec 1818 2 Green Arbour Court, Lambeth Hill +Samuel HARTRUP 19 Mar 1815 0.2 Green Arbour Court, Lambeth Hill +William Matthew HASSALL 28 Nov 1852 0.3 2, Old Fish Street +Jane Charlotte HAWARD 22 Sep 1821 2w Little Carter Lane +Eleanor HAWKINS 14 Sep 1817 0.13 Canterbury Court, St Andrews Hil +Elizabeth Sarah HAWKINS 26 Nov 1838 4.2 Green Arbour Court, Lambeth Hill +Mary HAWKINS 01 Jul 1821 53 Knight Rider Court +Sarah Jane HAWKINS 30 Nov 1817 3 Canterbury Court, St Andrews Hill +Thomas HAWKINS 13 Dec 1818 55 Sermon Lane +Alice HAY 17 Nov 1850 57 6, Green Arbour Court, Lambeth Hill +James HEALD 13 Apr 1847 56 24, Old Change +Martha HEALD 03 Mar 1841 48 Lambeth Hill +William HEALD 21 Jul 1850 14 Old Change +Thomas HEATH 22 May 1836 72 Lambeth Hill +Robert HENDRY 28 Nov 1824 43 Labour in Vain Yard +William HENLEY 11 Dec 1814 43 Bottle Hay Yard +Robert HENRY 30 Jan 1814 66 Lambeth Hill +Ann HIBBLE 28 Aug 1833 53 Lambeth Hill +James HIBBLE 24 Jul 1833 75 Lambeth Hill +James HILLUM 26 Sep 1839 39 Knight Rider Court +James HINES 17 Jan 1813 40 Lambeth Hill +Elizabeth HOBART 19 Apr 1833 36 Little Knight Ryder Street +Janes HOLLOWAY 15 Jul 1818 0.10 Lambeth Hill +John HOLLOWAY 05 Jun 1821 6 Lambeth Hill +Elizabeth HOLMAN 08 Nov 1835 1.5 Little Carter Lane +William Henry HOLMAN 26 Apr 1835 14 Little Carter Lane +John HOOD 15 Dec 1844 51 Carter Lane +Robert HOOPER 16 Sep 1824 0.9 Green Arbour Court, Lambeth Hill +William HOOPER 25 Sep 1839 19 Green Arbour Court, Lambeth Hill +Martha HOPKINS 18 Mar 1825 84 Taylor's Court, Lambeth Hill +Henry HORNER 06 Apr 1847 45 Knowles Court +Benjamin HOTINE 15 Feb 1829 53 Little Knight Rider Street +Mary HOTINE 27 Oct 1819 49 Lambeth Hill +John HUGGINS 09 May 1849 47 6, Lambeth Hill +Edwin HUGHES 11 Sep 1829 5d Lambeth Hill +Hannah HUGHES 11 Sep 1829 25 Lambeth Hill +Elizabeth HULCUP 09 Jan 1814 2.6 Old Change +William HURN 06 Feb 1826 0.2 Lambeth Hill +Mary Harris HUTCHINSON 14 May 1837 2 Little Carter Lane +Mary Ann ISLIP 20 Dec 1840 4 Lambeth Hill +James JACKSON 19 May 1822 0.10 Friday Street +Mary Ann JACKSON 31 Jul 1814 1.3 Knowles Court +Sarah JACKSON 05 Dec 1819 68 Labour in Vain Crt, Little Fish +Simmons JACKSON 24 Oct 1819 4 Friday Street +Mary JARRAL 04 Oct 1824 69 Lambeth Hill +James JARRETT 11 May 1851 39 12,Crane Court Lambeth Hill +Thomas JARVIS 23 Apr 1825 39 Little Knight Ryder Street +Susan JEWELL 17 Mar 1850 0.5 10, Little Carter Lane +James JOHNS 13 Jan 1842 51 Lambeth Hill +Richard JOHNS 13 Mar 1827 28 Knight Rider Court +Eliza Sarah JOHNSON 06 Jan 1822 2.6 Lambeth Hill +George JOHNSON 05 Feb 1817 64 Taylor's Court, Lambeth Hill +Sarah JOHNSON 28 Jan 1827 41 Lambeth Hill +Caroline JONES 31 Oct 1821 0.15 St Peters Hill +Elizabeth JONES 12 Jul 1815 0.21 Lambeth Hill +Elizabeth JONES 20 Jan 1822 61 Little Carter Lane +George JONES 18 Mar 1827 0.13 Bell Inn Yard, Friday Street +James John JONES 12 Aug 1832 37 Knight Rider Court +John JONES 27 May 1819 60 Windsor Crt, Little Knight Rider +John Amos JONES 02 Nov 1828 0.9 Bell Inn Yard, Friday Street +Margaret JONES 14 Apr 1833 58 Crane Court Lambeth Hill +Martha JONES 09 Jun 1850 7 9, Little Carter Lane +Mary Ann JONES 27 Sep 1849 8 20,Lambeth Hill +Rebecca JONES 01 Dec 1833 86 Green Arbour Court, Lambeth Hill +William JONES 08 Nov 1835 40 St Bartholomew's Hospital +William JOPP 10 Sep 1833 24 Great Trinity Lane +William JOPP 01 May 1834 0.8 Oxford Street +Anne JORDAN 25 Nov 1832 36 Knight Ryder Court +Frances Ann JORDAN 14 May 1827 3.4 Knight Ryder Court +Joseph KELLY 31 Dec 1815 27 Little Knight Ryder Street +Clara KEMSHEAD 21 May 1843 3.6 25, Lambeth Hill +Richard KEMSHEAD 21 Feb 1841 35 Lambeth Hill +Hannah KENDRICK 27 Nov 1831 71 Crane Court Lambeth Hill +Hannah KENDRICK 06 Dec 1821 0.11 Old Change +Daniel KENSEY 04 Nov 1825 3d Knight Rider Court +Thomas Joel James KENSEY 27 Mar 1822 4 Lambeth Hill +Henry KERR 05 Dec 1823 3 Little Knight Ryder Street +William KNIGHT 30 Mar 1828 35 Knight Rider Court +Frederick KOPP 20 Dec 1818 45 Kings Head Crt, Little Carter Lane +Mary LANGDON 15 Mar 1813 36 Blackheath Hill Kent +William LANGLEY 27 Feb 1820 42 Old Change +Henry Richard LAVIS 24 Oct 1848 0.5 7, Lambeth Hill +Sarah Ann LAVIS 15 Oct 1848 2 7, Lambeth Hill +Chas Nathaniel LAWRENCE 02 Dec 1838 10 Old Change +Frances LEAVER 25 Nov 1830 28 Little Knight Ryder Street +Charles LEE 16 Mar 1828 0.13 Sermon Lane +George Edwin LEE 22 Apr 1830 5 Little Carter Lane +Hannah LEE 21 Apr 1844 53 Sermon Lane +Hannah LEE 30 May 1852 22 17,Sermon Lane +Samuel LEE 26 Jul 1834 5.9 Sermon Lane +Jane LEGG 10 Feb 1833 26 Green Arbour Court, Lambeth Hill +John LESTER 22 May 1814 61 St Mary, Lambeth +Mary LEWIN 18 Aug 1850 63 7,Little Knight Ryder Street +Catherine LINCH 27 May 1813 0.2 Green Arbour Court, Lambeth Hill +John LINCK 22 May 1814 0.7 Taylor's Court, Lambeth Hill +Martin LINCK 05 Mar 1817 0.7 Taylor's Court, Lambeth Hill +Sarah LINSELL 24 Dec 1828 62 Taylor's Court, Lambeth Hill +Thomas LINSELL 15 Jan 1832 63 At Andrews Hill +Mary LINSELL 22 Dec 1844 43 Crane Court Lambeth Hill +Samuel LITTLE 23 Feb 1851 2 3, Taylor's Court, Lambeth Hill +Harriet LLOYD 17 Aug 1831 1.9 Lambeth Hill +Richard LLOYD 03 Feb 1830 40 Lambeth Hill +James LOOKER 01 Dec 1825 2.6 Lambeth Hill +John LOOKER 11 Sep 1831 45 Lambeth Hill +John Edward LOOKER 20 Jul 1831 0.20 Lambeth Hill +Thomas LOOKER 09 May 1824 2.10 Lambeth Hill +Wilhelmina Lydia LOVE 22 Aug 1820 0.10 Lambeth Hill +Hannah LUCAS 27 Dec 1829 67 Taylor's Court, Lambeth Hill +William LYALL 05 Jan 1851 63 23 Peter's Hill +Daniel LYONS 27 Apr 1834 1.6 Green Arbour Court, Lambeth Hill +Thomas LYONS 03 Apr 1833 2 Green Arbour Court, Lambeth Hill +Elizabeth MACKEY 10 Apr 1853 77 193, Upper Thames Street +Richard Jebb MADELEY 18 Jul 1813 1.4 Green Arbour Court, Lambeth Hill +John Sadler MAIL 07 Mar 1816 3 Sermon Lane +Richard MALLON 17 Feb 1850 0.2 23, Lambeth Hill +George Henry MANN 16 Jun 1822 0.13 Lambeth Hill +Elizabeth MANNING 07 Oct 1818 0.10 Little Carter Lane +Sarah MARCHANT 20 May 1850 87 12, Sermon Lane +William MARCHUM 15 Dec 1822 22 Taylor's Court, Lambeth Hill +Ann MARECHAL 07 May 1837 73 Little Knight Ryder Street +Caroline MARECHAL 23 Apr 1820 22 Little Knight Ryder Street +Anthony Romney MARSHALL 05 Aug 1839 0.19 Little Knight Ryder Street +Frederick MARSHALL 05 Aug 1839 4 Little Knight Ryder Street +Mary Ann MARSHALL 25 Aug 1814 5 St Mildreds Crt Bread Street +Mary Louise MARSHALL 20 Dec 1839 5 Little Knight Ryder Street +Francis MARTIMORE 27 Jun 1824 64 Lambeth Hill +Edward MARTIN 09 Aug 1825 49 Lambeth Hill +Mary MARYON 06 Feb 1842 38 Boss Court Upper Thames Street +Simon MARYON 03 Mar 1841 41 Crane Court Lambeth Hill +Emma MASDON 13 Nov 1825 0.10 Lambeth Hill +George MASON 26 Oct 1837 0.5 Knight Rider Court +James MASON 12 Jun 1839 0.3 Crane Court Lambeth Hill +John MASON 23 Jun 1846 18 Crane Court Lambeth Hill +Richard MASON 12 Oct 1826 49 Lambeth Hill +Sarah MASON 02 Jun 1839 3.10 Crane Court Lambeth Hill +Sophie McGOWAN 06 Mar 1836 55 St Peters Hill +Nathaniel McGOWEN 20 Jan 1841 76 Lambeth Hill +Christianus MEADOWS 03 Apr 1823 67 Bell Court +Mary MEADOWS 07 Feb 1823 74 Taylor's Court, Lambeth Hill +Hannah MELLOR 20 Feb 1825 60 Bell Court, Great Carter Lane +Elizabeth MILLINGTON 23 Jan 1818 0.13 Lambeth Hill +Sarah MILLWARD 29 Oct 1841 84 Little Carter Lane +James MILNER 05 Apr 1830 61 Crown Court Old Change +Mary MILNER 14 Jul 1822 56 Old Change +Thomas MILWARD 02 Nov 1834 84 Lambeth Hill +Caroline MOLE 15 Nov 1840 63 Holiday Yard +Ann MOORES 02 Jul 1817 43 Fleet Market +Henry MORE 06 Jun 1814 0.14 Lambeth Hill +Charles MORGAN 22 Feb 1824 0.14 Crane Court Lambeth Hill +William James MORGAN 26 Jul 1833 0.15 Crane Court Lambeth Hill +Ann MORRIS 10 Jan 1819 76 Green Arbour Court, Lambeth Hill +Mary MORRIS 30 Mar 1828 96 Lambeth Hill +Thomas MORRIS 07 Apr 1815 71 Carter Lane, Old Change +Job MORTON 17 Dec 1813 45 St Bartholomews Hospital +Edward MOULL 25 Apr 1821 6w Green Arbour Court, Lambeth Hill +Robert MULLIS 29 Jun 1828 38 Sermon Lane +Ann MURRAY 13 Mar 1821 62 Green Arbour Court, Lambeth Hill +James MURRAY 15 Jan 1815 27 Taylor's Court, Lambeth Hill +Thomas William NEALE 03 Sep 1828 1 Lambeth Hill +Eliza NEGUS 12 Dec 1847 43 5, Lambeth Hill +Mary NETTLETON 02 Jan 1845 69 Knight Rider Court +Philadelphia NEWBLE 12 Jun 1818 25 Green Arbour Court, Lambeth Hill +John NEWHALE 04 Nov 1833 58 Woolwich Kent +Joseph NEWHALL 08 Jul 1833 61 Little Knight Ryder Street +Joseph NEWMAN 24 Sep 1843 1 Old Change +Caroline NICHOLAS 06 Feb 1834 6 Little Carter Lane +Francis NORIS 05 Feb 1837 45 Lambeth Hill +Mary Ann NORRIS 03 Oct 1849 18 7, Little Knight Ryder Street +Elizabeth Webb NORTWYCK 06 May 1818 37 Little Knight Ryder Street +Elizabeth NOTLEY 28 Jan 1819 5 Upper Thames Street +William NOTTLEY 30 Apr 1818 0.11 Printing Ho Yard Water Lane +Thomas Ebenezer OGILVY 19 Mar 1843 2.5 Little Knight Ryder Street +Jane Elizabeth ORAM 06 Apr 1817 0.22 Lambeth Hill +Sarah ORAM 21 Feb 1819 37 Lambeth Hill +Susannah ORAM 27 Apr 1817 60 Crane Court Lambeth Hill +Elizabeth ORTSON 03 Jan 1819 46 Crane Court Lambeth Hill +Susan OXFORD 08 Nov 1826 0.15 Crane Court Lambeth Hill +Elizabeth PARRY 12 Mar 1826 41 Old Change +Maria PARTRIDGE 20 Nov 1842 60 Great Trinity Lane +Amy PAYNE 29 Mar 1839 42 Little Carter Lane +Hannah PAYNE 02 Jul 1816 40 New Street, Shoe Lane +Elizabeth PEASTON 11 Dec 1842 0.11 Taylor's Court, Lambeth Hill +Alice Elizabeth PERKINS 30 Nov 1845 68 Bell Court, Temple Bar +Elizabeth PERKINS 25 Oct 1816 0.16 Green Arbour Court, Lambeth Hill +Emma PERKINS 11 Jul 1827 14w Lambeth Hill +Mary PERKINS 21 Sep 1814 1.3 Green Arbour Court, Lambeth Hill +Mary PERKINS 02 May 1833 45 Lambeth Hill +Robert PERKINS 29 Jun 1821 3 Green Arbour Court, Lambeth Hill +Stephen PERKINS 25 Mar 1838 19 Old Fish Street +Thomas PERKINS 31 Mar 1833 50 Lambeth Hill +Thomas Robert PERKINS 04 Sep 1814 6.7 Green Arbour Court, Lambeth Hill +Elizabeth Ann PETTIT 23 Mar 1819 38 Little Knight Ryder Street +Susannah PETTIT 14 May 1817 69 Blackheath Kent +Sarah PHILLIPS 26 Oct 1834 59 Lambeth Hill +Susan PHILLIPS 06 Jan 1828 61 Lambeth Hill +William PHILLIPS 22 Feb 1829 66 Crane Court Lambeth Hill +James PHILP 03 Aug 1837 0.4 Knight Rider Court +Mary PHILP 23 Dec 1838 46 Knight Rider Court +William PHILP 07 Jul 1833 16 St Peters Hill +William Andrew PINK 02 Jun 1816 1.9 Lambeth Hill +James PITT 07 Oct 1849 3 2,Lambeth Hill +William Earl PITT 07 Oct 1849 3 2,Lambeth Hill +Charles PLUMRIDGE 21 Nov 1849 0.14 4, Green Arbour Court +William PLUMRIDGE 25 Aug 1833 75 Taylor's Court, Lambeth Hill +George POCOCK 09 Jun 1814 35 St Bartholomew's Hospital +Georgina POWELL 24 Jul 1830 43 Little Carter Lane +Robert POWELL 13 Oct 1837 1 Knight Rider Court +Henry PRESCOTT 17 Sep 1817 0.11 Lambeth Hill +Elizabeth PRICE 30 Jan 1825 53 Noble Street, St Lukes MDX +Hiram PRICE 01 Aug 1820 60 Lambeth Hill +Mary Ann PRICE 18 Jul 1832 9 Lambeth Hill +William PRICE 16 Mar 1828 30 Knight Rider Court +Philip John PRUDORN 19 Dec 1838 40 Sermon Lane +Alfred PRYCE 17 Nov 1850 1 1, Sermon Lane +Jane PUZEY 27 Aug 1829 0.13 Crane Court Lambeth Hill +George RADFORD 23 Sep 1824 18 St Peters Hill +William RADFORD 13 Feb 1826 57 St Peters Hill +George READ 20 Aug 1833 66 Green Arbour Court, Lambeth Hill +Mary Ann READ 30 Apr 1815 0.9 Little Knight Ryder Street +Sarah READ 05 May 1833 65 Green Arbour Court, Lambeth Hill +John REDDALL 22 Aug 1834 72 Sermon Lane +Jane REDHALL 28 Dec 1816 59 Sermon Lane +Alfred RENWELL 22 May 1842 0.18 Crane Court Lambeth Hill +Jane RICHARDS 21 Aug 1831 7w Green Arbour Court, Lambeth Hill +Mary RICHARDS 07 Feb 1819 3 Stepney MDX +Mary RICHARDS 26 Oct 1819 82 Lambeth SRY +Thomas RICHARDS 06 May 1819 44 Taylor's Court, Lambeth Hill +William RICHARDS 09 Jan 1818 43 John Street, St George MDX +Hubert Paul RIVOUS 07 Apr 1835 15 Little Knight Rider Street +Elizabeth ROBERTS 28 May 1839 1.11 Green Arbour Court, Lambeth Hill +Geroge Henry ROBERTS 20 Oct 1839 0.3 Green Arbour Court, Lambeth Hill +John ROCKELL 09 Aug 1835 69 Taylor's Court, Lambeth Hill +Jane ROCKLE 03 Aug 1845 74 6, Lambeth Hill +Harriet RODGERS 06 Jan 1820 61 Pratt Street, Lambeth +Hannah ROGERS 10 Nov 1824 5 Knight Rider's Court +Maria ROSE 29 Jun 1828 8 Taylor's Court, Lambeth Hill +Henry ROSS 22 Aug 1841 37 Little Carter Lane +Charles ROWLEY 03 Nov 1822 79 Old Change +Martha RUSS 20 Jun 1816 66 Green Arbour Court +Richard RUSS 13 Sep 1818 68 Little Fish Street Hill +Alfred RYDER 15 Jan 1843 2.6 Sermon Lane +Margaret RYDER 03 Jul 1814 64 Knight Rider Court +Emma SALIS 23 Jul 1833 2w Knight Rider Court +Nicholas SANDELL 08 Apr 1821 50 Old Change +Mary Ann SARGENT 14 Dec 1835 0.10 Taylor's Court, Lambeth Hill +William SARGENT 15 Feb 1829 0.5 Lambeth Hill +William John SARJANT 08 Jun 1838 5w Taylor's Court, Lambeth Hill +Mary SARTINE xx Sep 1815 64 Taylor's Court, Lambeth Hill +Ann SAUNDERS 21 May 1852 90 1, Taylor's Court, Lambeth Hill +George SAYER 21 Aug 1813 3.3 Old Change +Christian SCHINDLER 27 Jan 1830 58 Knowles Court Little Carter Lane +Bella SCOTT 04 Jun 1840 11 Lambeth Hill +Henry SEATORN 22 Feb 1814 4.9 Lambeth Hill +Jane SEATORN 08 Feb 1814 1.11 Lambeth Hill +Sarah SEDGWICK 31 Jul 1821 49 St Peter's Hill +Henry SHIPMAN 02 Nov 1826 39 Little Carter Lane +Martha SHIPMAN 28 Apr 1850 69 9, Crane Court Lambeth Hill +Ann SHIRMER 17 Feb 1822 26 St Peter's Hill +James SHORT 22 Sep 1822 22 Little Knight Ryder Street +William SHURRY 25 Jan 1818 0.1 Little Carter Lane +Ann SKATES 08 Oct 1837 50 Green Arbour Court, Lambeth Hill +Janet SKEENE 31 Dec 1829 63 Little Knight Rider Street +John SMALE 22 Jul 1832 51 Green Arbour Court, Lambeth Hill +Ann SMITH 26 Jan 1845 31 Sermon Lane +Ann Harriett SMITH 16 Oct 1847 3 25, Lambeth Hill +George Trinity SMITH 18 Aug 1822 29 Lambeth Hill +Mary Ann SMITH 26 Nov 1813 2 Workhouse +Richard SMITH 04 Aug 1817 35 Crane Court Lambeth Hill +Richard Ann SMITH 01 Apr 1813 0.3 Lambeth Hill +Sophia SMITH 05 Feb 1815 18 Little Knight Ryder Street +Thomas SMITH 20 Oct 1823 28 Old Change +Thomas SNOWDEN 05 Aug 1814 43 Knowles Court +Clara Emmeline SPEECHLEY 16 Dec 1838 3.5 Christ Church Surrey +Eliza Ellen SPEECHLEY 28 Feb 1836 3 Prujean Square Old Bailey +John SPEECHLEY 03 May 1821 68 Sidney Street, Islington MDX +John Edward SPEECHLEY 09 Nov 1828 4 Sermon Lane +Thomas Henry SPEECHLEY 07 Mar 1830 3.6 Sermon Lane +William SPEED 07 Jun 1846 0.3 24, Peters Hill +Mary SPRINGH 24 Mar 1816 4d St Peter's Hill +Maria STAINES 28 Nov 1840 0.3 Lambeth Hill +William STEDMAN 17 Feb 1813 0.7 Crane Court +Eliza STEVENS 06 Mar 1822 0.11 Bells Court, Docotr's Commons +Elizabeth STEVENS 23 Mar 1817 66 Green Arbour Court, Lambeth Hill +Emily Esther STEVENS 22 Apr 1832 1.7 Bell Court, Doctors Commons +John Paul STEVENS 17 Jan 1827 66 Crane Arbour Court +Maria STEVENS 16 Nov 1820 1.9 Bell Court, Doctor's Commons +William Nick STEVENS 07 Feb 1847 21 Bell Court +James STEWART 05 Apr 1829 4w Sermon Lane +Sarah STEWART 11 Dec 1831 1.9 St Johns Street, Smithfield +Mary STRAITON 08 Nov 1835 2.10 Little Knight Ryder Street +William STRANGE 03 Apr 1853 44 19, Little Knight Ryder Street +Elizabeth Lydia STRATTON 17 Aug 1834 25 Sermon Lane +Joseph STRICKFIELD 19 Jul 1835 0.4 Lambeth Hill +Thomas STRICKLAND 11 Sep 1835 73 Little Knight Ryder Street +Margaret TALBOTT 01 Dec 1833 31 Little Carter Lane +Henry TAPP 17 Aug 1845 57 Crane Court Lambeth Hill +Mary TAYLOR 23 Jan 1814 22 Knight Rider Court +Joseph TEMPEST 26 Dec 1841 73 Taylor's Court, Lambeth Hill +Henry THEED 17 Mar 1842 37 Sermon Lane +John THEOBALD 23 Mar 1817 45 Lambeth Hill +Mary THOMPSON 21 Mar 1844 82 Sermon Lane +Sarah THOMPSON 07 May 1844 78 Lambeth Hill +William THOMPSON 10 Oct 1839 75 Green Arbour Court, Lambeth Hill +Ann THOMSON 26 Mar 1820 63 Red Lion Street, Holborn +David THOMSON 29 Jan 1837 5 Old Change +Robert THOMSON 04 Aug 1813 25 Fleet Market +George THORNTON 03 Sep 1820 60 Lambeth Hill +Agnes TINDALL 15 Mar 1818 0.19 Kings Head Crt Little Carter Lan +John TINDALL 19 Oct 1815 0.7 Green Arbour Court, Lambeth Hill +Elizabeth TINKLER 22 Mar 1846 66 Little Carter Lane +William TRACEY 31 May 1849 2 8, Green Arbour Court +James Frederick TRAYLEN 10 Jul 1828 0.4 Little Carter Lane +Charles TRIMMING 17 Aug 1837 15 Taylor's Court, Lambeth Hill +Maria Ann TUCKER 30 Aug 1815 0.8 Green Arbour Court, Lambeth Hill +William TYRRELL 25 Dec 1822 0.2 Lambeth Hill +Moot VALENTINE 14 Sep 1832 43 Crane Court Lambeth Hill +Joseph VERE 11 Feb 1819 65 Cloth Fair, Smithfield +George Frederick VIGOR 23 Nov 1828 2 Little Knight Ryder Street +Sarah VINCE 14 Aug 1831 1 Lambeth Hill +Penfold WAKEFIELD 18 Feb 1844 4.8 Knight Rider Court +Stephen C WAKEFIELD 12 Aug 1851 53 1, Knight Rider Court +Caroline Lydia WALKER 17 Mar 1817 0.1 Little Knight Ryder Street +Charlotte WALKER 17 Aug 1851 0.7 20, Lambeth Hill +John Henry WALKER 08 Jul 1829 0.5 Knight Rider Court +Mary WALKER 27 Nov 1817 30 Little Knight Ryder Street +Eliza WALLINGER 20 May 1821 0.10 Taylor's Court, Lambeth Hill +Mary Ann WALLINGER 02 Aug 1818 1.6 Taylor's Court, Lambeth Hill +William Isaac WALSHAM 21 Jan 1849 0.9 2, Lambeth Hill +Peter WARBURTON 13 Mar 1823 47 Old Change +George WARD 30 Jul 1820 21d Lambeth Hill +Maria WARD 11 Dec 1849 43 2, Lambeth Hill +Martha WARD 12 Mar 1815 36 St Peter's Hill +Joseph WARHAM 22 Nov 1818 0.18 Green Arbour Court, Lambeth Hill +Edward WATERLANE 14 Sep 1826 32 Bread Street Hill +Henry Samuel WATT 01 Oct 1823 0.10 St Peter's Hill +John Francis WATTS 08 Dec 1813 3 Old Change +Mary WEEKS 23 Dec 1849 57 11, Little Carter Lane +Joshua WELCH 21 Apr 1828 25 Little Knight Rider Street +Sarah WELCH 23 Feb 1840 20 Old Fish Street +Sarah WELCH 23 Feb 1840 20 Old Fish Street +George WESTCOTT 04 Apr 1838 40 Crane Court Lambeth Hill +Mary WESTCOTT 17 Aug 1833 26 Knight Rider Court +Ann WHIFFEN 15 Dec 1824 42 St Peter's Hill +Peter WHITE 30 Nov 1851 70 5, Knight Rider Street +Ann WHITEHOUSE 18 Feb 1814 42 Lambeth Hill +William WHITEKER 02 Feb 1845 43 Peter's Hill +James Fredrk. WHITTAKER 05 Mar 1820 0.16 Little Fish Street Hill +John Butler WHITTAKER 20 Aug 1817 15w Lambeth Hill +Elizabeth WILD 22 Dec 1835 23 Lambeth Hill +John WILD 17 Aug 1817 64 St George's Court, St Bennets Hil +John WILLIAMS 18 May 1834 40 Old Change +Susannah WILLIAMS 13 Nov 1842 56 Green Arbour Court +Ann WILLOUGHBY 04 Feb 1818 67 Green Arbour Court, Lambeth Hill +John WILLSON 16 Apr 1826 25 Little Carter Lane +Robert WILLSON 04 Jan 1817 19 Crane Court Lambeth Hill +Samuel WILLWARD 25 Apr 1813 63 Lambeth Hill +Jane WILSON 01 Nov 1816 46 Little Knight Ryder Street +Joseph WILSON 06 Jun 1835 2 Green Arbour Court, Lambeth Hill +Samuel John WINDSOR 30 Apr 1817 0.2 Lambeth Hill +Jonathan WINSON 17 Feb 1822 34 Taylor's Court, Lambeth Hill +Charles WISE 22 Dec 1816 49 Lambeth Hill +Mary WISE 25 Jan 1820 44 Lambeth Hill +Jane WISHER 28 Apr 1833 0.11 Lambeth Hill +Jane WISHER 19 Dec 1851 50 4, Lambeth Hill +Sarah WISHER 27 Jan 1835 1 Lambeth Hill +Hannah WOOD 03 Mar 1830 7w Knight Rider Court +Samuel WOOLFE 05 Mar 1846 76 4, Lambeth Hill +Jacob WRAGG 23 Sep 1818 62 Little Knight Ryder Street +Margaret WRAGG 30 Oct 1819 73 Stangate Lambeth +William WRIGHT 24 Jan 1844 74 Greeham, East Kent +Benjamin Day YATES 16 Feb 1819 1.8 Sermon Lane +George YOUNG 11 May 1845 73 Peter's Hill diff --git a/01 Strings/07 Cemetery/cemetery_short.txt b/01 Strings/07 Cemetery/cemetery_short.txt new file mode 100644 index 0000000..184e2aa --- /dev/null +++ b/01 Strings/07 Cemetery/cemetery_short.txt @@ -0,0 +1,8 @@ +John William ALLARDYCE 17 Mar 1844 2.9 Little Knight Ryder Street +Frederic Alex. ALLARDYCE 21 Apr 1844 0.7 Little Knight Ryder Street +Philip AMIS 03 Aug 1848 1 18 1/2 Knight Rider Street +Thomas ANDERSON 06 Jul 1845 27 2, Bennet's Hill +Edward ANGEL 20 Nov 1842 22 Crane Court Lambeth Hill +Lucy Ann COLEBACK 23 Jul 1843 14w Lambeth Hill +Thomas William COLLEY 08 Aug 1833 4d Lambeth Hill +Joseph COLLIER 03 Apr 1831 58 Lambeth Hill \ No newline at end of file diff --git a/01 Strings/08a StringCoder/String Coder.doc b/01 Strings/08a StringCoder/String Coder.doc new file mode 100644 index 0000000..72c4590 Binary files /dev/null and b/01 Strings/08a StringCoder/String Coder.doc differ diff --git a/01 Strings/08a StringCoder/StringCoder.class b/01 Strings/08a StringCoder/StringCoder.class new file mode 100644 index 0000000..d7224fd Binary files /dev/null and b/01 Strings/08a StringCoder/StringCoder.class differ diff --git a/01 Strings/08a StringCoder/StringCoderDriver.class b/01 Strings/08a StringCoder/StringCoderDriver.class new file mode 100644 index 0000000..e650040 Binary files /dev/null and b/01 Strings/08a StringCoder/StringCoderDriver.class differ diff --git a/01 Strings/08a StringCoder/StringCoderDriver.java b/01 Strings/08a StringCoder/StringCoderDriver.java new file mode 100644 index 0000000..942b315 --- /dev/null +++ b/01 Strings/08a StringCoder/StringCoderDriver.java @@ -0,0 +1,176 @@ +// Name: +// Date: + +import java.util.*; +public class StringCoderDriver +{ + public static void main(String[] args) + { + StringCoder sc = new StringCoder("sixtyzipperswerequicklypickedfromthewovenjutebag"); + StringPart[] sp = sc.encodeString("overeager"); + for(int i=0; i 0 + * @return the string obtained by concatenating the parts of the master string + */ + //PART A: // =8 + public String decodeString(StringPart[] parts) + { + // 1 + String decodedString = ""; + + for (int i = 0; i < parts.length;i++) { + int start = parts[i].getStart(); + int length = parts[i].getLength(); + decodedString += masterString.substring(start, start+length); + } + + return decodedString; + } + + + /** @param str the string to encode using the master string + * Precondition: all of the characters in str appear in the master string; + * str.length() > 0 + * @return a string part in the master string that matches the beginning of str. + * The returned string part has length at least 1. + */ + private StringPart findPart(String str) + { + int x = 0; + String s = str.substring(0, x); + while( masterString.contains(s) ) + { + x++; + if(x > str.length()) + break; + s = str.substring(0, x); + } + s = str.substring(0, x - 1); + int start = masterString.indexOf(s); + StringPart sp = new StringPart(start, s.length()); + return sp; + } + + + /** @param word the string to be encoded + * Precondition: all of the characters in word appear in the master string; + * word.length() > 0 + * @return an ArrayList of string parts of the master string that can be combined + * to create word + */ + // Part B // =12 + public StringPart[] encodeString(String word) + { + StringPart[] temp = new StringPart[100]; + int partCount = 0; + String currentPart = ""; + int index = 0; + + while(word.length() > 0) { + temp[partCount] = findPart(word); + word = word.substring(temp[partCount].getLength()); + partCount++; + } + + StringPart[] parts = new StringPart[partCount]; + for (int i = 0; i < parts.length; i++) + parts[i] = temp[i]; + + return parts; + } +} + +class StringPart +{ + private int start; + private int length; + /** @param start the starting position of the substring in a master string + * @param length the length of the substring in a master string + */ + public StringPart(int start, int length) + { + this.start = start; + this.length = length; + } + + /** @return the starting position of the substring in a master string + */ + public int getStart() + { + return start; + } + + /** @return the length of the substring in a master string + */ + public int getLength() + { + return length; + } + public String toString() + { + return "(" + start + ", " + length + ")"; + } +} + +/*********************************** + + (37, 3), (14, 2), (46, 2), (9, 2), + overeager + (20, 1), (6, 6), + kippers + (19, 1), (31, 1), (21, 1), (31, 1), (40, 1), (1, 1), (46, 1), (21, 1), (0, 1), + colonials + (12, 4), (36, 2), (21, 1), (29, 1), + werewolf + +******************************/ + diff --git a/01 Strings/08a StringCoder/StringPart.class b/01 Strings/08a StringCoder/StringPart.class new file mode 100644 index 0000000..b64ac69 Binary files /dev/null and b/01 Strings/08a StringCoder/StringPart.class differ diff --git a/01 Strings/DS_Sept.pub b/01 Strings/DS_Sept.pub new file mode 100644 index 0000000..97f8109 Binary files /dev/null and b/01 Strings/DS_Sept.pub differ diff --git a/02 Recursion/00 Recursion Intro/Additional Labs for Fast Finishers.doc b/02 Recursion/00 Recursion Intro/Additional Labs for Fast Finishers.doc new file mode 100644 index 0000000..5c61850 Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Additional Labs for Fast Finishers.doc differ diff --git a/02 Recursion/00 Recursion Intro/Oberle PowerPoint/10_Recursion Dangers.pptx b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/10_Recursion Dangers.pptx new file mode 100644 index 0000000..ffdabf9 Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/10_Recursion Dangers.pptx differ diff --git a/02 Recursion/00 Recursion Intro/Oberle PowerPoint/11_Recur_dot_java 1.pptx b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/11_Recur_dot_java 1.pptx new file mode 100644 index 0000000..c3114a4 Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/11_Recur_dot_java 1.pptx differ diff --git a/02 Recursion/00 Recursion Intro/Oberle PowerPoint/12_Recur_dot_java 2.pptx b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/12_Recur_dot_java 2.pptx new file mode 100644 index 0000000..f23edfe Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/12_Recur_dot_java 2.pptx differ diff --git a/02 Recursion/00 Recursion Intro/Oberle PowerPoint/9_Recursion.pptx b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/9_Recursion.pptx new file mode 100644 index 0000000..e08075a Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Oberle PowerPoint/9_Recursion.pptx differ diff --git a/02 Recursion/00 Recursion Intro/Recursion Exercises.docx b/02 Recursion/00 Recursion Intro/Recursion Exercises.docx new file mode 100644 index 0000000..971f195 Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Recursion Exercises.docx differ diff --git a/02 Recursion/00 Recursion Intro/Recursion Notes.doc b/02 Recursion/00 Recursion Intro/Recursion Notes.doc new file mode 100644 index 0000000..534d816 Binary files /dev/null and b/02 Recursion/00 Recursion Intro/Recursion Notes.doc differ diff --git a/02 Recursion/01 Permutations/Permutations.class b/02 Recursion/01 Permutations/Permutations.class new file mode 100644 index 0000000..333c2c2 Binary files /dev/null and b/02 Recursion/01 Permutations/Permutations.class differ diff --git a/02 Recursion/01 Permutations/Permutations.docx b/02 Recursion/01 Permutations/Permutations.docx new file mode 100644 index 0000000..778e657 Binary files /dev/null and b/02 Recursion/01 Permutations/Permutations.docx differ diff --git a/02 Recursion/01 Permutations/Permutations.java b/02 Recursion/01 Permutations/Permutations.java new file mode 100644 index 0000000..032460f --- /dev/null +++ b/02 Recursion/01 Permutations/Permutations.java @@ -0,0 +1,108 @@ +// Name: B6-24 +// Date: 09/26/19 + +import java.util.*; +public class Permutations +{ + public static int count = 0; + + public static void main(String[] args) + { + Scanner sc = new Scanner(System.in); + System.out.print("\nHow many digits? "); + int n = sc.nextInt(); + leftRight("", n); + oddDigits("", n); + superprime(n); + if(count==0) + //Extension #1: + System.out.println("there are no " + n + "-digit superprimes"); + else + System.out.println("Count is "+count); + } + + /** + * Builds all the permutations of a string of length n containing Ls and Rs + * @param s A string + * @param n An postive int representing the length of the string + */ + public static void leftRight(String s, int n) + { + if (s.length() < n) { + leftRight(s + "L", n); + leftRight(s + "R", n); + } else if (s.length() == n) + System.out.println(s); + } + + /** + * Builds all the permutations of a string of length n containing odd digits + * @param s A string + * @param n A postive int representing the length of the string + */ + public static void oddDigits(String s, int n) + { + if (s.length() < n){ + for (int i = 1; i < 10; i += 2) + oddDigits(s + i, n); + } else if (s.length() == n) { + System.out.println(s); + } + } + + /** + * Builds all combinations of a n-digit number whose value is a superprime + * @param n A positive int representing the desired length of superprimes + */ + public static void superprime(int n) + { + recur(2, n); //try leading 2, 3, 5, 7, i.e. all the single-digit primes + recur(3, n); + recur(5, n); + recur(7, n); + } + + /** + * Recursive helper method for superprime + * @param k The possible superprime + * @param n A positive int representing the desired length of superprimes + */ + private static void recur(int k, int n) + { + if (isPrime(k)) { + if (n == 1) { + System.out.println(k); + //Extension #2: + count++; + } else { + for (int i = 1; i < 10; i+=2) + recur(k*10 + i, n - 1); + } + } + } + + /** + * Determines if the parameter is a prime number. + * @param n An int. + * @return true if prime, false otherwise. + */ + public static boolean isPrime(int n) { + + //Extension #3: + + if (n < 2) + return false; + + if (n < 4) + return true; + + if (n % 2 == 0 || n % 3 == 0) + return false; + + for (int i = 5; i * i <= n; i += 6) // since we already checked for 6, 8, 9, and 10 with 2 & 3 we can add by 6 and only check 5 and 7 + if (n % i == 0 || n % (i + 2) == 0) + return false; + + return true; + } +} \ No newline at end of file diff --git a/02 Recursion/02 Fibonacci/Fibonacci - Recursion v Iteration.docx b/02 Recursion/02 Fibonacci/Fibonacci - Recursion v Iteration.docx new file mode 100644 index 0000000..6ab9631 Binary files /dev/null and b/02 Recursion/02 Fibonacci/Fibonacci - Recursion v Iteration.docx differ diff --git a/02 Recursion/02 Fibonacci/Fibonacci Talking Points.doc b/02 Recursion/02 Fibonacci/Fibonacci Talking Points.doc new file mode 100644 index 0000000..677263a Binary files /dev/null and b/02 Recursion/02 Fibonacci/Fibonacci Talking Points.doc differ diff --git a/02 Recursion/02 Fibonacci/Fibonacci.class b/02 Recursion/02 Fibonacci/Fibonacci.class new file mode 100644 index 0000000..c3044a6 Binary files /dev/null and b/02 Recursion/02 Fibonacci/Fibonacci.class differ diff --git a/02 Recursion/02 Fibonacci/Fibonacci.java b/02 Recursion/02 Fibonacci/Fibonacci.java new file mode 100644 index 0000000..cf110b9 --- /dev/null +++ b/02 Recursion/02 Fibonacci/Fibonacci.java @@ -0,0 +1,56 @@ +// Name: B6-24 +// Date: 09/26/19 + +import java.util.*; +public class Fibonacci +{ + public static void main(String[] args) + { + long start, end, fib; //why long? + int[] fibNumber = {1, 5, 10, 20, 30, 40, 41, 42}; + System.out.println("\tFibonacci\tBy Iteration\tTime\tby Recursion\t Time"); + for(int n = fibNumber[0]; n <= fibNumber[fibNumber.length - 1]; n++) + { + start = System.nanoTime(); + fib = fibIterate(n); + end = System.nanoTime(); + System.out.print("\t\t" + n + "\t\t" + fib + "\t" + (end-start)/1000.); + start = System.nanoTime(); + fib = fibRecur(n); + end = System.nanoTime(); + System.out.println("\t" + fib + "\t\t" + (end-start)/1000.); + } + } + + /** + * Calculates the nth Fibonacci number by interation + * @param n A variable of type int representing which Fibonacci number + * to retrieve + * @returns A long data type representing the Fibonacci number + */ + public static long fibIterate(int n) + { + long n1, n2 = 0, n3 = 1; + for (int i = 1; i < n; i++) { + n1 = n2; + n2 = n3; + n3 = n1 + n2; + } + + return n3; + } + + /** + * Calculates the nth Fibonacci number by recursion + * @param n A variable of type int representing which Fibonacci number + * to retrieve + * @returns A long data type representing the Fibonacci number + */ + public static long fibRecur(int n) + { + if (n == 0) return 0; + if (n == 1) return 1; + + return fibRecur(n - 1) + fibRecur(n - 2); + } +} \ No newline at end of file diff --git a/02 Recursion/03 Hailstone/Hailstone.class b/02 Recursion/03 Hailstone/Hailstone.class new file mode 100644 index 0000000..5c56e97 Binary files /dev/null and b/02 Recursion/03 Hailstone/Hailstone.class differ diff --git a/02 Recursion/03 Hailstone/Hailstone.java b/02 Recursion/03 Hailstone/Hailstone.java new file mode 100644 index 0000000..c85a156 --- /dev/null +++ b/02 Recursion/03 Hailstone/Hailstone.java @@ -0,0 +1,82 @@ +// Name: B6-24 +// Date: 09/30/19 + +import java.util.*; + +public class Hailstone +{ + public static void main(String[] args) + { + System.out.println("Hailstone Numbers!"); + System.out.print("Enter the start value: "); + Scanner sc = new Scanner(System.in); + int start = sc.nextInt(); + int count = hailstone(start, 1); + System.out.println(" With count variable, it takes " + count + " steps." ); + int count2 = hailstone(start); + System.out.println(" Without count variable, it takes " + count2 + " steps." ); + } + + /** + * Prints the hailstone sequence that starts with n. + * Pre-condition: n > 0, count = 1. + * This method is recursive. + * If n is even, then the next number is n / 2. + * If n is odd, then the next number is 3 * n + 1. + * @param n The beginning hailstone number. + * @param count The helper variable that counts the steps. + * @returns An int representing the number of steps from n to 1. + */ + public static int hailstone(int n, int count) + { + if (n == 1){ + System.out.print("1"); + return count; + } else if (n % 2 == 0) { + System.out.print(n + "-"); + return hailstone(n / 2, ++count); + } else { + System.out.print(n + "-"); + return hailstone(3 * n + 1, ++count); + } + } + + /** + * Prints the hailstone sequence that starts with n. + * This method does not use a variable to count the steps. + * Pre-condition: n > 0. + * This method is recursive. + * If n is even, then the next number is n / 2. + * If n is odd, then the next number is 3 * n + 1. + * @param n The beginning hailstone number. + * @returns An int representing the number of steps from n to 1. + */ + public static int hailstone(int n) + { + if (n == 1) { + System.out.print("1"); + return 1; + } else if (n % 2 == 0) { + System.out.print(n + "-"); + return 1 + hailstone(n / 2); + } else { + System.out.print(n + "-"); + return 1 + hailstone(3 * n + 1); + } + } +} + +/* +------------SAMPLE RUN---------------------- + +Hailstone Numbers! +Enter the start value: 12 +12-6-3-10-5-16-8-4-2-1 With count variable, it takes 10 steps. +12-6-3-10-5-16-8-4-2-1 Without count variable, it takes 10 steps. + +Hailstone Numbers! +Enter the start value: 100 +100-50-25-76-38-19-58-29-88-44-22-11-34-17-52-26-13-40-20-10-5-16-8-4-2-1 With count variable, it takes 26 steps. +100-50-25-76-38-19-58-29-88-44-22-11-34-17-52-26-13-40-20-10-5-16-8-4-2-1 Without count variable, it takes 26 steps. + +*/ diff --git a/02 Recursion/04 AreaFill/AreaFill.class b/02 Recursion/04 AreaFill/AreaFill.class new file mode 100644 index 0000000..f7b3fe2 Binary files /dev/null and b/02 Recursion/04 AreaFill/AreaFill.class differ diff --git a/02 Recursion/04 AreaFill/AreaFill.doc b/02 Recursion/04 AreaFill/AreaFill.doc new file mode 100644 index 0000000..67de79e Binary files /dev/null and b/02 Recursion/04 AreaFill/AreaFill.doc differ diff --git a/02 Recursion/04 AreaFill/AreaFill.java b/02 Recursion/04 AreaFill/AreaFill.java new file mode 100644 index 0000000..f5a628c --- /dev/null +++ b/02 Recursion/04 AreaFill/AreaFill.java @@ -0,0 +1,150 @@ +// Name: B6-24 +// Date: 10/02/19 + +import java.util.*; +import java.io.*; + +public class AreaFill +{ + private static char[][] grid = null; + private static String filename = null; + + public static void main(String[] args) + { + Scanner sc = new Scanner(System.in); + while(true) // what does this do? + { + System.out.print("Fill the Area of (-1 to exit): "); + filename = sc.next(); + if(filename.equals("-1")) + { + sc.close(); + System.out.println("Good-bye"); + //System.exit(0); + return; + } + grid = read(filename); + String theGrid = display(grid); + System.out.println( theGrid ); + System.out.print( "1-Fill or 2-Fill-and-Count: "); + int choice = sc.nextInt(); + switch(choice) + { + case 1: + { + System.out.print("\nEnter ROW COL to fill from: "); + int row = sc.nextInt(); + int col = sc.nextInt(); + fill(grid, row, col, grid[row][col]); + System.out.println( display(grid) ); + break; + } + case 2: + { + System.out.print("\nEnter ROW COL to fill from: "); + int row = sc.nextInt(); + int col = sc.nextInt(); + int count = fillAndCount(grid, row, col, grid[row][col]); + System.out.println( display(grid) ); + System.out.println("count = " + count); + System.out.println(); + break; + } + default: + System.out.print("\nTry again! "); + } + } + } + + /** + * Reads the contents of the file into a matrix. + * Uses try-catch. + * @param filename The string representing the filename. + * @returns A 2D array of chars. + */ + public static char[][] read(String filename) + { + Scanner infile = null; + try + { + infile = new Scanner(new File(filename)); + } + catch (Exception e) + { + System.out.println("File not found"); + return null; + } + /* enter your code here */ + + int r = infile.nextInt(); + int c = infile.nextInt(); + char[][] g = new char[r][c]; + infile.nextLine(); + + for (int i = 0; i < r; i++) + g[i] = infile.nextLine().toCharArray(); + + return g; + } + + /** + * @param g A 2-D array of chars. + * @returns A string representing the 2D array. + */ + public static String display(char[][] g) + { + String outString = ""; + for (int i = 0; i < g.length; i++){ + for (int j = 0; j < g[i].length; j++){ + outString += g[i][j]; + } + + outString += '\n'; + } + + return outString; + } + + /** + * Fills part of the matrix with a different character. + * @param g A 2D char array. + * @param r An int representing the row of the cell to be filled. + * @param c An int representing the column of the cell to be filled. + * @param ch A char representing the replacement character. + */ + public static void fill(char[][] g, int r, int c, char ch) + { + if(r >= 0 && r < g.length && c >= 0 && c < g[0].length) { + if(g[r][c] == ch) { + g[r][c] = '*'; + fill(g, r + 1, c, ch); + fill(g, r - 1, c, ch); + fill(g, r, c + 1, ch); + fill(g, r, c - 1, ch); + } + } + + return; + } + + /** + * Fills part of the matrix with a different character. + * Counts as you go. Does not use a static variable. + * @param g A 2D char array. + * @param r An int representing the row of the cell to be filled. + * @param c An int representing the column of the cell to be filled. + * @param ch A char representing the replacement character. + * @return An int representing the number of characters that were replaced. + */ + public static int fillAndCount(char[][] g, int r, int c, char ch) + { + if(r >= 0 && r < g.length && c >= 0 && c < g[0].length) { + if(g[r][c] == ch) { + g[r][c] = '*'; + return 1 + fillAndCount(g, r + 1, c, ch) + fillAndCount(g, r - 1, c, ch) + fillAndCount(g, r, c + 1, ch) + fillAndCount(g, r, c - 1, ch); + } + } + + return 0; //never reached + } +} \ No newline at end of file diff --git a/02 Recursion/04 AreaFill/area1.txt b/02 Recursion/04 AreaFill/area1.txt new file mode 100644 index 0000000..c690628 --- /dev/null +++ b/02 Recursion/04 AreaFill/area1.txt @@ -0,0 +1,16 @@ +15 32 +xxxx............................ +...xx........................... +..xxxxxxxxxxxx.................. +..x.........xxxxxxx............. +..x...........0000xxxx.......... +..xxxxxxxxxxxx0..000............ +..xxxxxxxxx...0...00.....0000000 +..........xx.......0000000000000 +.....xxxxxxxxx........0......... +....xx.................00000.... +....xx.....................00... +.....xxxxxxxxxxxxxxxxxx....00... +......................xx...00... +.......................xxxx00000 +............................0000 \ No newline at end of file diff --git a/02 Recursion/04 AreaFill/area2.txt b/02 Recursion/04 AreaFill/area2.txt new file mode 100644 index 0000000..355315a --- /dev/null +++ b/02 Recursion/04 AreaFill/area2.txt @@ -0,0 +1,10 @@ +9 12 +..........00 +...0....0000 +...000000000 +0000.....000 +............ +..#########. +..#...#####. +......#####. +...00000.... \ No newline at end of file diff --git a/02 Recursion/04 AreaFill/area3.txt b/02 Recursion/04 AreaFill/area3.txt new file mode 100644 index 0000000..d1891c2 --- /dev/null +++ b/02 Recursion/04 AreaFill/area3.txt @@ -0,0 +1,6 @@ +4 3 ++++ +@+@ +@+@ +@@@ + diff --git a/02 Recursion/04 AreaFill/area4.txt b/02 Recursion/04 AreaFill/area4.txt new file mode 100644 index 0000000..f7fb038 --- /dev/null +++ b/02 Recursion/04 AreaFill/area4.txt @@ -0,0 +1,11 @@ +10 10 +mmmm....ff +...mm..... +..mmmmm.mm +..m.....ff +..x..xx... +..xxx..xx. +..xxx.xxx. +....x..... +.....ggg.g +....gg.... diff --git a/02 Recursion/05 ExpressionEvaluator/Evaluator.class b/02 Recursion/05 ExpressionEvaluator/Evaluator.class new file mode 100644 index 0000000..a73688f Binary files /dev/null and b/02 Recursion/05 ExpressionEvaluator/Evaluator.class differ diff --git a/02 Recursion/05 ExpressionEvaluator/Expression Evaluator.doc b/02 Recursion/05 ExpressionEvaluator/Expression Evaluator.doc new file mode 100644 index 0000000..7207003 Binary files /dev/null and b/02 Recursion/05 ExpressionEvaluator/Expression Evaluator.doc differ diff --git a/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.class b/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.class new file mode 100644 index 0000000..c5593ef Binary files /dev/null and b/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.class differ diff --git a/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.java b/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.java new file mode 100644 index 0000000..5b97643 --- /dev/null +++ b/02 Recursion/05 ExpressionEvaluator/ExpressionEvaluator.java @@ -0,0 +1,244 @@ +// Name: B6-24 +// Date: 10/7/19 +import java.util.*; + +/** + * This program calculates the value of an expression + * consisting of numbers, arithmetic operators, and parentheses. + */ +public class ExpressionEvaluator +{ + public static void main(String[] args) + { + Scanner in = new Scanner(System.in); + System.out.print("Enter an expression: "); + // 3+4*5 23 + // (3+4)*5 35 + // (4+5)-5*3 -6 + // (3+4)*(5+6) 77 + // (3*(4+5)-2)/5 5 + // 2*3*4-9/3 21 + /* extension, left-to-right processing */ + // 6*8/6 6 + // 2-3+5 -6 + // 3*4/6 0 + // 3+4-5+2*2 6 + + String input = in.nextLine().trim(); + Evaluator e = new Evaluator(input); + int value = e.getExpressionValue(); + //int value = e.getExpressionValueEXT(); //extension + System.out.println(input + " = " + value); + } +} + +/** + * A class that can compute the value of an arithmetic expression. + */ +class Evaluator +{ + private ExpressionTokenizer tokenizer; + + /** + * Constructs an evaluator. + * @param anExpression a string containing the expression + * to be evaluated + */ + public Evaluator(String anExpression) + { + tokenizer = new ExpressionTokenizer(anExpression); + } + + /** + * Evaluates the expression. + * @return the value of the expression. + */ + public int getExpressionValue() + { + int value = getTermValue(); + String next = tokenizer.peekToken(); + if("+".equals(next)) { + tokenizer.nextToken(); + value += getExpressionValue(); + } else if("-".equals(next)) { + tokenizer.nextToken(); + value -= getExpressionValue(); + } + + return value; + } + + /** + * Evaluates the next term found in the expression. + * @return the value of the term + */ + public int getTermValue() + { + int value = getFactorValue(); + String next = tokenizer.peekToken(); + if("*".equals(next)) { + tokenizer.nextToken(); + value *= getTermValue(); + } else if("/".equals(next)) { + tokenizer.nextToken(); + value /= getTermValue(); + } + + return value; + } + + /** + * Evaluates the next factor found in the expression. + * @return the value of the factor + */ + public int getFactorValue() + { + int value; + String next = tokenizer.peekToken(); + if ("(".equals(next)) + { + tokenizer.nextToken(); // Discard "(" + value = getExpressionValue(); + tokenizer.nextToken(); // Discard ")" + } + else + { + if(!next.equals("-")) { + value = Integer.parseInt(tokenizer.nextToken()); + } else { + tokenizer.nextToken(); + value = -1 * Integer.parseInt(tokenizer.nextToken()); + } + } + + return value; + } + + /** + * Extension + * + */ + public int getExpressionValueEXT() + { + int value = getTermValueEXT(); + String next = tokenizer.peekToken(); + if("+".equals(next)) { + tokenizer.nextToken(); + return value += getTermValueEXT(); + } else if("-".equals(next)) { + tokenizer.nextToken(); + return value -= getTermValueEXT(); + } + + return value; + } + + /** + * Extension + * + */ + public int getTermValueEXT() + { + int value = getFactorValueEXT(); + String next = tokenizer.peekToken(); + if("*".equals(next)) { + tokenizer.nextToken(); + return value *= getFactorValueEXT(); + } else if("/".equals(next)) { + tokenizer.nextToken(); + return value /= getFactorValueEXT(); + } + return value; + + } + + /** + * Extension + * + */ + public int getFactorValueEXT() + { + int value; + String next = tokenizer.peekToken(); + if ("(".equals(next)) + { + tokenizer.nextToken(); // Discard "(" + value = getExpressionValueEXT(); + tokenizer.nextToken(); // Discard ")" + } + else + { + if(!next.equals("-")) { + value = Integer.parseInt(tokenizer.nextToken()); + } else { + tokenizer.nextToken(); + value = -1 * Integer.parseInt(tokenizer.nextToken()); + } + } + + return value; + + } +} + +/** + * This class breaks up a string describing an expression + * into tokens: numbers, parentheses, and operators. + */ +class ExpressionTokenizer +{ + private String input; + private int start; // The start of the current token + private int end; // The position after the end of the current token + + /** + * Constructs a tokenizer. + * @param anInput the string to tokenize + */ + public ExpressionTokenizer(String anInput) + { + input = anInput; + start = 0; + end = 0; + nextToken(); // Find the first token + } + + /** + * Peeks at the next token without consuming it. + * @return the next token or null if there are no more tokens + */ + public String peekToken() + { + if (start >= input.length()) { + return null; } + else { + return input.substring(start, end); } + } + + /** + * Gets the next token and moves the tokenizer to the following token. + * @return the next token or null if there are no more tokens + */ + public String nextToken() + { + String r = peekToken(); + start = end; + if (start >= input.length()) { + return r; + } + if (Character.isDigit(input.charAt(start))) + { + end = start + 1; + while (end < input.length() + && Character.isDigit(input.charAt(end))) + { + end++; + } + } + else + { + end = start + 1; + } + return r; + } +} \ No newline at end of file diff --git a/02 Recursion/05 ExpressionEvaluator/ExpressionTokenizer.class b/02 Recursion/05 ExpressionEvaluator/ExpressionTokenizer.class new file mode 100644 index 0000000..589f0d7 Binary files /dev/null and b/02 Recursion/05 ExpressionEvaluator/ExpressionTokenizer.class differ diff --git a/02 Recursion/06 NQueens/GoldCrown.gif b/02 Recursion/06 NQueens/GoldCrown.gif new file mode 100644 index 0000000..f312710 Binary files /dev/null and b/02 Recursion/06 NQueens/GoldCrown.gif differ diff --git a/02 Recursion/06 NQueens/LABS.CSS b/02 Recursion/06 NQueens/LABS.CSS new file mode 100644 index 0000000..c060da1 --- /dev/null +++ b/02 Recursion/06 NQueens/LABS.CSS @@ -0,0 +1,97 @@ +/* Colors: #088 is a nice teal, #080 is a true green, + #37f is a true blue, #22a is almost indigo, + #a00 is deep red, #00a is deep blue, #04c is true blue + */ + +BODY { + background-color: #fff; + color: black; + font-size: medium; /* usually medium; small for printing */ +/* margin-left: 150px; */ +} + +P, TD { + font-size: medium; /* usually medium; small for printing */ +} + +H1 { font-size: xx-large } /* usually x-large; large for printing */ + +H2 { + font-size: x-large; /* usually x-large; large for printing */ + font-style: italic; /* for printing */ + color: #f00; +} + +H3 { + font-size: large; + color: #00a; +} + +H4 { + font-size: large; + color: #f00; +} + +A:link { color: #a00; text-decoration: underline } +A:visited, A:active { color: indigo; text-decoration: underline } + +CODE { + color: #00f; + font-family: monospace; +} + +PRE { font-family: serif } + +#siteTitle { + color: #04c; + text-align: center; +} + +A.sTitleA:link, A.sTitleA:visited, A.sTitleA:active { + color: #04c; + text-decoration: underline; +} + +#pageTitle { + color: #00a; + text-align: center; +} + +#author { + color: #a00; + text-align: center; +} + +#navigBar { + color: white + text-align: center; +} + +#copyright { + margin-left: 20px; + margin-right: 20px; + font-size: small; + font-style: italic; +} + +#footer { + font-size: small; + font-style: italic; +} + +SPAN.spec { + color: #009; +} + +/* Following should be shared among course web sites: + @import "http://max.cs.kzoo.edu/styles/SharedCourseStyles"; +*/ + +SPAN.Tall { font-size: x-large } + +SPAN.SmCap { font-size: large } + +/* Another way to do the above might be H1:first-letter { font: 2em }, + * although this does not deal well with words like 1998 which should + * be completely tall. + */ diff --git a/02 Recursion/06 NQueens/NQueens.class b/02 Recursion/06 NQueens/NQueens.class new file mode 100644 index 0000000..3b41d3c Binary files /dev/null and b/02 Recursion/06 NQueens/NQueens.class differ diff --git a/02 Recursion/06 NQueens/NQueens.java b/02 Recursion/06 NQueens/NQueens.java new file mode 100644 index 0000000..fdadb0c --- /dev/null +++ b/02 Recursion/06 NQueens/NQueens.java @@ -0,0 +1,154 @@ +//Name: B6-24 Date: 10/5/19 +// +// +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.Location; +import edu.kzoo.grid.display.GridDisplay; + +/** + * Environment-Based Applications:
+ * + * The NQueens class implements the N Queens problem. + * + * @author Your Name (based on a template provided by Alyce Brady) + * @version 1 September 2002 + **/ + +public class NQueens +{ + // Instance Variables: Encapsulated data for EACH NQueens problem + private Grid board; + private GridDisplay display; + + // constructor + + /** Constructs an object that solves the N Queens Problem. + * @param n the number of queens to be placed on an + * n x n board + * @param d an object that knows how to display an + * n x n board and + * the queens on it + **/ + public NQueens(int n, GridDisplay d) + { + board = new BoundedGrid(n, n); + display = d; + display.setGrid(board); + display.showGrid(); + } + + // methods + + /** Returns the number of queens to be placed on the board. **/ + public int numQueens() + { + return board.numRows(); // replace this with something more useful + } + + /** Solves (or attempts to solve) the N Queens Problem. **/ + public boolean solve() + { + if(placeQueen(0)) { + display.showGrid(); + return true; + } else { + System.out.println("NO SOLUTION"); + display.showGrid(); + return false; + } + } + + /** Attempts to place the qth queen on the board. + * (Precondition: 0 <= q < numQueens()) + * @param q index of next queen to place + **/ + private boolean placeQueen(int q) + { + // Queen q is placed in row q. The only question is + // which column she will be in. Try them in turn. + // Whenever we find a column that could work, put her + // there and see if we can place the rest of the queens. + + if(q >= numQueens()) + return true; + for(int i = 0; i < numQueens(); i++) { + if (locationIsOK(new Location(q, i))) { + addQueen(new Location(q, i)); + display.showGrid(); + if(placeQueen(q + 1)) + return true; + else + removeQueen(new Location(q, i)); + } + } + + return false; + + } + + /** Determines whether a queen can be placed at the specified + * location. + * @param loc the location to test + **/ + private boolean locationIsOK(Location loc) + { + //System.out.print("I ran! "); + // Verify that another queen can't attack this location. + // (Only queens in previous rows have been placed.) + int currentRow = loc.row(); + int currentCol = loc.col(); + int i, j; + + + for (i = 0; i < numQueens(); i++) { + if (board.objectAt(new Location(i, currentCol)) != null) { + return false; + } + } + + //only have to check for above left and right because it moves down + for (i = currentRow, j = currentCol; i >= 0 && j < numQueens(); i--, j++) { + if (board.objectAt(new Location(i, j)) != null) { + return false; + } + } + + for (i = currentRow, j = currentCol; i >= 0 && j >= 0; i--, j--) { + if (board.objectAt(new Location(i, j)) != null) { + return false; + } + } + + return true; + } + + /** Adds a queen to the specified location. + * @param loc the location where the queen should be placed + **/ + private void addQueen(Location loc) + { + new Queen(board, loc); // queens add themselves to the board + } + + /** Removes a queen from the specified location. + * @param loc the location where the queen should be removed + **/ + private void removeQueen(Location loc) + { + board.remove(loc); + // replace this with something useful. + } + +} diff --git a/02 Recursion/06 NQueens/NQueensLab.class b/02 Recursion/06 NQueens/NQueensLab.class new file mode 100644 index 0000000..de9d381 Binary files /dev/null and b/02 Recursion/06 NQueens/NQueensLab.class differ diff --git a/02 Recursion/06 NQueens/NQueensLab.java b/02 Recursion/06 NQueens/NQueensLab.java new file mode 100644 index 0000000..bbbfdfc --- /dev/null +++ b/02 Recursion/06 NQueens/NQueensLab.java @@ -0,0 +1,80 @@ +// Class: NQueensLab +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +import java.awt.Color; + +import javax.swing.JMenu; +import javax.swing.JOptionPane; + +import edu.kzoo.grid.display.ColorBlockDisplay; +import edu.kzoo.grid.display.DisplayMap; +import edu.kzoo.grid.gui.GridAppFrame; +import edu.kzoo.grid.gui.nuggets.BasicHelpMenu; +import edu.kzoo.grid.gui.nuggets.MinimalFileMenu; + + +/** + * Environment-Based Applications:
+ * + * The NQueensLab class implements the N Queens problem. + * + * @author Alyce Brady + * @version 1 September 2002 + **/ + +public class NQueensLab +{ + // Specify dimensions of grid display and individual cell size. + private static final int DISPLAY_WIDTH = 400; + private static final int DISPLAY_HEIGHT = 400; + private static final int MIN_CELL_SIZE = 20; + + // Specify the grid's background color and highlight color. + private static final Color BACKGROUND_COLOR = new Color(0, 155, 255); + private static final Color HIGHLIGHT_COLOR = Color.red; + + /** + * Starts the N Queens program. + * The String arguments (args) are not used in this application. + **/ + public static void main(String[] args) + { + + String sizeString = JOptionPane.showInputDialog("How large would you like the board to be?", 8); + int size = Integer.parseInt(sizeString); + + // Construct the object for solving the N Queens problem and + // a window to display it in. + GridAppFrame display = new GridAppFrame(); + display.includeMenu(new MinimalFileMenu()); + JMenu helpMenu = new BasicHelpMenu("NQueens", + "Your Name Here", + "with assistance from (whom? e.g., Alyce Brady)", + "1 September 2004", "file:NQueensHelp.html"); + display.includeMenu(helpMenu); + display.includeSpeedSlider(); + display.constructWindowContents("N Queens Problem", BACKGROUND_COLOR, + DISPLAY_WIDTH, DISPLAY_HEIGHT, MIN_CELL_SIZE); + Queen.setQueenColor(HIGHLIGHT_COLOR); + NQueens queens = new NQueens(size, display); + + // Specify how to display objects in the grid. + DisplayMap.associate("Queen", new ColorBlockDisplay()); + // OR, DisplayMap.associate("Queen", new ScaledImageDisplay("GoldCrown.gif")); + + // Solve the N Queens Problem. + queens.solve(); + } + +} diff --git a/02 Recursion/06 NQueens/NQueensLab.shtml b/02 Recursion/06 NQueens/NQueensLab.shtml new file mode 100644 index 0000000..f0c777e --- /dev/null +++ b/02 Recursion/06 NQueens/NQueensLab.shtml @@ -0,0 +1,132 @@ +Recursion: N Queens Lab + + + + + +
+

Recursion Lab: N Queens Problem

+
+ + + +
+ +

In this lab you will implement the N Queens Problem, using the BoundedGrid + class.‡ + In this lab you will implement an algorithm that places N queens on an N x N + board (like a chess board) in such a way that no queen can attack another queen.

+ + + +
+

Exercise Set

+ +
    +
  1. Download the zip file that contains the starting code files for + the N Queens Lab (NQueens.zip) + and unzip it. When you unzip the file you will see the +following files and folders. +
      +
    • The file NQueensLab.shtml contains this +write-up. +
    • Two image files, GoldCrown.gif and +SilverCrown.gif (images of crowns). +
    • The grid.jar Java archive +(jar) file + contains a library of classes that can be used to +model a two-dimensional grid as described above. +
        +
      • BoundedGrid (class that represents +the two-dimensional grid)‡
        • +
      • Location (class that represents the +row and column positions of a location in the +grid)‡
        • +
      • ColorBlock (class whose objects +represent blocks of color put in a grid)
        • +
      + The documentation for these files can be found by +downloading the +GridPkgClassDocs.zip file. +
      • +

      +
    • The JavaSourceFiles folder contains the +source files for the NQueens Lab. +
        +
      • NQueensLab (contains the main method)
        • +
      • NQueens (the class that implements the solution + to the N Queens Problem)
        • +
      • Queen (represents a queen on the board)
        • +
      +
    +
    + Note: All of the + classes in the JavaSourceFiles folder and the +grid.jar Java archive file are covered by the GNU General Public License. + +

    +
  2. Compile and run the program. You should see an 8 x 8 "chess + board" with no queens. +

    +
    3. +
  3. Complete the numQueens and removeQueen + methods, without adding any additional instance variables.  To + test the removeQueen method, modify the placeQueen + method to add a queen to any arbitrary column (your choice) of the + correct row for that queen, display the environment, and then remove + the queen and redisplay the environment.  Modify the solve + method to place one queen.  Run the program.  You should + see one queen (or color block) appear and then disappear from the + environment. +

    +
    4. +
  4. Modify the placeQueen method to recursively place all + the queens in arbitrary columns (or the same arbitrary column).  + Think about where you should place the recursive call if you want + to see the queens appear in each row, one-by-one, and then disappear + in reverse order.  Make sure you remember to include a base case.  + Do you need to modify the solve method to place all the + queens?  If so, do it. +

    +
    5. +
  5. Fully implement the placeQueen method so that it checks + column by column to find an OK location to place this queen, until + the queen has been successfully placed in a column and all the queens + after her have been successfully placed also.  Since the locationIsOK + method always returns true, the queens should fill in + the first column. +

    +
    6. +
  6. Modify the locationIsOK method to return false + if any queens have already be placed in the same column as the location + parameter.  When you have this working you should see the queens + fill in the diagonal from location (0, 0) to location (n-1, n-1). +

    +
    7. +
  7. Modify the locationIsOK method again to also return + false if any queens have already been placed on the board + in locations that are on the diagonal from the location parameter. +
    8. +
+ +
+
+
+ + + diff --git a/02 Recursion/06 NQueens/NQueens_Lab.doc b/02 Recursion/06 NQueens/NQueens_Lab.doc new file mode 100644 index 0000000..eb7e616 Binary files /dev/null and b/02 Recursion/06 NQueens/NQueens_Lab.doc differ diff --git a/02 Recursion/06 NQueens/Queen.class b/02 Recursion/06 NQueens/Queen.class new file mode 100644 index 0000000..defddc8 Binary files /dev/null and b/02 Recursion/06 NQueens/Queen.class differ diff --git a/02 Recursion/06 NQueens/Queen.java b/02 Recursion/06 NQueens/Queen.java new file mode 100644 index 0000000..1c40590 --- /dev/null +++ b/02 Recursion/06 NQueens/Queen.java @@ -0,0 +1,48 @@ +// Class: Queen +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +import java.awt.Color; + +import edu.kzoo.grid.ColorBlock; +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.Location; + +/** + * Environment-Based Applications:
+ * + * A Queen object represents a queen in the N Queens Problem. + * + * @author Alyce Brady + * @version 1 November 2002 + **/ +public class Queen extends ColorBlock +{ + private static Color queenColor = Color.red; + + /** Constructs a queen at the specified location on an N x N + * "chessboard." + * @param board the board on which to place this queen + * @param loc the location of this queen + **/ + public Queen(Grid board, Location loc) + { + super(queenColor, board, loc); + } + + /** Defines the color to make all queens. **/ + public static void setQueenColor(Color col) + { + queenColor = col; + } +} diff --git a/02 Recursion/06 NQueens/README.txt b/02 Recursion/06 NQueens/README.txt new file mode 100644 index 0000000..3811d05 --- /dev/null +++ b/02 Recursion/06 NQueens/README.txt @@ -0,0 +1,7 @@ +This archive has been reorganized by Daniel Johnson (johnmon2@gmail.com). The reorganization was done to enable the files to compile without worrying about making the given libraries work. + +List of changes: +1. The Following files were moved out of the JavaSourceFiles folder into the NQueens folder: NQueensLab.java, NQueens.java, Queen.java. +2. The empty JavaSourceFiles folder was deleted. +3. The grid.jar file was extracted into the NQueens folder (appears as the edu folder). +4. This README file was created. diff --git a/02 Recursion/06 NQueens/SilverCrown.gif b/02 Recursion/06 NQueens/SilverCrown.gif new file mode 100644 index 0000000..ba1125b Binary files /dev/null and b/02 Recursion/06 NQueens/SilverCrown.gif differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$ArrayListGridRep.class b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$ArrayListGridRep.class new file mode 100644 index 0000000..4fd57c6 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$ArrayListGridRep.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Bounded.class b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Bounded.class new file mode 100644 index 0000000..88631f6 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Bounded.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Unbounded.class b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Unbounded.class new file mode 100644 index 0000000..4d3b326 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid$Unbounded.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.class b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.class new file mode 100644 index 0000000..d31717f Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.java b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.java new file mode 100644 index 0000000..bcdaa10 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/ArrayListGrid.java @@ -0,0 +1,363 @@ +// Class: ArrayListGrid +// +// Author: Alyce Brady +// +// This class is based on the College Board's UnboundedEnv class, +// as allowed by the GNU General Public License. UnboundedEnv is a +// component of the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import java.util.ArrayList; + +/** + * Grid Container Package:
+ * + * The ArrayListGrid class encapsulates two public inner + * classes that extend the Grid class to + * model a two-dimensional grid by keeping track of their contents + * in ArrayList objects. The first public inner class, + * ArrayListGrid.Bounded, represents a bounded grid + * using an ArrayList, while the second public inner class, + * ArrayListGrid.Unbounded, represents an unbounded grid + * using an ArrayList. + * + *

+ * Methods of both ArrayListGrid classes have the + * following time and space characteristics: + * + * + * + * + * + * + * + *
numObjectsO(1)
allObjectsO(n)
isEmpty, objectAtO(n)
addO(1) [amortized]
removeO(n)
spaceO(n)
+ * where n is the number of objects in the grid. + * + *

+ * The ArrayListGrid classes are based on the + * College Board's UnboundedEnv class, as allowed + * by the GNU General Public License. + * + * @author Alyce Brady + * @version 20 March 2004 + * @see Direction + * @see Location + * @see GridObject + */ +public class ArrayListGrid +{ + // ArrayListGrid is a scoping mechanism, not meant to be instantiated. + private ArrayListGrid() + { + } + + /** An ArrayListGrid.Bounded object is a rectangular, + * bounded two-dimensional container data structure implemented as + * an ArrayList of the objects it contains. It can contain + * any kind of object that can be modeled using an extension of the + * GridObject class. For example, a bounded grid could + * be used to model a board for a tic-tac-toe or chess game, an + * environment of fish for a marine biology simulation, etc. + * + *

+ * ArrayListGrid.Bounded methods have the + * following time and space characteristics: + * + * + * + * + * + * + * + *
numObjectsO(1)
allObjectsO(n)
isEmpty, objectAtO(n)
addO(1) [amortized]
removeO(n)
spaceO(n)
+ * where n is the number of objects in the grid. + **/ + public static class Bounded extends Grid + { + // instance variables: encapsulated data for each Bounded grid object + private int numRows; + private int numCols; + + // constructors + + /** Constructs an empty ArrayListGrid.Bounded object with the given + * dimensions. + * A cell's neighbors include only the cells to its north, south, + * east, and west, not the cells on the diagonals. + * (Precondition: rows > 0 and cols > 0.) + * @param rows number of rows in grid + * @param cols number of columns in grid + * @throws IllegalArgumentException if the precondition is not met + **/ + public Bounded(int rows, int cols) + { + // Construct and initialize inherited attributes. + this(false, rows, cols); + } + + /** Constructs an empty ArrayListGrid.Bounded object with the given + * dimensions. + * Each cell in this grid will have at most four or eight + * adjacent neighbors, depending on the value of the + * includeDiagonalNeighbors parameter. Cells along + * the grid boundaries will have fewer than the maximum four or + * eight neighbors. If includeDiagonalNeighbors is + * true, a cell's adjacent neighbors include the + * cells to its north, south, east, and west and the cells on + * the diagonals, to the northeast, southeast, northwest, and + * southwest. If includeDiagonalNeighbors is + * false, a cell's adjacent neighbors include only + * the four cells to its north, south, east, and west. + * (Precondition: rows > 0 and cols > 0.) + * @param includeDiagonalNeighbors whether to include the four + * diagonal locations as neighbors + * @param rows number of rows in grid + * @param cols number of columns in grid + * @throws IllegalArgumentException if the precondition is not met + **/ + public Bounded(boolean includeDiagonalNeighbors, + int rows, int cols) + { + // Construct and initialize inherited attributes. + super(new ArrayListGridRep( + new Grid.BoundedGridValidityChecker(rows, cols)), + includeDiagonalNeighbors); + numRows = rows; + numCols = cols; + } + + // accessor methods dealing with grid dimensions + + /** Returns number of rows in this grid. + * @return the number of rows in this grid + **/ + public int numRows() + { + return this.numRows; + } + + /** Returns number of columns in this grid. + * @return the number of columns in this grid + **/ + public int numCols() + { + return this.numCols; + } + + } + + /** An ArrayListGrid.Unounded object is an unbounded + * two-dimensional container data structure implemented as + * an ArrayList of the objects it contains. It can contain + * any kind of object that can be modeled using an extension of the + * GridObject class. For example, a bounded grid could + * be used to model a board for a tic-tac-toe or chess game, an + * environment of fish for a marine biology simulation, etc. + * + *

+ * ArrayListGrid.Unbounded methods have the + * following time and space characteristics: + * + * + * + * + * + * + * + *
numObjectsO(1)
allObjectsO(n)
isEmpty, objectAtO(n)
addO(1) [amortized]
removeO(n)
spaceO(n)
+ * where n is the number of objects in the grid. + **/ + public static class Unbounded extends Grid + { + // constructors + + /** Constructs an empty ArrayListGrid.Unbounded object. + * A cell's neighbors include only the cells to its north, south, + * east, and west, not the cells on the diagonals. + * (Precondition: rows > 0 and cols > 0.) + **/ + public Unbounded() + { + // Construct and initialize inherited attributes. + this(false); + } + + /** Constructs an empty ArrayListGrid.Unbounded object. + * Each cell in this grid will have at most four or eight + * adjacent neighbors, depending on the value of the + * includeDiagonalNeighbors parameter. If + * includeDiagonalNeighbors is true, + * a cell's adjacent neighbors include the cells to its north, + * south, east, and west and the cells on the diagonals, to + * the northeast, southeast, northwest, and southwest. If + * includeDiagonalNeighbors is false, + * a cell's adjacent neighbors include only the four cells to + * its north, south, east, and west. + * (Precondition: rows > 0 and cols > 0.) + * @param includeDiagonalNeighbors whether to include the four + * diagonal locations as neighbors + **/ + public Unbounded(boolean includeDiagonalNeighbors) + { + // Construct and initialize inherited attributes. + super(new ArrayListGridRep(new Grid.UnboundedGridValidityChecker()), + includeDiagonalNeighbors); + } + + // accessor methods dealing with grid dimensions + + /** Returns number of rows in this grid. + * @return the number of rows, or UNBOUNDED if the grid is unbounded + **/ + public int numRows() + { + return Grid.UNBOUNDED; + } + + /** Returns number of columns in this grid. + * @return the number of columns, or UNBOUNDED if the grid is unbounded + **/ + public int numCols() + { + return Grid.UNBOUNDED; + } + } + + /** Internal representation for an ArrayList-based + * implementation of a Grid class. + **/ + public static class ArrayListGridRep + implements Grid.InternalRepresentation + { + // instance variables: encapsulated data for each ArrayListGridRep object + private ArrayList objectList; // list of objects in a grid + private Grid.ValidityChecker locationValidityChecker; + + // constructors + + /** Constructs an empty ArrayListGridRep representation of a grid. + * @param checker an object that knows how to check the validity + * of a location in a grid + **/ + protected ArrayListGridRep(Grid.ValidityChecker checker) + { + objectList = new ArrayList(); + locationValidityChecker = checker; + } + + + // accessor methods + + /** Verifies whether a location is valid in this grid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc) + { + return locationValidityChecker.isValid(loc); + } + + /** Returns the number of objects in this grid. + * @return the number of objects + **/ + public int numObjects() + { + return objectList.size(); + } + + /** Returns all the objects in this grid. + * @return an array of all the grid objects + **/ + public GridObject[] allObjects() + { + // Copy them to an array. + int numObjects = objectList.size(); + GridObject[] theObjects = new GridObject[numObjects]; + for ( int i = 0; i < numObjects; i++ ) + theObjects[i] = (GridObject) objectList.get(i); + return theObjects; + } + + /** Returns the object at a specific location in this grid. + * @param loc the location in which to look + * @return the object at location loc; + * null if loc is not + * in the grid or is empty + **/ + public GridObject objectAt(Location loc) + { + int index = indexOf(loc); + if ( index == -1 ) + return null; + + return (GridObject) objectList.get(index); + } + + + // modifier methods + + /** Adds a new object to this internal grid representation at the + * location it specifies. + * (Precondition: obj.grid() is this grid and + * obj.location() is a valid empty location; + * verified by the Grid object.) + * @param obj the new object to be added + **/ + public void add(GridObject obj) + { + // Add object to the internal grid representation. + objectList.add(obj); + } + + /** Removes the object from this internal grid representation. + * (Precondition: obj is in this grid; verified + * by the Grid object.) + * @param obj the object to be removed + **/ + public void remove(GridObject obj) + { + // Find the index of the object and then remove it. + objectList.remove(indexOf(obj.location())); + } + + + // internal helper method + + /** Get the index of the object at the specified location. + * @param loc the location in which to look + * @return the index of the object at location loc + * if there is one; -1 otherwise + **/ + protected int indexOf(Location loc) + { + // Look through the list to find the object at the given location. + for ( int index = 0; index < objectList.size(); index++ ) + { + GridObject obj = (GridObject) objectList.get(index); + if ( obj.location().equals(loc) ) + { + // Found the object -- return its index. + return index; + } + } + + // No such object found. + return -1; + } + } +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid$Array2DGridRep.class b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid$Array2DGridRep.class new file mode 100644 index 0000000..8bd43b1 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid$Array2DGridRep.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.class b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.class new file mode 100644 index 0000000..f1bc1dd Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.java b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.java new file mode 100644 index 0000000..02bdf52 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/BoundedGrid.java @@ -0,0 +1,275 @@ +// Class: BoundedGrid +// +// Author: Alyce Brady +// +// This class is based on the College Board's BoundedEnv class, +// as allowed by the GNU General Public License. BoundedEnv is a +// component of the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +/** + * Grid Container Package:
+ * + * A BoundedGrid is a rectangular, bounded two-dimensional + * container data structure. It can contain any kind of object that + * can be modeled using an extension of the GridObject class. + * For example, a grid could be used to model a board for a + * tic-tac-toe or chess game, an environment of fish for a marine + * biology simulation, etc. + * + *

+ * A BoundedGrid is implemented as a two-dimensional array + * corresponding to the dimensions of the grid. This gives it the + * following time and space characteristics: + * + * + * + * + * + * + * + *
numObjectsO(1)
allObjectsO(r * c)
isEmpty, objectAtO(1)
addO(1)
removeO(1)
spaceO(r * c)
+ * where r is the number of rows and rc is the + * number of columns in the grid. + * + *

+ * The BoundedGrid class and its internal 2D array + * implementation are based on the College Board's + * BoundedEnv class, as allowed by the GNU General + * Public License. + * + * @author Alyce Brady + * @version 13 December 2003 + **/ + +public class BoundedGrid extends Grid +{ + // instance variables: encapsulated data for each BoundedGrid object + private int numRows; + private int numCols; + + // constructors + + /** Constructs an empty BoundedGrid object with the given dimensions. + * A cell's neighbors include only the cells to its north, south, + * east, and west, not the cells on the diagonals. + * (Precondition: rows > 0 and cols > 0.) + * @param rows number of rows in BoundedGrid + * @param cols number of columns in BoundedGrid + * @throws IllegalArgumentException if the precondition is not met + **/ + public BoundedGrid(int rows, int cols) + { + // Construct and initialize inherited attributes. + this(false, rows, cols); + } + + /** Constructs an empty BoundedGrid object with the given dimensions. + * Each cell in this grid will have at most four or eight + * adjacent neighbors, depending on the value of the + * includeDiagonalNeighbors parameter. Cells along + * the grid boundaries will have fewer than the maximum four or + * eight neighbors. If includeDiagonalNeighbors is + * true, a cell's adjacent neighbors include the cells + * to its north, south, east, and west and the cells on the diagonals, + * to the northeast, southeast, northwest, and southwest. If + * includeDiagonalNeighbors is false, + * a cell's adjacent neighbors include only the four cells to its + * north, south, east, and west. + * (Precondition: rows > 0 and cols > 0.) + * @param includeDiagonalNeighbors whether to include the four + * diagonal locations as neighbors + * @param rows number of rows in BoundedGrid + * @param cols number of columns in BoundedGrid + * @throws IllegalArgumentException if the precondition is not met + **/ + public BoundedGrid(boolean includeDiagonalNeighbors, int rows, int cols) + { + // Construct and initialize inherited attributes. + super(new Array2DGridRep(rows, cols), includeDiagonalNeighbors); + this.numRows = rows; + this.numCols = cols; + } + + // accessor methods dealing with grid dimensions + + /** Returns number of rows in this grid. + * @return the number of rows in this grid + **/ + public int numRows() + { + return numRows; + } + + /** Returns number of columns in this grid. + * @return the number of columns in this grid + **/ + public int numCols() + { + return numCols; + } + + // internal 2D Grid representation + + /** The Array2DGridRep class represents an internal bounded + * grid using a two-dimensional array. + */ + protected static class Array2DGridRep implements Grid.InternalRepresentation + { + // instance variables: encapsulated data for each Array2DGridRep object + private GridObject[][] theGrid; // internal representation of the grid + private int objectCount; // # of objects in current grid + + // constructors + + /** Constructs an empty Array2DGridRep representation with the given + * dimensions. + * (Precondition: rows > 0 and cols > 0.) + * @param rows number of rows in the grid + * @param cols number of columns in the grid + **/ + public Array2DGridRep(int rows, int cols) + { + // Verify precondition. + if ( rows <= 0 || cols <= 0 ) + throw new IllegalArgumentException(); + + theGrid = new GridObject[rows][cols]; + objectCount = 0; + } + + + // accessor methods dealing with grid dimensions + + /** Returns number of rows in this grid. + * @return the number of rows, or UNBOUNDED if the grid is unbounded + **/ + public int numRows() + { + return theGrid.length; + } + + /** Returns number of columns in this grid. + * @return the number of columns, or UNBOUNDED if the grid is unbounded + **/ + public int numCols() + { + // Note: according to the constructor precondition, numRows() > 0, + // so theGrid[0] is non-null. + return theGrid[0].length; + } + + /** Verifies whether a location is valid in this grid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc) + { + if ( loc == null ) + return false; + + return (0 <= loc.row() && loc.row() < numRows()) && + (0 <= loc.col() && loc.col() < numCols()); + } + + + // accessor methods that deal with objects in this grid + + /** Returns the number of objects in this grid. + * @return the number of objects + **/ + public int numObjects() + { + return objectCount; + } + + /** Returns all the objects in this grid. + * @return an array of all the grid objects + **/ + public GridObject[] allObjects() + { + // Create an array in which to put the objects. + GridObject[] theObjects = new GridObject[numObjects()]; + int arrayIndex = 0; + + // Look at all grid locations. + for ( int r = 0; r < numRows(); r++ ) + { + for ( int c = 0; c < numCols(); c++ ) + { + // If there's an object at this location, put it + // in the list. + GridObject obj = theGrid[r][c]; + if ( obj != null ) + { + theObjects[arrayIndex] = obj; + arrayIndex++; + } + } + } + + return theObjects; + } + + /** Returns the object at a specific location in this grid. + * @param loc the location in which to look + * @return the object at location loc; + * null if loc is not + * in the grid or is empty + **/ + public GridObject objectAt(Location loc) + { + if ( ! isValid(loc) ) + return null; + + return theGrid[loc.row()][loc.col()]; + } + + + // modifier methods + + /** Adds a new object to this internal grid representation at the + * location it specifies. + * (Precondition: obj.grid() is this grid and + * obj.location() is a valid empty location; + * verified by the Grid object.) + * @param obj the new object to be added + **/ + public void add(GridObject obj) + { + // Add object to the internal grid representation. + Location loc = obj.location(); + theGrid[loc.row()][loc.col()] = obj; + objectCount++; + } + + /** Removes the object from this internal grid representation. + * (Precondition: obj is in this grid; verified + * by the Grid object.) + * @param obj the object to be removed + **/ + public void remove(GridObject obj) + { + // Remove the object from the grid. + Location loc = obj.location(); + theGrid[loc.row()][loc.col()] = null; + objectCount--; + } + + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.class b/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.class new file mode 100644 index 0000000..4f391e8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.java b/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.java new file mode 100644 index 0000000..0efcabb --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/ColorBlock.java @@ -0,0 +1,68 @@ +// Class: ColorBlock +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import java.awt.Color; + +/** + * Grid Container Package:
+ * + * A ColorBlock object encapsulates a color for a colored + * cell in a grid. + * + * @author Alyce Brady + * @version 13 December 2003 + * @see Grid + * @see Location + **/ +public class ColorBlock extends GridObject +{ + // Encapsulated data for each color block object + private Color theColor; // the color of this color block + + /** Constructs a color block with the specified color. + * @param colorValue the color that fills this color block + **/ + public ColorBlock(Color colorValue) + { + super(); + theColor = colorValue; + } + + /** Constructs a color block with the specified color. + * @param colorValue the color that fills this color block + * @param grid the grid containing this color block + * @param loc the location of the color block in grid + **/ + public ColorBlock(Color colorValue, Grid grid, Location loc) + { + super(grid, loc); + theColor = colorValue; + } + + /** Gets color value for color block. + **/ + public Color color() + { + return theColor; + } + + /** Returns a string representation of the color. **/ + public String toString() + { + return theColor.toString() + " " + location().toString(); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.class new file mode 100644 index 0000000..b3a717c Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.java b/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.java new file mode 100644 index 0000000..0761c16 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/Direction.java @@ -0,0 +1,243 @@ +// AP(r) Computer Science Marine Biology Simulation: +// The Direction class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import java.util.Random; +import edu.kzoo.util.RandNumGenerator; + +/** + * AP® Computer Science Marine Biology Simulation:
+ * The Direction class encapsulates the notion of a compass + * direction such as North, East, South, West. + * + *

+ * The Direction class is + * copyright© 2002 College Entrance Examination Board + * (www.collegeboard.com). + * + * @author Alyce Brady + * @author Chris Nevison + * @author Julie Zelenski + * @author APCS Development Committee + * @version 1 July 2002 + **/ + +public class Direction +{ + // Named constants for some common compass directions + public static final Direction NORTH = new Direction(0); + public static final Direction NORTHEAST = new Direction (45); + public static final Direction EAST = new Direction(90); + public static final Direction SOUTHEAST = new Direction (135); + public static final Direction SOUTH = new Direction(180); + public static final Direction SOUTHWEST = new Direction (225); + public static final Direction WEST = new Direction(270); + public static final Direction NORTHWEST = new Direction (315); + + /** Number of degrees in compass + * (will not be tested on the Advanced Placement exam). + **/ + public static final int FULL_CIRCLE = 360; // not tested on AP exam + + // Array of strings representing common compass points. + private static final String[] dirNames = {"North", "Northeast", "East", "Southeast", + "South", "Southwest", "West", "Northwest"}; + + // Instance Variables: Encapsulated data for each Direction object + private int dirInDegrees; // represents compass direction in degrees, + // with 0 degrees as North, + // 90 degrees as East, etc. + + + // constructors + + /** Constructs a default Direction object facing North. + **/ + public Direction() + { + dirInDegrees = 0; // default to North + } + + /** Constructs a Direction object. + * @param degrees initial compass direction in degrees + **/ + public Direction(int degrees) + { + dirInDegrees = degrees % FULL_CIRCLE; + if ( dirInDegrees < 0 ) + dirInDegrees += FULL_CIRCLE; + } + + /** Constructs a Direction object. + * @param str compass direction specified as a string, e.g. "North" + * @throws IllegalArgumentException if string doesn't match a known direction name + **/ + public Direction(String str) + { + int regionWidth = FULL_CIRCLE / dirNames.length; + + for ( int k = 0; k < dirNames.length; k++ ) + { + if ( str.equalsIgnoreCase(dirNames[k]) ) + { + dirInDegrees = k * regionWidth; + return; + } + } + throw new IllegalArgumentException("Illegal direction specified: \"" + + str + "\""); + } + + + // accessor methods + + /** Returns this direction value in degrees. + * @return the value of this Direction object in degrees + **/ + public int inDegrees() + { + return dirInDegrees; + } + + /** Indicates whether some other Direction object + * is "equal to" this one. + * @param other the other position to test + * @return true if other + * represents the same direction; + * false otherwise + **/ + public boolean equals(Object other) + { + if ( ! (other instanceof Direction) ) + return false; + + Direction d = (Direction) other; + return inDegrees() == d.inDegrees(); + } + + /** Generates a hash code for this direction + * (will not be tested on the Advanced Placement exam). + * @return a hash code for a Direction object + **/ + public int hashCode() + { + return inDegrees(); + } + + /** Returns the direction that is a quarter turn + * to the right of this Direction object. + * @return the new direction + **/ + public Direction toRight() + { + return new Direction(dirInDegrees + (FULL_CIRCLE / 4)); + } + + /** Returns the direction that is deg degrees + * to the right of this Direction object. + * @param deg the number of degrees to turn + * @return the new direction + **/ + public Direction toRight(int deg) + { + return new Direction(dirInDegrees + deg); + } + + /** Returns the direction that is a quarter turn + * to the left of this Direction object. + * @return the new direction + **/ + public Direction toLeft() + { + return new Direction(dirInDegrees - (FULL_CIRCLE / 4)); + } + + /** Returns the direction that is deg degrees + * to the left of this Direction object. + * @param deg the number of degrees to turn + * @return the new direction + **/ + public Direction toLeft(int deg) + { + return new Direction(dirInDegrees - deg); + } + + /** Returns the direction that is the reverse of this + * Direction object. + * @return the reverse direction + **/ + public Direction reverse() + { + return new Direction(dirInDegrees + (FULL_CIRCLE / 2)); + } + + /** Represents this direction as a string. + * @return a string indicating the direction + **/ + public String toString() + { + // If the direction is one of the compass points for which we have + // a name, provide it; otherwise report in degrees. + int regionWidth = FULL_CIRCLE / dirNames.length; + if (dirInDegrees % regionWidth == 0) + return dirNames[dirInDegrees / regionWidth]; + else + return dirInDegrees + " degrees"; + } + + /** Rounds this direction to the nearest "cardinal" direction + * (will not be tested on the Advanced Placement exam). + *

+ * The choice of possible cardinal directions depends on the number + * of cardinal directions and the starting direction. For example, + * the two cardinal directions starting at NORTH are NORTH and SOUTH. + * The two cardinal directions starting at EAST are EAST and WEST. + * The four cardinal directions starting at NORTH are NORTH, EAST, + * SOUTH, and WEST. The four cardinal directions starting from + * NORTHEAST are NORTHEAST, SOUTHEAST, SOUTHWEST, and NORTHWEST. + * (Precondition: 0 < numDirections <= 360) + * @param numDirections the number of "cardinal" directions + * @param startingDir the starting cardinal direction + * @return the current direction rounded to a "cardinal" direction + **/ + public Direction roundedDir(int numDirections, Direction startingDir) + { + // Determine offset of this direction from startingDir. + int degreesFromStartingDir = dirInDegrees - startingDir.inDegrees(); + + // Divide the compass into regions whose width is based on the + // number of cardinal directions we have. Then determine how many + // regions this direction is from the starting direction. + int regionWidth = FULL_CIRCLE / numDirections; + int numRegions = Math.round((float)degreesFromStartingDir/regionWidth); + + // Return the "cardinal" direction numRegions regions from the + // starting direction. + return startingDir.toRight(numRegions*regionWidth); + } + + + // methods not tied to any one Direction object + + + /** Returns a random direction. + * @return a direction + **/ + public static Direction randomDirection() + { + Random randNumGen = RandNumGenerator.getInstance(); + return new Direction(randNumGen.nextInt(FULL_CIRCLE)); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$BoundedGridValidityChecker.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$BoundedGridValidityChecker.class new file mode 100644 index 0000000..1f44e8a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$BoundedGridValidityChecker.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$InternalRepresentation.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$InternalRepresentation.class new file mode 100644 index 0000000..e323326 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$InternalRepresentation.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$UnboundedGridValidityChecker.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$UnboundedGridValidityChecker.class new file mode 100644 index 0000000..0f0a917 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$UnboundedGridValidityChecker.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$ValidityChecker.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$ValidityChecker.class new file mode 100644 index 0000000..d0fa70b Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid$ValidityChecker.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.class new file mode 100644 index 0000000..faeea7b Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.java b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.java new file mode 100644 index 0000000..01192b0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/Grid.java @@ -0,0 +1,505 @@ +// Class: Grid +// +// Author: Alyce Brady +// +// This class is based on the College Board's Environment interface +// and SquareEnvironment class, as allowed by the GNU General Public +// License. Environment and SquareEnvironment are components of +// the AP(r) CS Marine Biology Simulation case study +// (see http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import edu.kzoo.util.RandNumGenerator; + +import java.util.ArrayList; + +/** + * Grid Container Package:
+ * + * A Grid is a two-dimensional, rectangular container + * data structure. It can contain any kind of object that can be + * modeled using an extension of the GridObject class. + * For example, a grid could be used to model a board for a + * tic-tac-toe or chess game, an environment of fish for a marine + * biology simulation, etc. + * + *

+ * The Grid class is based on the College Board's + * Environment interface and SquareEnvironment + * class, as allowed by the GNU General Public License. + * + * @author Alyce Brady + * @version 13 December 2003 + * @see Direction + * @see Location + * @see GridObject + **/ + +public abstract class Grid +{ + // constants + + /** A constant representing an unbounded (or infinite) number of + * rows or columns in a grid. + **/ + public final static int UNBOUNDED = -1; + + // instance variables: encapsulated data for EACH Grid object + + /** Instance variable indicating whether the set of neighbors around + * each cell in the grid should include the 4 cells on the diagonals + * as well as the 4 cells with shared sides. + **/ + protected final boolean includeDiagonals; + + /** Instance variable containing the internal representation of the + * grid, which could be implemented in a number of ways. + **/ + protected final InternalRepresentation internalRep; + + + // constructors + + /** Constructs a Grid object with the specified internal + * representation. Each cell in this grid will have at most four + * adjacent neighbors, the cells to its north, south, east, and west. + * If the grid is bounded, cells along the boundaries will have fewer + * than four neighbors. + * @param rep the internal representation for the grid and the + * objects it contains + **/ + protected Grid(InternalRepresentation rep) + { + this(rep, false); + } + + /** Constructs a Grid object with the specified internal + * representation. Each cell in this grid will have at most four or + * eight adjacent neighbors, depending on the value of the + * includeDiagonalNeighbors parameter. If + * includeDiagonalNeighbors is true, each + * cell will have at most eight adjacent neighbors, the cells to + * its north, south, east, and west and the cells on the diagonals, + * to the northeast, southeast, northwest, and southwest. If + * includeDiagonalNeighbors is false, + * each cell will have at most the four neighbors to its north, + * south, east, and west. If the grid is bounded, cells along + * the boundaries will have fewer than the maximum four or eight + * neighbors. + * @param rep the internal representation for the grid and the + * objects it contains + * @param includedDiagonalNeighbors whether to include the four + * diagonal locations as neighbors + **/ + protected Grid(InternalRepresentation rep, + boolean includeDiagonalNeighbors) + { + internalRep = rep; + includeDiagonals = includeDiagonalNeighbors; + } + + + // accessor methods dealing with grid dimensions + + /** Returns number of rows in this grid. + * @return the number of rows, or UNBOUNDED if the grid + * is unbounded + **/ + public abstract int numRows(); + + /** Returns number of columns in this grid. + * @return the number of columns, or UNBOUNDED if the grid + * is unbounded + **/ + public abstract int numCols(); + + + // accessor methods for navigating around this grid + + /** Verifies whether a location is valid in this grid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc) + { + return internalRep.isValid(loc); + } + + /** Returns the number of adjacent neighbors around each cell. + * @return the number of adjacent neighbors + **/ + public int numAdjacentNeighbors() + { + return (includeDiagonals ? 8 : 4); + } + + /** Generates a random direction. The direction returned by + * randomDirection reflects the direction from + * a cell in the grid to one of its adjacent neighbors. + * @return a direction + **/ + public Direction randomDirection() + { + RandNumGenerator randNumGen = RandNumGenerator.getInstance(); + int randNum = randNumGen.nextInt(numAdjacentNeighbors()); + return new Direction(randNum * Direction.FULL_CIRCLE/numAdjacentNeighbors()); + } + + /** Returns the direction from one location to another. If + * fromLoc and toLoc are the same, + * getDirection arbitrarily returns Direction.NORTH. + * @param fromLoc starting location for search + * @param toLoc destination location + * @return direction from fromLoc to toLoc + **/ + public Direction getDirection(Location fromLoc, Location toLoc) + { + if (fromLoc.equals(toLoc)) + return Direction.NORTH; + int rowDifference = fromLoc.row() - toLoc.row(); // our coord system is upside down + int colDifference = toLoc.col() - fromLoc.col(); + double inRads = Math.atan2(rowDifference, colDifference); + double angle = 90 - Math.toDegrees(inRads); // convert to our sweep, North is 0 + Direction d = new Direction((int)angle); + return d.roundedDir(numAdjacentNeighbors(), Direction.NORTH); + } + + /** Returns the adjacent neighbor (whether valid or invalid) of a location + * in the specified direction. + * @param fromLoc starting location for search + * @param compassDir direction in which to look for adjacent neighbor + * @return neighbor of fromLoc in given direction + * (whether valid or not) + **/ + public Location getNeighbor(Location fromLoc, Direction compassDir) + { + Direction roundedDir = compassDir.roundedDir(numAdjacentNeighbors(), + Direction.NORTH); + + // Calculate neighboring location using sines and cosines. + // First have to adjust because our 0 is North, not East. + // The row change is the opposite of what is expected because + // our row numbers increase as they go down, not up. + int adjustedDegrees = 90 - roundedDir.inDegrees(); + double inRads = Math.toRadians(adjustedDegrees); + int colDelta = (int)(Math.cos(inRads) * Math.sqrt(2)); + int rowDelta = -(int)(Math.sin(inRads) * Math.sqrt(2)); + return new Location(fromLoc.row() + rowDelta, fromLoc.col() + colDelta); + } + + /** Returns the adjacent neighbors of a specified location. + * Only neighbors that are valid locations in the grid will be + * included. + * @param ofLoc location whose neighbors to get + * @return a list of locations that are neighbors of ofLoc + **/ + public ArrayList neighborsOf(Location ofLoc) + { + ArrayList nbrs = new ArrayList(); + + Direction d = Direction.NORTH; + for (int i = 0; i < numAdjacentNeighbors(); i++) + { + Location neighbor = getNeighbor(ofLoc, d); + if ( isValid(neighbor) ) + nbrs.add(neighbor); + d = d.toRight(Direction.FULL_CIRCLE/numAdjacentNeighbors()); + } + return nbrs; + } + + + // accessor methods that deal with objects in this grid + + /** Returns the number of objects in this grid. + * @return the number of objects + **/ + public synchronized int numObjects() + { + return internalRep.numObjects(); + } + + /** Returns all the objects in this grid. + * @return an array of all the grid objects + **/ + public synchronized GridObject[] allObjects() + { + return internalRep.allObjects(); + } + + /** Determines whether a specific location in this grid is empty. + * @param loc the location to test + * @return true if loc is a + * valid location in the context of this grid + * and is empty; false otherwise + **/ + public synchronized boolean isEmpty(Location loc) + { + return isValid(loc) && objectAt(loc) == null; + } + + /** Returns the object at a specific location in this grid. + * @param loc the location in which to look + * @return the object at location loc; + * null if loc is not + * in the grid or is empty + **/ + public synchronized GridObject objectAt(Location loc) + { + return internalRep.objectAt(loc); + } + + /** Creates a single string representing all the objects in this + * environment (not necessarily in any particular order). + * @return a string indicating all the objects in this environment + **/ + public synchronized String toString() + { + GridObject[] theObjects = allObjects(); + String s = "Grid contains " + numObjects() + " objects: "; + for ( int index = 0; index < theObjects.length; index++ ) + s += theObjects[index].toString() + " "; + return s; + } + + + // modifier methods + + /** Adds a new object to this grid at the specified location. + * (Precondition: obj.grid() and + * obj.location() are both null; + * loc is a valid empty location in this grid.) + * @param obj the new object to be added + * @throws IllegalArgumentException if the precondition is not met + **/ + public void add(GridObject obj, Location loc) + { + obj.addToGrid(this, loc); + } + + /** Adds the specified object to this grid at the location it specifies. + * This method is meant to be called only by + * GridObject.addToGrid because it assumes a + * broken GridObject invariant: the grid and location + * are set in the GridObject instance, but the object's + * location in the internal representation of the grid does not yet + * represent the object's own view of its location. + * (Precondition: obj.grid() is this grid and + * obj.location() is a valid empty location.) + * @param obj the new object to be added + * @throws IllegalArgumentException if the precondition is not met + **/ + final synchronized void internalAdd(GridObject obj) + { + // Verify precondition. + Location loc = obj.location(); + if ( obj.grid() != this || ! isEmpty(loc) ) + throw new IllegalArgumentException("Location " + loc + + " is not a valid empty location"); + + // Add object to the grid. + internalRep.add(obj); + } + + /** Removes the specified object from this grid. + * (Precondition: obj is in this grid.) + * @param obj the object to be removed + * @throws IllegalArgumentException if the precondition is not met + **/ + public synchronized void remove(GridObject obj) + { + // Make sure that the object is not in another grid. + if ( obj.grid() != this && obj.grid() != null ) + throw new IllegalArgumentException("Cannot remove " + + obj + " from another grid"); + + // The object should initiate its own removal from the grid so + // that its object invariant is not violated. + obj.removeFromGrid(); + } + + /** Removes whatever object is at the specified location in this grid. + * If there is no object at the specified location, this method does + * nothing. + * @param loc the location from which to remove an object + **/ + public void remove(Location loc) + { + // The object should initiate its own removal from the grid so + // that its object invariant is not violated. + GridObject obj = objectAt(loc); + if ( obj != null ) + obj.removeFromGrid(); + } + + /** Removes the specified object from this grid. This method is meant to + * be called only by GridObject.removeFromGrid; all object + * removals should proceed through that method. + * (Precondition: obj is in the process of being removed + * via GridObject.removeFromGrid and, as a result, its + * invariant does not hold. Specifically, + * obj.grid() == null but obj.location() + * correctly specifies the object's location in the grid.) + * @param obj the object to be removed + * @throws IllegalArgumentException if the precondition is not met + **/ + final synchronized void internalRemove(GridObject obj) + { + // Make sure that the object has initiated its own removal from + // the grid. + if ( obj.grid() != null || objectAt(obj.location()) != obj ) + throw new IllegalArgumentException("Object " + obj + + " is not in process of removing itself"); + + // The object is in the process of removing itself from the grid, + // so we can remove it. + internalRep.remove(obj); + } + + /** Removes all objects from this grid. + **/ + public synchronized void removeAll() + { + // Loop through the objects in the grid and remove them. + GridObject[] objectsToRemove = allObjects(); + for ( int i = 0; i < objectsToRemove.length; i++ ) + { + remove(objectsToRemove[i]); + } + } + + + /** The InternalRepresentation interface specifies + * the methods that any internal representation of the + * Grid class must implement. + */ + protected interface InternalRepresentation + { + // accessor methods + + /** Verifies whether a location is valid in this grid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + boolean isValid(Location loc); + + /** Returns the number of objects in this grid. + * @return the number of objects + **/ + int numObjects(); + + /** Returns all the objects in this grid. + * @return an array of all the grid objects + **/ + GridObject[] allObjects(); + + /** Returns the object at a specific location in this grid. + * @param loc the location in which to look + * @return the object at location loc; + * null if loc is not + * in the grid or is empty + **/ + GridObject objectAt(Location loc); + + + // modifier methods + + /** Adds a new object to this environment at the location it specifies. + * (Precondition: obj.grid() is this grid and + * obj.location() is a valid empty location; + * verified by the Grid object.) + * @param obj the new object to be added + **/ + void add(GridObject obj); + + /** Removes the object from this environment. + * (Precondition: obj is in this environment; verified + * by the Grid object.) + * @param obj the object to be removed + **/ + void remove(GridObject obj); + } + + + /** A ValidityChecker specifies a strategy for determining + * the validity of a location in a grid. Known implementing classes + * include BoundedGridValidityChecker and + * UnboundedGridValidityChecker. + **/ + public interface ValidityChecker + { + /** Verifies whether a location is valid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc); + } + + + /** A BoundedGridValidityChecker implements a strategy for + * determining the validity of a location in a bounded grid. + **/ + public static class BoundedGridValidityChecker implements ValidityChecker + { + private int numRows; + private int numCols; + + /** Constructs a BoundedGridValidityChecker object. + * (Precondition: rows > 0 and cols > 0.) + * @param rows number of rows in the grid + * @param cols number of columns in the grid + **/ + public BoundedGridValidityChecker(int rows, int cols) + { + numRows = rows; + numCols = cols; + } + + /** Verifies whether a location is valid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc) + { + if ( loc == null ) + return false; + + return (0 <= loc.row() && loc.row() < numRows) && + (0 <= loc.col() && loc.col() < numCols); + } + } + + + /** An UnboundedGridValidityChecker implements a strategy + * for determining the validity of a location in an unbounded grid. + **/ + public static class UnboundedGridValidityChecker implements ValidityChecker + { + /** Verifies whether a location is valid. + * @param loc location to check + * @return true if loc is valid; + * false otherwise + **/ + public boolean isValid(Location loc) + { + // All non-null locations are valid in an unbounded grid. + return loc != null; + } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.class b/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.class new file mode 100644 index 0000000..4310388 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.java b/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.java new file mode 100644 index 0000000..e7c1291 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/GridObject.java @@ -0,0 +1,211 @@ +// Class: GridObject +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +/** + * Grid Container Package:
+ * + * A GridObject object is an object that can be contained + * in a grid. If it is in a grid, it keeps track of its location + * there. When it moves, it notifies the grid. This ensures that the + * object and the grid in which it is located always agree about where + * the object is. + * + * Object invariant: + * 

+ *      this.grid() == null && this.location() == null ||
+ *      this.grid().objectAt(this.location()) == this
+ *
+ * + * @author Alyce Brady + * @version 13 December 2003 + * @see Grid + * @see Location + **/ + +public class GridObject +{ + // instance variables: encapsulated data for each GridObject instance + private Grid theGrid; // the grid holding this grid object + private Location myLoc; // this grid object's location + + // constructors + + /** Constructs an instance of a GridObject that is not yet in a grid. + **/ + public GridObject() + { + this(null, null); + // assert(theGridObjectInvariantHolds()); + } + + /** Constructs an instance of a GridObject and places it in the specified + * grid. + * (Precondition: either both loc and grid are + * null or neither is null; if loc + * is not null, it is a valid empty location in + * grid.) + * @param grid the grid in which this object should be placed + * @param loc the location of this grid object + * @throws IllegalArgumentException if the precondition is not met + **/ + public GridObject(Grid grid, Location loc) + { + theGrid = null; + myLoc = null; + + if ( grid != null && loc != null ) + { + addToGrid(grid, loc); + } + else if ( grid != null || loc != null ) + throw new IllegalArgumentException( + "Both grid and loc should be provided or both should be null."); + + // assert(theGridObjectInvariantHolds()); + } + + + // accessor methods + + /** Checks whether this object is in a grid. + * @return true if the object is in a grid; + * false otherwise + **/ + public final synchronized boolean isInAGrid() + { + // To be true, this object must be in the grid and at + // the correct location. + return ( this.grid() != null && + this.grid().objectAt(this.location()) == this ) ; + } + + /** Returns the grid in which this grid object exists. + * @return the grid containing this + * GridObject + **/ + public Grid grid() + { + return theGrid; + } + + /** Gets this grid object's location. + * @return the grid object's location + **/ + public Location location() + { + return myLoc; + } + + /** Verifies that the object invariant holds. + * @return true if the object invariant holds; + * false if it has been violated + **/ + protected final synchronized boolean theGridObjectInvariantHolds() + { + return ( (this.grid() == null && this.location() == null) || + isInAGrid() ) ; + } + + /** Returns a string representation of this grid object. + * @return a string representation of this grid object + **/ + public String toString() + { + return getClass().getName() + " " + location().toString(); + } + + + // public modifier method + + /** Acts. For example, acts for one step in an animation or simulation. + * This implementation of act does not, in fact, do + * anything, but subclasses may redefine it to have specific, + * application-dependent behavior. + **/ + public void act() + { + } + + // protected modifier methods: these are protected because not all subclasses + // will wish to allow client code to modify an object's location. + // Those subclasses that do should provide a public method to do so + // (e.g., a move method), which can, in turn, call the methods below. + + /** Adds this object to the specified grid at the specified location. + * (Precondition: this object is not currently in a grid; + * neither grid nor loc + * is null; loc is a valid + * empty location in grid.) + * @param grid the grid in which this object should be placed + * @param loc the location of this grid object + * @throws IllegalArgumentException if the precondition is not met + **/ + protected synchronized void addToGrid(Grid grid, Location loc) + { + // Verify parts of precondition not verified by Grid.internalAdd. + if ( this.grid() != null || grid == null || loc == null ) + throw new IllegalArgumentException(); + + // Set relevant instance variables and add to grid. + theGrid = grid; + myLoc = loc; + theGrid.internalAdd(this); + + // assert(theGridObjectInvariantHolds()); + } + + /** Modifies this grid object's location and notifies the grid. + * (Precondition: this object is in a grid and newLoc + * is a valid, empty location in the grid.) + * @param newLoc new location value + * @throws IllegalArgumentException if the precondition is not met + **/ + protected synchronized void changeLocation(Location newLoc) + { + // Verify precondition. + if ( ! isInAGrid() || ! theGrid.isEmpty(newLoc) ) + throw new IllegalArgumentException(); + + if ( ! newLoc.equals(myLoc) ) + { + Grid theGridIStillWantToBeIn = theGrid; + removeFromGrid(); + addToGrid(theGridIStillWantToBeIn, newLoc); + } + + // assert(theGridObjectInvariantHolds()); + } + + /** Removes this object from the grid in which it was located. + **/ + protected synchronized void removeFromGrid() + { + // No action is necessary if this object isn't in a grid. + if ( ! isInAGrid() ) + return; + + // The grid and grid object should both notify the other + // when an object is removed. We set theGrid to null BEFORE + // notifying the grid to break the circularity. + Grid tempGrid = theGrid; + theGrid = null; + tempGrid.internalRemove(this); + myLoc = null; + + // assert(theGridObjectInvariantHolds()); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Location.class b/02 Recursion/06 NQueens/edu/kzoo/grid/Location.class new file mode 100644 index 0000000..6c643f6 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/Location.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/Location.java b/02 Recursion/06 NQueens/edu/kzoo/grid/Location.java new file mode 100644 index 0000000..8b13562 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/Location.java @@ -0,0 +1,121 @@ +// AP(r) Computer Science Marine Biology Simulation: +// The Location class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +/** + * AP® Computer Science Marine Biology Simulation:
+ * A Location object represents the row and column of a + * location in a two-dimensional grid. + * + *

+ * The Location class is + * copyright© 2002 College Entrance Examination Board + * (www.collegeboard.com). + * + * @author Alyce Brady + * @author Chris Nevison + * @author APCS Development Committee + * @version 1 July 2002 + **/ + +public class Location implements Comparable +{ + // Instance Variables: Encapsulated data for each Location object + private int myRow; // row location in grid + private int myCol; // column location in grid + + /** Constructs a Location object. + * @param row location's row + * @param col location's column + **/ + public Location(int row, int col) + { + myRow = row; + myCol = col; + } + + // accessor methods + + /** Returns the row coordinate of this location. + * @return row of this location + **/ + public int row() + { + return myRow; + } + + /** Returns the column coordinate of this location. + * @return column of this location + **/ + public int col() + { + return myCol; + } + + /** Indicates whether some other Location object is + * "equal to" this one. + * @param other the other location to test + * @return true if other is at the + * same row and column as the current location; + * false otherwise + **/ + public boolean equals(Object other) + { + if ( ! (other instanceof Location) ) + return false; + + Location otherLoc = (Location) other; + return row() == otherLoc.row() && col() == otherLoc.col(); + } + + /** Generates a hash code for this location + * (will not be tested on the Advanced Placement exam). + * @return a hash code for a Location object + **/ + public int hashCode() + { + return row() * 3737 + col(); + } + + /** Compares this location to other for ordering. + * Returns a negative integer, zero, or a positive integer as this + * location is less than, equal to, or greater than other. + * Locations are ordered in row-major order. + * (Precondition: other is a Location object.) + * @param other the other location to test + * @return a negative integer if this location is less than + * other, zero if the two locations are equal, + * or a positive integer if this location is greater than + * other + **/ + public int compareTo(Object other) + { + Location otherLoc = (Location) other; + if ( equals(other) ) + return 0; + if ( row() == otherLoc.row() ) + return col() - otherLoc.col(); + return row() - otherLoc.row(); + } + + /** Represents this location as a string. + * @return a string indicating the row and column of the + * location in (row, col) format + **/ + public String toString() + { + return "(" + row() + ", " + col() + ")"; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.class b/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.class new file mode 100644 index 0000000..fd551b8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.java b/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.java new file mode 100644 index 0000000..3f1c7e0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/PictureBlock.java @@ -0,0 +1,86 @@ +// Class: PictureBlock +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import javax.swing.ImageIcon; + +/** + * Grid Container Package:
+ * + * A PictureBlock object encapsulates a picture (an image + * read from a file) to be put in a cell in a grid. + * + * @author Alyce Brady + * @version 10 November 2004 + * @see Grid + * @see Location + **/ +public class PictureBlock extends GridObject +{ + // Encapsulated data for each picture block object + private ImageIcon icon; + private String description; + + /** Constructs a picture block encapsulating the image in the specified + * file. Looks for the named file first in the jar file, then in the + * current directory. + * @param imageFilename name of file containing image + * @param description description of this picture block object (used + * by the toString method) + **/ + public PictureBlock(String imageFilename, String description) + { + this(imageFilename, description, null, null); + } + + /** Constructs a picture block encapsulating the image in the specified + * file. Looks for the named file first in the jar file, then in the + * current directory. + * @param imageFilename name of file containing image + * @param description description of this picture block object (used + * by the toString method) + * @param grid the grid containing this picture block + * @param loc the location of the picture block in grid + **/ + public PictureBlock(String imageFilename, String description, + Grid grid, Location loc) + { + super(grid, loc); + this.description = description; + java.net.URL urlInJarFile = getClass().getResource(imageFilename); + if (urlInJarFile != null) + icon = new ImageIcon(urlInJarFile); + else + { + String path = System.getProperty("user.dir") + + java.io.File.separator + imageFilename; + icon = new ImageIcon(path); + } + } + + /** Gets picture associated with this picture block. + **/ + public ImageIcon pictureIcon() + { + return icon; + } + + /** Returns the description of the picture provided to the constructor. **/ + public String toString() + { + return description; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.class b/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.class new file mode 100644 index 0000000..2baa38b Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.java b/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.java new file mode 100644 index 0000000..11c8066 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/TextCell.java @@ -0,0 +1,95 @@ +// Class: TextCell +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid; + +import java.awt.Color; + +/** + * Grid Container Package:
+ * + * A TextCell object encapsulates text to go in a + * cell in a grid. + * + * @author Alyce Brady + * @version 13 December 2003 + * @see Grid + * @see Location + **/ +public class TextCell extends GridObject +{ + // Encapsulated data for each text cell object + private String theText; // the text to go in a cell in the grid + private Color theColor; // the color of this color block + + /** Constructs a text cell with the specified text and a default color + * of black. + * @param text the text to go in this cell + **/ + public TextCell(String text) + { + this(text, Color.black); + } + + /** Constructs a text cell with the specified text and color. + * @param text the text to go in this cell + * @param textColor the color of the text + **/ + public TextCell(String text, Color textColor) + { + super(); + theText = text; + theColor = textColor; + } + + /** Constructs a text cell at a given location of a grid with the + * specified text and a default color of black. + * @param text the text to go in this cell + * @param grid the grid containing this text cell + * @param loc the location of the text cell in grid + **/ + public TextCell(String text, Grid grid, Location loc) + { + this(text, Color.black, grid, loc); + } + + /** Constructs a text cell at a given location of a grid with the + * specified text and color. + * @param text the text to go in this cell + * @param textColor the color of the text + * @param grid the grid containing this text cell + * @param loc the location of the text cell in grid + **/ + public TextCell(String text, Color textColor, Grid grid, Location loc) + { + super(grid, loc); + theText = text; + theColor = textColor; + } + + /** Gets text in this text cell. + **/ + public String text() + { + return theText; + } + + /** Gets color of text. + **/ + public Color color() + { + return theColor; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.class new file mode 100644 index 0000000..e77788f Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.java new file mode 100644 index 0000000..4066651 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/CheckeredBackgroundDisplay.java @@ -0,0 +1,92 @@ +// Class: CheckeredBackgroundDisplay +// +// Author: Joel Booth +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import java.awt.Color; +import java.awt.Graphics2D; +import java.awt.Insets; + +import edu.kzoo.grid.Grid; + +/** + * Grid Display Package:
+ * + * The GridBackgroundDisplay interface specifies the + * method that must be provided by any class used to display + * a Grid background. + * + * @author Joel Booth + * @version Sep 1, 2004 + **/ +public class CheckeredBackgroundDisplay implements GridBackgroundDisplay +{ + private ScrollableGridDisplay overallDisplay; + private Color upperLeftColor; + private Color otherColor; + + /** Constructs a background display that draws a checkered background + * for a grid, using the specified colors. + * @param enclosingDisplay the overall grid display for which this + * object will draw the background + * @param upperLeftColor color to display in upper-left corner + * and every other cell after that + * @param otherColor the alternate color + **/ + public CheckeredBackgroundDisplay(ScrollableGridDisplay enclosingDisplay, + Color upperLeftColor, Color otherColor) + { + this.overallDisplay = enclosingDisplay; + this.upperLeftColor = upperLeftColor; + this.otherColor = otherColor; + } + + /* (non-Javadoc) + * @see edu.kzoo.grid.display.GridBackgroundDisplay#drawBackground(java.awt.Graphics2D) + */ + public void drawBackground(Graphics2D g2) + { + // Fill the background with one of the two colors. + overallDisplay.fillBackground(g2, otherColor); + + // Fill in the checkerboard pattern with the other color. + Insets insets = overallDisplay.getInsets(); + + int leftSide; + int topSide; + + Grid grid = overallDisplay.grid(); + for (int row = 0; row < grid.numRows(); row++) + { + for (int col = 0; col < grid.numCols(); col++) + { + // Calculate upper left corner of the cell to draw. + leftSide = overallDisplay.colToXCoord(col); + topSide = overallDisplay.rowToYCoord(row); + + // Put the other checkered color in the top-left cell and + // every other cell whose row and column are both even or + // both odd. + if ( (col % 2) == (row % 2 ) ) + { + g2.setColor(upperLeftColor); + g2.fillRect(leftSide, topSide, + overallDisplay.innerCellSize(), + overallDisplay.innerCellSize()); + } + } + } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.class new file mode 100644 index 0000000..f66844f Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.java new file mode 100644 index 0000000..1f1da2a --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ColorBlockDisplay.java @@ -0,0 +1,76 @@ +// Class: ColorBlockDisplay +// +// Author: Alyce Brady +// Modified: 21 March 2004: Modified to handle any class that has +// a color method, not just ColorBlock objects. +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.Color; +import java.awt.Component; +import java.awt.Graphics2D; +import java.awt.geom.Rectangle2D; +import java.lang.reflect.InvocationTargetException; +import java.lang.reflect.Method; + +/** + * Grid Display Package:
+ * + * A ColorBlockDisplay object displays a + * ColorBlock object, or any object with a + * color method, as a color block in a grid. + * + * @author Alyce Brady + * @version 21 March 2004 + **/ +public class ColorBlockDisplay extends ScaledDisplay +{ + + /** Draw the given object as a block of color. + * (Precondition: obj has a color method.) + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + **/ + public void draw(GridObject obj, Component comp, Graphics2D g2) + { + // Get the color of the object. + Class objClass = obj.getClass(); + Color objColor; + try + { + Method colorMethod = objClass.getMethod("color", new Class[0]); + objColor = (Color)colorMethod.invoke(obj, new Object[0]); + } + catch (NoSuchMethodException e) + { throw new IllegalArgumentException("Cannot get color for object of " + + objClass + " class; cannot invoke color method."); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException("Cannot get color for object of " + + objClass + " class; exception thrown in color method."); } + catch (IllegalAccessException e) + { throw new IllegalArgumentException("Cannot get color for object of " + + objClass + " class; cannot access color method."); } + + // Draw a 1 x 1 rectangle centered around (0, 0). Temporarily + // scale up first. + float scaleFactor = 10; + g2.scale(1.0/scaleFactor, 1.0/scaleFactor); + g2.setPaint(objColor); + g2.fill(new Rectangle2D.Double(-5, -5, 10, 10)); + g2.scale(scaleFactor, scaleFactor); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.class new file mode 100644 index 0000000..43b9cfd Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.java new file mode 100644 index 0000000..ed18ee0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplay.java @@ -0,0 +1,43 @@ +// Class: DefaultDisplay +// +// Modified: 15 September 2004: Most functionality moved to the TextDisplay +// class. +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +/** + * Grid Display Package:
+ * + * A DefaultDisplay draws a centered question-mark. + * A DefaultDisplay object is used to display any + * grid object that doesn't have a specialized display object. + * The association between a particular GridObject + * subclass and its display object is handled in the + * DisplayMap class. + * + * @author Alyce Brady + * @version 15 September 2004 + * @see DisplayMap + **/ +public class DefaultDisplay extends TextDisplay +{ + + /** Gets the text string to draw. + */ + protected String getText(GridObject obj) + { + return "?"; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.class new file mode 100644 index 0000000..4668acf Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.java new file mode 100644 index 0000000..07df4d5 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DefaultDisplayFactory.java @@ -0,0 +1,162 @@ +// Class: DefaultDisplayFactory +// +// Author: Alyce Brady +// +// Created on Mar 1, 2005 +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import java.util.HashSet; +import java.util.Iterator; + +/** + * Grid Display Package:
+ * + * The DefaultDisplayFactory class contains methods + * that provide a suitable default display for a given class. + * + * @author Alyce Brady + * @version Mar 1, 2005 + **/ +public class DefaultDisplayFactory +{ + private static GridObjectDisplay baseDefault = new DefaultDisplay(); + private static String baseSuffixes[] = {"gif", "GIF", + "jpg", "jpeg", "JPG", "JPEG"}; + private static HashSet suffixes = new HashSet(); + + static + { + for ( int i = 0; i < baseSuffixes.length; i++ ) + suffixes.add(baseSuffixes[i]); + } + + /** Adds the specified suffix to the list of image suffixes to look for. + * @param suffix image suffix (e.g., "tiff") + */ + public static void addSuffix(String suffix) + { + suffixes.add(suffix); + } + + /** Returns a DefaultDisplay object. + **/ + public static GridObjectDisplay getDefaultDisplay() + { + return baseDefault; + } + + /** Returns a default display specific to the given class if there + * is one. In the following detailed description of which + * display object is returned, assume that ClassName + * is the base class name passed in as a parameter and package + * is the name of the package in which that class resides. The + * returned display is: + *

    + *
  • a ClassNameDisplay object if there is a + * a ClassNameDisplay class with a default + * (no-parameter) constructor in package, in + * the associated display package (package.display), + * or in the unnamed default display + *
  • a ScaledImageDisplay object if there is a + * an image file named ClassName.sfx in the jar + * file or current directory (where sfx is one of + * the following suffixes: gif, GIF, jpg, JPG, jpeg, JPEG, + * or any added with the addSuffix method) + * If no default display specific to the given class is available, + * this method returns null. + * @param className the name of the class for which to find + * a default display + **/ + public static GridObjectDisplay getDefaultDisplay(Class cls) + { + return getDefaultDisplay(cls.getName()); + } + + /** Returns a default display specific to the given class if there + * is one. In the following detailed description of which + * display object is returned, assume that ClassName + * is the base class name passed in as a parameter and package + * is the name of the package in which that class resides. The + * returned display is: + *
      + *
    • a ClassNameDisplay object if there is a + * a ClassNameDisplay class with a default + * (no-parameter) constructor in package, in + * the associated display package (package.display), + * or in the unnamed default display + *
    • a ScaledImageDisplay object if there is a + * an image file named ClassName.sfx in the jar + * file or current directory (where sfx is one of + * the following suffixes: gif, GIF, jpg, JPG, jpeg, JPEG, + * or any added with the addSuffix method) + * If no default display specific to the given class is available, + * this method returns null. + * @param className the name of the class for which to find + * a default display + **/ + public static GridObjectDisplay getDefaultDisplay(String className) + { + // If the className includes package information, strip it. + String packageName = null; + String baseName = className; + int endOfPkgPrefix = className.lastIndexOf('.'); + if ( endOfPkgPrefix != -1 ) + { + packageName = className.substring(0, endOfPkgPrefix); + baseName = className.substring(endOfPkgPrefix + 1); + } + + // Look for ...Display class in a package. + if ( packageName != null ) + { + // Look in that package. + try + { + Class dispClass = Class.forName(className + "Display"); + return (GridObjectDisplay) dispClass.newInstance(); + } + catch (Exception e) { /* Just go on to next section. */ } + + // Look in the related display package. + String tempName = packageName + ".display." + baseName; + try + { + Class dispClass = Class.forName(tempName + "Display"); + return (GridObjectDisplay) dispClass.newInstance(); + } + catch (Exception e) { /* Just go on to next section. */ } + } + + // Look for ...Display class in unnamed default package. + try + { + Class dispClass = Class.forName(baseName + "Display"); + return (GridObjectDisplay) dispClass.newInstance(); + } + catch (Exception e) { /* Just go on to next section. */ } + + // Look for related image files, e.g., ClassName.gif. + Iterator it = suffixes.iterator(); + while ( it.hasNext() ) + { + String suffix = (String) it.next(); + String imageFilename = baseName + "." + suffix; + ScaledImageDisplay disp = new ScaledImageDisplay(imageFilename); + if ( disp.imageLoadedOK() ) + return disp; + } + return null; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.class new file mode 100644 index 0000000..c6e2ca3 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.java new file mode 100644 index 0000000..457ed0e --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayDecorator.java @@ -0,0 +1,37 @@ +// Class: DisplayDecorator +// +// Author: Joel Booth +// +// The Display decorator provides an interface for decorators +// to be used on the different display types. +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; +import java.awt.Component; +import java.awt.Graphics2D; + +/** + * Grid Display Package:
      + * + * A DisplayDecorator provides an interface for any decorator + * that will be used in the Display package. All decorators must implement + * the interface in order to be added to a Display object. + + * @author Joel Booth + * @version 28 July 2004 + */ +public interface DisplayDecorator { + + public abstract void decorate(ScaledDisplay sd, GridObject obj, Component comp, Graphics2D g2); +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.class new file mode 100644 index 0000000..ca1a719 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.java new file mode 100644 index 0000000..f1506fd --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/DisplayMap.java @@ -0,0 +1,107 @@ +// Class: DisplayMap +// +// This is a modified version of the College Board's DisplayMap class, +// as allowed by the GNU General Public License. DisplayMap is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// The modifications were to make DisplayMap work with GridObject and +// GridObjectDisplay objects. +// Modified on 1 March 2005 to look for default display classes or +// image files corresponding to the class to display. +// +// The original copyright and license information for DisplayMap is: +// +// AP(r) Computer Science Marine Biology Simulation: +// The DisplayMap class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.util.HashMap; + +/** + * Grid Display Package:
      + * + * DisplayMap is a collection that maps grid + * object classes to objects that know how to display them. + * + *

      + * The DisplayMap class is based on the + * College Board's DisplayMap class, + * as allowed by the GNU General Public License. + * + * @author Alyce Brady + * @author Jeff Raab, Northeastern University + * @author Alyce Brady (modified 1 March 2005 to look for default + * display classes or image files corresponding to + * a particular class name) + * @version 1 March 2005 + **/ +public class DisplayMap +{ + // Class Variables: Not tied to any one DisplayMap object + private static HashMap map = new HashMap(); // the collection + private static GridObjectDisplay defaultDisplay = new DefaultDisplay(); + + /** Associates a display object with a grid object class. If + * no class can be found for that name, an error message is printed. + * @param gridObjClassname the name of a class whose objects might be + * in an Grid + * @param displayObj object that knows how to display + * objects of class gridObjClassname + **/ + public static void associate(String gridObjClassname, + GridObjectDisplay displayObj) + { + try + { + // Store the actual class rather than the classname in the map. + Class gridObjClass = Class.forName(gridObjClassname); + map.put(gridObjClass, displayObj); + } + catch (ClassNotFoundException e) + { + System.err.println("DisplayMap was unable to find class named " + + gridObjClassname + + " to associate with display object.\n" + + "Will use default display instead." ); + } + } + + /** Finds a display class that knows how to display the given object. + * @param obj the object to display + **/ + public static GridObjectDisplay findDisplayFor(GridObject obj) + { + // Go up through the class hierarchy for obj and see + // if there is a display for its class or superclasses. + for ( Class c = obj.getClass(); c != Object.class; + c = c.getSuperclass() ) + { + GridObjectDisplay display = (GridObjectDisplay) map.get(c); + if ( display != null ) + return display; + display = DefaultDisplayFactory.getDefaultDisplay(c); + if ( display != null ) + return display; + + } + + // No specific display found; use default display for generic + // GridObject instance. + return defaultDisplay; + } +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.class new file mode 100644 index 0000000..870439a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.java new file mode 100644 index 0000000..5c55ec9 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridBackgroundDisplay.java @@ -0,0 +1,37 @@ +// Interface: GridBackgroundDisplay +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import java.awt.Graphics2D; + +/** + * Grid Display Package:
      + * + * The GridBackgroundDisplay interface specifies the + * method that must be provided by any class used to display + * a Grid background. + * + * @author Alyce Brady + * @version 1 September 2004 + **/ +public interface GridBackgroundDisplay +{ + + /** Draws the grid background. + * @param g2 the Graphics2 object to use to render + **/ + void drawBackground(Graphics2D g2); + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.class new file mode 100644 index 0000000..4196626 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.java new file mode 100644 index 0000000..f5f4bac --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridDisplay.java @@ -0,0 +1,51 @@ +// Interface: GridDisplay +// +// Author: Alyce Brady +// +// This class is based on the College Board's EnvDisplay class, as +// allowed by the GNU General Public License. EnvDisplay is a +// black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.Grid; + +/** + * Grid Display Package:
      + * + * The GridDisplay interface specifies the + * methods that must be provided by any class used to display + * a Grid object and its contents. + * + *

      + * The GridDisplay class is based on the + * College Board's EnvDisplay class, + * as allowed by the GNU General Public License. + * + * @author Alyce Brady + * @version 13 December 2003 + **/ +public interface GridDisplay +{ + /** Sets the Grid being displayed. + * @param grid the Grid to display + **/ + void setGrid(Grid grid); + + /** Shows the current state of the grid. + **/ + void showGrid(); + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.class new file mode 100644 index 0000000..0065f21 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.java new file mode 100644 index 0000000..b04c78c --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/GridObjectDisplay.java @@ -0,0 +1,65 @@ +// Class: GridObjectDisplay +// +// Author: Alyce Brady +// +// This class is based on the College Board's LocatableDisplay class, +// as allowed by the GNU General Public License. LocatableDisplay is a +// component of the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.Graphics2D; +import java.awt.Component; +import java.awt.Rectangle; + +/** + * Grid Display Package:
      + * + * The GridObjectDisplay interface contains the + * method needed to display an object in a grid. + * Objects that implement the GridObjectDisplay + * interface are called on by the GridDisplay to + * draw grid objects. The association between a + * particular GridObject subclass and its display + * is handled in the DisplayMap class. + * + *

      + * The GridObjectDisplay class is based on the + * College Board's LocatableDisplay class, + * as allowed by the GNU General Public License. + * + * @author Alyce Brady + * @version 13 December 2003 + * @see DisplayMap + **/ +public interface GridObjectDisplay +{ + /** Method invoked to draw a GridObject. The first argument is the + * grid object to draw, the second the component, the third the + * drawing surface, the last is the rectangle in which to draw. A + * class that implements this interface should draw a representation of + * the given GridObject object on the drawing surface in the given + * rectangle. + * + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + * @param rect rectangle in which to draw + **/ + void draw(GridObject obj, Component c, Graphics2D g2, Rectangle rect); + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.class new file mode 100644 index 0000000..c470693 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.java new file mode 100644 index 0000000..20c5da4 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PictureBlockDisplay.java @@ -0,0 +1,82 @@ +// Class: PictureBlockDisplay +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; +import edu.kzoo.grid.GridObject; + +import java.awt.Component; +import java.awt.Graphics2D; +import java.lang.reflect.InvocationTargetException; +import java.lang.reflect.Method; + +import javax.swing.ImageIcon; + +/** + * Grid Display Package:
      + * + * A PictureBlockDisplay object displays a + * PictureBlock object, or any object with a + * pictureIcon method, as a picture in a grid. + * + * @author Alyce Brady + * @version 10 November 2004 + **/ +public class PictureBlockDisplay extends ScaledImageDisplay +{ + /** Constructs a display object that can display grid objects that have + * a pictureIcon method. + **/ + public PictureBlockDisplay() + { + } + + /** Draws a unit-length object using an image. + * This implementation draws the object by scaling + * the image provided to the constructor. It calls + * the adjust method to make further + * adjustments (for example, rotating and tinting + * the image) as appropriate. + * (Precondition: obj has a pictureIcon method.) + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + **/ + public void draw(GridObject obj, Component comp, Graphics2D g2) + { + Class objClass = obj.getClass(); + + // Get the picture to display. + String errorBeginning = "Cannot get picture for object of " + + objClass + " class; "; + ImageIcon objIcon; + try + { + Method iconMethod = objClass.getMethod("pictureIcon", new Class[0]); + objIcon = (ImageIcon)iconMethod.invoke(obj, new Object[0]); + } + catch (NoSuchMethodException e) + { throw new IllegalArgumentException(errorBeginning + + "cannot invoke pictureIcon method."); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException(errorBeginning + + "exception thrown in pictureIcon method."); } + catch (IllegalAccessException e) + { throw new IllegalArgumentException(errorBeginning + + "cannot access pictureIcon method."); } + + setIcon(objIcon); + super.draw(obj, comp, g2); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$1.class new file mode 100644 index 0000000..5af899b Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$Pannable.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$Pannable.class new file mode 100644 index 0000000..f9f5b5e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport$Pannable.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.class new file mode 100644 index 0000000..8ce285a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.java new file mode 100644 index 0000000..6265a58 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/PseudoInfiniteViewport.java @@ -0,0 +1,184 @@ +// AP(r) Computer Science Marine Biology Simulation: +// The PseudoInfiniteViewport class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import java.awt.Point; +import java.awt.Dimension; +import java.awt.Color; +import java.awt.event.ActionListener; +import java.awt.event.ActionEvent; + +import javax.swing.JPanel; +import javax.swing.JScrollPane; +import javax.swing.JToolTip; +import javax.swing.JViewport; +import javax.swing.SwingUtilities; +import javax.swing.Timer; + +/** + * AP® Computer Science Marine Biology Simulation:
      + * A PseudoInfiniteViewport is a + * JViewport subclass that + * translates scroll actions into pan actions across an + * unbounded view. + * + *

      + * The PseudoInfiniteViewport class is + * copyright© 2002 College Entrance Examination Board + * (www.collegeboard.com). + * + * @author Julie Zelenski + * @version 1 August 2002 + **/ + +public class PseudoInfiniteViewport extends JViewport +{ + /** The Pannable interface contains those methods that + * the view in a PseudoInfiniteViewport needs to support + * to enable panning behavior along with scrolling. + **/ + public interface Pannable + { + void panBy(int hDelta, int vDelta); + boolean isPannableUnbounded(); + String getPannableTipText(); // return null if no tip desired + } + + private static final int ORIGIN_TIP_DELAY = 1000; + + private JScrollPane scrollParent; + private JPanel glassPane; + private JToolTip originTip; + private Timer originTipTimer; + private Point panPoint = new Point(0,0); + + /** Construct a new PseudoInfiniteViewport object for the given scrollpane. + * @param parent the JScrollPane for which this will be the viewport + **/ + public PseudoInfiniteViewport(JScrollPane parent) + { + scrollParent = parent; + setBackground(Color.lightGray); + } + + /** Sets the view position (upper left) to a new point. Overridden from + * JViewport to do a pan, instead of scroll, on an unbounded view. + * @param pt the Point to become the upper left + **/ + public void setViewPosition(Point pt) + { + boolean isAdjusting = scrollParent.getVerticalScrollBar().getValueIsAdjusting() + || scrollParent.getHorizontalScrollBar().getValueIsAdjusting(); + boolean changed = true; + + if (viewIsUnbounded()) + { + int hDelta = pt.x - panPoint.x; + int vDelta = pt.y - panPoint.y; + if (hDelta != 0 && vDelta == 0) + getPannableView().panBy(hDelta, vDelta); + else if (vDelta != 0 && hDelta == 0) + getPannableView().panBy(hDelta, vDelta); + else + changed = false; // no pan action was taken + panPoint = pt; + if (!panPoint.equals(getPanCenterPoint()) && !isAdjusting) + { // needs recentering + panPoint = getPanCenterPoint(); + fireStateChanged(); // update scrollbars to match + } + } + else // ordinary scroll behavior + { + changed = !getViewPosition().equals(pt); + super.setViewPosition(pt); + } + if (changed || isAdjusting) showOriginTip(); // briefly show tip + } + + + /** Returns current view position (upper left). Overridden from + * JViewport to use pan center point for unbounded view. + **/ + public Point getViewPosition() + { + return (viewIsUnbounded() ? getPanCenterPoint() : super.getViewPosition()); + } + + /** Returns current view size. Overridden from + * JViewport to use preferred virtual size for unbounded view. + **/ + public Dimension getViewSize() + { + return (viewIsUnbounded() ? getView().getPreferredSize() : super.getViewSize()); + } + + /** Shows a tool tip over the upper left corner of the viewport + * with the contents of the pannable view's pannable tip text + * (typically a string identifiying the corner point). Tip is + * removed after a short delay. + **/ + public void showOriginTip() + { + if (getRootPane() == null) return; + // draw in glass pane to appear on top of other components + if (glassPane == null) + { + getRootPane().setGlassPane(glassPane = new JPanel()); + glassPane.setOpaque(false); + glassPane.setLayout(null); // will control layout manually + glassPane.add(originTip = new JToolTip()); + originTipTimer = new Timer(ORIGIN_TIP_DELAY, new ActionListener() { + public void actionPerformed(ActionEvent evt) { glassPane.setVisible(false); }}); + originTipTimer.setRepeats(false); + } + String tipText = getPannableView().getPannableTipText(); + if (tipText == null) return; + + // set tip text to identify current origin of pannable view + originTip.setTipText(tipText); + + // position tip to appear at upper left corner of viewport + originTip.setLocation(SwingUtilities.convertPoint(this, getLocation(), glassPane)); + originTip.setSize(originTip.getPreferredSize()); + + // show glass pane (it contains tip) + glassPane.setVisible(true); + + // this timer will hide the glass pane after a short delay + originTipTimer.restart(); + } + + + // some simple private helpers + + private Pannable getPannableView() + { + return (Pannable)getView(); + } + + private boolean viewIsUnbounded() + { + Pannable p = getPannableView(); + return (p != null && p.isPannableUnbounded()); + } + + private Point getPanCenterPoint() + { + Dimension size = getViewSize(); + return new Point(size.width/2, size.height/2); + } + + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.class new file mode 100644 index 0000000..19ceadf Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.java new file mode 100644 index 0000000..2dfabc0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/RotatedDecorator.java @@ -0,0 +1,104 @@ +// Class: RotatedDecorator +// +// Author: Joel Booth +// +// This decorator allows objects being displayed to adjust for their direction. +// It was designed so that it can be applied to any subclass of ScaledDisplay +// as long as the Object it is associated with has a Direction. +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; +import java.awt.Component; +import java.awt.Graphics2D; + +import edu.kzoo.grid.Direction; + +import java.lang.reflect.Method; +import java.lang.reflect.InvocationTargetException; + +/** + * Grid Display Package:
      + * + * A RotatedDecorator will allow a display to change as the + * object it is associated with changes direction. The GridObject + * must have a Direction direction in order for it to work. + * + * @author Joel Booth + * @version 28 July 2004 + * + */ +public class RotatedDecorator implements DisplayDecorator { + + //The original direction the object was facing + Direction originalDirection; + + /** + * Construct a new RotatedDecorator that can be + * added to a ScaledDisplay. + * @param d The origrinal direction the object is facing + */ + public RotatedDecorator(Direction d) { + originalDirection = d; + } + + /** Apply the rotating aspect of the decoration. It is called from the class that + * has added the decorator. + */ + public void decorate(ScaledDisplay sd, GridObject obj, Component comp, Graphics2D g2) { + // Rotate drawing surface to compensate for the direction of the object + // in the image (in case it is not facing North, as assumed). + if ( ! originalDirection.equals(Direction.NORTH) ) + { + int rotationInDegrees = originalDirection.inDegrees(); + g2.rotate(- Math.toRadians(rotationInDegrees)); + if (rotationInDegrees >= 180) + g2.scale(1, -1); // flip image upside-down + } + + // Now rotate again to represent the direction the object is facing. + adjustForDirection(obj, g2); + } + + /** Adjusts the graphics system for drawing an object with direction. + * (Precondition: obj has a direction method.) + * @param obj object we want to draw + * @param g2 drawing surface + **/ + public static void adjustForDirection(GridObject obj, Graphics2D g2) + { + // Rotate drawing surface to capture object's orientation + // (direction). (Assumption is that without rotating the + // drawing surface the object will be drawn facing North.) + // Object must have a direction method. + Class objClass = obj.getClass(); + try + { + Method dirMethod = objClass.getMethod("direction", new Class[0]); + Direction dir = (Direction)dirMethod.invoke(obj, new Object[0]); + int rotationInDegrees = dir.inDegrees(); + g2.rotate(Math.toRadians(rotationInDegrees)); + //return rotationInDegrees; + } + catch (NoSuchMethodException e) + { throw new IllegalArgumentException("Cannot rotate object of " + objClass + + " class; cannot invoke direction method."); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException("Cannot rotate object of " + objClass + + " class; exception in direction method."); } + catch (IllegalAccessException e) + { throw new IllegalArgumentException("Cannot rotate object of " + objClass + + " class; cannot access direction method."); } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.class new file mode 100644 index 0000000..f60e582 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.java new file mode 100644 index 0000000..df08c3b --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledDisplay.java @@ -0,0 +1,124 @@ +// Class: ScaledDisplay +// +// Author: Alyce Brady, Joel Booth +// +// This class is based on the College Board's AbstractFishDisplay class, +// as allowed by the GNU General Public License. AbstractFishDisplay is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.BasicStroke; +import java.awt.Component; +import java.awt.Graphics2D; +import java.awt.Rectangle; + +import java.util.ArrayList; + +/** + * Grid Display Package:
      + * + * This abstract class provides common implementation code for + * drawing a GridObject object. The class will translate and + * scale the graphics system as needed and then invoke its + * abstract draw method. Subclasses of this abstract class + * define draw to just display an object with a fixed size. + * + * @author Alyce Brady (based on AbstractFishDisplay by Julie Zelenski) + * @author Joel Booth (Added the mechanism to allow for decorators) + * @version 28 July 2004 + **/ +public abstract class ScaledDisplay implements GridObjectDisplay +{ + + // Instance Variables + private ArrayList decorations = new ArrayList(); + + /** Draw the given GridObject object. + * Subclasses should implement this method to draw the object in a + * cell of size (1,1) centered around (0,0) on the drawing surface. + * (All scaling has been done beforehand). + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + **/ + abstract public void draw(GridObject obj, Component comp, Graphics2D g2); + + + /** Draw the given object. + * Scales the coordinate appropriately then invokes the simple + * draw method above that is only responsible for drawing a + * unit-length object. + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + * @param rect rectangle in which to draw + **/ + public void draw(GridObject obj, Component comp, Graphics2D g2, + Rectangle rect) + { + // Translate to center of object + g2.translate(rect.x + rect.width/2, rect.y + rect.height/2); + + // Scale to size of rectangle, adjust stroke back to 1-pixel wide + float scaleFactor = Math.min(rect.width, rect.height); + g2.scale(scaleFactor, scaleFactor); + g2.setStroke(new BasicStroke(1.0f/scaleFactor)); + + // Apply the decorators + if (!decorations.isEmpty()) { + for (int i = 0; i < decorations.size(); i++) { + ((DisplayDecorator)decorations.get(i)).decorate(this, obj, comp, g2); + } + + } + + // Adjust (e.g., rotate) as necessary. + adjust(obj, comp, g2); + + // Draw the image + draw(obj, comp, g2); + } + + /** Add a Decorator to the display in order to add some functionality. + * + * @param d The decorator to add + */ + public void addDecorator(DisplayDecorator d) + { + decorations.add(d); + } + + /** Remove a Decorator from the display + * + * @param d The decorator to remove + */ + public void removeDecorator(DisplayDecorator d) + { + decorations.remove(d); + } + + + /** Adjusts the graphics system for drawing an object, as appropriate. + * This method actually makes no further adjustments, but subclasses + * could override this method to rotate the object, for example. + */ + public void adjust(GridObject obj, Component comp, Graphics2D g2) + { + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay$TintFilter.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay$TintFilter.class new file mode 100644 index 0000000..1f168c6 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay$TintFilter.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.class new file mode 100644 index 0000000..efde634 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.java new file mode 100644 index 0000000..497a6ed --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageDisplay.java @@ -0,0 +1,204 @@ +// Class: ScaledImageDisplay +// +// Author: Alyce Brady +// +// This class is based on the College Board's FishImageDisplay class, +// as allowed by the GNU General Public License. FishImageDisplay is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.Color; +import java.awt.Component; +import java.awt.MediaTracker; +import java.awt.Image; +import java.awt.image.FilteredImageSource; +import java.awt.image.RGBImageFilter; +import java.awt.Graphics2D; +import javax.swing.ImageIcon; +import java.lang.reflect.Method; +import java.lang.reflect.InvocationTargetException; +import java.util.HashMap; + +/** + * Grid Display Package:
      + * + * A ScaledImageDisplay uses an image read from a file to + * represent an object in a location in a grid. Images can be rotated + * or tinted using appropriate decorators. ScaledImageDisplay + * provides a tint method that can be used by a + * tint decorator. + * + * @author Alyce Brady (based on FishImageDisplay by Julie Zelenski) + * @version 13 December 2003 + **/ +public class ScaledImageDisplay extends ScaledDisplay +{ + private ImageIcon icon; + private DefaultDisplay defaultDisp = new DefaultDisplay(); + private HashMap tintedVersions = new HashMap(); + + /** Internal constructor that does not initialize the icon + * instance variable; subclasses must be sure to set the icon + * using the setIcon method (e.g., at the beginning + * of a redefined draw method). + **/ + protected ScaledImageDisplay() + { + } + + /** Constructs an object that knows how to display a + * GridObject object as an image. Looks for the + * named file first in the jar file, then in the + * current directory. If the named file is not found + * or the file is malformed, the display will fall + * back to the DefaultDisplay class. + * @param imageFilename name of file containing image + **/ + public ScaledImageDisplay(String imageFilename) + { + java.net.URL urlInJarFile = getClass().getResource(imageFilename); + if (urlInJarFile != null) + icon = new ImageIcon(urlInJarFile); + else + { + String path = System.getProperty("user.dir") + + java.io.File.separator + imageFilename; + icon = new ImageIcon(path); + } + } + + /** Returns true if the image loaded OK; false + * otherwise. + **/ + public boolean imageLoadedOK() + { + return (icon.getImageLoadStatus() == MediaTracker.COMPLETE) ; + } + + /** Defines the image to use for display purposes. **/ + protected void setIcon(ImageIcon icon) + { + this.icon = icon; + } + + /** Draws a unit-length object using an image. + * This implementation draws the object by scaling + * the image provided to the constructor. It calls + * the adjust method to make further + * adjustments (for example, rotating and tinting + * the image) as appropriate. + * @param obj object we want to draw + * @param comp the component we're drawing on + * @param g2 drawing surface + **/ + public void draw(GridObject obj, Component comp, Graphics2D g2) + { + if ( ! imageLoadedOK() ) + { + // Image failed to load, so fall back to default display. + defaultDisp.draw(obj, comp, g2); + return; + } + + // Scale to shrink or enlarge the image to fit the size 1x1 cell. + g2.scale(1.0/icon.getIconWidth(), 1.0/icon.getIconHeight()); + + icon.paintIcon(comp, g2, -icon.getIconWidth()/2, -icon.getIconHeight()/2); + } + + + /** Adjusts the graphics system to use an object's color to tint an image. + * (Precondition: obj has a color method.) + * @param obj object we want to draw + * @param comp the component we're drawing on + * @param g2 drawing surface + **/ + public void tint(GridObject obj, Component comp, Graphics2D g2) + { + // Use the object's color as an image filter. + Class objClass = obj.getClass(); + try + { + Method colorMethod = objClass.getMethod("color", new Class[0]); + Color col = (Color)colorMethod.invoke(obj, new Object[0]); + Image tinted = (Image)tintedVersions.get(col); + if (tinted == null) // not cached, need new filter for color + { + Image originalImage = icon.getImage(); + FilteredImageSource src = + new FilteredImageSource(originalImage.getSource(), + new TintFilter(col)); + tinted = comp.createImage(src); + // Cache tinted image in map by color, we're likely to need it again. + tintedVersions.put(col, tinted); + } + + icon.setImage(tinted); + } + catch (NoSuchMethodException e) + { throw new IllegalArgumentException("Cannot tint object of " + objClass + + " class; cannot invoke color method."); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException("Cannot tint object of " + objClass + + " class; exception in color method."); } + catch (IllegalAccessException e) + { throw new IllegalArgumentException("Cannot tint object of " + objClass + + " class; cannot access color method."); } + } + + + /** An image filter class that tints colors based on the tint provided + * to the constructor. + **/ + private static class TintFilter extends RGBImageFilter + { + private int tintR, tintG, tintB; + + /** Constructs an image filter for tinting colors in an image. **/ + public TintFilter(Color color) + { + canFilterIndexColorModel = true; + int rgb = color.getRGB(); + tintR = (rgb >> 16) & 0xff; + tintG = (rgb >> 8) & 0xff; + tintB = rgb & 0xff; + } + + public int filterRGB(int x, int y, int argb) + { + // Separate pixel into its RGB coomponents. + int alpha = (argb >> 24) & 0xff; + int red = (argb >> 16) & 0xff; + int green = (argb >> 8) & 0xff; + int blue = argb & 0xff; + + // Use NTSC/PAL algorithm to convert RGB to grayscale. + int lum = (int) (0.2989 * red + 0.5866 * green + 0.1144 * blue); + + // Interpolate along spectrum black->white with tint at midpoint + double scale = Math.abs((lum - 128)/128.0); // absolute distance from midpt + int edge = lum < 128 ? 0 : 255; // going towards white or black? + red = tintR + (int)((edge - tintR) * scale); // scale from midpt to edge + green = tintG + (int)((edge - tintG) * scale); + blue = tintB + (int)((edge - tintB) * scale); + return (alpha << 24) | (red << 16) | (green << 8) | blue; + } + + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.class new file mode 100644 index 0000000..c124a6f Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.java new file mode 100644 index 0000000..65ce6a7 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScaledImageTintDecorator.java @@ -0,0 +1,47 @@ +// Class: ScaledImageTintDecorator +// +// Author: Joel Booth +// +// This decorator allows objects being displayed to adjust for a tint color. +// It can only be applied to ScaledImageDisplay objects. The associated +// Object must have a Color. +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +package edu.kzoo.grid.display; + +import java.awt.Component; +import java.awt.Graphics2D; + +import edu.kzoo.grid.GridObject; + +/** + * Grid Display Package:
      + * + * A tinting decorator for a ScaledImageDisplay. The associated + * object must have a Color. + * + * @author Joel Booth + * @version 28 July 2004 + * + */ +public class ScaledImageTintDecorator implements DisplayDecorator +{ + /** + * Decorate the ScaledImageDisplay so that it appears tinted. + */ + public void decorate(ScaledDisplay sd, GridObject obj, Component comp, + Graphics2D g2) + { + ((ScaledImageDisplay)sd).tint(obj, comp, g2); + + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay$1.class new file mode 100644 index 0000000..a94a96a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.class new file mode 100644 index 0000000..4f4db1d Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.java new file mode 100644 index 0000000..afde10d --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/ScrollableGridDisplay.java @@ -0,0 +1,759 @@ +// Class: ScrollableGridDisplay +// +// Author: Alyce Brady +// +// This class is based on the College Board's MBSDisplay class, as +// allowed by the GNU General Public License. MBSDisplay is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.GridObject; +import edu.kzoo.grid.Location; + +import edu.kzoo.grid.gui.GridChangeListener; + +import java.awt.BasicStroke; +import java.awt.Color; +import java.awt.Component; +import java.awt.Dimension; +import java.awt.Graphics; +import java.awt.Graphics2D; +import java.awt.Insets; +import java.awt.Point; +import java.awt.Rectangle; + +import javax.swing.JPanel; +import javax.swing.JViewport; +import javax.swing.Scrollable; +import javax.swing.SwingConstants; +import javax.swing.ToolTipManager; + +import java.awt.event.MouseEvent; +import java.awt.event.ComponentAdapter; +import java.awt.event.ComponentEvent; +import java.awt.geom.AffineTransform; + +/** + * Grid Display Package:
      + * + * A ScrollableGridDisplay is a panel containing a + * scrollable graphical display of a grid. + * + * @author Alyce Brady (based on MBSDisplay by Julie Zelenski) + * @version 13 February 2004 + **/ +public class ScrollableGridDisplay extends JPanel + implements GridDisplay, GridBackgroundDisplay, GridChangeListener, + Scrollable, PseudoInfiniteViewport.Pannable +{ + // Class constants + public static final int DEFAULT_MIN_CELL_SIZE = 8, + DEFAULT_VIEWABLE_SIZE = 420; + public static final Color OCEAN_BLUE = new Color(75, 75, 255); + protected static final int LOCATION_TOOL_TIPS = 0, + OBJECT_STRING_TOOL_TIPS = 1; + + // Encapsulated data used to monitor/display the grid + protected Grid theGrid; + protected Dimension preferredVPSize; // preferred dimensions of viewing area + protected int gridLineWidth, // width of each grid line + minCellSize, // minimum cell size, not including width of grid lines + outerCellSize, // actual cell size, including width of grid lines + numRows, numCols, // number of rows & cols to display in grid + originRow, originCol; // row and column representing origin + protected GridBackgroundDisplay backgroundDisplay; + protected Color bgColor; + protected boolean toolTipsEnabledFlag; + protected int toolTipsType = OBJECT_STRING_TOOL_TIPS; + + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + **/ + public ScrollableGridDisplay() + { + this(DEFAULT_VIEWABLE_SIZE, DEFAULT_VIEWABLE_SIZE, + DEFAULT_MIN_CELL_SIZE, OCEAN_BLUE); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * (Precondition: width and height must be + * at least as large as the default minimum cell size.) + * @param width the width of the viewing area + * @param height the height of the viewing area + **/ + public ScrollableGridDisplay(int width, int height) + { + this(width, height, DEFAULT_MIN_CELL_SIZE, OCEAN_BLUE); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * @param minimumCellSize minimum cell side length + **/ + public ScrollableGridDisplay(int minimumCellSize) + { + this(DEFAULT_VIEWABLE_SIZE, DEFAULT_VIEWABLE_SIZE, + minimumCellSize, OCEAN_BLUE); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * (Precondition: width and height must be + * at least as large as minimumCellSize.) + * @param width the width of the viewing area + * @param height the height of the viewing area + * @param minimumCellSize minimum cell side length + **/ + public ScrollableGridDisplay(int width, int height, int minimumCellSize) + { + this(width, height, minimumCellSize, OCEAN_BLUE); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * @param backgroundColor color to paint background of grid + **/ + public ScrollableGridDisplay(Color backgroundColor) + { + this(DEFAULT_VIEWABLE_SIZE, DEFAULT_VIEWABLE_SIZE, + DEFAULT_MIN_CELL_SIZE, backgroundColor); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * (Precondition: width and height must be + * at least as large as the default minimum cell size.) + * @param width the width of the viewing area + * @param height the height of the viewing area + * @param backgroundColor color to paint background of grid + **/ + public ScrollableGridDisplay(int width, int height, Color backgroundColor) + { + this(width, height, DEFAULT_MIN_CELL_SIZE, backgroundColor); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * @param minimumCellSize minimum cell side length + * @param backgroundColor color to paint background of grid + **/ + public ScrollableGridDisplay(int minimumCellSize, Color backgroundColor) + { + this(DEFAULT_VIEWABLE_SIZE, DEFAULT_VIEWABLE_SIZE, + minimumCellSize, backgroundColor); + } + + /** Constructs a new ScrollableGridDisplay object with no grid + * and an empty view. + * (Precondition: width and height must be + * at least as large as minimumCellSize.) + * @param viewingWidth the width of the viewing area + * @param viewingHeight the height of the viewing area + * @param minimumCellSize minimum cell side length + * @param backgroundColor color to paint background of grid + **/ + public ScrollableGridDisplay(int viewingWidth, int viewingHeight, + int minimumCellSize, Color backgroundColor) + { + theGrid = null; + + if ( minimumCellSize > 0 ) + minCellSize = minimumCellSize; + else + minCellSize = DEFAULT_MIN_CELL_SIZE; + + int origViewingWidth, origViewingHeight; + if ( viewingWidth > minCellSize && viewingHeight > minCellSize ) + { + origViewingWidth = viewingWidth; + origViewingHeight = viewingHeight; + } + else + { + origViewingWidth = Math.max(DEFAULT_VIEWABLE_SIZE, minCellSize); + origViewingHeight = Math.max(DEFAULT_VIEWABLE_SIZE, minCellSize); + } + preferredVPSize = new Dimension(origViewingWidth + extraWidth(), + origViewingHeight + extraHeight()); + + backgroundDisplay = this; + if ( backgroundColor != null ) + bgColor = backgroundColor; + else + bgColor = OCEAN_BLUE; + + gridLineWidth = calculateGridLineWidth(); + numRows = numCols = 0; + originRow = originCol = 0; + setToolTipsEnabled(false); + addComponentListener(new ComponentAdapter() + { public void componentResized(ComponentEvent e) + { JViewport vp = getEnclosingViewport(); + if (vp == null) + { + recalculateCellSize(); + } + } + }); + } + + /** Sets the Grid being displayed. Sets the cell size to + * be the largest that fits the entire grid in the current + * viewing area (uses a default minimum if grid is too large). + * @param grid the Grid to display + **/ + public void setGrid(Grid grid) + { + JViewport vp = getEnclosingViewport(); // before changing, reset scroll/pan position + if (vp != null) + vp.setViewPosition(new Point(0, 0)); + + theGrid = grid; + setToolTipsEnabled(grid != null); + + if ( grid == null ) + return; + + outerCellSize = 0; + originRow = originCol = 0; + + if ( theGrid.numRows() == -1 ) + numRows = 2000; // This determines the "virtual" size of the pan world + else + numRows = theGrid.numRows(); + + if ( theGrid.numCols() == -1 ) + numCols = 2000; // This determines the "virtual" size of the pan world + else + numCols = theGrid.numCols(); + + recalculateCellSize(); + } + + /* (non-Javadoc) + * @see edu.kzoo.grid.gui.GridChangeListener#reactToNewGrid(edu.kzoo.grid.Grid) + */ + public void reactToNewGrid(Grid newGrid) + { + setGrid(newGrid); + } + + /** Gets our parent viewport, if we are in one. + **/ + public JViewport getEnclosingViewport() + { + Component parent = getParent(); + return (parent instanceof JViewport) ? (JViewport)parent : null; + } + + /** Calculates the cell size to use given the current viewable region and + * the number of rows and columns in the grid. We use the largest + * cellSize that will fit in the viewable region, bounded to be at least + * the parameter minSize. + * @param vp the view port that represents the viewable region + **/ + protected void recalculateCellSize() + { + if (numRows == 0 || numCols == 0) + { + outerCellSize = 0; + } + else + { + JViewport vp = getEnclosingViewport(); + Dimension windowSize = (vp != null) ? vp.getSize() : getSize(); + int viewingHeight = windowSize.height - extraHeight(); + int viewingWidth = windowSize.width - extraWidth(); + outerCellSize = Math.min(viewingHeight/numRows, + viewingWidth/numCols); + int innerCellSize = outerCellSize - gridLineWidth; + innerCellSize = Math.max(innerCellSize, minCellSize); + outerCellSize = innerCellSize + gridLineWidth; + } + revalidate(); + } + + /** Returns the width of each grid line. + **/ + protected int calculateGridLineWidth() + { + return (int)Math.round(Math.ceil((new BasicStroke()).getLineWidth())); + } + + /** Returns the size of each cell, not including the width of a grid line. + **/ + public int innerCellSize() + { + return outerCellSize - gridLineWidth; + } + + /** Gets the grid. **/ + public Grid grid() + { + return theGrid; + } + + /** Gets the minimum cell size. **/ + public int minimumCellSize() + { + return minCellSize; + } + + /** Sets the object used to draw the background. **/ + public void setBackgroundDisplay(GridBackgroundDisplay bgDisplay) + { + backgroundDisplay = bgDisplay; + } + + /** Gets the background color for displaying the grid. **/ + public Color backgroundColor() + { + return bgColor; + } + + /** Sets the background color for displaying the grid. **/ + public void setBackgroundColor(Color newBackgroundColor) + { + bgColor = newBackgroundColor; + } + + /** Makes the gridlines visible or invisible, depending on the value + * of the visible parameter. The gridlines are visible + * by default. + * @param visible whether to make the gridlines visible (true) + * or invisible (false) + **/ + public void makeGridLinesVisible(boolean visible) + { + gridLineWidth = visible ? calculateGridLineWidth() : 0; + } + + /** Returns true if the grid lines are visible, + * false otherwise. + **/ + public boolean gridLinesAreVisible() + { + return gridLineWidth > 0; + } + + /** Shows the grid. + * Invoking the repaint method is the standard way to ask a + * Swing component to redraw itself. This eventually turns into a call + * back to our version of the standard paintComponent + * method where we do the actual drawing. + **/ + public void showGrid() + { + repaint(); + } + + /** Updates the display of just a single location on the grid. + * Does not redraw the gridlines. + **/ + public void updateLocation(Location loc) + { + // Find the object to redraw. + if (grid() == null) + return; + + // Get the screen location for this grid location. + Rectangle cellOnScreen = + new Rectangle(colToXCoord(loc.col()), + rowToYCoord(loc.row()), + innerCellSize(), innerCellSize()); + + Graphics2D g2 = (Graphics2D) getGraphics(); + AffineTransform savedTransform = g2.getTransform(); // save + + // Redraw the background for just this one location. + g2.setColor(bgColor); // fill background + g2.fillRect(cellOnScreen.x, cellOnScreen.y, + cellOnScreen.width, cellOnScreen.height); + + // Draw the object. + GridObject obj = grid().objectAt(loc); + if ( obj != null ) + { + // Get the drawing object to display this grid object. + GridObjectDisplay displayObj = DisplayMap.findDisplayFor(obj); + displayObj.draw(obj, this, g2, cellOnScreen); + } + + g2.setTransform(savedTransform); // restore coordinate system + + } + + /** Paints this component. + * @param g the Graphics object to use to render this component + **/ + public void paintComponent(Graphics g) + { + Graphics2D g2 = (Graphics2D)g; + + super.paintComponent(g2); + if (grid() == null) + return; + + backgroundDisplay.drawBackground(g2); + + GridObject[] allGridObjects = grid().allObjects(); + for (int k = 0; k < allGridObjects.length; k++) + drawGridObject(g2, allGridObjects[k]); + + if ( gridLinesAreVisible() ) + drawGridlines(g2); + } + + /** Draws the grid background. + * @param g2 the Graphics2 object to use to render + **/ + public void drawBackground(Graphics2D g2) + { + fillBackground(g2, bgColor); + } + + /** Fills the grid background with the specified color. At the + * end of this method, the graphics context is set to draw + * whatever color it was set to draw when the method was called, + * not the fill color. + * @param g2 the Graphics2 object to use to render + * @param fillColor the color with which to fill the background + **/ + public void fillBackground(Graphics2D g2, Color fillColor) + { + Color oldColor = g2.getColor(); + Insets insets = getInsets(); + g2.setColor(fillColor); + g2.fillRect(insets.left, insets.top, + numCols*outerCellSize + gridLineWidth, + numRows*outerCellSize + gridLineWidth); + g2.setColor(oldColor); + } + + /** Draws the gridlines for the grid. We only draw the portion + * of the lines that intersect the current clipping bounds. + * @param g2 the Graphics2 object to use to render + **/ + protected void drawGridlines(Graphics2D g2) + { + Rectangle curClip = g2.getClip().getBounds(); + int top = getInsets().top, left = getInsets().left; + + int cellSize = outerCellSize; + int miny = Math.max(0, (curClip.y - top)/cellSize)*cellSize + top; + int minx = Math.max(0, (curClip.x - left)/cellSize)*cellSize + left; + int maxy = Math.min(numRows, + (curClip.y + curClip.height - top + cellSize - 1)/cellSize)*cellSize + top; + int maxx = Math.min(numCols, + (curClip.x + curClip.width - left + cellSize - 1)/cellSize)*cellSize + left; + + g2.setColor(Color.black); + g2.setStroke(new BasicStroke()); + for (int y = miny; y <= maxy; y += cellSize) // draw horizontal lines + g2.drawLine(minx, y, maxx, y); + + for (int x = minx; x <= maxx; x += cellSize) // draw vertical lines + g2.drawLine(x, miny, x, maxy); + } + + /** Draws one GridObject instance. First verifies that the object + * is actually visible before any drawing, sets up the clip + * appropriately and uses the DisplayMap to determine + * which object to call upon to render this particular GridObject. + * Note that we save and restore the graphics transform to + * restore back to normalcy no matter what the renderer did to + * to the coordinate system. + * @param g2 the Graphics2D object to use to render + * @param obj the GridObject object to draw + **/ + protected void drawGridObject(Graphics2D g2, GridObject obj) + { + // Make sure that obj hasn't been removed from the grid + // since it was placed in the list of objects to draw + if ( obj.grid() != grid() ) + return; + + Location objLoc = obj.location(); + Rectangle cellToDraw = + new Rectangle(colToXCoord(objLoc.col()), + rowToYCoord(objLoc.row()), + innerCellSize(), innerCellSize()); + + // Only draw if the object is visible within the current clipping region. + if (cellToDraw.intersects(g2.getClip().getBounds())) + { + AffineTransform savedTransform = g2.getTransform(); // save + + // Get the drawing object to display this grid object. + GridObjectDisplay displayObj = DisplayMap.findDisplayFor(obj); + displayObj.draw(obj, this, g2, cellToDraw); + + g2.setTransform(savedTransform); // restore coordinate system + } + } + + + // The following methods implement the Scrollable interface to get nicer + // behavior in a JScrollPane. + + /* (non-Javadoc) + * @see javax.swing.Scrollable#getScrollableUnitIncrement(java.awt.Rectangle, int, int) + */ + public int getScrollableUnitIncrement(Rectangle visibleRect, int orientation, int direction) + { + return outerCellSize; + } + + /* (non-Javadoc) + * @see javax.swing.Scrollable#getScrollableBlockIncrement(java.awt.Rectangle, int, int) + */ + public int getScrollableBlockIncrement(Rectangle visibleRect, int orientation, int direction) + { + if (orientation == SwingConstants.VERTICAL) + return (int)(visibleRect.height * .9); + else + return (int)(visibleRect.width * .9); + } + + /* (non-Javadoc) + * @see javax.swing.Scrollable#getScrollableTracksViewportWidth() + */ + public boolean getScrollableTracksViewportWidth() + { + return false; + } + + /* (non-Javadoc) + * @see javax.swing.Scrollable#getScrollableTracksViewportHeight() + */ + public boolean getScrollableTracksViewportHeight() + { + return false; + } + + /* (non-Javadoc) + * @see javax.swing.Scrollable#getPreferredScrollableViewportSize() + */ + public Dimension getPreferredScrollableViewportSize() + { + return preferredVPSize; + } + + + // The following methods provide zooming and panning behavior. + + /** Zooms in the display by doubling the current cell size. + **/ + public void zoomIn() + { + outerCellSize *= 2; + revalidate(); + } + + /** Zooms out the display by halving the current cell size. + **/ + public void zoomOut() + { + outerCellSize = Math.max(outerCellSize/2, minCellSize); + revalidate(); + } + + /** Pans the display back to the origin, so that 0, 0 is at the + * the upper left of the visible viewport. + **/ + public void recenterOnOrigin() + { + originRow = 0; + originCol = 0; + repaint(); + JViewport vp = getEnclosingViewport(); + if (vp != null) + { + if (!isPannableUnbounded() || !(vp instanceof PseudoInfiniteViewport)) + vp.setViewPosition(new Point(0, 0)); + else + ((PseudoInfiniteViewport)vp).showOriginTip(); + } + } + + // The following methods implement the PseudoInfiniteViewport.Pannable + // interface to get nicer pan behavior for viewing an unbounded grid. + + public void panBy(int hDelta, int vDelta) + { + originCol += hDelta/outerCellSize; + originRow += vDelta/outerCellSize; + repaint(); + } + + public boolean isPannableUnbounded() + { + return (theGrid != null && theGrid.numRows() == -1); + } + + public String getPannableTipText() + { + Point upperLeft = new Point(0, 0); + JViewport vp = getEnclosingViewport(); + if (!isPannableUnbounded() && vp != null) upperLeft = vp.getViewPosition(); + Location loc = locationForPoint(upperLeft); + return (loc != null ? loc.toString() : null); + } + + + // The following methods support tool tips. + + /** Enables/disables showing of tooltip giving information about + * the grid object beneath the mouse. + * @param flag whether to enable/disable tool tips + **/ + public void setToolTipsEnabled(boolean flag) + { + if (flag) + ToolTipManager.sharedInstance().registerComponent(this); + else + ToolTipManager.sharedInstance().unregisterComponent(this); + toolTipsEnabledFlag = flag; + } + + /** Indicates whether tool tips have been enabled. + * @return true if tool tips are enabled; + * false otherwise + **/ + public boolean toolTipsEnabled() + { + return toolTipsEnabledFlag; + } + + /** Sets tool tips to provide information about the locations + * of cells in the grid. + **/ + public void makeToolTipsReportLocation() + { + setToolTipsEnabled(true); + toolTipsType = LOCATION_TOOL_TIPS; + } + + /** Sets tool tips to provide information about the contents + * of cells in the grid. + **/ + public void makeToolTipsReportObject() + { + setToolTipsEnabled(true); + toolTipsType = OBJECT_STRING_TOOL_TIPS; + } + + /** Given a MouseEvent, determines what text to place in the floating + * tool tip when the the mouse hovers over this location. If the mouse + * is over a valid cell in the grid, we provide some information about + * the cell and its contents. This method is automatically called + * on mouse-moved events if we register for tool tips. + * @param evt the MouseEvent in question + * @return the tool tip string for this location + **/ + public String getToolTipText(MouseEvent evt) + { + Location loc = locationForPoint(evt.getPoint()); + if (!toolTipsEnabled() || loc == null) + return null; + if ( toolTipsType == OBJECT_STRING_TOOL_TIPS ) + { + GridObject obj = grid().objectAt(loc); + if ( obj != null ) + return obj.toString(); + else + return loc + " is empty"; + } + else + return loc.toString(); + } + + /** Given a Point, determines which grid location (if any) + * is under the mouse. This method is used by the GUI when + * generating text tips. + * @param p the Point in question (in display's coordinate system) + * @return the grid Location beneath the event, or null if + * no cell is beneath the mouse + **/ + public Location locationForPoint(Point p) + { + if ( theGrid == null ) + return null; + Location loc = new Location(yCoordToRow(p.y), xCoordToCol(p.x)); + return (theGrid.isValid(loc)) ? loc : null; + } + + // protected helpers to convert between (x,y) and (row,col) + /** Returns column corresponding to given X-coordinate. **/ + protected int xCoordToCol(int xCoord) + { + return (xCoord - getInsets().left - gridLineWidth)/outerCellSize + originCol; + } + + /** Returns row corresponding to given Y-coordinate. **/ + protected int yCoordToRow(int yCoord) + { + return (yCoord - getInsets().top - gridLineWidth)/outerCellSize + originRow; + } + + /** Returns X-coordinate of left side of given column. **/ + public int colToXCoord(int col) + { + return (col - originCol)*outerCellSize + getInsets().left + gridLineWidth; + } + + /** Returns Y-coordinate of top of given row. **/ + public int rowToYCoord(int row) + { + return (row - originRow)*outerCellSize + getInsets().top + gridLineWidth; + } + + + // The following methods are used by the Java GUI classes. + + /** Returns the desired size of the display, for use by layout manager. + * @return preferred size + **/ + public Dimension getPreferredSize() + { + return new Dimension(numCols*outerCellSize + extraWidth(), + numRows*outerCellSize + extraHeight()); + } + + /** Returns the minimum size of the display, for use by layout manager. + * @return minimum size + **/ + public Dimension getMinimumSize() + { + return new Dimension(numCols*minCellSize + extraWidth(), + numRows*minCellSize + extraHeight()); + } + + // protected helpers to caculate extra width/height needs for borders/insets. + protected int extraWidth() + { + return getInsets().left + getInsets().right + gridLineWidth; + } + + protected int extraHeight() + { + return getInsets().top + getInsets().bottom + gridLineWidth; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.class new file mode 100644 index 0000000..ecfc584 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.java new file mode 100644 index 0000000..1aa26b3 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextAndIconRenderer.java @@ -0,0 +1,87 @@ +// Class: TextAndIconRenderer +// +// Author: Alyce Brady +// +// This class is based on the College Board's FishToolbar class, +// as allowed by the GNU General Public License. FishToolbar is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; +import java.awt.Component; +import javax.swing.BorderFactory; +import javax.swing.JComboBox; +import javax.swing.JLabel; +import javax.swing.JList; +import javax.swing.ListCellRenderer; + +/** + * Grid Display Package:
      + * + * The TextAndIconRenderer class provides a + * renderer that paints both the text and the icon of a + * JLabel. (The default renderer only displays one or the + * other.) + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 13 December 2003 + **/ +public class TextAndIconRenderer extends JLabel + implements ListCellRenderer +{ + private JComboBox cb; + + /** Constructs a renderer that will operate on the specified + * combo box. + * @param combo the combo box this renderer is associated with + **/ + public TextAndIconRenderer(JComboBox combo) + { + setOpaque(true); + setHorizontalAlignment(LEFT); + setVerticalAlignment(CENTER); + setBorder(BorderFactory.createEmptyBorder(2, 2, 2, 2)); + cb = combo; + } + + /** Returns a component that can display the specified value. + * (Precondition: value must be a JLabel.) + * @param list the JList we're painting + * @param value the value returned by list.getModel().getElementAt(index) + * @param index the cell's index + * @param isSelected true if the specified cell was selected + * @param cellHasFocus truepaint method will render + * the specified value + **/ + public Component getListCellRendererComponent(JList list, + Object value, int index, + boolean selected, boolean cellHasFocus) + { + setBackground(selected ? list.getSelectionBackground() : list.getBackground()); + setForeground(selected ? list.getSelectionForeground() : list.getForeground()); + if (!cb.isEnabled()) + { + setText("No choice"); // draw differently when disabled + setIcon(null); + } + else + { + setText(value.toString()); + setIcon(((JLabel)value).getIcon()); + } + return this; + } + +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.class new file mode 100644 index 0000000..dbf4a9d Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.java new file mode 100644 index 0000000..1904b2b --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextCellDisplay.java @@ -0,0 +1,62 @@ +// Class: TextCellDisplay +// +// Author: Alyce Brady +// Modified: 21 March 2004: Modified to handle any class that has text and +// color methods, not just TextCell objects. +// Modified: 15 September 2004: Most functionality moved to the TextDisplay +// class. TextCellDisplay now extends +// TextDisplay rather than DefaultDisplay. +// +// This class is based on the College Board's DefaultDisplay class, +// as allowed by the GNU General Public License. DefaultDisplay is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.Color; + +/** + * Grid Display Package:
      + * + * A TextCellDisplay object displays a + * TextCell object (or any object with + * text and color methods) + * in a grid. + * + * @author Alyce Brady + * @version 15 September 2004 + **/ +public class TextCellDisplay extends TextDisplay +{ + + /** Gets the text string to draw. + * (Precondition: obj has a text method.) + **/ + protected String getText(GridObject obj) + { + return (String) invokeAccessorMethod(obj, "text"); + } + + /** Gets the text color. + * (Precondition: obj has a color method.) + */ + protected Color getTextColor(GridObject obj) + { + return (Color) invokeAccessorMethod(obj, "color"); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.class b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.class new file mode 100644 index 0000000..caff635 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.java b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.java new file mode 100644 index 0000000..0eac5e4 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/display/TextDisplay.java @@ -0,0 +1,167 @@ +// Class: TextDisplay +// +// This is a modified version of the College Board's DefaultDisplay class, +// as allowed by the GNU General Public License. DefaultDisplay is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// The modifications were to make TextDisplay extend ScaledDisplay, +// paint the text as if in a 100 x 100 cell, and use alternative values +// if the object being drawn does not have text or color methods. +// +// The original copyright and license information for DefaultDisplay is: +// +// AP(r) Computer Science Marine Biology Simulation: +// The DefaultDisplay class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.display; + +import edu.kzoo.grid.GridObject; + +import java.awt.BasicStroke; +import java.awt.Color; +import java.awt.Component; +import java.awt.Font; +import java.awt.font.FontRenderContext; +import java.awt.font.LineMetrics; +import java.awt.geom.Rectangle2D; +import java.awt.Graphics2D; +import java.lang.reflect.InvocationTargetException; +import java.lang.reflect.Method; + +/** + * Grid Display Package:
      + * + * A TextDisplay draws a centered text string in a + * grid cell. If the object it is asked to display has a + * text method, it displays the text returned by that + * string, otherwise it displays the text returned by the object's + * toString method. If the object it is asked to + * display has a color method, it displays the text + * in that color, otherwise it displays it in black. The + * TextDisplay class works best for very short text + * strings, especially one-character strings; longer strings will + * not fit in the bounds of the object's grid cell location and if + * there are objects in the neighboring cells they will obscure the + * text that does not fit in its own cell. + * + *

      + * The TextDisplay class is based on the + * College Board's DefaultDisplay class, + * as allowed by the GNU General Public License. + * + * @author Alyce Brady + * @author Jeff Raab, Northeastern University + * @author Alyce Brady (most recent modifications) + * @version 15 September 2004 + **/ +public class TextDisplay extends ScaledDisplay +{ + /** Draws the given object. + * This implementation draws a text string using the Java + * 2D Graphics API. + * @param obj object we want to draw + * @param comp component on which to draw + * @param g2 drawing surface + **/ + public void draw(GridObject obj, Component comp, Graphics2D g2) + { + // Get the text associated with the object (if any). + String objText = getText(obj); + + // Get the color of the object (if any) or black. + Color objColor = getTextColor(obj); + + // Text rendering does not work well in a 1 x 1 cell, so paint + // the text as if in a 100 x 100 cell and then scale down by 100. + float scaleFactor = 0.01f; + + // Scale to size of rectangle, adjust stroke back to 1-pixel wide + g2.scale(scaleFactor, scaleFactor); + g2.setStroke(new BasicStroke(1.0f/scaleFactor)); + + // Set color of question mark and its font. + g2.setPaint(objColor); + g2.setFont(new Font("SansSerif", Font.BOLD, 80)); + + // Paint it centered in the rectangle. + paintCenteredText(g2, objText, (float)0, (float)0); + } + + /** Gets the text string to draw. + */ + protected String getText(GridObject obj) + { + try + { + return (String) invokeAccessorMethod(obj, "text"); + } + catch(Exception e) { return obj.toString(); } + } + + /** Gets the text color. + */ + protected Color getTextColor(GridObject obj) + { + try + { + return (Color) invokeAccessorMethod(obj, "color"); + } + catch(Exception e) { return Color.BLACK; } + } + + /** Invokes the named method on the specified object. **/ + protected Object invokeAccessorMethod(GridObject obj, String methodName) + { + Class objClass = obj.getClass(); + Object returnValue; + try + { + Method textMethod = objClass.getMethod(methodName, new Class[0]); + returnValue = textMethod.invoke(obj, new Object[0]); + } + catch (NoSuchMethodException e) + { throw new IllegalArgumentException("Cannot invoke " + methodName + + " method for object of " + objClass + " class."); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException("Cannot get " + methodName + + " for object of " + objClass + " class; exception thrown in " + + methodName + " method."); } + catch (IllegalAccessException e) + { throw new IllegalArgumentException("Cannot get " + methodName + + " for object of " + objClass + " class; cannot access " + + methodName + " method."); } + return returnValue; + } + + /** Paints a horizontally and vertically-centered text string. + * This method is adapted from p. 134 of J. Knudsen's book, + * Java 2D Graphics, published by O'Reilly & Associates (1999). + * @param g2 drawing surface + * @param s string to draw (centered) + * @param centerX x-coordinate of center point + * @param centerY y-coordinate of center point + **/ + protected void paintCenteredText(Graphics2D g2, + String s, float centerX, float centerY) + { + FontRenderContext frc = g2.getFontRenderContext(); + Rectangle2D bounds = g2.getFont().getStringBounds(s, frc); + float leftX = centerX - (float)bounds.getWidth()/2; + LineMetrics lm = g2.getFont().getLineMetrics(s, frc); + float baselineY = centerY - lm.getHeight()/2 + lm.getAscent(); + g2.drawString(s, leftX, baselineY); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.class new file mode 100644 index 0000000..e982f93 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.java new file mode 100644 index 0000000..f470565 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ActiveGridAppController.java @@ -0,0 +1,47 @@ +// Class ActiveGridAppController +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.GridObject; + +/** + * Grid GUI Support Package:
      + * + * An ActiveGridAppController controls the running of a + * grid application. In each timestep it tells all of the objects in + * the grid to act. The objects in the grid should be instances of a + * class that redefines the act method to do something + * meaningful. + * + * @author Alyce Brady + * @version 10 November 2004 + **/ +public class ActiveGridAppController extends SteppedGridAppController +{ + /** Advances the application one step by asking every object in + * the grid to act. + **/ + public void step() + { + // Get all the objects in the grid and ask each + // one to perform the actions it does in a timestep. + GridObject[] theObjects = getGrid().allObjects(); + for ( int index = 0; index < theObjects.length; index++ ) + { + theObjects[index].act(); + } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$1.class new file mode 100644 index 0000000..0027de9 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorChoice.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorChoice.class new file mode 100644 index 0000000..6ee32c1 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorChoice.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorIcon.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorIcon.class new file mode 100644 index 0000000..d8ba5e1 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu$ColorIcon.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.class new file mode 100644 index 0000000..62e1e1e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.java new file mode 100644 index 0000000..5b7b3d4 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ColorChoiceDDMenu.java @@ -0,0 +1,261 @@ +// Class: ColorChoiceDDMenu +// +// Author: Alyce Brady +// +// This class is based on the College Board's FishToolbar class, +// as allowed by the GNU General Public License. FishToolbar is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.display.TextAndIconRenderer; + +import edu.kzoo.util.NamedColor; +import edu.kzoo.util.RandNumGenerator; + +import java.awt.Color; +import java.awt.Component; +import java.awt.Graphics; +import java.awt.Graphics2D; +import java.awt.Rectangle; + +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; + +import javax.swing.Icon; +import javax.swing.JColorChooser; +import javax.swing.JComboBox; +import javax.swing.JLabel; +import javax.swing.JOptionPane; +import javax.swing.SwingConstants; + +import java.util.Random; + +/** + * Grid GUI Support Package:
      + * + * The ColorChoiceDDMenu class provides a + * drop-down menu for choosing a color. + * + *

      + * A number of predefined color choices, + * ColorChoiceDDMenu.RED, ORANGE, YELLOW, GREEN, BLUE, INDIGO, + * VIOLET, WHITE, GRAY, BLACK, RANDOM, and CUSTOM, + * have been provided for specifying the choices that should be made + * available in the menu and for specifying the initial selected color + * choice. This set of choices comprises the standard set. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 15 December 2003 + **/ +public class ColorChoiceDDMenu extends JComboBox +{ + /** Unique constant object representing a random color (to compare == to) */ + public static final Color RANDOM_COLOR = new Color(0, 0, 0); + + // Constants that indicate pre-defined color choices that may be used + // in a color choice drop-down menu. + public static final ColorChoice + RED = new ColorChoice("Red", NamedColor.RED), + ORANGE = new ColorChoice("Orange", NamedColor.PUMPKIN), + YELLOW = new ColorChoice("Yellow", NamedColor.YELLOW), + GREEN = new ColorChoice("Green", NamedColor.MEDIUM_GREEN), + BLUE = new ColorChoice("Blue", NamedColor.BLUE), + INDIGO = new ColorChoice("Indigo", NamedColor.INDIGO), + VIOLET = new ColorChoice("Violet", NamedColor.VIOLET), + WHITE = new ColorChoice("White", NamedColor.WHITE), + GRAY = new ColorChoice("Gray", NamedColor.GRAY), + BLACK = new ColorChoice("Black", NamedColor.BLACK), + RANDOM = new ColorChoice("Random", RANDOM_COLOR), + CUSTOM = new ColorChoice("Other ...", NamedColor.LIGHT_GRAY); + public static final ColorChoice[] STANDARD_CHOICES = { + RED, ORANGE, YELLOW, GREEN, BLUE, INDIGO, VIOLET, WHITE, GRAY, BLACK, + RANDOM, CUSTOM }; + + // static methods + + /** Gets the color choice from STANDARD_CHOICES with the + * specified name. Returns null if there is no such + * color choice in STANDARD_CHOICES. + **/ + public static ColorChoice getChoice(String name) + { + for ( int i = 0; i < STANDARD_CHOICES.length; i++ ) + { + ColorChoice choice = STANDARD_CHOICES[i]; + if ( choice.toString().equals(name) ) + return choice; + } + return null; + } + + + // constructors + + /** Creates a color choice menu in which the selected choice to begin + * with is the "Random" color choice. + **/ + public ColorChoiceDDMenu() + { + this(RANDOM); + } + + /** Creates a color choice menu in which startingColorChoice + * is the selected one when the menu is created. + * (Precondition: startingColorChoice is one of the + * color choices in STANDARD_CHOICES, whose labels are + * "Red", "Orange", "Yellow", "Green", "Blue", "Indigo", "Violet", + * "White", "Gray", "Black", "Random", and "Other ...".) + * @param startingColorChoice the initial selected color choice + **/ + public ColorChoiceDDMenu(String startingColorChoice) + { + this(STANDARD_CHOICES, getChoice(startingColorChoice)); + } + + /** Creates a color choice menu in which startingColorChoice + * is the selected one when the menu is created. + * (Precondition: startingColorChoice is one of the + * color choices in STANDARD_CHOICES.) + * @param startingColorChoice the initial selected color choice + **/ + public ColorChoiceDDMenu(ColorChoice startingColorChoice) + { + this(STANDARD_CHOICES, startingColorChoice); + } + + /** Creates a color choice menu with the specified color choices and + * with startingColorChoice + * as the selected one when the menu is created. The color choices + * may be any of the pre-defined color choices, + * ColorChoiceDDMenu.RED, ORANGE, YELLOW, GREEN, BLUE, INDIGO, + * VIOLET, WHITE, BLACK, RANDOM, or CUSTOM, + * or may ones constructed with the + * ColorChoiceDDMenu.ColorChoice constructor. + * (Precondition: startingColorChoice is one of the + * color choices in colorChoices.) + * @param colorChoices the set of color choices to show in the + * drop-down menu + * @param startingColorChoice the initial selected color choice + **/ + public ColorChoiceDDMenu(ColorChoice[] colorChoices, + ColorChoice startingColorChoice) + { + super(colorChoices); + if ( startingColorChoice != null ) + setSelectedItem(startingColorChoice); + setRenderer(new TextAndIconRenderer(this)); + setAlignmentX(LEFT_ALIGNMENT); + addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) { chooseColor(); }}); + } + + + // methods + + /** Follows up when the user picks a new choice from the + * drop-down menu (specified listener action). + **/ + protected void chooseColor() + { + ColorChoice cc = (ColorChoice)getSelectedItem(); + if (cc == CUSTOM) + { + hidePopup(); + Component parentFrame = JOptionPane.getFrameForComponent(this); + Color chosen = JColorChooser.showDialog(parentFrame, + "Choose object's color", + cc.getColor()); + if (chosen != null) + cc.setColor(chosen); + } + } + + /** Returns the currently selected color. If random color is selected, + * returns a new randomly generated color. + * @return the currently selected color + **/ + public Color currentColor() + { + ColorChoice cc = (ColorChoice)getSelectedItem(); + if (cc == RANDOM) + { + Random rng = RandNumGenerator.getInstance(); + return new Color(rng.nextInt(256), rng.nextInt(256), rng.nextInt(256)); + } + else + return cc.getColor(); + } + + /** Nested class used to hold the per-item information + * for the entries in the combo box of color + * choices. Each item represents a color choice which + * is basically just a Color object, an icon, and a name. + */ + public static class ColorChoice extends JLabel + { + private Color color; + + public ColorChoice(NamedColor c) + { super(c.toString(), new ColorIcon(c, 16, 16), + SwingConstants.LEFT); + color = c; + } + public ColorChoice(String name, Color c) + { super(name, new ColorIcon(c, 16, 16), SwingConstants.LEFT); + color = c; + } + protected void setColor(Color c) { color = c; } + public Color getColor() { return color; } + public String toString() { return getText(); } + } + + /** Nested class used to draw the color swatch icon used + * for color choice entries in the color combo box. + * This simple class just draws a rectangle filled with the + * color and edged with a black border. + */ + protected static class ColorIcon implements Icon + { + private static final int MARGIN = 2; + + private Color color; + private int width, height; + + public ColorIcon(Color c, int w, int h) { color = c; width = w; height = h; } + public void setColor(Color c) { color = c; } + public int getIconWidth() { return width; } + public int getIconHeight() { return height; } + public void paintIcon(Component comp, Graphics g, int x, int y) + { + Graphics2D g2 = (Graphics2D)g; + Rectangle r = new Rectangle(x + MARGIN, y + MARGIN, width - 2*MARGIN, height - 2*MARGIN); + if (color != RANDOM_COLOR) + { + g2.setColor(color); + g2.fill(r); + } + else for (int k = 0; k < r.width; k++) // draw rainbow lines + { + g2.setColor(Color.getHSBColor((float)k/r.width, .95f, 1)); + g2.drawLine(r.x + k, r.y, r.x + k, r.y + r.height); + } + g2.setColor(Color.black); + g2.draw(r); + } + } + +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton$1.class new file mode 100644 index 0000000..2146e31 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.class new file mode 100644 index 0000000..86a99da Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.java new file mode 100644 index 0000000..e579e54 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ControlButton.java @@ -0,0 +1,94 @@ +// Class: ControlButton +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.gui.GridAppFrame; + +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import javax.swing.JButton; + +/** + * Grid GUI Support Package:
      + * + * The ControlButton class represents a button + * whose button action runs in the same thread as the rest + * of the graphical user interface. + * + * @author Alyce Brady + * @version 29 July 2004 + **/ +public abstract class ControlButton extends JButton +{ + // Instance Variables: Encapsulated data for each object + private GridAppFrame gui = null; + private boolean displayAtEnd = false; + + // constructor + + /** Constructs a button. + * @param gui graphical user interface containing this button + * @param label label to place on button + * @param displayAtEnd true if grid should be displayed when + * button behavior is complete; false otherwise + **/ + public ControlButton(GridAppFrame gui, String label, + boolean displayAtEnd) + { + super(label); + this.gui = gui; + this.displayAtEnd = displayAtEnd; + addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { onClick(); }}); + } + + // accessors + + /** Returns the graphical user interface containing this button. **/ + public GridAppFrame getGUI() + { + return gui; + } + + /** Returns true if this control button redisplays the + * the grid after performing the action associated with the button. + **/ + public boolean displaysAfterButtonAction() + { + return displayAtEnd; + } + + // methods that implement the action associated with this button + + /** Executes the action associated with this button in a separate + * thread. Uses the Template Method pattern to separate the + * application-specific button behavior from the generic behavior + * of creating a new thread and deciding whether or not to display + * the grid when the button action is complete. + **/ + public void onClick() + { + act(); + + // Redisplay grid contents if appropriate. + if ( displayAtEnd ) + gui.showGrid(); + } + + /** Performs the button action associated with this button. **/ + public abstract void act(); + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.class new file mode 100644 index 0000000..74c7949 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.java new file mode 100644 index 0000000..ebdc769 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/EnabledDisabledStates.java @@ -0,0 +1,75 @@ +// Class EnabledDisabledStates +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +/** + * Grid GUI Support Package:
      + * + * The EnabledDisabledStates class provides a set of constants + * describing possible criteria for graphical user interface components to + * be enabled or disabled. + * This class should be replaced with an enumerated + * type under Java 1.5. + * + * @author Alyce Brady + * @version 29 July 2004 + **/ +public class EnabledDisabledStates +{ + /** Indicates that a component should always be enabled. **/ + public static final int ALWAYS_ENABLED = 0; + + /** Indicates that a component should be enabled if the grid + * associated with the component's user interface is not null. + **/ + public static final int NEEDS_GRID = 1; + + /** Indicates that a component should be enabled whenever the application + * is waiting for user input (regardless of whether the user interface's + * grid has been set) and disabled when the application is actively + * executing (responding to another button, for example). + **/ + public static final int NEEDS_APP_WAITING = 2; + + /** Indicates that a component should be enabled when the application is + * actively executing (responding to another button, for example) and + * disabled whenever the application is waiting for user input, as for + * a stop button. The component's enabled/disabled status does not + * depend on whether the user interface's grid has been set. + **/ + public static final int NEEDS_APP_RUNNING = 3; + + /** Indicates that a component should be enabled whenever the grid has + * been set and the application is waiting for user input. If the grid + * has not been set, or if the application is actively executing + * (responding to another button, for example), the component should + * be disabled. + **/ + public static final int NEEDS_GRID_AND_APP_WAITING = 4; + + /** Indicates that a component should be enabled when the grid has + * been set and the application is actively executing (responding + * to another button, for example). If the grid has not been set, + * or if the application is waiting for user input, the component + * should be disabled. + **/ + public static final int NEEDS_GRID_AND_APP_RUNNING = 5; + + /** Indicates that a component should always be disabled. **/ + public static final int ALWAYS_DISABLED = 6; + +} + + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.class new file mode 100644 index 0000000..c584c4d Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.java new file mode 100644 index 0000000..4ab22d7 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/FileMenuActionHandler.java @@ -0,0 +1,227 @@ +// Class FileMenuActionHandler +// +// Author: Alyce Brady +// +// This class is based on the College Board's EnvironmentController class, +// as allowed by the GNU General Public License. EnvironmentController +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; + +import javax.swing.JFileChooser; +import javax.swing.JOptionPane; + +/** + * Grid GUI Support Package:
      + * + * The FileMenuActionHandler class implements the methods + * used by the File menu defined in GridAppFrame. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 15 December 2003 + * @see GridAppFrame + **/ +public class FileMenuActionHandler +{ + // instance variables + + private GridAppFrame parentFrame = null; + private GridCreationDialog gridCreationDialog = null; + private GridFileChooser fileChooser; + private GridDataFileHandler fileHandler = null; + + + // constructor + + /** Creates a new file menu action handler tied to the specified frame. + * (Precondition: frame is not null. ) + * @param frame the frame that uses this action handler + * @param fileHandler object that can read and write a grid; + * null if this handler should not support file i/o + **/ + public FileMenuActionHandler(GridAppFrame frame, + GridDataFileHandler fileHandler) + { + parentFrame = frame; + this.fileHandler = fileHandler; + } + + + // methods that allow subclasses access to instance variables + + /** Gets the frame containing the file menu associated with this handler. + * @return the frame with this file menu + **/ + protected GridAppFrame getParentFrame() + { + return parentFrame; + } + + /** Gets the dialog used previously (if any) for grid creation. + * @return the dialog that prompts for grid creation parameters + **/ + protected GridCreationDialog getGridCreationDialog() + { + if (gridCreationDialog == null) + gridCreationDialog = createGridCreationDialog(); + return gridCreationDialog; + } + + /** Creates a grid creation dialog. + * @return a grid creation dialog + * + **/ + protected GridCreationDialog createGridCreationDialog() + { + return GridCreationDialog.makeGridChoiceDialog(parentFrame); + } + + /** Gets the file chooser dialog used previously (if any) or creates + * a new one using the createFileChooser method. + * @return the file chooser for finding files to read to or write from + **/ + protected GridFileChooser getFileChooser() + { + if (fileChooser == null) fileChooser = createFileChooser(); + return fileChooser; + } + + /** Creates the file chooser. + * @return the file to open + * + **/ + protected GridFileChooser createFileChooser() + { + return new GridFileChooser(); + } + + /** Gets the object that handles file i/o. + * @return file i/o handler + **/ + protected GridDataFileHandler getFileHandler() + { + return fileHandler; + } + + + // methods that support the actions of a typical, basic file menu + + /** Indicates whether this action handler supports file i/o. + * @return true if this action handler was constructed + * with a non-null grid data file handler + **/ + public boolean supportsFileIO() + { + return fileHandler != null; + } + + /** Indicates whether this action handler supports grid editing. + * Should only be redefined in subclasses that also redefine the + * invokeEditor method. + **/ + public boolean supportsGridEditing() + { + return false; + } + + /** Creates a new empty grid and invokes the grid editor. + * (Precondition: supportsGridEditing() == true + **/ + public void createNewGrid() + { + GridCreationDialog dialog = getGridCreationDialog(); + Grid newGrid = dialog.showDialog(); + if ( newGrid != null ) + { + parentFrame.setGrid(newGrid); + invokeEditor(); + } + } + + /** Invokes the appropriate grid editor to edit the grid from the + * parent frame. Should be redefined in subclasses that support + * a grid editor, to construct and run the editor. + * @param grid the grid to edit + **/ + protected void invokeEditor() + { + throw new java.lang.UnsupportedOperationException(); + + // Would be something like: + // GridEditor editor = new GridEditor(getParentFrame()); + // editor.constructWindowContents(); + + } + + /** Enables editing of the existing grid from the parent frame. + * Subclasses that support grid editing should ensure that the + * application is not actively running and modifying the grid + * while the grid is being edited. For example, if the parent + * frame is a SteppedGridAppFrame, the subclass + * should call the frame's stop method. + **/ + public void editGrid() + { + if ( parentFrame.getGrid() != null ) + invokeEditor(); + } + + /** Reads a new grid from a saved data file. Gets file via file + * chooser dialog, reads contents using the specified file handler. + * On error, brings up dialog and continues using previous grid. + **/ + public void openFile() + { + GridFileChooser chooser = getFileChooser(); + if (chooser.showOpenDialog(parentFrame) != JFileChooser.APPROVE_OPTION) + return; + + Grid newGrid; + try + { + newGrid = fileHandler.readGrid(chooser.getSelectedFile()); + } + catch (Exception ex) + { + JOptionPane.showMessageDialog(parentFrame, "Unable to read grid from file.\n" + + "Reason: " + ex, "Error reading file", JOptionPane.ERROR_MESSAGE); + return; + } + parentFrame.setGrid(newGrid); + } + + /** Saves the grid from the parent frame to a data file. + **/ + public void saveFile() + { + Grid grid = parentFrame.getGrid(); + if (fileChooser == null) fileChooser = new GridFileChooser(); + if (fileChooser.showSaveDialog(parentFrame) != JFileChooser.APPROVE_OPTION) + return; + + try + { + fileHandler.writeGrid(grid, fileChooser.getSelectedFile()); + } + catch (Exception ex) + { + JOptionPane.showMessageDialog(parentFrame, "Unable to save grid to file.\n" + + "Reason: " + ex, "Error saving file", JOptionPane.ERROR_MESSAGE); + } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList$GeneratedThreadedControlButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList$GeneratedThreadedControlButton.class new file mode 100644 index 0000000..7e218c0 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList$GeneratedThreadedControlButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.class new file mode 100644 index 0000000..ca7ccf8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.java new file mode 100644 index 0000000..df2cc2a --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GeneratedButtonList.java @@ -0,0 +1,393 @@ +// Class: GeneratedButtonList +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import javax.swing.JButton; + +import java.lang.reflect.InvocationTargetException; +import java.lang.reflect.Method; + +import java.util.ArrayList; +import java.util.HashMap; +import java.util.Iterator; +import java.util.List; +import java.util.Map; +import java.util.regex.Matcher; +import java.util.regex.Pattern; + +/** + * Grid GUI Support Package:
      + * + * A GeneratedButtonList object creates a group of + * control buttons based on the methods of another class. When the + * GeneratedButtonList object is constructed, the + * client code must specify a target object (the object whose methods + * are to be associated with control buttons) and a set of arguments + * to be passed to those methods. The GeneratedButtonList + * object will generate control buttons for all of the target object's + * methods that could be passed the given set of arguments and have a + * void return type. + * + * @author Alyce Brady + * @version 29 July 2004 + **/ +public class GeneratedButtonList extends ArrayList +{ + // Define pattern for on...ButtonClick methods. + public static final String prefix = "on"; + public static final String suffix = "ButtonClick"; + public static final String methNameRegExpr = prefix + ".+" + suffix; + public static final Pattern methNamePattern = + Pattern.compile(methNameRegExpr); + + // Instance Variables: Encapsulated data for each GeneratedButtonList object + protected GridAppFrame gui; + protected Object targetObj; + protected boolean includeOnButtonClickMethodsOnly; + protected List targetMethods; + protected Object[] methodArguments; + protected Map buttonLabelToMethodObjMap = new HashMap(); + protected boolean displayGridAfterButtonActions; + + // constructors and their helper methods + + /** Constructs a list of control buttons based on methods associated + * with the given target object. Will only include methods that take + * 0 arguments and have a void return type. The text on + * each control button will be the associated method name or, if the + * name matches the on...ButtonClick format, the middle part of the + * method name. For example, the control button for a doX method + * would have the label "doX", while the control button for an + * onDoYButtonClick method would have the label "DoY". When each + * resulting control button is pressed, it will send the associated + * message to the target object. It may also display the contents + * of the grid afterward, depending on the value of + * displayAfterButtonPresses. + * @param gui graphical user interface that will contain these + * buttons + * @param targetObj an object of the class whose methods should become + * control buttons; the buttons will forward + * messages to targetObj in response to button presses + * @param displayAfterButtonPresses true if the user interface should + * display the contents of the grid after executing + * the behaviors associated with control button + * presses; false otherwise + **/ + public GeneratedButtonList(GridAppFrame gui, Object targetObj, + boolean displayAfterButtonPresses) + { + this(gui, targetObj, null, false, displayAfterButtonPresses); + } + + /** Constructs a list of control buttons based on methods associated + * with the given target object. Will only include methods that + * take 0 arguments, have a void return type, and, if + * onButtonClickMethodsOnly is true, whose names match + * the on...ButtonClick format (e.g., onXYZButtonClick). The text on + * each control button will be the associated method name or, if the + * name matches the on...ButtonClick format, the middle part of the + * method name. For example, the control button for a doX method + * would have the label "doX", while the control button for an + * onDoYButtonClick method would have the label "DoY". When each + * resulting control button is pressed, it will send the associated + * message to the target object. It may also display the contents + * of the grid afterward, depending on the value of + * displayAfterButtonPresses. + * @param gui graphical user interface that will contain these + * buttons + * @param targetObj an object of the class whose methods should become + * control buttons; the buttons will forward + * messages to targetObj in response to button presses + * @param onButtonClickMethodsOnly true if only on...ButtonClick + * methods should be included; false otherwise + * @param displayAfterButtonPresses true if the user interface should + * display the contents of the grid after executing + * the behaviors associated with control button + * presses; false otherwise + **/ + public GeneratedButtonList(GridAppFrame gui, Object targetObj, + boolean onButtonClickMethodsOnly, + boolean displayAfterButtonPresses) + { + this(gui, targetObj, null, onButtonClickMethodsOnly, + displayAfterButtonPresses); + } + + /** Constructs a list of control buttons based on methods associated + * with the given target object. Will only include methods that + * could be passed the given set of arguments and that have a + * void return type. The text on each control button + * will be the associated method name or, if the name matches the + * on...ButtonClick format, the middle part of the method name. For + * example, the control button for a doX method would have the label + * "doX", while the control button for an onDoYButtonClick method + * would have the label "DoY". When each resulting control button + * is pressed, it will send the associated message to the target object, + * passing as arguments the objects provided to this constructor. + * It may also display the contents of the grid afterward, depending + * on the value of displayAfterButtonPresses. + * @param gui graphical user interface that will contain these + * buttons + * @param targetObj an object of the class whose methods should become + * control buttons; the buttons will forward + * messages to targetObj in response to button presses + * @param arguments the arguments to pass to methods associated with + * control buttons + * @param displayAfterButtonPresses true if the user interface should + * display the contents of the grid after executing + * the behaviors associated with control button + * presses; false otherwise + **/ + public GeneratedButtonList(GridAppFrame gui, + Object targetObj, Object[] arguments, + boolean displayAfterButtonPresses) + { + this(gui, targetObj, arguments, false, displayAfterButtonPresses); + } + + /** Constructs a list of control buttons based on methods associated + * with the given target object. Will only include methods that + * could be passed the given set of arguments, that have a + * void return type, and, if + * onButtonClickMethodsOnly is true, whose names match + * the on...ButtonClick format (e.g., onXYZButtonClick). The text on + * each control button will be the associated method name or, if the + * name matches the on...ButtonClick format, the middle part of the + * method name. For example, the control button for a doX method + * would have the label "doX", while the control button for an + * onDoYButtonClick method would have the label "DoY". When each + * resulting control button is pressed, it will send the associated + * message to the target object, passing as arguments the objects + * provided to this constructor. It may also display the contents + * of the grid afterward, depending on the value of + * displayAfterButtonPresses. + * @param gui graphical user interface that will contain these + * buttons + * @param targetObj an object of the class whose methods should become + * control buttons; the buttons will forward + * messages to targetObj in response to button presses + * @param arguments the arguments to pass to methods associated with + * control buttons + * @param onButtonClickMethodsOnly true if only on...ButtonClick + * methods should be included; false otherwise + * @param displayAfterButtonPresses true if the user interface should + * display the contents of the grid after executing + * the behaviors associated with control button + * presses; false otherwise + **/ + public GeneratedButtonList(GridAppFrame gui, + Object targetObj, Object[] arguments, + boolean onClickButtonMethodsOnly, + boolean displayAfterButtonPresses) + { + this.gui = gui; + this.targetObj = targetObj; + if ( arguments == null ) + this.methodArguments = new Object[0]; + else + this.methodArguments = arguments; + this.includeOnButtonClickMethodsOnly = onClickButtonMethodsOnly; + this.displayGridAfterButtonActions = displayAfterButtonPresses; + + // Identify the target object's methods that will have control buttons. + identifyButtonMethods(); + + // Create the control buttons. + createButtons(); + } + + /** Identifies the target object's methods for which control buttons + * should be created. + **/ + protected void identifyButtonMethods() + { + // Get all the methods from the targetObj class, look through + // them, and save all the control button methods in a list. + // (The control button methods are all the void methods that + // take parameters corresponding to those provided in the + // GeneratedButtonList constructor.) + Class targetClass = targetObj.getClass(); + targetMethods = new ArrayList(); + Method[] allMethods = targetClass.getMethods(); + for ( int i = 0; i < allMethods.length; i++ ) + { + Method meth = allMethods[i]; + if ( meetsControlMethodCriteria(meth, targetClass) ) + { + targetMethods.add(meth); + buttonLabelToMethodObjMap.put(buttonLabelFor(meth), meth); + } + } + } + + /** Returns true if the given method was declared in + * the specified class (not in one of its superclasses) and has + * the right return type and parameters to be turned into a + * control button; false otherwise. + **/ + protected boolean meetsControlMethodCriteria(Method methodToCheck, + Class targetClass) + { + Class retType = methodToCheck.getReturnType(); + Class[] paramTypes = methodToCheck.getParameterTypes(); + + // Check whether method was declared in the target class. + if ( ! (methodToCheck.getDeclaringClass().equals(targetClass)) ) + return false; + + // Check whether method has the right return type & number of + // parameters. + if ( ! ( retType.equals(void.class) && + paramTypes.length == methodArguments.length ) ) + return false; + + // Check whether all its parameters are of the right type. + for ( int j = 0; j < paramTypes.length; j++ ) + { + if ( ! paramTypes[j].isInstance(methodArguments[j]) ) + { + // This parameter type is not as expected. + return false; + } + } + + // Check whether the button name has the right format. + if ( includeOnButtonClickMethodsOnly ) + return meetsMethodNameFormatCriteria(methodToCheck.getName()); + + // This method meets all the criteria for a target method. + return true; + } + + /** Returns true if the given method was declared in + * the specified class (not in one of its superclasses) and has + * the right return type and parameters to be turned into a + * control button; false otherwise. + **/ + protected boolean meetsMethodNameFormatCriteria(String methodName) + { + Matcher patternMatcher = methNamePattern.matcher(methodName); + return patternMatcher.matches(); + } + + /** Returns the appropriate button label for the given method. **/ + protected String buttonLabelFor(Method method) + { + String methodName = method.getName(); + if ( meetsMethodNameFormatCriteria(methodName) ) + { + int endIndex = methodName.length() - suffix.length(); + return methodName.substring(prefix.length(), endIndex); + } + else + return methodName; + } + + /** Creates control buttons that, when pressed, will pass a message to + * the appropriate method in the target object. + * @param targetMethods the methods for which to create control buttons + **/ + protected void createButtons() + { + Iterator iter = targetMethods.iterator(); + while ( iter.hasNext() ) + { + Method meth = (Method) iter.next(); + add(new GeneratedThreadedControlButton(gui, buttonLabelFor(meth), + displayGridAfterButtonActions)); + } + } + + + // public method to customize button labels + + /** Resets the specified button label associated with a method in + * the target object. The prevButtonLabel parameter + * should be the previous button label. (The default button label + * is the name of the associated method or, if the method name + * matches the onXYZButtonClick format, is the name of the method + * without the on...ButtonClick prefix and suffix, e.g., XYZ). This + * method should be called before the constructWindowContents + * method of the graphical user interface. This method does nothing + * if the list of generated control buttons does not include a button + * whose current label is prevButtonLabel. + * @param prevButtonLabel previous button label + * @param buttonLabel label to place on button + **/ + public void resetButtonLabel(String prevButtonLabel, String buttonLabel) + { + // Change the label on the button. + Iterator iter = iterator(); + while ( iter.hasNext() ) + { + JButton button = (JButton) iter.next(); + if ( button.getText().equals(prevButtonLabel) ) + { + button.setText(buttonLabel); + + // Update the button label to method object map. + Method meth = + (Method) buttonLabelToMethodObjMap.get(prevButtonLabel); + buttonLabelToMethodObjMap.remove(prevButtonLabel); + buttonLabelToMethodObjMap.put(buttonLabel, meth); + } + } + } + + + // Nested class for generated ThreadedControlButton objects + + /** GeneratedThreadedControlButton objects represent buttons whose + * button action is to reflectively invoke the appropriate method + * in the target object. + **/ + protected class GeneratedThreadedControlButton + extends ThreadedControlButton + { + /** Constructs a button that will run in its own thread. + * @param gui graphical user interface containing this button + * @param label label to place on button + * @param displayAtEnd true if grid should be displayed when + * button behavior is complete; false otherwise + **/ + protected GeneratedThreadedControlButton(GridAppFrame gui, + String label, + boolean displayAtEnd) + { + super(gui, label, displayAtEnd); + } + + /** Performs the button action associated with this button; + * actually delegates the button action to the method in the + * target object associated with this button. + **/ + public void act() + { + // Get method associated with button label and try to invoke it. + Method meth = (Method) buttonLabelToMethodObjMap.get(getText()); + try + { meth.invoke(targetObj, methodArguments); } + catch (InvocationTargetException e) + { throw new IllegalArgumentException("Can't invoke " + + meth.getName() + ": " + e); + } + catch (IllegalAccessException e) + { throw new IllegalArgumentException("Can't invoke " + + meth.getName() + ": " + e); + } + } + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$1.class new file mode 100644 index 0000000..501d804 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$DisplayMouseListener.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$DisplayMouseListener.class new file mode 100644 index 0000000..6bf1f0a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$DisplayMouseListener.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$GUIExceptionHandler.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$GUIExceptionHandler.class new file mode 100644 index 0000000..38f4608 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame$GUIExceptionHandler.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.class new file mode 100644 index 0000000..5c367a2 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.java new file mode 100644 index 0000000..63396a3 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridAppFrame.java @@ -0,0 +1,857 @@ +// Class GridAppFrame +// +// Author: Alyce Brady +// +// This class is based on the College Board's MBSGUIFrame class, +// as allowed by the GNU General Public License. MBSGUIFrame +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study. +// (See http://www.collegeboard.com/student/testing/ap/compsci_a/case.html.) +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.Location; + +import edu.kzoo.grid.display.GridDisplay; +import edu.kzoo.grid.display.PseudoInfiniteViewport; +import edu.kzoo.grid.display.ScrollableGridDisplay; + +import java.awt.BorderLayout; +import java.awt.Color; +import java.awt.Dimension; +import java.awt.GridLayout; +import java.awt.event.MouseAdapter; +import java.awt.event.MouseEvent; +import java.util.ArrayList; +import java.util.Collection; +import java.util.HashSet; +import java.util.Iterator; + +import javax.swing.BorderFactory; +import javax.swing.JComponent; +import javax.swing.JFrame; +import javax.swing.JLabel; +import javax.swing.JMenu; +import javax.swing.JMenuBar; +import javax.swing.JOptionPane; +import javax.swing.JPanel; +import javax.swing.JScrollPane; +import javax.swing.JSlider; +import javax.swing.event.ChangeEvent; +import javax.swing.event.ChangeListener; + +/** + * Grid GUI Support Package:
      + * + * The GridAppFrame class provides a window in which + * to display a grid and its contents. Options include menus, a + * speed slider bar, and a control panel containing buttons such as + * a Start/Restart/Reset button. Menus and buttons are usually + * enabled (clickable) except when one of them is executing, when + * they are generally disabled (grayed-out and not clickable). It + * is possible, though, to create components that are always enabled + * (such as the speed slider bar), enabled only when the application + * is actively executing (such as a stop button), or always disabled + * (useful when the program is under construction and the behavior for + * a particular component has not yet been implemented). + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 1 September 2004 + **/ +public class GridAppFrame extends JFrame implements GridDisplay +{ + // constants used to initialize slider + + /** Default minimum value for speed slider bar (10 milliseconds). **/ + public static final int DEFAULT_MIN_DELAY_MSECS = 10; + + /** Default maximum value for speed slider bar (1000 milliseconds). **/ + public static final int DEFAULT_MAX_DELAY_MSECS = 1000; + + // instance variables + private Grid grid = null; + private Collection gridChangeListeners = new HashSet(); + private ScrollableGridDisplay display = null; + + private JPanel controlButtonsAtTopOfPanel = null; + private Collection componentsNeedingGrid = new HashSet(); + private Collection componentsEnabledWhenWaiting = new HashSet(); + private Collection componentsEnabledWhenRunning = new HashSet(); + private boolean inRunningMode = false; + + private int min_delay_msecs = DEFAULT_MIN_DELAY_MSECS, + max_delay_msecs = DEFAULT_MAX_DELAY_MSECS, + initial_delay = defaultInitialDelay(DEFAULT_MAX_DELAY_MSECS, + DEFAULT_MIN_DELAY_MSECS); + private int delay = 0; // time to view the display + private JSlider speedSlider = null; + + + // methods not tied to any particular instance of this class + + /** Calculates the default initial delay when one is not provided + * by the user. + * @param maxDelay maximum delay value for slider + * @param minDelay minimum delay value for slider + **/ + private static final int defaultInitialDelay(int maxDelay, int minDelay) + { + return minDelay + (maxDelay - minDelay)/2; + } + + + // constructor, methods that specify which components to include + // in the window, and constructWindowContents method + + /** Constructs an empty GridAppFrame window object that will + * display a grid. + * Use methods such as includeStartRestart and + * includeSpeedSlider to include components on the + * window other than the basic grid display. + * Use the constructWindowContents method to set the properties of the + * window and make it visible. + **/ + public GridAppFrame() + { + // Reset exception handler to notify user of exception and + // generate trace information. + System.setProperty("sun.awt.exception.handler", + GUIExceptionHandler.class.getName()); + } + + /** Includes the specified menu. + * The menu will be enabled only when the application is inactive, + * waiting for user input. + * If some menu items are enabled/disabled or visible/invisible + * based on the existence or identity of the grid, then the menu + * should be a JMenu subclass, should implement the + * GridChangeListener interface, and should register + * itself as a grid change listener. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param menu the menu to include + * @see edu.kzoo.grid.gui.nuggets.BasicGridFileMenu + * @see edu.kzoo.grid.gui.nuggets.BasicHelpMenu + * @see edu.kzoo.grid.gui.nuggets.MinimalFileMenu + * @see #addGridChangeListener + **/ + public void includeMenu(JMenu menu) + { + includeMenu(menu, EnabledDisabledStates.NEEDS_APP_WAITING); + } + + /** Includes the specified menu. + * If some menu items are enabled/disabled or visible/invisible + * based on the existence or identity of the grid, then the menu + * should be a JMenu subclass, should implement the + * GridChangeListener interface, and should register + * itself as a grid change listener. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param menu the menu to include + * @param enableDisableIndicator indicates when the menu should + * enabled or disabled + * @see edu.kzoo.grid.gui.nuggets.BasicGridFileMenu + * @see edu.kzoo.grid.gui.nuggets.BasicHelpMenu + * @see edu.kzoo.grid.gui.nuggets.MinimalFileMenu + * @see #addGridChangeListener + **/ + public void includeMenu(JMenu menu, int enableDisableIndicator) + { + if ( menu != null ) + { + if ( getJMenuBar() == null ) + setJMenuBar(new JMenuBar()); + getJMenuBar().add(menu); + + setEnabledStatus(menu, enableDisableIndicator); + } + } + + /** Specifies when a given component should be enabled or disabled. + * @param component the component to include + * @param enableDisableIndicator indicates when the component should + * enabled or disabled + **/ + protected void setEnabledStatus(JComponent component, + int enableDisableIndicator) + { + switch (enableDisableIndicator) + { + case EnabledDisabledStates.ALWAYS_ENABLED: + component.setEnabled(true); + break; + case EnabledDisabledStates.NEEDS_GRID: + enableOnlyIfGridSet(component); + component.setEnabled(grid != null); + break; + case EnabledDisabledStates.NEEDS_APP_WAITING: + enableOnlyWhenWaiting(component); + component.setEnabled(true); + break; + case EnabledDisabledStates.NEEDS_APP_RUNNING: + enableOnlyWhenRunning(component); + component.setEnabled(false); + break; + case EnabledDisabledStates.NEEDS_GRID_AND_APP_WAITING: + enableOnlyIfGridSet(component); + enableOnlyWhenWaiting(component); + component.setEnabled(grid != null); + break; + case EnabledDisabledStates.NEEDS_GRID_AND_APP_RUNNING: + enableOnlyIfGridSet(component); + enableOnlyWhenRunning(component); + component.setEnabled(false); + break; + case EnabledDisabledStates.ALWAYS_DISABLED: + component.setEnabled(false); + break; + } + } + + /** Enables the given component only when the application is ready + * and waiting for user input. + **/ + public void enableOnlyIfGridSet(JComponent component) + { + componentsNeedingGrid.add(component); + } + + /** Enables the given component only when the application is ready + * and waiting for user input. + **/ + public void enableOnlyWhenWaiting(JComponent component) + { + componentsEnabledWhenWaiting.add(component); + } + + /** Enables the given component only when the application is actively + * executing (not just waiting for user input). A stop button, for + * example, might be enabled only when the application is actively + * running. + **/ + public void enableOnlyWhenRunning(JComponent component) + { + componentsEnabledWhenRunning.add(component); + } + + /** Includes the specified control component in a list of control + * buttons. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param component the component to include + * @param enableDisableIndicator indicates when the component should + * be enabled or disabled + **/ + public void includeControlComponent(JComponent component, + int enableDisableIndicator) + { + if ( component != null ) + { + if ( controlButtonsAtTopOfPanel == null ) + { + controlButtonsAtTopOfPanel = new JPanel(); + controlButtonsAtTopOfPanel.setLayout(new GridLayout(0, 1)); + } + controlButtonsAtTopOfPanel.add(component); + } + setEnabledStatus(component, enableDisableIndicator); + } + + /** Includes the specified control component in a list of control + * buttons. The component starts out enabled (visible and usable) + * or disabled according to the initiallyEnabled parameter; + * it later switches to enabled or disabled under the conditions + * indicated by the enableDisableIndicator parameter. + * Note, though, that it will only switch if there is a state change + * that would normally cause it to switch. It will never switch, + * for example, if the enableDisableIndicator parameter + * is ALWAYS_ENABLED or ALWAYS_DISABLED, because there is no defined + * state change that would cause such components to switch. Thus, + * a component that is specified as ALWAYS_ENABLED but initially + * disabled will remain disabled throughout the application. + *

      + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param component the component to include + * @param enableDisableIndicator indicates when the component should + * be enabled or disabled + * @param initiallyEnabled true if button should initially be enabled; + * false if button should initially be disabled + **/ + public void includeControlComponent(JComponent component, + int enableDisableIndicator, + boolean initiallyEnabled) + { + includeControlComponent(component, enableDisableIndicator); + component.setEnabled(initiallyEnabled); + } + + /** Includes the control components in the given list in the control + * panel. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * (Precondition: all object in componentList are JComponent objects.) + * @param componentList the list of components to include in the + * control panel + * @param enableDisableIndicator indicates when the components should + * be enabled or disabled + **/ + public void includeControlComponents(ArrayList componentList, + int enableDisableIndicator) + { + Iterator iter = componentList.iterator(); + while ( iter.hasNext() ) + { + JComponent component = (JComponent) iter.next(); + includeControlComponent(component, enableDisableIndicator); + } + } + + /** Includes a speed adjustment slider bar with default values. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * The slider will be initialized to range from + * DEFAULT_MAX_DELAY_MSECS to + * DEFAULT_MIN_DELAY_MSECS (maximum delay is + * slowest; minimum dalay is fastest), with an initial + * delay halfway between them. + **/ + public void includeSpeedSlider() + { + includeSpeedSlider(DEFAULT_MAX_DELAY_MSECS, DEFAULT_MIN_DELAY_MSECS); + } + + /** Includes a speed adjustment slider bar with the specified + * extreme values and an initial delay halfway between them. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * The slider will be initialized to range from + * maxDelayMsecs to minDelayMsecsY_MSECS + * (maximum delay is slowest; minimum dalay is fastest). + * (Precondition: minDelayMsecs <= <= maxDelayMsecs) + * @param maxDelayMsecs maximum delay value for slider, in milliseconds + * @param minDelayMsecs minimum delay value for slider, in milliseconds + **/ + public void includeSpeedSlider(int maxDelayMsecs, int minDelayMsecs) + { + includeSpeedSlider(maxDelayMsecs, minDelayMsecs, + defaultInitialDelay(maxDelayMsecs, minDelayMsecs)); + } + + /** Includes a speed adjustment slider bar with the specified + * properties. This method will have no effect unless it is + * called before the constructWindowContents method. + * The slider will be initialized to range from + * maxDelayMsecs to minDelayMsecsY_MSECS + * (maximum delay is slowest; minimum dalay is fastest). + * (Precondition: minDelayMsecs <= initialDelayMsecs <= maxDelayMsecs) + * @param maxDelayMsecs maximum delay value for slider, in milliseconds + * @param minDelayMsecs minimum delay value for slider, in milliseconds + * @param initialDelayMsecs initial value for slider, in milliseconds + **/ + public void includeSpeedSlider(int maxDelayMsecs, int minDelayMsecs, + int initialDelayMsecs) + { + // Initialize the slider values. + min_delay_msecs = minDelayMsecs; + max_delay_msecs = maxDelayMsecs; + if ( minDelayMsecs <= initialDelayMsecs && + initialDelayMsecs <= maxDelayMsecs ) + { + initial_delay = initialDelayMsecs; + } + else + initial_delay = defaultInitialDelay(maxDelayMsecs, minDelayMsecs); + delay = initial_delay; + + // Create the slider and add a change listener to it. + speedSlider = new JSlider(min_delay_msecs, max_delay_msecs, + initial_delay); + speedSlider.addChangeListener(new ChangeListener() { + public void stateChanged(ChangeEvent evt) { + delay = ((JSlider)evt.getSource()).getValue(); + }}); + } + + /** Constructs the body of a window containing a scrollable + * display for a grid and its contents. + * @param title frame title + * @param viewingWidth the width of the viewing area + * @param viewingHeight the height of the viewing area + * @param minCellSize minimum grid cell side length + **/ + public void constructWindowContents(String title, + int viewingWidth, int viewingHeight, + int minCellSize) + { + constructWindowContents(title, null, viewingWidth, viewingHeight, + minCellSize); + } + + /** Constructs the body of a window containing a scrollable + * display for a grid and its contents. + * @param title frame title + * @param bgColor color to paint background of grid + * @param viewingWidth the width of the viewing area + * @param viewingHeight the height of the viewing area + * @param minCellSize minimum grid cell side length + **/ + public void constructWindowContents(String title, Color bgColor, + int viewingWidth, int viewingHeight, + int minCellSize) + { + // Set characteristics for the main frame. + setTitle(title); + setLocation(25, 15); + setDefaultCloseOperation(EXIT_ON_CLOSE); + + // Create the grid display that is the center of this + // graphical user interface. + display = constructDisplay(viewingWidth, viewingHeight, + minCellSize, bgColor); + display.addMouseListener(getMouseListenerForDisplay()); + gridChangeListeners.add(display); + + // Define the contents of the main frame. + setContentPane(defineContent()); + enterNotRunningMode(); + + pack(); + setVisible(true); + } + + /** Constructs the grid display at the heart of the graphical + * user interface. Should be redefined in subclasses that wish + * to use a subclass of ScrollableGridDisplay (for + * example, to modify the way tool tips are displayed, or some + * other aspect of the scrollable display). + * @param viewingWidth the width of the viewing area + * @param viewingHeight the height of the viewing area + * @param minCellSize minimum grid cell side length + * @param bgColor color to paint background of grid + * @return a scrollable grid display + **/ + protected ScrollableGridDisplay constructDisplay( + int viewingWidth, int viewingHeight, int minCellSize, Color bgColor) + { + return new ScrollableGridDisplay(viewingWidth, viewingHeight, + minCellSize, bgColor); + } + + // methods that access this object's state, including methods + // required by the GridDisplay interface + + /** Sets the grid being displayed. + * @param grid the Grid to display + **/ + public void setGrid(Grid grid) + { + this.grid = grid; + notifyGridChangeListeners(); + enableAndDisable(); + } + + /** Returns the grid at the center of this graphical user + * interface. + * @return the grid + */ + public Grid getGrid() + { + return grid; + } + + /** Shows the grid. + * (Precondition: must have called setGrid.) + **/ + public void showGrid() + { + display.showGrid(); + if ( getDelay() > 0 ) + { + try + { + Thread.sleep(getDelay()); + } + catch (InterruptedException e) {} + } + } + + /** Gets the grid display. + * @return a scrollable grid display + **/ + public ScrollableGridDisplay getDisplay() + { + return display; + } + + /** Returns a mouse adapter that responds to mouse presses over + * the grid display. + * Subclasses that wish to respond to other mouse events should + * redefine this method to return a subclass of DisplayMouseListener + * (or another MouseAdapter subclass) that handles other mouse events. + **/ + protected MouseAdapter getMouseListenerForDisplay() + { + // Return an instance of an anonymous inner subclass of MouseAdapter. + return new DisplayMouseListener(); + } + + /** Returns the control panel (null if this + * graphical user interface has no control panel). + **/ + protected JPanel getControlPanel() + { + return controlButtonsAtTopOfPanel; + } + + /** Returns true if the given component requires the grid + * to have been set in order to be enabled; false otherwise. + **/ + protected boolean componentRequiresGrid(JComponent component) + { + return componentsNeedingGrid.contains(component); + } + + /** Returns the set of components that should be enabled only when the + * current grid is not null. + **/ + protected Collection componentsEnabledOnlyIfGridSet() + { + return componentsNeedingGrid; + } + + /** Returns the set of components that should be enabled only when the + * application is ready and waiting for user input. + **/ + protected Collection componentsEnabledOnlyWhenWaiting() + { + return componentsEnabledWhenWaiting; + } + + /** Returns the set of components that should be enabled only when the + * application is actively running, and should be disabled when the + * application is ready and waiting for user input. + **/ + protected Collection componentsEnabledOnlyWhenRunning() + { + return componentsEnabledWhenRunning; + } + + /** Returns true if the application is in "running mode" + * (executing the behavior associated with a control button, for example); + * returns false otherwise. + **/ + public boolean isInRunningMode() + { + return inRunningMode; + } + + /** Returns the speed slider bar (null if no speed slider + * is included with this graphical user interface). + **/ + protected JSlider getSpeedSlider() + { + return speedSlider; + } + + /** Sets the current delay value and adjusts the speed slider, if there + * is one. Subsequent changes to the slider bar will override + * this value. + * @param delayMsecs the length of time the application should pause + * after displaying the grid to allow users time + * to see it (in milliseconds) + **/ + public void setDelay(int delayMsecs) + { + delay = delayMsecs; + if ( speedSlider != null ) + { + if ( delay < min_delay_msecs ) + speedSlider.setValue(min_delay_msecs); + else if ( delay > max_delay_msecs ) + speedSlider.setValue(max_delay_msecs); + else + speedSlider.setValue(delay); + } + } + + /** Resets the current delay value to the initial delay value and adjusts + * the speed slider, if there is one. + **/ + public void resetDelay() + { + setDelay(initial_delay); + } + + /** Returns the current delay value from the speed slider or a previous + * call to setDelay; defaults to 0 if there is no speed + * slider included with this graphical user interface and if + * setDelay has never been called. + * @return the length of time the application should pause after + * displaying the grid to allow users time to see it + * (in milliseconds) + **/ + public int getDelay() + { + return delay; + } + + + // methods that create components of the graphical user interface + + /** Defines contents of main window panel. Redefine this method + * to define panels other than a grid display panel, control panel, + * or speed slider bar panel, or to alter the layout or border of + * the main contents panel. + * @return the panel that will serve as the window's content panel + **/ + protected JPanel defineContent() + { + JPanel content = new JPanel(); + content.setBorder(BorderFactory.createEmptyBorder(15, 15, 15, 15)); + content.setLayout(new BorderLayout()); + + // Create a panel to display the grid, an optional control panel for + // buttons (e.g., a Reset button), and an optional speed slider panel, + // and add them to the main panel. + content.add(makeDisplayPanel(), BorderLayout.CENTER); + + JComponent controlPanel = makeControlPanel(null); + if ( controlPanel != null ) + content.add(controlPanel, BorderLayout.WEST); + + JComponent sliderPanel = makeSliderPanel(); + if ( sliderPanel != null ) + content.add(sliderPanel, BorderLayout.SOUTH); + + return content; + } + + /** Creates the panel for displaying a grid application. + **/ + protected JComponent makeDisplayPanel() + { + // Create a scrollable pane with a viewport that views the + // grid display. + JScrollPane scrollPane = new JScrollPane(); + PseudoInfiniteViewport vp = new PseudoInfiniteViewport(scrollPane); + scrollPane.setViewport(vp); + scrollPane.setViewportView(getDisplay()); + + // There are no actions defined for the viewing scrollpane, so + // it is always "disabled." + scrollPane.setEnabled(false); + + return scrollPane; + } + + /** Creates a control panel that lays out control buttons starting + * from the top. Redefine this method to change the layout or + * border of the control panel. + * @param title a title to put in the border of this control + * panel, or null if no title is desired + * @return a panel containing the control components + **/ + protected JPanel makeControlPanel(String title) + { + // Create a panel for the control components. + JPanel controlPanel = new JPanel(); + controlPanel.setLayout(new BorderLayout()); + if ( title != null ) + controlPanel.setBorder(BorderFactory.createTitledBorder(title)); + + // Add the control buttons to the top of the control panel. + if ( controlButtonsAtTopOfPanel == null ) + return null; + controlPanel.add(controlButtonsAtTopOfPanel, BorderLayout.NORTH); + return controlPanel; + } + + /** Creates a speed slider for controling the speed of the animation. + * @return a panel containing the speed slider + **/ + protected JPanel makeSliderPanel() + { + if ( speedSlider == null ) + { + // No speed slider. + return null; + } + + // Define the labels and appearance of the speed slider for + // controling the speed of the application. + JPanel sliderPanel = new JPanel(); + sliderPanel.setBorder(BorderFactory.createTitledBorder("Adjust Speed")); + sliderPanel.add(new JLabel("Slow")); + speedSlider.setInverted(true); + speedSlider.setPreferredSize(new Dimension(100, + speedSlider.getPreferredSize().height)); + speedSlider.setMaximumSize(speedSlider.getPreferredSize()); + sliderPanel.add(speedSlider); + sliderPanel.add(new JLabel("Fast")); + + // The speed slider is always enabled. + sliderPanel.setEnabled(true); + + return sliderPanel; + } + + // Methods that support notifying components or other interested objects + // about changes to the grid (changes in grid identity, i.e., which grid + // object is being displayed, not changes to the grid contents, which the + // GUI doesn't know about). + + /** Registers the specified object as interested in being notified + * of changes in the identify of the grid being modeled. + * @param listener the object that should be notified of + * changes to the identity of the grid + **/ + public void addGridChangeListener(GridChangeListener listener) + { + gridChangeListeners.add(listener); + } + + /** Notifies all registered model change listeners that the model + * has been replaced. + **/ + public void notifyGridChangeListeners() + { + Iterator it = gridChangeListeners.iterator(); + while ( it.hasNext() ) + { + GridChangeListener listener = (GridChangeListener)it.next(); + listener.reactToNewGrid(getGrid()); + } + } + + // Methods for handling user-initiated events + + /** Handles a mouse press over the grid display. + * Currently does nothing, but can be redefined in subclasses + * to handle actions. + **/ + protected void onMousePressOverDisplay(Location loc) + { + } + + /** Enables and disables GUI components as necessary while the application + * is running. + **/ + public void enterRunningMode() + { + inRunningMode = true; + enableAndDisable(); + } + + /** Enables and disables GUI components as necessary when an application + * is not running. + **/ + public void enterNotRunningMode() + { + inRunningMode = false; + enableAndDisable(); + } + + /** Enables and disables components appropriately. **/ + protected void enableAndDisable() + { + // Tool tips should not be enabled while in running mode. + if ( getDisplay() != null ) + getDisplay().setToolTipsEnabled(!isInRunningMode()); + + // Deal with components that should be enabled only if there is a grid. + Iterator it = componentsEnabledOnlyIfGridSet().iterator(); + while ( it.hasNext() ) + { + JComponent component = (JComponent) it.next(); + component.setEnabled(getGrid() != null); + } + + // Deal with components that should be enabled only in running mode + // (which may or may not also require a grid). + it = componentsEnabledOnlyWhenRunning().iterator(); + while ( it.hasNext() ) + { + JComponent component = (JComponent) it.next(); + + // If component needs grid, enable only if it is set. + component.setEnabled(isInRunningMode() && + ( ! componentRequiresGrid(component) || + getGrid() != null ) ); + } + + // Deal with components that should be disabled in running mode + // (which may or may not also require a grid). + it = componentsEnabledOnlyWhenWaiting().iterator(); + while ( it.hasNext() ) + { + JComponent component = (JComponent) it.next(); + + // If component needs grid, enable only if it is set. + component.setEnabled( ! isInRunningMode() && + ( ! componentRequiresGrid(component) || + getGrid() != null ) ); + } + } + + // Nested class for handling mouse events over the grid display + + /** Nested class that handles simple mouse presses over the grid + * display. Can be extended to handle other mouse events (mouse + * release, mouse click, etc.). + **/ + public class DisplayMouseListener extends MouseAdapter + { + // Redefined method from MouseAdapter + public void mousePressed(MouseEvent evt) + { + Location loc = getMouseLocation(evt); + if ( loc != null ) + onMousePressOverDisplay(loc); + } + + /** Returns the Location in the grid corresponding to the location + * of the mouse event. + **/ + public Location getMouseLocation(MouseEvent evt) + { + return getDisplay().locationForPoint(evt.getPoint()); + } + } + + + // Nested class for handling exceptions + + /** Nested class that is registered as the handler for exceptions + * on the Swing event thread. The handler will put up an alert panel, + * dump the stack trace to the console, and then exit entire program + * rather than persist in an inconsistent state, which would be + * the default behavior. + **/ + public static class GUIExceptionHandler + { + public void handle(Throwable e) + { + e.printStackTrace(); + JOptionPane.showMessageDialog(null, + "An error occurred. The application must exit." + "\nReason: " + e, + "Error", JOptionPane.ERROR_MESSAGE); + System.exit(0); + } + } + +} + + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.class new file mode 100644 index 0000000..5c011b2 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.java new file mode 100644 index 0000000..cfccc55 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChangeListener.java @@ -0,0 +1,35 @@ +// Class: GridChangeListener +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; + +/** + * Grid GUI Support Package:
      + * + * The GridChangeListener interface specifies the + * method used to notify GridChangeListener objects + * of changes to the grid. + * + * @author Alyce Brady + * @version 27 March 2004 + **/ +public interface GridChangeListener +{ + /** Reacts to a change in grids being used. + * @param newGrid the new grid being used + **/ + public void reactToNewGrid(Grid newGrid); +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox$GridChoice.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox$GridChoice.class new file mode 100644 index 0000000..3964eb7 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox$GridChoice.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.class new file mode 100644 index 0000000..9f5e2fa Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.java new file mode 100644 index 0000000..c3b80dc --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridChoiceComboBox.java @@ -0,0 +1,113 @@ +// Class GridChoiceComboBox +// +// Author: Alyce Brady +// +// This class is based on the College Board's CreateEnvDialog class, +// as allowed by the GNU General Public License. CreateEnvDialog +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.ArrayListGrid; + +import javax.swing.JComboBox; +import java.util.Iterator; +import java.util.Set; + +/** + * Grid GUI Support Package:
      + * + * A GridChoiceComboBox is a dialog that allows the user to + * choose the type of grid to be created and, if appropriate, its + * dimensions. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 15 December 2003 + **/ +public class GridChoiceComboBox extends JComboBox +{ + private GridChoice gridChoice; + + /** Adds bounded grid classes to the combo box. If the + * GridPkgFactory has a list of bounded grid, that list is + * used. Otherwise, only the BoundedGrid class is added. + **/ + public void addBoundedGrids() + { + Set boundedGridClasses = GridPkgFactory.boundedGridClasses(); + if ( boundedGridClasses.isEmpty() ) + addItem(new GridChoice(BoundedGrid.class, true)); + else + { + Iterator iter = boundedGridClasses.iterator(); + while (iter.hasNext()) + addItem(new GridChoice((Class)iter.next(), true)); + } + } + + /** Adds unbounded grid classes to the combo box. If the + * GridPkgFactory has a list of unbounded grids, that list is + * used. Otherwise, only the UnboundedArrayListGrid class is added. + **/ + public void addUnboundedGrids() + { + Set unboundedGridClasses = GridPkgFactory.unboundedGridClasses(); + if ( unboundedGridClasses.isEmpty() ) + addItem(new GridChoice(ArrayListGrid.Unbounded.class, false)); + else + { + Iterator iter = unboundedGridClasses.iterator(); + while (iter.hasNext()) + addItem(new GridChoice((Class)iter.next(), false)); + } + } + + /** Returns the class associated with the selected item in the + * combo box. + **/ + public Class getSelectedClass() + { + return ((GridChoice)getSelectedItem()).gridClass(); + } + + /** Returns true if the class associated with the + * selected item in the combo box is a bounded grid and + * false if it is an unbounded grid. + **/ + public boolean selectedClassIsBounded() + { + return ((GridChoice)getSelectedItem()).isBounded(); + } + + + /** Nested class used to hold the per-item information + * for the entries in a combo box of grid + * choices. Each item represents a grid + * class and tracks whether this is a bounded or unbounded type. + */ + static class GridChoice + { + private Class cls; + private boolean isBounded; + + public GridChoice(Class cl, boolean isB) { cls = cl; isBounded = isB; } + public boolean isBounded() { return isBounded; } + public Class gridClass() { return cls; } + public String toString() { return cls.getName(); } + } + +} + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$1.class new file mode 100644 index 0000000..b509d0c Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$2.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$2.class new file mode 100644 index 0000000..4b90a03 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$2.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$3.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$3.class new file mode 100644 index 0000000..ac04a20 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog$3.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.class new file mode 100644 index 0000000..b3e89ae Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.java new file mode 100644 index 0000000..fc5c749 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridCreationDialog.java @@ -0,0 +1,261 @@ +// Class GridCreationDialog +// +// Author: Alyce Brady +// +// This class is based on the College Board's CreateEnvDialog class, +// as allowed by the GNU General Public License. CreateEnvDialog +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.Grid; + +import java.awt.Component; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import javax.swing.BorderFactory; +import javax.swing.BoxLayout; +import javax.swing.JButton; +import javax.swing.JDialog; +import javax.swing.JFrame; +import javax.swing.JLabel; +import javax.swing.JOptionPane; +import javax.swing.JPanel; +import javax.swing.JTextField; + +/** + * Grid GUI Support Package:
      + * + * A GridCreationDialog is a dialog that allows the user + * to construct a new grid, choosing its type (bounded or unbounded) + * and, if appropriate, its dimensions. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 15 December 2003 + **/ +public class GridCreationDialog +{ + private boolean promptForGridChoice; + private JDialog dialog; + private GridChoiceComboBox gridChooser; + private JPanel dimPanel; + private JLabel rowLabel, colLabel; + private JTextField rowField, colField; + private int numRows, numCols; + private JButton[] optButtons; + private boolean userClickedOK; + + // factory methods + + /** Creates a dialog that creates a BoundedGrid object + * after prompting the user for its dimensions. + * @param parent parent frame for the dialog + * @return a dialog that will prompt for bounded grid + * dimensions and then create the grid + **/ + public static GridCreationDialog makeDimensionsDialog(JFrame parent) + { + GridCreationDialog d = new GridCreationDialog(parent, false); + return d; + } + + /** Creates a dialog that allows the user to choose the type of + * grid to create and, if appropriate, its dimensions. The + * set of grid classes available to choose from depends on + * whether the application has registered grid classes with + * the GridPkgFactory. If any bounded grid classes + * have been registered with the GridPkgFactory, then + * the dialog will include them in the set of options. Otherwise, + * it will include BoundedGrid as its only bounded + * grid. Similarly, if any unbounded grid classes have been + * registered with the GridPkgFactory, then the dialog + * will include them in the set of options. Otherwise, it will + * include UnboundedArrayListGrid as its only unbounded + * grid. BoundedGrid and UnboundedArrayListGrid + * must explicitly be registered with the GridPkgFactory to + * appear along with other options from the factory. + * @param parent parent frame for the dialog + * @return a dialog that prompts for an Grid representation + **/ + public static GridCreationDialog makeGridChoiceDialog(JFrame parent) + { + GridCreationDialog d = new GridCreationDialog(parent, true); + return d; + } + + // constructor + + /** Creates a dialog that allows the user to choose the type of + * grid to create and/or its dimensions. + * @param parent parent frame for the dialog + * @param promptForGridChoice true if dialog should + * prompt for choice of grid representation; + * false if it should always create + * a BoundedGrid grid + **/ + protected GridCreationDialog(JFrame parent, boolean promptForGridChoice) + { + this.promptForGridChoice = promptForGridChoice; + dialog = new JDialog(parent, "Create new grid", true); + + JPanel myControls = new JPanel(); + myControls.setLayout(new BoxLayout(myControls, BoxLayout.Y_AXIS)); + + // Add grid choice drop-down menu, if appropriate. + if ( promptForGridChoice ) + makeGridChoiceMenu(myControls); + + // Make dimensions choice panel. + makeDimensionsFields(myControls); + + // Add Create/Cancel buttons. + JOptionPane optPane = new JOptionPane(myControls, JOptionPane.QUESTION_MESSAGE); + optButtons = new JButton[] { new JButton("Create"), new JButton("Cancel")}; + optPane.setOptions(optButtons); + optPane.setInitialValue(optButtons[0]); + optButtons[0].addActionListener( new ActionListener() { + public void actionPerformed(ActionEvent e) { okClicked(); }}); + optButtons[1].addActionListener( new ActionListener() { + public void actionPerformed(ActionEvent e) { cancelClicked(); }}); + + dialog.setContentPane(optPane); + dialog.pack(); + dialog.setResizable(false); + } + + /** Creates a drop-down menu for choosing a grid. + * @param panel panel to which to add the drop-down menu + **/ + private void makeGridChoiceMenu(JPanel panel) + { + panel.setBorder(BorderFactory.createEmptyBorder(5, 0, 10, 0)); + JLabel lab = new JLabel("Choose grid type: "); + panel.add(lab); + lab.setAlignmentX(Component.CENTER_ALIGNMENT); + + // add all bounded/unbounded grid classes to the combo box + gridChooser = new GridChoiceComboBox(); + gridChooser.addBoundedGrids(); + gridChooser.addUnboundedGrids(); + gridChooser.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent evt) { gridChosen(); }}); + panel.add(gridChooser); + } + + /** callback when user selects new grid class choice from combo box */ + private void gridChosen() + { + // only show the num rows/cols field for bounded grids + dimPanel.setVisible(gridChooser.selectedClassIsBounded()); + optButtons[0].requestFocus(); + } + + /** Creates a panel to prompt for bounded grid dimensions. + * @param panel panel to which to add the drop-down menu + **/ + private void makeDimensionsFields(JPanel panel) + { + dimPanel = new JPanel(); + dimPanel.setLayout(new BoxLayout(dimPanel, BoxLayout.X_AXIS)); + dimPanel.add(rowLabel = new JLabel("rows: ")); + dimPanel.add(rowField = new JTextField("10")); + dimPanel.add(colLabel = new JLabel(" cols: ")); + dimPanel.add(colField = new JTextField("10")); + panel.add(dimPanel); + } + + /** callback when user clicks cancel button */ + private void cancelClicked() + { + userClickedOK = false; + dialog.setVisible(false); + } + + /** callback when user clicks ok button */ + private void okClicked() + { + userClickedOK = true; + try + { + // If creating a bounded grid, get grid dimensions + if ( ! promptForGridChoice || gridChooser.selectedClassIsBounded() ) + { + rowField.requestFocus(); + numRows = Integer.parseInt(rowField.getText().trim()); + colField.requestFocus(); + numCols = Integer.parseInt(colField.getText().trim()); + if (numRows <= 0 || numCols <= 0) throw new NumberFormatException(); + } + dialog.setVisible(false); + } + catch (NumberFormatException ex) + { + JOptionPane.showMessageDialog(dialog, + "Grid dimensions must be positive integers!", + "Error creating grid", JOptionPane.ERROR_MESSAGE); + // we don't dismiss the dialog in this case, leave up for another try + } + } + + /** Shows the modal dialog that allows the user to create a new + * grid. If the dialog is dismissed by clicking the "OK" + * button, a new grid is created to the user's specification + * and returned. If "Cancel" is chosen or there is an error + * constructing the grid, null is returned. + * @return the newly created grid or null + **/ + public Grid showDialog() + { + userClickedOK = false; + + // Show the dialog box; will block until setVisible(false), see ok/cancel methods/ + // Dialog box is shown in middle of parent frame. + rowField.requestFocus(); + Component parent = dialog.getParent(); + dialog.setLocation(parent.getX() + parent.getWidth()/2 - dialog.getSize().width/2, + parent.getY() + parent.getHeight()/2 - dialog.getSize().height/2); + dialog.show(); // Modal dialog will block until user clicks ok/cancel + + // User selected grid and/or dimensions, so create grid. + if ( ! userClickedOK ) // if user cancelled or closed dialog + return null; // return null + try + { + if ( promptForGridChoice ) + { + Class selectedClass = gridChooser.getSelectedClass(); + if ( gridChooser.selectedClassIsBounded() ) + return GridPkgFactory.constructGrid(selectedClass, + numRows, numCols); + else + return GridPkgFactory.constructGrid(selectedClass); + } + else + return GridPkgFactory.constructGrid(BoundedGrid.class, + numRows, numCols); + } + catch (Exception ex) + { + JOptionPane.showMessageDialog(dialog.getParent(), + "Unable to create new grid.\n" + + "Reason: " + ex, "Error creating grid", + JOptionPane.ERROR_MESSAGE); + return null; + } + } + +} + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.class new file mode 100644 index 0000000..700d3d8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.java new file mode 100644 index 0000000..d86268c --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridDataFileHandler.java @@ -0,0 +1,50 @@ +// Class GridDataFileHandler +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; + +import java.io.File; + +/** + * Grid GUI Support Package:
      + * + * The GridDataFileHandler interface specifies methods for + * reading grid information from a file and writing it to a file. + * + * @author Alyce Brady + * @version 15 December 2003 + **/ +public interface GridDataFileHandler +{ + /** Reads information about a grid from an initial configuration + * data file and creates the grid. + * @param file java.io.File object from which to read + * @return the newly created grid + * @throws java.io.FileNotFoundException if file cannot be opened + * @throws RuntimeException if invalid information is read from file + **/ + Grid readGrid(File file) + throws java.io.FileNotFoundException; + + /** Writes information about a grid into a data file. + * @param grid grid to write to file + * @param file java.io.File object to which to write + * @throws java.io.IOException if error writing to file + **/ + void writeGrid(Grid grid, File file) + throws java.io.IOException; + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$1.class new file mode 100644 index 0000000..b6ee8c8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$2.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$2.class new file mode 100644 index 0000000..c24b5f8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$2.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectChoice.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectChoice.class new file mode 100644 index 0000000..3555ff1 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectChoice.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectIcon.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectIcon.class new file mode 100644 index 0000000..774c5f0 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor$GridObjectIcon.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.class new file mode 100644 index 0000000..9c55f42 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.java new file mode 100644 index 0000000..3369f07 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridEditor.java @@ -0,0 +1,387 @@ +// Class: GridEditor +// +// Author: Alyce Brady +// +// This class is based on the College Board's EnvironmentController +// and FishToolbar classes, as allowed by the GNU General Public License. +// EnvironmentController and FishToolbar are black-box GUI classes +// within the AP(r) CS Marine Biology Simulation case study +// (see http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.GridObject; +import edu.kzoo.grid.Location; + +import edu.kzoo.grid.display.DisplayMap; +import edu.kzoo.grid.display.GridObjectDisplay; +import edu.kzoo.grid.display.ScrollableGridDisplay; +import edu.kzoo.grid.display.TextAndIconRenderer; + +import java.awt.BorderLayout; +import java.awt.Color; +import java.awt.Component; +import java.awt.Dimension; +import java.awt.Graphics; +import java.awt.Graphics2D; +import java.awt.Rectangle; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import java.awt.geom.AffineTransform; +import javax.swing.BorderFactory; +import javax.swing.Box; +import javax.swing.Icon; +import javax.swing.JButton; +import javax.swing.JComboBox; +import javax.swing.JLabel; +import javax.swing.JOptionPane; +import javax.swing.JPanel; +import javax.swing.JToolBar; +import javax.swing.JViewport; +import javax.swing.SwingConstants; +import java.util.Iterator; + +/** + * Grid GUI Support Package:
      + * + * The GridEditor class provides a window in which + * to edit a grid. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 29 February 2004 + **/ +public class GridEditor extends GridAppFrame +{ + protected GridAppFrame parentFrame = null; + protected JButton doneButton; + protected JComboBox objComboBox; + + + // constructors and initialization methods + + /** Constructs an empty GridEditor window to edit the grid in the + * specified frame. + * Use the constructWindowContents method to set the properties of the + * window and make it visible. + * @param grid the grid to edit + * @param frame the frame that invoked this grid editor + **/ + public GridEditor(GridAppFrame frame) + { + parentFrame = frame; + } + + /** Constructs the display for a GridEditor using values from the parent + * frame. + **/ + public void constructWindowContents() + { + String title = parentFrame.getTitle() + ": Grid Editor"; + ScrollableGridDisplay parentDisplay = parentFrame.getDisplay(); + JViewport vp = parentFrame.getDisplay().getEnclosingViewport(); + Dimension windowSize = (vp != null) ? vp.getSize() : getSize(); + constructWindowContents(title, parentDisplay.backgroundColor(), + windowSize.width, windowSize.height, + parentDisplay.minimumCellSize()); + } + + /** Constructs the display for a GridEditor. + * @param title frame title + * @param backgroundColor color to paint background of grid + * @param viewingWidth the width of the viewing area + * @param viewingHeight the height of the viewing area + * @param minCellSize minimum grid cell side length + **/ + public void constructWindowContents(String title, Color bgColor, + int viewingWidth, int viewingHeight, int minCellSize) + { + super.constructWindowContents(title, bgColor, viewingWidth, viewingHeight, minCellSize); + + // change the location and default close operation of the new window + setLocation(parentFrame.getX() + 40, parentFrame.getY() + 40); + setDefaultCloseOperation(DISPOSE_ON_CLOSE); + + setGrid(parentFrame.getGrid()); + showGrid(); + } + + + // methods that deal with defining the main panel contents + + /** Defines contents of main window panel. Should be redefined in + * subclasses that require panels other than (or in addition to) + * an editing palette, a display, and a Done button. + * @return the panel that will serve as the window's content panel + **/ + protected JPanel defineContent() + { + // Create a panel for the editing palette. + JPanel content = new JPanel(); + content.add(makeEditingPalette(), BorderLayout.WEST); + + // Create a sub-panel for the grid display and Done button. + JPanel p = new JPanel(); + p.setLayout(new BorderLayout()); + p.setBorder(BorderFactory.createTitledBorder("Click to Add Object")); + p.add(makeDisplayPanel(), BorderLayout.NORTH); + + doneButton = new JButton("Done"); + doneButton.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { done(); }}); + p.add(doneButton, BorderLayout.SOUTH); + content.add(p, BorderLayout.EAST); + return content; + } + + + // methods and nested classes for building editing palette + + /** Creates the editing palette. + **/ + protected Component makeEditingPalette() + { + JToolBar tb = new JToolBar(SwingConstants.VERTICAL); + tb.setFloatable(false); + tb.setBorder(BorderFactory.createCompoundBorder( + BorderFactory.createTitledBorder("Choose attribute"), + BorderFactory.createEmptyBorder(4, 4, 4, 4))); + + fillPalette(tb); + + tb.add(Box.createGlue()); + return tb; + } + + /** Puts tools for choosing grid object attributes in + * the editing palette, in particular a Type tool for choosing + * the type of grid object. Subclasses can redefine this + * method to put other types of components, such as a color + * choice combo box, in the palette. + **/ + protected void fillPalette(JToolBar palette) + { + palette.add(new JLabel(" Type: ")); + palette.add(makeTypeChoiceComponent()); + + // Subclasses could redefine to add color choice, as below. + // palette.addSeparator(); + // palette.add(new JLabel(" Color: ")); + // palette.add(new ColorChoiceDDMenu(ColorChoiceDDMenu.WHITE)); + } + + /** Makes the grid object type choice combo box. + **/ + protected Component makeTypeChoiceComponent() + { + objComboBox = new JComboBox(); + addChoicesFromFactory(objComboBox); + objComboBox.setRenderer(new TextAndIconRenderer(objComboBox)); + objComboBox.setAlignmentX(LEFT_ALIGNMENT); + objComboBox.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { chooseGridObjType(); }}); + return objComboBox; + } + + /** Builds up the list of grid object type choices for the editing + * palette. + **/ + protected void addChoicesFromFactory(JComboBox cb) + { + Iterator iter = GridPkgFactory.gridObjectClasses().iterator(); + while (iter.hasNext()) + { + GridObjectChoice choice = new GridObjectChoice((Class)iter.next()); + cb.addItem(choice); + } + } + + /** Nested class used to hold the per-item information for the + * entries in the combo box of grid object choices. + * Each item represents a choice which is a GridObject class. + * (Uses GridPkgFactory; override to use a different factory.) + */ + protected class GridObjectChoice extends JLabel + { + private Class cls; + + public GridObjectChoice(Class c) + { super(c.getName(), + new GridObjectIcon(c, 16, 16), SwingConstants.LEFT); + cls = c; + } + + public Class getObjectClass() { return cls; } + public String toString() { return cls.getName(); } + } + + /** Nested class used to draw the icons used for + * GridObject entries in the grid object combo box. + * We construct a GridObject object and then hand it off to + * its display object to draw. + */ + protected class GridObjectIcon implements Icon + { + private GridObject gridObj; + private Class cls; + private Color color = Color.gray; // default color + private int width, height; + + public GridObjectIcon(Class cl, int w, int h) + { cls = cl; width = w; height = h; } + + public GridObjectIcon(Class cl, Color c, int w, int h) + { cls = cl; color = c; width = w; height = h; } + + public int getIconWidth() { return width; } + public int getIconHeight() { return height; } + public void paintIcon(Component comp, Graphics g, int x, int y) + { + if ( gridObj == null ) + { + Grid grid = new BoundedGrid(1, 1); + Location loc = new Location(0, 0); + makeObject(cls, grid, loc, color); + gridObj = grid.objectAt(loc); + } + Graphics2D g2 = (Graphics2D)g; + AffineTransform savedTransform = g2.getTransform(); // save current + GridObjectDisplay displayObj = DisplayMap.findDisplayFor(gridObj); + displayObj.draw(gridObj, comp, g2, new Rectangle(x, y, + getIconWidth(), getIconHeight())); + g2.setTransform(savedTransform); // restore coordinate system + } + } + + + // methods for handling user events + + /** Follows up when the user picks a new choice from the + * grid object combo box (specified listener action). + **/ + protected void chooseGridObjType() + { + // Could do something like enabling the color menu iff the + // chosen class has a constructor that takes a color. + } + + /** Handles a mouse press over the grid display, editing the + * contents of the grid at the specified location. If the + * location is empty, a new object of the currently specified + * grid object class will be added. If the location is not + * empty, the object at the location will be removed. + * @see #currentGridObjectClass() + **/ + protected void onMousePressOverDisplay(Location loc) + { + if ( loc != null ) + { + GridObject obj = getGrid().objectAt(loc); + Class selectedClass = currentGridObjectClass(); + + // If there's an object there, remove it. Otherwise, + // add one. + if (obj == null ) + { + makeObject(selectedClass, getGrid(), loc); + } + else + { + getGrid().remove(obj); + } + getDisplay().repaint(); + } + } + + /** Returns the currently selected grid object class. + **/ + protected Class currentGridObjectClass() + { + return ((GridObjectChoice)objComboBox.getSelectedItem()).getObjectClass(); + } + + /** Constructs the specified type of object. In subclasses that use + * the color combo box, this method could be redefined to call the + * four-parameter makeObject method, passing it the + * current color from the combo box. + * @param cls the type of object to create + * @param grid the grid in which to create the object + * @param loc the location at which to create the object + **/ + protected void makeObject(Class cls, Grid grid, Location loc) + { + try + { GridPkgFactory.constructGridObject(cls, grid, loc); } + catch (Exception e) + { reportConstructionError(cls, e, "Grid and Location"); } + } + + /** Constructs the specified type of object. + * @param cls the type of object to create + * @param grid the grid in which to create the object + * @param loc the location at which to create the object + * @param color the color of the new object (some objects may + * ignore this) + **/ + protected void makeObject(Class cls, Grid grid, Location loc, + Color color) + { + try + { + Class[] paramTypes = {Grid.class, Location.class, + Color.class}; + Object[] params = {grid, loc, color}; + GridPkgFactory.constructObject(cls, paramTypes, params); + } + catch (Exception e) + { + try + { GridPkgFactory.constructGridObject(cls, grid, loc); } + catch (Exception e2) + { reportConstructionError(cls, e2, + "Grid and Location, with or without Color"); } + } + } + + /** Reports an error from attempting to construct an object. + * @param cls the class of the failed object + * @param e the exception thrown by the attempt + * @param string string describing parameter types used in attempt + **/ + protected void reportConstructionError(Class cls, Exception e, + String string) + { + JOptionPane.showMessageDialog(parentFrame, "Cannot construct " + + cls.getName() + + " with " + string + " parameters.\n" + + "Reason: " + e, + "Error constructing grid object", + JOptionPane.ERROR_MESSAGE); + } + + /** Leaves the editor, returning to the parent frame. + **/ + protected void done() + { + // Although the parent already has a reference to the grid + // being edited, set it anyway so that it updates other aspects + // of the gui such as buttons that need to be enabled, etc. + parentFrame.setGrid(getGrid()); + parentFrame.repaint(); + dispose(); + } + +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser$1.class new file mode 100644 index 0000000..e1cbd78 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.class new file mode 100644 index 0000000..fbcb86a Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.java new file mode 100644 index 0000000..34961de --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridFileChooser.java @@ -0,0 +1,206 @@ +// Class GridFileChooser +// +// Author: Alyce Brady +// +// This class is based on the College Board's EnvFileChooser class, as +// allowed by the GNU General Public License. The MBS EnvFileChooser class +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.ArrayListGrid; + +import java.awt.Component; + +import javax.swing.Box; +import javax.swing.BoxLayout; +import javax.swing.BorderFactory; +import javax.swing.filechooser.FileFilter; +import javax.swing.JFileChooser; +import javax.swing.JLabel; +import javax.swing.JOptionPane; +import javax.swing.JPanel; + +import java.io.File; + +import java.util.Set; + +/** + * Grid GUI Support Package:
      + * + * A GridFileChooser is a JFileChooser + * subclass that adds + * some specialized behavior for opening and saving grid + * data files. The additional features allow for filtering to + * just ".dat" files, an alert that confirms before overwriting + * an existing file, and an accessory panel on the open dialog + * for choosing which bounded/unbounded class to use for + * the new grid. + * + *

      + * This class is a slightly modified version of the College Board's + * Marine Biology Simulation EnvFileChooser class + * (see http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). + * Like the MBS + * version, this version looks in the GridPkgFactory + * for lists of the available bounded and unbounded representations. + * This version, however, does not require applications to use + * GridPkgFactory if the only grid representations + * available are BoundedGrid and + * UnboundedArrayListGrid. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 15 December 2003 + **/ + +public class GridFileChooser extends JFileChooser +{ + protected static final String DATA_FILE_EXT = ".dat"; + protected JPanel openAccessory; + protected GridChoiceComboBox boundedChooser, unboundedChooser; + protected Class defaultBounded, defaultUnbounded; + + + /** Creates a new GridFileChooser. The default starting directory will be the "DataFiles" + * subdirectory on the current working directory. + **/ + public GridFileChooser() + { + super(new File(System.getProperty("user.dir") + File.separator + "DataFiles")); + setFileFilter(new FileFilter() { + public boolean accept(File f) { + return (f.getName().toLowerCase().endsWith(DATA_FILE_EXT) || f.isDirectory()); + } + public String getDescription() { + return("Grid data files (*" + DATA_FILE_EXT + ")"); + }}); + setFileSelectionMode(JFileChooser.FILES_ONLY); + makeOpenAccessory(); + } + + /** Builds the open accessory with combo boxes for choosing the bounded + * and unbounded grid classes. + **/ + protected void makeOpenAccessory() + { + openAccessory = new JPanel(); + openAccessory.setLayout(new BoxLayout(openAccessory, BoxLayout.Y_AXIS)); + openAccessory.setBorder(BorderFactory.createEmptyBorder(20, 5, 5, 0)); + + // Get the list of possible bounded grids. If factory doesn't + // have any, use BoundedGrid. If factory has just one, use it. Otherwise, + // build a combo box for user to choose a grid representations. + Set set = GridPkgFactory.boundedGridClasses(); + if (set.size() == 0) + defaultBounded = BoundedGrid.class; + else if (set.size() == 1) + defaultBounded = (Class)set.iterator().next(); + else if (set.size() > 1) + { + openAccessory.add(new JLabel("Class to use if bounded:")); + boundedChooser = new GridChoiceComboBox(); + boundedChooser.addBoundedGrids(); + boundedChooser.setAlignmentX(Component.LEFT_ALIGNMENT); + openAccessory.add(boundedChooser); + openAccessory.add(Box.createRigidArea(new java.awt.Dimension(5, 5))); + } + + // Do the same thing for unbounded grids. + set = GridPkgFactory.unboundedGridClasses(); + if (set.size() == 0) + defaultUnbounded = ArrayListGrid.Unbounded.class; + else if (set.size() == 1) + defaultUnbounded = (Class)set.iterator().next(); + else if (set.size() > 1) + { + openAccessory.add(new JLabel("Class to use if unbounded:")); + unboundedChooser = new GridChoiceComboBox(); + unboundedChooser.addUnboundedGrids(); + unboundedChooser.setAlignmentX(Component.LEFT_ALIGNMENT); + openAccessory.add(unboundedChooser); + } + } + + /** Brings up a modal file chooser dialog allowing the user to choose + * the grid file. + * @param parent the parent of the dialog + * @return the return state of the dialog once finished + **/ + public int showOpenDialog(Component parent) + { + setDialogTitle("Open grid file"); + setAccessory(openAccessory); + rescanCurrentDirectory(); + return super.showOpenDialog(parent); + } + + /** Returns the bounded grid class selected on the open accessory. + * @return the selected bounded grid class + **/ + public Class boundedClass() + { + if (boundedChooser == null) + return defaultBounded; + else + return boundedChooser.getSelectedClass(); + } + + /** Returns the unbounded grid class selected on the open accessory. + * @return the selected grid class + */ + public Class unboundedClass() + { + if (unboundedChooser == null) + return defaultUnbounded; + else + return unboundedChooser.getSelectedClass(); + } + + /** Brings up a modal file chooser dialog allowing the user to save + * to a grid file. + * @param parent the parent of the dialog + * @return the return state of the dialog once finished + **/ + public int showSaveDialog(Component parent) + { + setDialogTitle("Save grid file"); + setAccessory(null); + rescanCurrentDirectory(); + return super.showSaveDialog(parent); + } + + /** Called when the user hits the approve button (Save/Open) to + * confirm the selected file is acceptable. Overrides the + * JFileChooser to confirm overwrite if choosing a file + * that already exists for a save action. + **/ + public void approveSelection() + { + if (getDialogType() == SAVE_DIALOG) + { + File file = getSelectedFile(); + if (!file.getName().endsWith(DATA_FILE_EXT)) // add extension if missing + setSelectedFile(file = new File(file.getAbsolutePath() + DATA_FILE_EXT)); + if (file.exists() + && JOptionPane.showConfirmDialog(this,"File " + file.getName() + + " exists. Overwrite?", "Confirm overwrite", + JOptionPane.OK_CANCEL_OPTION) != JOptionPane.OK_OPTION) + return; + } + super.approveSelection(); //if we get here, this will dismiss the dialog + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory$1.class new file mode 100644 index 0000000..adb89ec Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.class new file mode 100644 index 0000000..c680027 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.java new file mode 100644 index 0000000..fbcd2e0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/GridPkgFactory.java @@ -0,0 +1,356 @@ +// Class: GridPkgFactory +// +// Author: Alyce Brady +// +// This class is based on the College Board's MBSFactory class, as +// allowed by the GNU General Public License. MBSFactory is a +// black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Direction; +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.GridObject; +import edu.kzoo.grid.Location; + +import java.lang.reflect.Constructor; +import java.awt.Color; +import java.util.Set; +import java.util.TreeSet; +import java.util.Comparator; + +/** + * Grid GUI Support Package:
      + * + * The GridPkgFactory class provides a set of static methods + * for constructing grids and the objects they contain, and for keeping + * track of what types of grids or grid objects are available to a + * specific application. + * + *

      + * The GridPkgFactory class is based on the + * College Board's MBSFactory class, + * as allowed by the GNU General Public License. + * + * @author Julie Zelenski (author of MBSFactory) + * @version 1 August 2002 + **/ +public class GridPkgFactory +{ + // Static (class) variables maintained by the factory hold the sets + // of known grid object, BoundedGrid, and UnboundedArrayListGrid classes. + // The comparator used for the TreeSets will keep the sets sorted by + // class name. + private static Comparator classCmp = new Comparator() { + public int compare(Object o1, Object o2) { + return o1.toString().compareTo(o2.toString()); + }}; + private static Set gridObjectClasses = new TreeSet(classCmp); + private static Set boundedGridClasses = new TreeSet(classCmp); + private static Set unboundedGridClasses = new TreeSet(classCmp); + + // Class constants that define the parameter types for common Grid constructors + private static final Class[] TWO_ARG_TYPES = {Grid.class, Location.class}; + private static final Class[] THREE_ARG_TYPES = {Grid.class, Location.class, Direction.class}; + private static final Class[] FOUR_ARG_TYPES = {Grid.class, Location.class, Direction.class, Color.class}; + private static final Class[] BOUNDED_ARGS = {int.class, int.class}; + private static final Class[] UNBOUNDED_ARGS = null; + + + /** Creates an object of the given class. + * @param cls class of new object + * @param parameterTypes parameter types expected by constructor + * for class + * @param parameters actual parameters to pass to constructor + * @return the newly created object + * @throws RuntimeException if an object of the specified class cannot + * be constructed with the specified + * parameters + **/ + public static Object constructObject(Class cls, Class[] parameterTypes, + Object[] parameters) + { + Object newObject = null; // the new object + + try + { + // Construct an instance via class constructor. + if ( parameterTypes == null || parameters == null ) + { + // if no parameters; use default constructor + newObject = cls.newInstance(); + } + else + { + // use the constructor that matches the parameterTypes + Constructor objCons = cls.getConstructor(parameterTypes); + newObject = objCons.newInstance(parameters); + } + return newObject; + } + catch (Exception e) + { + throw new RuntimeException("Cannot construct " + cls.getName() + + " object due to " + e); + } + } + + + /** Creates an instance of the given grid object class using a + * two-argument constructor that takes a grid and a location. + * @param cls class of new grid object + * @param grid grid in which this object will act + * @param loc location the object will occupy + * @return the newly created grid object + * @throws MBSException if an object of the specified class cannot be + * constructed with the specified parameters + **/ + public static Object constructGridObject(Class cls, Grid grid, + Location loc) + { + Object[] parameters = {grid, loc}; + return constructObject(cls, TWO_ARG_TYPES, parameters); + } + + /** Creates an instance of the given grid object class using a + * three-argument constructor that takes a grid, a location, + * and a direction. + * @param cls class of new grid object + * @param grid grid in which this object will act + * @param loc location the object will occupy + * @param dir direction the object will face + * @return the newly created grid object + * @throws MBSException if an object of the specified class cannot be + * constructed with the specified parameters + **/ + public static Object constructGridObject(Class cls, Grid grid, + Location loc, Direction dir) + { + Object[] parameters = {grid, loc, dir}; + return constructObject(cls, THREE_ARG_TYPES, parameters); + } + + /** Creates an instance of the given grid object class using a + * four-argument constructor that takes a grid, a location, + * a direction, and a color. + * @param cls class of new grid object + * @param grid grid in which this object will act + * @param loc location the object will occupy + * @param dir direction the object will face + * @param color color of the object + * @return the newly created grid object + * @throws MBSException if an object of the specified class cannot be + * constructed with the specified parameters + **/ + public static Object constructGridObject(Class cls, Grid grid, + Location loc, Direction dir, + Color color) + { + Object[] parameters = {grid, loc, dir, color}; + return constructObject(cls, FOUR_ARG_TYPES, parameters); + } + + /** Creates an instance of a Grid using the default constructor + * of the given class. Used to create unbounded grids; no + * dimensions are specified. + * @param cls class of new grid + * @return the newly created grid + * @throws MBSException if a grid of the specified class cannot be + * constructed + **/ + public static Grid constructGrid(Class cls) + { + return (Grid)constructObject(cls, UNBOUNDED_ARGS, null); + } + + /** Creates an instance of a Grid using the 2-argument constructor + * of the given class. Used to create bounded grids; + * dimensions must be specified. + * @param cls class of new grid + * @return the newly created grid + * @throws MBSException if an grid of the specified class cannot be + * constructed with the given number of rows and columns + **/ + public static Grid constructGrid(Class cls, int numRows, int numCols) + { + Object[] parameters = {new Integer(numRows), new Integer(numCols)}; + return (Grid)constructObject(cls, BOUNDED_ARGS, parameters); + } + + + /** Returns the set of grid object classes known to the factory. + * Classes are added to the factory via the + * addGridObjClassNames method. + * @return the set of grid object classes + **/ + public static Set gridObjectClasses() + { + return gridObjectClasses; + } + + /** Returns the set of bounded grid classes known to the factory. + * Classes are added to the factory via the addBoundedClassNames method. + * @return the set of bounded grid classes + **/ + public static Set boundedGridClasses() + { + return boundedGridClasses; + } + + /** Returns the set of unbounded grid classes known to the factory. + * Classes are added to the factory via the addUnboundedClassNames method. + * @return the set of unbounded grid classes + **/ + public static Set unboundedGridClasses() + { + return unboundedGridClasses; + } + + /** Helper to add new classes to the factory. Classes are specified by + * string name. For each name, error-checking is done to ensure the name + * class exists, is accessible, and has the proper constructor. If all checks + * out, the class is added to the appropriate set maintained by the factory. + * On errors, a message is printed and the class is skipped. + * @param classNames an array of class names + * @param whichCategory descriptive name for category + * (e.g., "bounded grid") + **/ + protected static void addClassesToFactory(String[] classNames, + String whichCategory) + { + for (int i = 0; i < classNames.length; i++) + { + String errStart = "Discarding " + whichCategory + " choice \"" + + classNames[i] + "\" because "; + try + { + Class cls = Class.forName(classNames[i]); + if (whichCategory.equals("bounded grid")) + { + if (isValidGridClass(cls, BOUNDED_ARGS)) + boundedGridClasses.add(cls); + } + else if (whichCategory.equals("unbounded grid")) + { + if (isValidGridClass(cls, UNBOUNDED_ARGS)) + unboundedGridClasses.add(cls); + } + else + { + gridObjectClasses.add(cls); + } + } + catch (ClassNotFoundException e) + { + System.err.println(errStart + "no class found with that name."); + } + catch (ClassCastException e) + { + System.err.println(errStart + e.getMessage()); + } + catch (NoSuchMethodException e) + { + System.err.println(errStart + "it doesn't have the proper constructor."); + } + } + } + + + /** Adds grid object classes to the set maintained by the factory. + * If the named class cannot be found or the class is not a proper + * GridObject object, an error message is printed and the class is not + * added to the set. + * @param classNames an array of grid object class names + **/ + public static void addGridObjClassNames(String[] classNames) + { + addClassesToFactory(classNames, "grid object"); + } + + /** Adds bounded grid classes to the set maintained by the factory. + * If the named class cannot be found or the class is not a proper bounded + * grid, an error message is printed, and that class is not added to the set. + * @param classNames an array of bounded grid class names + **/ + public static void addBoundedGridClassNames(String[] classNames) + { + addClassesToFactory(classNames, "bounded grid"); + } + + + /** Adds unbounded grid classes to the set maintained by the factory. + * If the named class cannot be found or the class is not a proper unbounded + * grid, an error message is printed, and that class is not added to the set. + * @param classNames an array of unbounded grid class names + **/ + public static void addUnboundedGridClassNames(String[] classNames) + { + addClassesToFactory(classNames, "unbounded grid"); + } + + /** Verifies that a class has the required constructor and + * is properly assignable to Grid. This is used to vet + * grid classes given to the factory before + * adding them to the list of known classes. + **/ + public static boolean isValidGridClass(Class cls, + Class[] ctorParameters) + throws NoSuchMethodException + { + return hasCorrectCtor(cls, Grid.class, ctorParameters); + } + + /** Verifies that a class has the required constructor and + * is properly assignable to GridObject. This is used to vet + * grid object classes given to the factory before + * adding them to the list of known classes. + **/ + public static boolean isValidGridObjectClass(Class cls, + Class[] ctorParameters) + throws NoSuchMethodException + { + return hasCorrectCtor(cls, GridObject.class, ctorParameters); + } + + /** Verifies that a class has the required constructor and + * is properly assignable. This is used to vet classes + * given to the factory before adding them to the list of known classes. + **/ + protected static boolean hasCorrectCtor(Class cls, Class requiredCls, + Class[] ctorParameters) + throws NoSuchMethodException + { + if (!requiredCls.isAssignableFrom(cls)) + throw new ClassCastException("not compatible with " + requiredCls + "."); + Constructor ctor = cls.getConstructor(ctorParameters); + return true; + } + + + /** Reports wehther a given grid object class has an accessible + * four-arg constructor that takes Grid, Location, Direction, + * and Color. + **/ + public static boolean hasFourArgCtor(Class cls) + { + try + { + return isValidGridObjectClass(cls, FOUR_ARG_TYPES); + } + catch (NoSuchMethodException e) {} + return false; + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.class new file mode 100644 index 0000000..f5d1483 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.java new file mode 100644 index 0000000..5f46b27 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppController.java @@ -0,0 +1,78 @@ +// Class SteppedGridAppController +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; + +import java.lang.UnsupportedOperationException; + +/** + * Grid GUI Support Package:
      + * + * A SteppedGridAppController controls the running of a + * stepped grid application. + * + * @author Alyce Brady + * @version 29 February 2004 + **/ +public abstract class SteppedGridAppController +{ + private Grid grid = null; + + /** Gets the application's grid. + * @return the grid being controlled + **/ + public Grid getGrid() + { + return this.grid; + } + + /** Sets the application's grid. + * (Precondition: grid is not null.) + * @param grid the Grid to act on + **/ + public void setGrid(Grid grid) + { + this.grid = grid; + } + + /** Initializes or re-initializes the state of the grid application. + **/ + public void init() + { + throw new UnsupportedOperationException(); // default behavior + } + + /** Advances the application one step. + * (Note: there is no precondition on this method that getGrid() + * must return a non-null grid, so subclass implementations should + * handle the possibility of a null grid gracefully.) + **/ + public abstract void step(); + + /** Determines whether a running application has reached + * a desired stopping state. Examples include whether the + * mouse in a maze has found the cheese, whether the first + * (or last) competitor in a race has finished, or whether + * a chemical reaction has reached equilibrium. + * @return true if the application should + * stop + **/ + public boolean hasReachedStoppingState() + { + return false; // default behavior + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$1.class new file mode 100644 index 0000000..f185e0e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$2.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$2.class new file mode 100644 index 0000000..95f7daa Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$2.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$3.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$3.class new file mode 100644 index 0000000..014b54e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$3.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$4.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$4.class new file mode 100644 index 0000000..a34b538 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$4.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$5.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$5.class new file mode 100644 index 0000000..2b13a92 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$5.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$6.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$6.class new file mode 100644 index 0000000..380b39c Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$6.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$7.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$7.class new file mode 100644 index 0000000..cbed00d Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$7.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$8.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$8.class new file mode 100644 index 0000000..d05320b Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame$8.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.class new file mode 100644 index 0000000..47a85aa Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.java new file mode 100644 index 0000000..87871a0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/SteppedGridAppFrame.java @@ -0,0 +1,424 @@ +// Class SteppedGridAppFrame +// +// Author: Alyce Brady +// +// This class is based on the College Board's MBSGUIFrame class, +// as allowed by the GNU General Public License. MBSGUIFrame +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.Grid; + +import java.awt.Toolkit; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import javax.swing.JButton; +import javax.swing.JOptionPane; +import javax.swing.JPanel; +import javax.swing.JSlider; +import javax.swing.Timer; +import javax.swing.event.ChangeEvent; +import javax.swing.event.ChangeListener; + +/** + * Grid GUI Support Package:
      + * + * The SteppedGridAppFrame class provides a window in which + * to run and display a grid application controlled by the user via + * a combination of Step, NSteps, Run, and Stop buttons. Other options + * provided by the GridAppFrame superclass include a + * speed slider bar and a Start/Restart button. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 1 September 2004 + **/ +public class SteppedGridAppFrame extends GridAppFrame +{ + protected SteppedGridAppController appController; + protected Timer timer; + protected boolean displayAfterEachStep; + protected boolean runningNSteps; + protected int numStepsToRun, numStepsSoFar; + + + // constructors and methods that specify which components to include + // in the window + + /** Constructs an empty SteppedGridAppFrame window object that will + * display a grid controlled by a combination of Step, NSteps, Run, and + * Stop buttons. Use methods such as includeStepOnceButton, + * includeRunButton, and includeStopButton, as well as the + * includeSetUpButton and includeSpeedSlider methods from GridAppFrame, + * to include components on the frame. Then use the + * constructWindowContents method to set the properties of the window + * and make it visible. The displayAfterEachStep parameter specifies + * whether the user interface should display the contents of the grid + * after each individual step (once each time the Step button is pressed, + * repeatedly when the NSteps or Run buttons are pressed). + * (Precondition: control is not null.) + * @param control the object that controls the running of + * the grid application through step + * and/or run methods + * @param displayAfterEachStep true if the user interface + * should display the contents of the grid + * after each individual step; + * false otherwise + **/ + public SteppedGridAppFrame(SteppedGridAppController control, + boolean displayAfterEachStep) + { + appController = control; + this.displayAfterEachStep = displayAfterEachStep; + } + + /** Includes a set/initialize/reset button with the specified label. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param label the button label (examples: "Initialize", "Start", + * "Restart", "Reset") + * @param enableDisableIndicator indicates when the set/reset button + * should be enabled or disabled + * @param displayAfterSetReset true if grid should be displayed after + * set/reset is complete; false otherwise + **/ + public void includeSetResetButton(String label, + int enableDisableIndicator, + boolean displayAfterSetReset) + { + // Create the button and add to control panel. + JButton startButton = + new ThreadedControlButton(this, label, displayAfterSetReset) + { public void act() { initialize(); }}; + includeControlComponent(startButton, enableDisableIndicator); + } + + /** Includes a set/initialize/reset button with the specified label. + * The button starts out enabled (visible and usable) + * or disabled according to the initiallyEnabled parameter; + * it later switches to enabled or disabled under the conditions + * indicated by the enableDisableIndicator parameter. + * Note, though, that it will only switch if there is a state change + * that would normally cause it to switch. It will never switch, + * for example, if the enableDisableIndicator parameter + * is ALWAYS_ENABLED or ALWAYS_DISABLED, because there is no defined + * state change that would cause such components to switch. Thus, + * a component that is specified as ALWAYS_ENABLED but initially + * disabled will remain disabled throughout the application. + *

      This method will have no effect unless it is + * called before the constructWindowContents method. + * @param label the button label (examples: "Initialize", "Start", + * "Restart", "Reset") + * @param enableDisableIndicator indicates when the set/reset button + * should be enabled or disabled + * @param initiallyEnabled true if button should initially be enabled; + * false if button should initially be disabled + * @param displayAfterSetReset true if grid should be displayed after + * set/reset is complete; false otherwise + **/ + public void includeSetResetButton(String label, + int enableDisableIndicator, + boolean initiallyEnabled, + boolean displayAfterSetReset) + { + // Create the button and add to control panel. + JButton startButton = + new ThreadedControlButton(this, label, displayAfterSetReset) + { public void act() { initialize(); }}; + includeControlComponent(startButton, enableDisableIndicator); + startButton.setEnabled(initiallyEnabled); + } + + /** Includes the Step Once button in the control panel. + * This method will have no effect unless it is + * called before the constructWindowContents method. + **/ + public void includeStepOnceButton() + { + // Create the button and add to control panel. + JButton stepButton = + new ControlButton(this, "Step Once", displayAfterEachStep) + { public void act() { step(); } }; + includeControlComponent(stepButton, + EnabledDisabledStates.NEEDS_GRID_AND_APP_WAITING); + } + + /** Includes the Step N Times button in the control panel. + * This method will have no effect unless it is + * called before the constructWindowContents method. + **/ + public void includeStepNTimesButton() + { + // Create the button and add to control panel. + JButton nStepsButton = + new ControlButton(this, "Step N Times", false) + { public void act() { nSteps(); } }; + includeControlComponent(nStepsButton, + EnabledDisabledStates.NEEDS_GRID_AND_APP_WAITING); + } + + /** Includes the Run button in the control panel. + * This method will have no effect unless it is + * called before the constructWindowContents method. + **/ + public void includeRunButton() + { + // Create the button and add to control panel. + JButton runButton = + new ControlButton(this, "Run...", false) + { public void act() { run(); } }; + includeControlComponent(runButton, + EnabledDisabledStates.NEEDS_GRID_AND_APP_WAITING); + } + + /** Includes the Stop button in the control panel. + * This method will have no effect unless it is + * called before the constructWindowContents method. + * @param displayAfterStopping true if grid should be displayed after + * stop is complete; false otherwise + **/ + public void includeStopButton(boolean displayAfterStopping) + { + // Create the button and add to control panel. + JButton stopButton = + new ControlButton(this, "Stop", displayAfterStopping) + { public void act() { stop(); } }; + includeControlComponent(stopButton, + EnabledDisabledStates.NEEDS_APP_RUNNING); + } + + + // methods that access this object's state + + /** Returns the controller used to drive the application. **/ + public SteppedGridAppController getController() + { + return appController; + } + + /** Specifies whether or not to display the contents of the grid + * after each step. + * @param whetherToDisplay true if the application + * should redisplay after each step; + * false otherwise + **/ + public void showDisplayAfterEachStep(boolean whetherToDisplay) + { + displayAfterEachStep = whetherToDisplay; + } + + + // methods and nested classes for building the control panel + + /** Creates the control panel. + * @param title description for this set of control components + * @return a panel containing the control components + **/ + protected JPanel makeControlPanel(String title) + { + // Create a panel for the control components. + if ( title == null ) + title = "Control Buttons"; + JPanel controlPanel = super.makeControlPanel(title); + + // Define timer used by NSteps and Run buttons. Define it here + // rather than in the constructor because it is critical that + // the speed slider (if there's going to be one) be created first. + timer = new Timer(getDelay(), + new ActionListener() + { public void actionPerformed(ActionEvent evt) + { stepAndDisplay(); } + }); + + + // Timer needs to listen for changes to the speed slider. + if ( getSpeedSlider() != null ) + { + getSpeedSlider().addChangeListener(new ChangeListener() { + public void stateChanged(ChangeEvent evt) { + timer.setDelay(((JSlider)evt.getSource()).getValue()); + }}); + } + + return controlPanel; + } + + + // redefinition of methods from the GridDisplay interface + + /** Sets the Grid being displayed. If the application is actively + * running, setGrid stops it. + * @param grid the Grid to display + **/ + public void setGrid(Grid grid) + { + if ( isInRunningMode() ) + stop(); + super.setGrid(grid); + + // Set the application controller's grid to match this one. + appController.setGrid(grid); + + // Enable and disable buttons as appropriate. + if ( grid != null ) + enterNotRunningMode(); + } + + /** Shows the grid. + **/ + public void showGrid() + { + getDisplay().showGrid(); + } + + + // methods that implement button actions + + /** Sets up (initializes) or resets the application. **/ + public void initialize() + { + appController.init(); + } + + /** Advances the application one step and displays the grid if + * appropriate. Uses the Template Method pattern to make it easier + * to redefine the step behavior and still display only after the + * step has been completed. + **/ + public void stepAndDisplay() + { + step(); + + if ( displayAfterEachStep ) + showGrid(); + } + + /** Advances the application one step. **/ + public void step() + { + appController.step(); + + if ( runningNSteps ) + numStepsSoFar++; + +// if ( isInRunningMode() && shouldStop() ) + if ( shouldStop() ) + stop(); + } + + /** Determines whether a running application has reached + * a desired stopping state. + * @return true if the application should + * stop + **/ + public boolean shouldStop() + { + return ( ( runningNSteps && numStepsSoFar == numStepsToRun ) || + appController.hasReachedStoppingState() ); + } + + /** Advances the application multiple (N) steps (where N is provided + * by the user in a dialog box) in a separate thread. It may stop + * before the N steps have completed if the user clicks on the stop + * button (if one is provided) or if the application controller + * indicates that the application has reached a stopping state. + **/ + public void nSteps() + { + if ( promptUserForStepCount() ) + { + runningNSteps = true; + numStepsSoFar = 0; + enterRunningMode(); + timer.start(); + } + } + + /** Runs a dialog asking the user to input a number of steps + * for the run behavior. If successful, updates numStepsToRun. + * and returns true, else returns false. + **/ + private boolean promptUserForStepCount() + { + int suggested = numStepsToRun > 0 ? numStepsToRun : 10; + String response = getInitialResponse(suggested); + while (response != null) + try + { + int userEntered = Integer.parseInt(response.trim()); + if (userEntered <= 0) + throw new NumberFormatException(); + numStepsToRun = userEntered; + return true; + } + catch (NumberFormatException ex) + { response = getClarificationResponse(suggested); } + catch (Exception ex) + { Toolkit.getDefaultToolkit().beep(); } + return false; + } + + /** Provides inital prompt for number of steps and gets result. **/ + protected String getInitialResponse(int suggested) + { + return (String)JOptionPane.showInputDialog(this, + "Enter number of steps:", + "Input", JOptionPane.QUESTION_MESSAGE, null, null, + "" + suggested); + } + + /** Provides a follow-up prompt for number of steps if initial response + * failed validation, and gets result. + **/ + protected String getClarificationResponse(int suggested) + { + return (String)JOptionPane.showInputDialog(this, + "Number of steps must be a valid, positive integer:", + "Input", JOptionPane.QUESTION_MESSAGE, null, null, + "" + suggested); + } + + /** Starts a timer to repeatedly step the application at + * the speed currently indicated by the speed slider. + * It will stop when the user clicks on the stop button or + * when the application controller indicates that the application + * has reached a stopping state. The step action happens in + * a separate thread from the graphical user interface. + **/ + public void run() + { + runningNSteps = false; + enterRunningMode(); + timer.start(); + } + + /** Stops any existing timer currently stepping the application. + **/ + public void stop() + { + timer.stop(); + enterNotRunningMode(); + } + + /** Enables and disables GUI components as necessary when an application + * is not running. + **/ + public void enterNotRunningMode() + { + runningNSteps = false; + super.enterNotRunningMode(); + } + +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton$1.class new file mode 100644 index 0000000..b3606a2 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.class new file mode 100644 index 0000000..f3a16e8 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.java new file mode 100644 index 0000000..d5b1ac9 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/ThreadedControlButton.java @@ -0,0 +1,84 @@ +// Class: ThreadedControlButton +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui; + +import edu.kzoo.grid.gui.GridAppFrame; + +/** + * Grid GUI Support Package:
      + * + * The ThreadedControlButton class represents a button + * whose button action runs in its own thread. This means that + * certain graphical user interface actions, such as updates to the + * display and changes to the slider bar, may happen concurrently with + * the action associated with a button of this class. The graphical + * user interface is put into running mode while the threaded + * action is executing, enabling or disabling various buttons and + * menus. + * + * @author Alyce Brady + * @version 1 September 2004 + **/ +public abstract class ThreadedControlButton extends ControlButton +{ + + // constructor + + /** Constructs a button that will run in its own thread. + * @param gui graphical user interface containing this button + * @param label label to place on button + * @param displayAtEnd true if grid should be displayed when + * button behavior is complete; false otherwise + **/ + public ThreadedControlButton(GridAppFrame gui, String label, + boolean displayAtEnd) + { + super(gui, label, displayAtEnd); + } + + // methods that implement the action associated with this button + + /** Executes the action associated with this button in a separate + * thread. Uses the Template Method pattern to separate the + * application-specific button behavior from the generic behavior + * of creating a new thread and deciding whether or not to display + * the grid when the button action is complete. + **/ + public void onClick() + { + Thread myThread = new Thread() + { + public void run() + { + getGUI().enterRunningMode(); + + act(); + + // Redisplay grid contents if appropriate. + if ( displaysAfterButtonAction() ) + getGUI().showGrid(); + + getGUI().enterNotRunningMode(); + } + }; + + myThread.setName(getText()); + myThread.start(); + } + + /** Performs the button action associated with this button. **/ + public abstract void act(); + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.class new file mode 100644 index 0000000..c4a242e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.java new file mode 100644 index 0000000..1bd0c14 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BGColorChoiceMenu.java @@ -0,0 +1,107 @@ +// Class: BGColorChoiceMenu +// +// Author: Alyce Brady +// +// This class is based on the College Board's FishToolbar class, +// as allowed by the GNU General Public License. FishToolbar is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import edu.kzoo.grid.gui.ColorChoiceDDMenu; +import edu.kzoo.grid.gui.GridAppFrame; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The BGColorChoiceMenu class provides a drop-down menu for + * setting the background color of a grid. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 29 July 2004 + **/ +public class BGColorChoiceMenu extends ColorChoiceMenu +{ + // Instance Variables: Encapsulated data for EACH object + private GridAppFrame gui = null; + + // constructor + + /** Constructs a menu of color choices for setting the background color + * of a grid. Puts the menu and a label introducing it into a panel. + * @param gui graphical user interface containing this button + **/ + public BGColorChoiceMenu(GridAppFrame gui) + { + this(gui, "Background Color: ", "White"); + } + + /** Constructs a menu of color choices for setting the background color + * of a grid. Puts the menu and a label introducing it into a panel. + * @param gui graphical user interface containing this button + * @param label label for color chooser + **/ + public BGColorChoiceMenu(GridAppFrame gui, String label) + { + this(gui, label, "White"); + } + + /** Constructs a menu of color choices for setting the background color + * of a grid. Puts the menu and a label introducing it into a panel. + * (Precondition: defaultColor is one of the + * color choices in STANDARD_CHOICES, whose labels are + * "Red", "Orange", "Yellow", "Green", "Blue", "Indigo", "Violet", + * "White", "Gray", "Black", "Random", and "Other ...".) + * @param gui graphical user interface containing this button + * @param label label for color chooser + * @param defaultColor the color that should appear as the default + * on the menu when it is first constructed + **/ + public BGColorChoiceMenu(GridAppFrame gui, String label, + String defaultColor) + { + super(label, defaultColor); + this.gui = gui; + } + + /** Constructs a menu of color choices for setting the background color + * of a grid. Puts the menu and a label introducing it into a panel. + * (Precondition: defaultColor is one of the + * color choices in colorChoices.) + * @param gui graphical user interface containing this button + * @param label label for color chooser + * @param colorChoices the set of color choices to show in the + * drop-down menu + * @param defaultColor the color that should appear as the default + * on the menu when it is first constructed + **/ + public BGColorChoiceMenu(GridAppFrame gui, String label, + ColorChoiceDDMenu.ColorChoice[] colorChoices, + ColorChoiceDDMenu.ColorChoice defaultColor) + { + super(label, colorChoices, defaultColor); + this.gui = gui; + } + + /** Changes the background color and, if there is a display defined + * for the graphical user interface, redisplays the grid. + **/ + public void act() + { + gui.getDisplay().setBackgroundColor(currentColor()); + gui.showGrid(); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$1.class new file mode 100644 index 0000000..998a2a4 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$2.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$2.class new file mode 100644 index 0000000..5ab0588 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$2.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$3.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$3.class new file mode 100644 index 0000000..3631e58 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$3.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$4.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$4.class new file mode 100644 index 0000000..28ba689 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu$4.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.class new file mode 100644 index 0000000..7115028 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.java new file mode 100644 index 0000000..e5576e4 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicGridFileMenu.java @@ -0,0 +1,220 @@ +// Class BasicGridFileMenu +// +// Author: Alyce Brady +// +// This class is based on code from the College Board's MBSGUIFrame class, +// as allowed by the GNU General Public License. MBSGUIFrame +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import java.awt.event.KeyEvent; +import java.util.ArrayList; +import java.util.Collection; +import java.util.Iterator; + +import javax.swing.JMenuItem; +import javax.swing.KeyStroke; + +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.gui.FileMenuActionHandler; +import edu.kzoo.grid.gui.GridAppFrame; +import edu.kzoo.grid.gui.GridChangeListener; +import edu.kzoo.grid.gui.GridDataFileHandler; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The BasicGridFileMenu class provides a file menu + * for creating, reading, and writing grids. The menu will always + * include a Quit menu option. It will include New Grid and + * Edit Grid menu options if provided with a menu action handler + * that supports grid editing. It will include Open and Save + * menu options if provided with a valid (non-null) file handler. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 29 February 2004 + * @see FileMenuActionHandler + **/ +public class BasicGridFileMenu extends MinimalFileMenu + implements GridChangeListener +{ + // instance variables + private Collection menuItemsThatNeedAGrid = new ArrayList(); + private GridAppFrame parentFrame = null; + private FileMenuActionHandler fileMenuActionHandler = null; + private GridDataFileHandler fileHandler = null; + + + // constructor and configuration methods + + /** Creates a File menu tied to the specified frame for creating, + * reading, and writing grids. This object will use a + * FileMenuActionHandler instance to handle file + * menu actions. As a result, it will not include New Grid + * or Edit Grid menu options. It will include Open and Save menu + * options only if fileHandler is not null. + * It will always include a Quit menu option. + * (Precondition: frame is not null. ) + * @param frame the frame that uses this menu + * @param fileHandler object that can read and write a grid; + * null if this menu should not support file i/o + **/ + public BasicGridFileMenu(GridAppFrame frame, + GridDataFileHandler fileHandler) + { + this(frame, new FileMenuActionHandler(frame, fileHandler), + fileHandler); + } + + /** Creates a File menu tied to the specified frame for creating, + * reading, and writing grids. The menu will always include a Quit + * menu option. It will include New Grid and Edit Grid menu if + * menuActionHandler supports grid editing. It will + * also include Open and Save menu items if + * fileHandler is not null. + * (Precondition: frame is not null. ) + * @param frame the frame that uses this menu + * @param menuActionHandler object that handles the behavior + * associated with the File and Seed menus + * @param fileHandler object that can read and write a grid; + * null if this menu should not support file i/o + **/ + public BasicGridFileMenu(GridAppFrame frame, + FileMenuActionHandler menuActionHandler, + GridDataFileHandler fileHandler) + { + super(false); // Do not want Quit menu item as first item, if at all + this.parentFrame = frame; + frame.addGridChangeListener(this); + this.fileMenuActionHandler = menuActionHandler; + this.fileHandler = fileHandler; + makeFileMenu(); + } + + // methods that allow subclasses access to instance variable + + /** Gets the frame containing the file menu associated with this handler. + * @return the frame with this file menu + **/ + protected GridAppFrame getParentFrame() + { + return parentFrame; + } + + /** Gets the action handler for the file menu. + * @return the file menu action handler + **/ + protected FileMenuActionHandler getFileMenuActionHandler() + { + return fileMenuActionHandler; + } + + /** Gets the object that handles file i/o. + * @return file i/o handler + **/ + protected GridDataFileHandler getFileHandler() + { + return fileHandler; + } + + + // methods that deal with constructing menus + + /** Creates the File drop-down menu on the frame. + * (Precondition: fileMenuActionHandler is not null.) + * @return the file menu + **/ + protected void makeFileMenu() + { + int menuMask = getToolkit().getMenuShortcutKeyMask(); + + JMenuItem mItem; + + if ( getFileMenuActionHandler().supportsGridEditing() ) + { + add(mItem = new JMenuItem("New grid...")); + mItem.addActionListener( + new ActionListener() + { public void actionPerformed(ActionEvent e) + { getFileMenuActionHandler().createNewGrid(); } + }); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_N, menuMask)); + } + + if ( getFileMenuActionHandler().supportsFileIO() ) + { + add(mItem = new JMenuItem("Open grid file...")); + mItem.addActionListener( + new ActionListener() + { public void actionPerformed(ActionEvent e) + { getFileMenuActionHandler().openFile(); } + }); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_O, menuMask)); + } + + if ( getFileMenuActionHandler().supportsGridEditing() ) + { + add(mItem = new JMenuItem("Edit grid...")); + mItem.addActionListener( + new ActionListener() + { public void actionPerformed(ActionEvent e) + { getFileMenuActionHandler().editGrid(); } + }); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_E, menuMask)); + itemNeedsDefinedGrid(mItem); + } + + if ( getFileMenuActionHandler().supportsFileIO() ) + { + add(mItem = new JMenuItem("Save grid as...")); + mItem.addActionListener( + new ActionListener() + { public void actionPerformed(ActionEvent e) + { getFileMenuActionHandler().saveFile(); } + }); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_S, menuMask)); + itemNeedsDefinedGrid(mItem); + } + + addQuitMenuItem(); + } + + /** Adds the specified menu item to the list of ones that + * should only be enabled when a grid is defined in the + * graphical user interface. + * @param item item that should only be enabled when + * there is a defined grid + **/ + protected void itemNeedsDefinedGrid(JMenuItem item) + { + menuItemsThatNeedAGrid.add(item); + } + + /** Sets the enabled status of those GUI items that need a + * grid to be valid. + **/ + public void reactToNewGrid(Grid newGrid) + { + Iterator iter = menuItemsThatNeedAGrid.iterator(); + while (iter.hasNext()) + ((JMenuItem)iter.next()).setEnabled(newGrid != null); + } + +} + + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$1.class new file mode 100644 index 0000000..837f920 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$2.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$2.class new file mode 100644 index 0000000..283e10f Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$2.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$3.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$3.class new file mode 100644 index 0000000..a5b005c Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu$3.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.class new file mode 100644 index 0000000..9897163 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.java new file mode 100644 index 0000000..4bdafec --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/BasicHelpMenu.java @@ -0,0 +1,332 @@ +// Class: BasicHelpMenu +// +// Author: Alyce Brady +// +// This class is based on the College Board's MBSGUIFrame class, +// as allowed by the GNU General Public License. MBSGUIFrame +// is a black-box class within the AP(r) CS Marine Biology Simulation +// case study. +// (See http://www.collegeboard.com/student/testing/ap/compsci_a/case.html.) +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import java.awt.Dimension; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import java.awt.event.KeyEvent; +import java.net.MalformedURLException; +import java.net.URL; + +import javax.swing.JDialog; +import javax.swing.JEditorPane; +import javax.swing.JFrame; +import javax.swing.JLabel; +import javax.swing.JMenu; +import javax.swing.JMenuItem; +import javax.swing.JOptionPane; +import javax.swing.JScrollPane; +import javax.swing.KeyStroke; +import javax.swing.event.HyperlinkEvent; +import javax.swing.event.HyperlinkListener; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * A BasicHelpMenu object represents a Help menu with + * two standard entries: "About Application_Name" and "Help", + * where "Application_Name" is the name of the application provided + * in a parameter to the constructor. Selecting the "About" menu + * item brings up an informational dialog box with the name of the + * application, and, for example, its authors, and a date or version + * number. Selecting the "Help" menu item displays the contents of + * a document in a scrolling dialog box. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 31 March 2004 + **/ +public class BasicHelpMenu extends JMenu +{ + // instance variables + private JFrame parentFrame = null; + private String applicationName; + private String aboutMessage; + private URL helpDocument; + + // static method useful in constructing BasicHelpMenu objects + + protected static String makeAboutMessage(String authors, + String acknowledgements, + String versionInfo) + { + String msg = ""; + if ( authors != null ) + msg += "

      Author: " + authors + "

      "; + if ( acknowledgements != null ) + msg += "

      Acknowledgements: " + acknowledgements + "

      "; + if ( versionInfo != null ) + msg += "

      Version: " + versionInfo + "

      "; + return msg; + } + + // constructors + + /** Constructs an empty Help menu. **/ + public BasicHelpMenu() + { + super("Help"); + } + + /** Constructs a Help menu with one "About This_Application" entry, + * where This_Application is replaced with applName. + * Selecting the About option brings up a dialog box that displays + * the application name and the specified additional information. + * @param applName the name of this application, to be used in the + * "About This_Application" menu item; + * null if there should not be an + * "About This_Application" menu item + * @param aboutMessage additional information to be displayed + * in the "About This_Application" dialog box; + * null if there should not be an + * "About This_Application" menu item + **/ + public BasicHelpMenu(String applName, String aboutMessage) + { + super("Help"); + addAboutMenuItem(applName, aboutMessage); + } + + /** Constructs a Help menu with one "About This_Application" entry, + * where This_Application is replaced with applName. + * Selecting the About option brings up a dialog box that + * displays the application name, and the specified author(s), + * acknowledgements, and version information, each preceded + * with an appropriate label. If any of those parameters is + * null, the associated label will not be included. + * @param applName the name of this application, to be used in the + * "About This_Application" menu item; + * null if there should not be an + * "About This_Application" menu item + * @param authors the name(s) of the author(s) to be displayed in + * the "About This_Application" dialog box; + * null if the "About" information should + * not include author information + * @param acknowledgements acknowledgement information to be included + * in the "About This_Application" dialog box; + * null if the "About" information should + * not include acknowledgements + * @param versionInfo version information (for example, date or + * version number) to be included in the + * "About This_Application" dialog box; + * null if the "About" information should + * not include version information + **/ + public BasicHelpMenu(String applName, String authors, + String acknowledgements, String versionInfo) + { + super("Help"); + addAboutMenuItem(applName, makeAboutMessage(authors, + acknowledgements, + versionInfo)); + } + + /** Constructs a Help menu with two standard entries: + * "About This_Application" and "Help", where + * This_Application is replaced with applName. + * Selecting the About option brings up a dialog box that displays + * the application name and the specified additional information. + * Selecting the "Help" menu item displays the specified help + * document in a scrolling dialog window. The name of the help + * document should be a well-formed URL such as "file:helpFile.html" + * or "http://aWebSite/helpFile.html". + * The Help menu may have only one of the two standard entries + * if any of the parameters are null or if the name + * of the helpDocumentURL is a malformed URL. + * @param applName the name of this application, to be used in the + * "About This_Application" menu item; + * null if there should not be an + * "About This_Application" menu item + * @param aboutMessage additional information to be displayed + * in the "About This_Application" dialog box; + * null if there should not be an + * "About This_Application" menu item + * @param helpDocumentURL the URL for the document to be displayed in + * a new window when the "Help" menu item is selected; + * null if there should not be a menu + * item for a help document + **/ + public BasicHelpMenu(String applName, String aboutMessage, + String helpDocumentURL) + { + super("Help"); + addAboutMenuItem(applName, aboutMessage); + addHelpDocMenuItem(helpDocumentURL); + } + + /** Constructs a Help menu with two standard entries: + * "About This_Application" and "Help", where + * This_Application is replaced with applName. + * Selecting the About option brings up a dialog box that + * displays the application name, and the specified author(s), + * acknowledgements, and version information, each preceded + * with an appropriate label. If any of those parameters is + * null, the associated label will not be included. + * Selecting the "Help" menu item displays the specified help + * document in a scrolling dialog window. The name of the help + * document should be a well-formed URL such as "file:helpFile.html" + * or "http://aWebSite/helpFile.html". + * The Help menu may have only one of the two standard entries + * if applName or helpDocumentURL is + * null or if the name of the helpDocumentURL + * is a malformed URL. + * @param applName the name of this application, to be used in the + * "About This_Application" menu item; + * null if there should not be an + * "About This_Application" menu item + * @param authors the name(s) of the author(s) to be displayed in + * the "About This_Application" dialog box; + * null if the "About" information should + * not include author information + * @param acknowledgements acknowledgement information to be included + * in the "About This_Application" dialog box; + * null if the "About" information should + * not include acknowledgements + * @param versionInfo version information (for example, date or + * version number) to be included in the + * "About This_Application" dialog box; + * null if the "About" information should + * not include version information + * @param helpDocumentURL the URL for the document to be displayed in + * a new window when the "Help" menu item is selected; + * null if there should not be a menu + * item for a help document + **/ + public BasicHelpMenu(String applName, String authors, + String acknowledgements, String versionInfo, + String helpDocumentURL) + { + super("Help"); + addAboutMenuItem(applName, makeAboutMessage(authors, + acknowledgements, + versionInfo)); + addHelpDocMenuItem(helpDocumentURL); + } + + /** Sets the frame to which this menu bar is attached. The menu bar + * does not need this information but will use it, if provided, to + * locate the window that displays help information. + **/ + public void setFrame(JFrame frame) + { + this.parentFrame = frame; + } + + /** Adds an "About This_Application" menu option to this menu, + * where This_Application is replaced with applName. + * Selecting this option brings up a dialog box that displays + * the application name (applName) and the specified + * additional information. + * @param applName the name of this application to be used in the + * menu item and as a title for the information in + * the dialog box + * @param additionalInfo additional information to be displayed + * in the dialog box + **/ + public void addAboutMenuItem(String applName, String additionalInfo) + { + if ( applName == null || additionalInfo == null ) + return; + + this.applicationName = applName; + this.aboutMessage = "

      " + applName + "

      " + + additionalInfo + ""; + + JMenuItem mItem; + add(mItem = new JMenuItem("About " + applName + "...")); + mItem.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { showAboutPanel(); }}); + } + + /** Adds a "Help" menu option to this menu that, when selected, + * displays the specified help document in a scrolling dialog window. + * @param documentURL the URL for the document to be displayed in + * a new window when the "Help" menu option is selected + **/ + public void addHelpDocMenuItem(String documentURL) + { + if ( documentURL == null || documentURL.equals("") ) + return; + + this.helpDocument = null; + try { + helpDocument = new URL(documentURL); + } + catch (MalformedURLException e) { } + + int menuMask = getToolkit().getMenuShortcutKeyMask(); + + JMenuItem mItem; + add(mItem = new JMenuItem("Help...")); + mItem.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { showHelp(); }}); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_HELP, + menuMask)); + } + + /** Brings up a simple dialog with some general information about + * the application. + **/ + private void showAboutPanel() + { + String html = "

      " + applicationName + "

      " + + aboutMessage + ""; + JOptionPane.showMessageDialog(this, new JLabel(aboutMessage), + "About " + applicationName, + JOptionPane.INFORMATION_MESSAGE); + } + + /** Brings up a window with a scrolling text pane that display + * the help information for the simulation. + **/ + private void showHelp() + { + JDialog dialog = new JDialog(parentFrame, applicationName + " Help"); + final JEditorPane helpText = new JEditorPane(); + try + { + helpText.setPage(helpDocument); + } + catch (Exception e) + { + helpText.setText("Couldn't load help file."); + } + helpText.setEditable(false); + helpText.addHyperlinkListener(new HyperlinkListener() { + public void hyperlinkUpdate(HyperlinkEvent ev) { + if (ev.getEventType() == HyperlinkEvent.EventType.ACTIVATED) + try + { + helpText.setPage(ev.getURL()); + } + catch (Exception ex) {} + }}); + JScrollPane sp = new JScrollPane(helpText); + sp.setPreferredSize(new Dimension(650, 500)); + dialog.getContentPane().add(sp); + dialog.setLocation(getX() + getWidth() - 200, getY() + 50); + dialog.pack(); + dialog.setVisible(true); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.class new file mode 100644 index 0000000..3bfc849 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.java new file mode 100644 index 0000000..740b2c3 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ClearGridButton.java @@ -0,0 +1,86 @@ +// Class: ClearGridButton +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import edu.kzoo.grid.gui.ControlButton; +import edu.kzoo.grid.gui.GridAppFrame; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The ClearGridButton class represents a button + * that clears all objects out of a grid. + * + * @author Alyce Brady + * @version 29 July 2004 + **/ +public class ClearGridButton extends ControlButton +{ + + // constructors + + /** Constructs a button labeled "Clear Grid" that will clear all + * objects out of a grid. By default, this button will not redisplay + * the grid contents after clearing the grid. + * @param gui graphical user interface containing this button + **/ + public ClearGridButton(GridAppFrame gui) + { + this(gui, "Clear Grid", false); + } + + /** Constructs a button that will clear all objects out of a grid. + * By default, this button will not redisplay the grid contents + * after clearing the grid. + * @param gui graphical user interface containing this button + * @param label label to place on button + **/ + public ClearGridButton(GridAppFrame gui, String label) + { + this(gui, label, false); + } + + /** Constructs a button that will clear all objects out of a grid. + * @param gui graphical user interface containing this button + * @param displayAfterClear true if grid should be displayed + * after being cleared; false otherwise + **/ + public ClearGridButton(GridAppFrame gui, boolean displayAfterClear) + { + this(gui, "Clear Grid", displayAfterClear); + } + + /** Constructs a button that will clear all objects out of a grid. + * @param gui graphical user interface containing this button + * @param label label to place on button + * @param displayAfterClear true if grid should be displayed + * after being cleared; false otherwise + **/ + public ClearGridButton(GridAppFrame gui, String label, + boolean displayAfterClear) + { + super(gui, label, displayAfterClear); + } + + // method that implements the core action associated with this button + + /** Clears the grid. + **/ + public void act() + { + getGUI().getGrid().removeAll(); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu$1.class new file mode 100644 index 0000000..f8d16bf Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.class new file mode 100644 index 0000000..ab1fda5 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.java new file mode 100644 index 0000000..195d146 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/ColorChoiceMenu.java @@ -0,0 +1,132 @@ +// Class: ColorChoiceMenu +// +// Author: Alyce Brady +// +// This class is based on the College Board's FishToolbar class, +// as allowed by the GNU General Public License. FishToolbar is a +// black-box GUI class within the AP(r) CS Marine Biology Simulation +// case study (see +// http://www.collegeboard.com/student/testing/ap/compsci_a/case.html). +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import edu.kzoo.grid.gui.ColorChoiceDDMenu; +import edu.kzoo.util.NamedColor; + +import java.awt.Color; +import java.awt.GridLayout; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; + +import javax.swing.BorderFactory; +import javax.swing.JLabel; +import javax.swing.JPanel; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * A ColorChoiceMenu object provides a drop-down menu for + * choosing a color. + * + * @author Alyce Brady (based on code by Julie Zelenski) + * @version 29 July 2004 + **/ +public class ColorChoiceMenu extends JPanel +{ + // Instance Variables: Encapsulated data for EACH object + protected ColorChoiceDDMenu colorMenu; + + // constructor + + /** Constructs a menu of color choices. Puts the menu and a label + * introducing it into a panel. The color choices are those + * defined in ColorChoiceDDMenu.STANDARD_CHOICES. + * @param label label for color chooser + **/ + public ColorChoiceMenu(String label) + { + this(label, ColorChoiceDDMenu.STANDARD_CHOICES, + ColorChoiceDDMenu.RED); + } + + /** Constructs a menu of color choices. Puts the menu and a label + * introducing it into a panel. + * (Precondition: defaultColor is one of the labels + * from ColorChoiceDDMenu.STANDARD_CHOICES: + * "Red", "Orange", "Yellow", "Green", "Blue", "Indigo", "Violet", + * "White", "Gray", "Black", "Random", and "Other ...".) + * @param label label for color chooser + * @param defaultColor the color that should appear as the default + * on the menu when it is first constructed + **/ + public ColorChoiceMenu(String label, String defaultColor) + { + this(label, ColorChoiceDDMenu.STANDARD_CHOICES, + ColorChoiceDDMenu.getChoice(defaultColor)); + } + + /** Constructs a menu of color choices. Puts the menu and a label + * introducing it into a panel. + * (Precondition: defaultColor is one of the + * color choices in colorChoices.) + * @param label label for color chooser + * @param colorChoices the set of color choices to show in the + * drop-down menu + * @param defaultColor the color that should appear as the default + * on the menu when it is first constructed + **/ + public ColorChoiceMenu(String label, + ColorChoiceDDMenu.ColorChoice[] colorChoices, + ColorChoiceDDMenu.ColorChoice defaultColor) + { + // Add the label and drop-down menu to the panel. + setLayout(new GridLayout(1, 0)); + setBorder(BorderFactory.createEmptyBorder(10, 4, 10, 4)); + + add(new JLabel(label)); + colorMenu = new ColorChoiceDDMenu(colorChoices, defaultColor); + colorMenu.addActionListener(new ActionListener() { + public void actionPerformed(ActionEvent e) + { act(); }}); + add(colorMenu); + } + + /** Adds a new menu item to the menu with the given color, using its + * name as the name in the menu. + **/ + public void addColorChoice(NamedColor color) + { + colorMenu.addItem(new ColorChoiceDDMenu.ColorChoice(color)); + } + + /** Adds a new menu item to the menu with the given name and color. + **/ + public void addColorChoice(String colorName, Color color) + { + colorMenu.addItem(new ColorChoiceDDMenu.ColorChoice(colorName, color)); + } + + /** Performs any actions necessary when the color changes. + **/ + public void act() + { + } + + /** Returns the current color from the drop-down menu. + **/ + public Color currentColor() + { + return colorMenu.currentColor(); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton$Initializer.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton$Initializer.class new file mode 100644 index 0000000..924bb5e Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton$Initializer.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.class new file mode 100644 index 0000000..b1ed66c Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.java new file mode 100644 index 0000000..35a43a3 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/InitializationButton.java @@ -0,0 +1,90 @@ +// Class: InitializationButton +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import edu.kzoo.grid.gui.GridAppFrame; +import edu.kzoo.grid.gui.ThreadedControlButton; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The InitializationButton class represents a button + * that initializes a grid, an application, or some other object. + * The actual initialization behavior is provided by the initializer + * object provided to the button constructor. + * + * @author Alyce Brady + * @version 1 September 2004 + **/ +public class InitializationButton extends ThreadedControlButton +{ + // Instance Variables: Encapsulated data for each object + private Initializer initializer = null; + + /** Constructs a button labeled "Initialize" that will invoke the + * initialize method on the specified initializer. + * The grid will not be redisplayed after the button is pressed + * unless the initializer object redisplays the grid explicitly. + * @param initializer object that knows how to initialize + **/ + public InitializationButton(Initializer initializer) + { + this(initializer, "Initialize", null, false); + } + + /** Constructs a button that will invoke the initialize method + * on the specified initializer. + * The grid will not be redisplayed after the button is pressed + * unless the initializer object redisplays the grid explicitly. + * @param initializer object that knows how to initialize + * @param label label to place on button + **/ + public InitializationButton(Initializer initializer, String label) + { + this(initializer, label, null, false); + } + + /** Constructs a button that will invoke the initialize method + * on the specified initializer. + * @param initializer object that knows how to initialize + * @param label label to place on button + * @param gui graphical user interface containing this button + * @param displayAtEnd true if gui should display grid when + * button behavior is complete; false otherwise + **/ + public InitializationButton(Initializer initializer, String label, + GridAppFrame gui, boolean displayAtEnd) + { + super(gui, label, displayAtEnd); + this.initializer = initializer; + } + + /** Invokes the initialize method on the initializer object provided to + * this object's constructor. + **/ + public void act() + { + initializer.initialize(); + } + + /** The Initializer interface specifies an + * initialize method. + **/ + public interface Initializer + { + public void initialize(); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu$1.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu$1.class new file mode 100644 index 0000000..7c15db1 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu$1.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.class new file mode 100644 index 0000000..47ea943 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.java new file mode 100644 index 0000000..8596db1 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/MinimalFileMenu.java @@ -0,0 +1,96 @@ +// Class MinimalFileMenu +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import java.awt.event.KeyEvent; + +import javax.swing.JMenu; +import javax.swing.JMenuItem; +import javax.swing.KeyStroke; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The MinimalFileMenu class provides a file menu + * that initially has either no menu items or just a Quit option, + * depending on the constructor used. + * + * @author Alyce Brady + * @version 15 August 2004 + **/ +public class MinimalFileMenu extends JMenu +{ + + /** Creates a minimal File menu containing only a Quit option. + **/ + public MinimalFileMenu() + { + this("File", true); + } + + /** Creates a File menu that may be empty or may include a Quit option. + * @param includeQuitOption true if the File menu + * should include a Quit option; + * false otherwise + **/ + public MinimalFileMenu(boolean includeQuitOption) + { + this("File", includeQuitOption); + } + + /** Creates a minimal File menu with the specifed name containing + * only a Quit option. + * @param name the label for this menu in the menu bar + **/ + public MinimalFileMenu(String name) + { + this(name, true); + } + + /** Creates a File menu with the specifed name that may be empty + * or may include a Quit option. + * @param name the label for this menu in the menu bar + * @param includeQuitOption true if the File menu + * should include a Quit option; + * false otherwise + **/ + public MinimalFileMenu(String name, boolean includeQuitOption) + { + super(name); + if ( includeQuitOption ) + addQuitMenuItem(); + } + + /** Adds a Quit menu option to this menu. + **/ + public void addQuitMenuItem() + { + int menuMask = getToolkit().getMenuShortcutKeyMask(); + + JMenuItem mItem; + add(mItem = new JMenuItem("Quit")); + mItem.addActionListener( + new ActionListener() + { public void actionPerformed(ActionEvent e) + { System.exit(0); } + }); + mItem.setAccelerator(KeyStroke.getKeyStroke(KeyEvent.VK_Q, menuMask)); + } + +} + + diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.class b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.class new file mode 100644 index 0000000..56d9fad Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.java b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.java new file mode 100644 index 0000000..6d00a08 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/grid/gui/nuggets/NewBoundedGridButton.java @@ -0,0 +1,82 @@ +// Class: NewBoundedGridButton +// +// Author: Alyce Brady +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.grid.gui.nuggets; + +import edu.kzoo.grid.BoundedGrid; +import edu.kzoo.grid.Grid; +import edu.kzoo.grid.gui.ControlButton; +import edu.kzoo.grid.gui.GridAppFrame; +import edu.kzoo.grid.gui.GridCreationDialog; + +/** + * Grid GUI Nuggets Package (Handy Grid GUI Components):
      + * + * The NewBoundedGridButton class represents a button + * that prompts the user for the dimensions of a new grid and then + * constructs that grid. + * + * @author Alyce Brady + * @version 1 September 2004 + **/ +public class NewBoundedGridButton extends ControlButton +{ + // Instance Variables: Encapsulated data for each object + private GridCreationDialog gridCreationDialog = null; + + + // constructor + + /** Constructs a button labeled "Create New Grid" that will create a + * new BoundedGrid object with dimensions specified by the user + * through a dialog box. + * @param gui graphical user interface containing this button + **/ + public NewBoundedGridButton(GridAppFrame gui) + { + this(gui, "Create New Grid"); + } + + /** Constructs a button that will create a new BoundedGrid object with + * dimensions specified by the user through a dialog box. + * @param gui graphical user interface containing this button + * @param label label to place on button + **/ + public NewBoundedGridButton(GridAppFrame gui, String label) + { + super(gui, label, true); + } + + /** Creates a new grid and notifies the user interface. The grid + * dimensions come from a dialog box presented to the user; the + * default grid dimensions if the user doesn't provide any are 10 x 10. + **/ + public void act() + { + GridAppFrame gui = getGUI(); + + // Ask user for grid dimensions. + if ( gridCreationDialog == null ) + gridCreationDialog = GridCreationDialog.makeDimensionsDialog(gui); + Grid newGrid = gridCreationDialog.showDialog(); + + // Using user-provided grid dimensions (or default 10 x 10), + // construct the grid. + if ( gui.getGrid() == null && newGrid == null ) + newGrid = new BoundedGrid(10, 10); + if ( newGrid != null ) + gui.setGrid(newGrid); + } + +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/Debug.class b/02 Recursion/06 NQueens/edu/kzoo/util/Debug.class new file mode 100644 index 0000000..0f8afef Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/util/Debug.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/Debug.java b/02 Recursion/06 NQueens/edu/kzoo/util/Debug.java new file mode 100644 index 0000000..71ec4b2 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/util/Debug.java @@ -0,0 +1,154 @@ +// AP(r) Computer Science Marine Biology Simulation: +// The Debug class is copyright(c) 2002 College Entrance +// Examination Board (www.collegeboard.com). +// +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.util; + +import java.util.Stack; + +/** + * AP® Computer Science Marine Biology Simulation:
      + * The Debug class supports conditional printing of + * debugging messages. + * + *

      + * The turnOn and turnOff methods cause the + * previous debugging state to be saved on a stack so that it can be + * restored later using the restoreState method. + * + *

      + * For example, consider the following scenario. Method 1 turns on + * debugging and calls Method 2. Method 2, not knowing that debugging + * is already on, turns debugging on and calls Method 3. Method 3 + * turns debugging off. Before returning, Method 3 restores the + * previous state, which turns debugging back on (as set by Method 2). + * Before Method 2 returns, it also restores the state, which will + * leave debugging on (as set by Method 1). This is illustrated in + * the pseudo-code below. + * 

      + *      in Method 1:
+ *          (A: in Method 1; we don't know debugging state)
+ *          turn on debugging
+ *          (debugging state is now on; Debug.println will print)
+ *          call Method 2
+ *              (B: now in Method 2; debugging state is unchanged (on))
+ *              turn on debugging
+ *              (debugging state is on (still))
+ *              call Method 3
+ *                  (C: now in Method 3; debugging state is unchanged (on))
+ *                  turn off debugging
+ *                  (debugging state is now off; Debug.println will not print)
+ *                  restore state
+ *                  (debugging state is restored to what it was at point C (on))
+ *                  return to Method 2
+ *               (D: now in Method 2; debugging state is unchanged (still on))
+ *               restore state
+ *               (debugging state is still on because it was on at point B)
+ *               return to Method 1
+ *           (E: now in Method 1; debugging state unchanged (still on))
+ *           restore state
+ *           (debugging state is whatever it was at point A (unknown))
+ *
      + * Note that when Method 2 restores the debugging state, it does not go + * back to its most recent state, which would be off (as set by Method 3). + * State restoration is controlled by a stack, not by a toggle. + * + *

      + * The Debug class is + * copyright© 2002 College Entrance Examination Board + * (www.collegeboard.com). + * + * @author Alyce Brady + * @version 1 July 2002 + **/ +public class Debug +{ + private static boolean debugOn = false; // debugging is on or off? + private static Stack oldStates = new Stack(); // to restore previous states + + + /** Checks whether debugging is on. The Debug.print + * and Debug.println) methods use isOn + * to decide whether or not to print. + **/ + public static boolean isOn () + { + return debugOn; + } + + + /** Checks whether debugging is off. + **/ + public static boolean isOff() + { + return ! isOn(); + } + + + /** Turns debugging on. + **/ + public static void turnOn() + { + // Push current state on stack. + oldStates.push (new Boolean(debugOn)); + + debugOn = true; + } + + /** Turns debugging off. + **/ + public static void turnOff() + { + // Push current state on stack. + oldStates.push (new Boolean(debugOn)); + + debugOn = false; + } + + /** Restores the previous debugging state. If there is + * no previous state to restore, restoreState turns + * debugging off. + **/ + public static void restoreState() + { + // Is there a previous state to restore to? + if ( oldStates.empty() ) + debugOn = false; + else + debugOn = ((Boolean) oldStates.pop()).booleanValue(); + } + + /** Prints debugging message without appending a newline character at + * the end. + * If debugging is turned on, message is + * printed to System.out without a newline. + * @param message debugging message to print + **/ + public static void print(String message) + { + if ( debugOn ) + System.out.print(message); + } + + /** Prints debugging message, appending a newline character at the end. + * If debugging is turned on, message is + * printed to System.out followed by a newline. + * @param message debugging message to print + **/ + public static void println(String message) + { + if ( debugOn ) + System.out.println(message); + } + +} + diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor$ColorMap.class b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor$ColorMap.class new file mode 100644 index 0000000..2215472 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor$ColorMap.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.class b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.class new file mode 100644 index 0000000..6c363b0 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.java b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.java new file mode 100644 index 0000000..baa39ad --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/util/NamedColor.java @@ -0,0 +1,607 @@ +// Class: NamedColor +// +// Author: Joel Booth +// Assistance From: Alyce Brady +// - Some of the constructors and random color generation was taken +// from a previous unworking version of NamedColor. +// +// Creation Date: September 1, 2004 +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.util; + +import java.awt.Color; + +import java.util.HashMap; +import java.util.ArrayList; +import java.util.Set; + + +/** + * Kalamazoo College Utility Classes:
      + * + * The edu.kzoo.util.NamedColor class extends the + * java.awt.Color class to associate names with colors and + * to provide static methods that generate random colors. + * The random color generation methods can generate random opaque colors, + * random named colors, and random colors with variable levels of + * transparency. Name associations are provided (in English) for many common + * colors, and the toString method returns the color name + * whenever possible. Internally all names are stored in upper-case, but + * the methods that take names as parameters will accept either upper- or + * lower-case, converting them to upper-case as needed. + * + * Names are provided for all of the color constants found in + * java.awt.Color, as well as a few additional colors. New + * named colors can be added with the addColor methods. A set + * of static methods support getting color names and looking up colors by + * name. + * + * @author Joel Booth + * @version September 1, 2004 + * + */ +public class NamedColor extends Color +{ + // A class that contains the mapping of color names to colors. + private static ColorMap colors = new ColorMap(); + + /** NamedColor version of java.awt.Color constant **/ + public static final NamedColor + WHITE = new NamedColor(Color.WHITE, "WHITE"), + LIGHT_GRAY = new NamedColor(Color.LIGHT_GRAY, "LIGHT_GRAY"), + GRAY = new NamedColor(Color.GRAY, "GRAY"), + DARK_GRAY = new NamedColor(Color.DARK_GRAY, "DARK_GRAY"), + BLACK = new NamedColor(Color.BLACK, "BLACK"), + RED = new NamedColor(Color.RED, "RED"), + PINK = new NamedColor(Color.PINK, "PINK"), + ORANGE = new NamedColor(Color.ORANGE, "ORANGE"), + YELLOW = new NamedColor(Color.YELLOW, "YELLOW"), + GREEN = new NamedColor(Color.GREEN, "GREEN"), + MAGENTA = new NamedColor(Color.MAGENTA, "MAGENTA"), + CYAN = new NamedColor(Color.CYAN, "CYAN"), + BLUE = new NamedColor(Color.BLUE, "BLUE"); + + public static final NamedColor + /** Less salmon-colored than PINK **/ + CINNAMON = new NamedColor(200, 100, 100, "CINNAMON"); + public static final NamedColor + ROSE = new NamedColor(255, 144, 192, "ROSE"); + public static final NamedColor + FUSCHIA = new NamedColor(230, 51, 181, "FUSCHIA"); + /** Slightly less yellow than ORANGE **/ + public static final NamedColor + PUMPKIN = new NamedColor(255, 128, 0, "PUMPKIN"); + public static final NamedColor + MEDIUM_GREEN = new NamedColor(0, 200, 0, "MEDIUM_GREEN"); + public static final NamedColor + DARK_GREEN = new NamedColor(16, 106, 40, "DARK_GREEN"); + public static final NamedColor + DARK_BLUE = new NamedColor(48, 8, 176, "DARK_BLUE"); + /** Midnight blue **/ + public static final NamedColor + MIDNIGHT = new NamedColor(0, 0, 128, "MIDNIGHT"); + public static final NamedColor + INDIGO = new NamedColor(64, 0, 128, "INDIGO"); + public static final NamedColor + PURPLE = new NamedColor(128, 0, 128, "PURPLE"); + public static final NamedColor + VIOLET = new NamedColor(128, 0, 192, "VIOLET"); + public static final NamedColor + LILAC = new NamedColor(187, 62, 249, "LILAC"); + public static final NamedColor + BROWN = new NamedColor(160, 64, 0, "BROWN"); + + /** Flag to specify behavior for the toString(int) method **/ + public static final int PRINT_RGB = 0, + PRINT_NAME = 1; + + // A random number generator that is used in producing random values. + private static RandNumGenerator randGen = RandNumGenerator.getInstance(); + + + // NamedColor constructors + + /** Creates a NamedColor version of the given + * Color object. + * @param c the Color object to convert to a + * NamedColor object + **/ + public NamedColor(Color c) + { + super(c.getRed(), c.getGreen(), c.getBlue(), c.getAlpha()); + } + + /** Creates a NamedColor version of the given + * Color object with the given name. + * (Precondition: there is not already a name associated with the given + * color, nor is there already a color associated with the given name.) + * @param c the Color object to convert to a + * NamedColor object + * @param name the name to associate with the given color + * @throws IllegalArgumentException if there is already + * a name => color association involving either c + * or name + **/ + public NamedColor(Color c, String name) + { + super(c.getRed(), c.getGreen(), c.getBlue(), c.getAlpha()); + colors.addColor(name, this); + } + + /** Creates an opaque sRGB color with the specified red, green, and blue + * values in the range (0 - 255). The actual color used in rendering + * depends on finding the best match given the color space available + * for a particular output device. Alpha is defaulted to 255. + * @param r the red component + * @param g the green component + * @param b the blue component + * @see java.awt.Color#Color(int, int, int) + **/ + public NamedColor(int r, int g, int b) + { + super(r, g, b); + } + + /** Creates an opaque sRGB color with the specified red, green, and blue + * values in the range (0 - 255) and associated with the specified name. + * The actual color used in rendering depends on finding the best match + * given the color space available for a particular output device. + * Alpha (the transparency level) defaults to 255. + * (Precondition: there is not already a name associated with the given + * color, nor is there already a color associated with the given name.) + * @param r the red component + * @param g the green component + * @param b the blue component + * @param name the name to associate with the given color + * @throws IllegalArgumentException if there is already + * a name => color association involving either c + * or name + **/ + public NamedColor(int r, int g, int b, String name) + { + super(r, g, b); + colors.addColor(name, this); + } + + /** Creates an sRGB color with the specified red, green, blue, and + * alpha values in the range (0 - 255). The actual color used + * in rendering depends on finding the best match given the color + * space available for a particular output device. + * @param r the red component + * @param g the green component + * @param b the blue component + * @param a the alpha component + * @see java.awt.Color#Color(int, int, int, int) + **/ + public NamedColor(int r, int g, int b, int a) + { + super(r, g, b, a); + } + + /** Creates an sRGB color with the specified red, green, blue, and + * alpha values in the range (0 - 255) and associated with the given name. + * The actual color used in rendering depends on finding the best match + * given the color space available for a particular output device. + * (Precondition: there is not already a name associated with the given + * color, nor is there already a color associated with the given name.) + * @param r the red component + * @param g the green component + * @param b the blue component + * @param a the alpha component + * @param name the name to associate with the given color + * @throws IllegalArgumentException if there is already + * a name => color association involving either c + * or name + **/ + public NamedColor(int r, int g, int b, int a, String name) + { + super(r, g, b, a); + colors.addColor(name, this); + } + + + // Static methods, not tied to a particular instance of the NamedColor class + + /** Associates the given name with the given color. + * (Precondition: there is not already a name associated with the given + * color, nor is there already a color associated with the given name.) + * @param name the name to associate with the color c + * @param c the color + * @throws IllegalArgumentException if there is already + * a name => color association involving either c + * or name + **/ + public static void setNameFor(Color c, String name) + { + colors.addColor(name.toUpperCase(), new NamedColor(c)); + } + + /** Changes a name => color association to the new name and the new color. + * Any previous association involving either name or + * c no longer exists. + * @param name the name of the color + * @param c the color + **/ + public static void changeNameOrColor(String name, Color c) + { + colors.changeNameColorMapping(name, c); + } + + /** Checks whether there is a name associated with the given color. + * @param c the color + * @return true if there is an associated name, + * otherwise false + **/ + public static boolean hasNameFor(Color c) + { + return colors.containsColor(c); + } + + /** Checks whether there is a color associated with the given name. + * @param name the name of the color + * @return true if there is an associated color, + * otherwise false + **/ + public static boolean hasColorFor(String name) + { + return colors.containsName(name); + } + + /** Gets the name associated with the specified color, if there is one. + * Returns a null object if there is no name => color association for + * the specified name. + * @param c a color + * @return the name associated with color; + * null if there is no such association + **/ + public static String getNameFor(Color c) + { + return colors.getNameFor(c); + } + + /** Gets the color associated with the specified name, if there is one. + * Returns a null object if there is no name => color association for + * the specified name. + * @param name a color name + * @return the color associated with name; + * null if there is no such association + **/ + public static NamedColor getNamedColor(String name) + { + name = name.toUpperCase(); + return colors.getNamedColor(name); + } + + /** Gets the names of all the colors with name => color associations. + * @return all the known color names + **/ + public static Set getAllColorNames() + { + return colors.getAllColorNames(); + } + + /** Gets all the colors with name => color associations. + * @return all the known colors + **/ + public static Set getAllNamedColors() + { + return colors.getAllNamedColors(); + } + + + /** Generates a pseudorandom opaque NamedColor value. + * @return the new pseudorandom opaque color + **/ + public static NamedColor getRandomColor() + { + // There are 256 possibilities for the red, green, and blue attributes + // of a color. Generate random values for each color attribute. + return new NamedColor(randGen.nextInt(256), // amount of red + randGen.nextInt(256), // amount of green + randGen.nextInt(256)); // amount of blue + } + + /** Generates a pseudorandom NamedColor value with the + * specified transparency level. + * @param alpha the transparency level to use, in the range + * of 0 to 255 where 255 is completely opaque + * @return the new pseudorandom color with the specified + * transparency level + **/ + public static NamedColor getRandomColor(int alpha) + { + // There are 256 possibilities for the red, green, and blue components + // of a color. Generate random values for each color component. + return new NamedColor(randGen.nextInt(256), // amount of red + randGen.nextInt(256), // amount of green + randGen.nextInt(256), // amount of blue + alpha); // degree of transparency + } + + /** Generates a pseudorandom named NamedColor value. Colors + * returned by this method have a random alpha (transparency) component, + * as well as random red, green, and blue components. + * @return the new pseudorandom color + **/ + public static NamedColor getRandomAlphaColor() + { + // There are 256 possibilities for the red, green, and blue components + // of a color, and for the degree of transparency. Generate random + // values for each color component. + return new NamedColor(randGen.nextInt(256), // amount of red + randGen.nextInt(256), // amount of green + randGen.nextInt(256), // amount of blue + randGen.nextInt(256)); // degree of transparency + } + + /** Generates a pseudorandom opaque namedNamedColor value. + * @return the new pseudorandom named opaque color + **/ + public static NamedColor getRandomNamedColor() + { + return colors.getRandomNamedColor(); + } + + /** Generates a pseudorandom named NamedColor value with the + * specified transparency level. + * @param alpha the transparency level to use, in the range + * of 0 to 255 where 255 is completely opaque + * @return the new pseudorandom named color with the specified + * transparency level + **/ + public static NamedColor getRandomNamedColor(int alpha) + { + NamedColor c = colors.getRandomNamedColor(); + + // Adjust the transparency of the random color. + return new NamedColor(c.getRed(), // amount of red + c.getGreen(), // amount of green + c.getBlue(), // amount of blue + alpha); // degree of transparency + } + + + // NamedColor instance methods + + /** Associates the given name with this color. + * (Precondition: there is not already a name associated with this + * color.) + * @param name the name to associate with this color + * @throws IllegalArgumentException if there is already + * a name => color association involving either c + * or name + **/ + public void setName(String name) + { + colors.addColor(name.toUpperCase(), this); + } + + /** Changes the name associated with this color to the specified name. + * If name was previously associated with any other color, + * that association no longer exists. + * @param name the name of this color + **/ + public void changeName(String name) + { + colors.changeNameColorMapping(name, this); + } + + /** Gets the name associated with this color. + * @return the name associated with this NamedColor object; + * null if there is no such association + **/ + public String getName() + { + return colors.getNameFor(this); + } + + /** Gets the component representation of the color (the value returned + * by the java.util.Color.toString method). + * @return the component representation of the color + */ + public String getRGBRepresentation() + { + return super.toString(); + } + + /** Returns a string representation of the color -- the name of the color + * if known, otherwise the standard representation as defined in + * java.awt.Color.toString. + * @return a String representation of the color + **/ + public String toString() + { + // Check if the color is in the map + if (colors.containsColor(this)) + return colors.getNameFor(this); + else + return super.toString(); + } + + /** Returns a string representation of the color. Two + * flags are available:
      + * PRINT_RGB - Return the java.awt.Color representation of + * the color components
      + * PRINT_NAME - Return the NamedColor (default) representation, + * which consists of the English name if it is available or + * the java.awt.Color representation if there + * is no name available for this color + * + * @param printMode the type of String to generate + * @return the String representation of the color + **/ + public String toString(int printMode) + { + // Check if it should print the RGB components + if (printMode == PRINT_RGB) + // If so use the method from java.awt.Color + return super.toString(); + else if (printMode == PRINT_NAME) + // Else use the default toString + return toString(); + else + // Should never go here, but it's a failsafe + return toString(); + } + + /** ColorMap is a protected static class that represents a + * mapping of colors to names and names to colors. It uses two HashMaps + * to implement this 1 - 1 mapping, ensuring quick lookups in either + * direction. All names are held in all uppercase format to avoid the + * problem different capitilizations cause for hashing on the keys. + * + *

      + * All colors in the map are NamedColor objects. + * + * @author Joel Booth + * @version September 1, 2004 + **/ + protected static class ColorMap + { + // Two hashmaps to store the mappings between names and colors. + private HashMap nameToColorMap = new HashMap(30); + private HashMap colorToNameMap = new HashMap(30); + + /** Adds a color to the map. + * (Precondition: neither name nor c + * appears in the map already. + * @param name the name of the color + * @param c the color to add + * @throws IllegalArgumentException if either + * c or name are already in the + * map + **/ + public void addColor(String name, Color c) + { + if ( containsName(name) ) + throw new IllegalArgumentException("The name '" + name + + "' already has a color associated with it."); + else if ( containsColor(c) ) + throw new IllegalArgumentException("The color '" + c + + "' already has a name associated with it."); + + // Convert the Color to a NamedColor to ensure that all items in + // the map are of the same type. That way a NamedColor will always + // be returned. A standard Color variable can hold a + // NamedColor object because NamedColor is a subclass of Color. If + // c is already a NamedColor, this will merely create a new, + // equivalent NamedColor to the map. + NamedColor k = new NamedColor(c); + name = name.toUpperCase(); + colorToNameMap.put(k, name); + nameToColorMap.put(name, k); + } + + /** Adds a named color to the map, removing any previous mapping + * involving either name or c. + * @param name the name of the color + * @param c the color + **/ + public void changeNameColorMapping(String name, Color c) + { + // Remove any old mappings involving name or c. + if ( containsName(name) ) + { + Color oldColor = (Color) nameToColorMap.get(name); + nameToColorMap.remove(name); + colorToNameMap.remove(oldColor); + } + if ( containsColor(c) ) + { + String oldName = (String) colorToNameMap.get(c); + colorToNameMap.remove(c); + nameToColorMap.remove(oldName); + } + + addColor(name, c); + } + + /** Checks whether or not the mapping contains a color with the given + * name. + * @param name the name of the color to look for + * @return true if the color is in the map, + * otherwise false + */ + public boolean containsName(String name) + { + return nameToColorMap.containsKey(name.toUpperCase()); + } + + /** Checks whether or not the mapping contains a name => color + * mapping for the given color. + * @param c the NamedColor to look for + * @return true if the color is in the map, + * otherwise false + **/ + public boolean containsColor(Color c) + { + return colorToNameMap.containsKey(c); + } + + /** Gets the name associated with the specified color. + * @param c a color + * @return the name associated with color; + * null if there is no such association + **/ + public String getNameFor(Color c) + { + return ( (String) colorToNameMap.get(c) ); + } + + /** Gets the color associated with the specified name. + * @param name a color name + * @return the color associated with name; + * null if there is no such association + **/ + public NamedColor getNamedColor(String name) + { + return (NamedColor) nameToColorMap.get(name.toUpperCase()); + } + + /** Gets all of the color names in the map. + * @return all the color names in the map (String + * objects) + */ + public Set getAllColorNames() + { + return nameToColorMap.keySet(); + } + + /** Gets all of the colors in the map (colors for which there are + * associated names. + * @return a Set of all the NamedColor + * objects in the map + */ + public Set getAllNamedColors() + { + return colorToNameMap.keySet(); + } + + /** Gets a random NamedColor from the map. + * @return a random NamedColor from the map + */ + public NamedColor getRandomNamedColor() + { + // Get a random integer value that is within the size of the map. + int i = randGen.nextInt(nameToColorMap.size()); + + // Create a temporary arrayList that can be used to access a + // random index . + ArrayList tempArrayList = new ArrayList(nameToColorMap.values()); + + // Return the random indexed NamedColor. + return (NamedColor) tempArrayList.get(i); + } + + } +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.class b/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.class new file mode 100644 index 0000000..852fcd4 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.java b/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.java new file mode 100644 index 0000000..f67d723 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/util/RandNumGenerator.java @@ -0,0 +1,133 @@ +// Class: RandNumGenerator +// +// Author: Alyce Brady +// +// This class is based on the College Board's RandNumGenerator +// (see http://www.collegeboard.com/student/testing/ap/compsci_a/case.html), +// as allowed by the GNU General Public License. +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.util; + +import java.util.Random; + +/** + * Kalamazoo College Utility Classes:
      + * + * The RandNumGenerator class provides a singleton + * object for random number generation. RandNumGenerator + * extends the java.util.Random class, so the object of this + * class inherits all methods defined for the Random class. + * Using this class, though, many different objects can share a single + * source of random numbers. This eliminates the potential problem of + * having multiple random number generators generating sequences of + * numbers that are too similar. + * + *

      + * Example of how to use RandNumGenerator: + * 

      
+ *       RandNumGenerator randNumGen = RandNumGenerator.getInstance();
+ *       int anInt = randNumGen.nextInt(4);
+ *       double aDouble = randNumGen.nextDouble();
+ *
      + * + *

      + * The original RandNumGenerator class, which provided + * a getInstance method but did not extend Random, was + * copyright© 2002 College Entrance Examination Board + * (www.collegeboard.com). + * + * @author Alyce Brady + * @version 1 December 2003 + **/ +public class RandNumGenerator extends Random +{ + // Class Variable: Only one generator is created by this class. + private static RandNumGenerator theRandNumGenerator = + new RandNumGenerator(); + + /* Private constructor ensures that a RandNumGenerator is ONLY + * acquired through the getInstance method. + */ + private RandNumGenerator() + { + } + + /** Returns a random number generator. + * Always returns the same RandNumGenerator object to + * provide a better sequence of random numbers. + **/ + public static RandNumGenerator getInstance() + { + return theRandNumGenerator; + } + + // Pretend to redefine key inherited Random methods so that they show + // up as part of the RandNumGenerator class documentation. + + /** Sets the seed of this random number generator using a single + * long seed. For more technical details, see the + * class documentation for the Random class. + * @return a pseudorandom, uniformly distributed boolean + * value from this random number generator's sequence + * @see java.util.Random#setSeed(long) + **/ + public void setSeed(long seed) + { + super.setSeed(seed); + } + + /** Returns a pseudorandom, uniformly distributed boolean + * value from this random number generator's sequence. The values + * true and false are produced with + * (approximately) equal probability. For more technical details, + * see the class documentation for the Random class. + * @return a pseudorandom, uniformly distributed boolean + * value from this random number generator's sequence + * @see java.util.Random#nextBoolean + **/ + public boolean nextBoolean() + { + return super.nextBoolean(); + } + + /** Returns a pseudorandom, uniformly distributed double + * value between 0.0 and 1.0 from this + * random number generator's sequence. For more technical details, + * see the class documentation for the Random class. + * @return a pseudorandom, uniformly distributed double + * value between 0.0 and 1.0 from + * this random number generator's sequence. + * @see java.util.Random#nextDouble + **/ + public double nextDouble() + { + return super.nextDouble(); + } + + /** Returns a pseudorandom, uniformly distributed int value + * between 0 (inclusive) and the specified value (exclusive), + * drawn from this random number generator's sequence. For more + * technical details, see the class documentation for the + * Random class. + * @param n the bound on the random number to be returned. + * Must be positive. + * @return a pseudorandom, uniformly distributed int + * value between 0 (inclusive) and n (exclusive). + * @throws IllegalArgumentException n is not positive + * @see java.util.Random#nextInt(int) + **/ + public int nextInt(int n) + { + return super.nextInt(n); + } +} diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.class b/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.class new file mode 100644 index 0000000..ef57d18 Binary files /dev/null and b/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.class differ diff --git a/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.java b/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.java new file mode 100644 index 0000000..aa4b1c0 --- /dev/null +++ b/02 Recursion/06 NQueens/edu/kzoo/util/ValidatedInputReader.java @@ -0,0 +1,516 @@ +// Class: ValidatedInputReader +// +// Authors: Joel Booth, Alyce Brady +// +// Created on Mar 19, 2004 +// Updated on September 3, 2004 +// +// License Information: +// This class is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation. +// +// This class is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +package edu.kzoo.util; + +import java.util.zip.DataFormatException; + +import javax.swing.JOptionPane; + +/** + * Kalamazoo College Utility Classes:
      + * + * This class provides numerous static methods that will put up a dialog + * box prompting the user for input and validate the responses. It + * handles all of the primitive Java types including: + * byte, short, int, + * long, float, double, + * char, String, and boolean. + * + *

      + * Each method displays an initial prompt with a suggested value, waits + * for the user's response, and validates it. If the user's response + * is invalid, the method prompts the user again using a clarification + * prompt until the user enters a valid response or selects Cancel. If + * the user selects Cancel, the input method returns the suggested value + * as a default. Thus, each input method requires an initial prompt, a + * suggested value, and a clarification prompt. Input methods for numeric + * values may also provide a range of valid values. + * (This input style was inspired by the Java Power Tools package developed + * by Richard Rasala, Jeff Raab, and Viera Proulx at Northeastern University.) + * + * @author Joel Booth + * @author Alyce Brady + * @version September 3, 2004 + **/ +public class ValidatedInputReader +{ + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid byte). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getByte returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static byte getByte(String initialPrompt, byte suggestedValue, + String clarificationPrompt) + { + return getByte(initialPrompt, Byte.MIN_VALUE, Byte.MAX_VALUE, + suggestedValue, clarificationPrompt); + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid byte in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getByte returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static byte getByte(String initialPrompt, + byte startOfRange, byte endOfRange, + byte suggestedValue, String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + byte userEntered = Byte.parseByte(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid short). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getShort returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static short getShort(String initialPrompt, short suggestedValue, + String clarificationPrompt) + { + return getShort(initialPrompt, Short.MIN_VALUE, Short.MAX_VALUE, + suggestedValue, clarificationPrompt); + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid short in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getShort returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static short getShort(String initialPrompt, + short startOfRange, short endOfRange, + short suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + short userEntered = Short.parseShort(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid integer). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getInteger returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static int getInteger(String initialPrompt, int suggestedValue, + String clarificationPrompt) + { + return getInteger(initialPrompt, Integer.MIN_VALUE, Integer.MAX_VALUE, + suggestedValue, clarificationPrompt); + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid integer in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getInteger returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static int getInteger(String initialPrompt, + int startOfRange, int endOfRange, + int suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + int userEntered = Integer.parseInt(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid long). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getLong returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static long getLong(String initialPrompt, long suggestedValue, + String clarificationPrompt) + { + return getLong(initialPrompt, Long.MIN_VALUE, Long.MAX_VALUE, + suggestedValue, clarificationPrompt); + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid long in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getLong returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static long getLong(String initialPrompt, + long startOfRange, long endOfRange, + long suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + long userEntered = Long.parseLong(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid float). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getFloat returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static float getFloat(String initialPrompt, float suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + float userEntered = Float.parseFloat(response.trim()); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid float in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getFloat returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static float getFloat(String initialPrompt, + float startOfRange, float endOfRange, + float suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + float userEntered = Float.parseFloat(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid double). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getDouble returns the suggestedValue. + * Any valid double value will be accepted. If the + * number is out + * of the range of a double the value will show up as the + * double representation of either positive or negative + * inifinity. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static double getDouble(String initialPrompt, double suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + double userEntered = Double.parseDouble(response.trim()); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid double in the range provided). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getDouble returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param startOfRange the smallest value in the range of valid values + * @param endOfRange the largest value in the range of valid values + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static double getDouble(String initialPrompt, + double startOfRange, double endOfRange, + double suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + double userEntered = Double.parseDouble(response.trim()); + if ( userEntered < startOfRange || userEntered > endOfRange ) + throw new NumberFormatException(); + return userEntered; + } + catch (NumberFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it (the response must + * be a valid char). Special characters are accepted. Any empty + * response will be taken as the null character. + * If the user's response is not a valid character, getChar + * prompts again using the clarificationPrompt until + * the user enters a valid response or selects Cancel. If the user + * selects Cancel, getChar returns the + * suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static char getChar(String initialPrompt, char suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + String userEntered = response.trim(); + if (userEntered.equals("")) + return '\u0000'; + else if (userEntered.length() != 1) + throw new DataFormatException(); + return userEntered.charAt(0); + } + catch (DataFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response. Because it is prompting for a + * String, any response will be accepted, including + * an empty string. + * If the user selects Cancel the suggestedValue. + * will be returned. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + **/ + public static String getString(String initialPrompt, String suggestedValue) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + return response.trim(); + } + + /** Puts up a dialog box displaying the initialPrompt, + * waits for the user's response, and validates it. The response must + * be a valid boolean in the form of "true" or "false" (case-insensitive). + * If the user's response is invalid, it prompts the user again + * using the clarificationPrompt until the user enters + * a valid response or selects Cancel. If the user selects Cancel, + * getBoolean returns the suggestedValue. + * @param initialPrompt the initial prompt to the user + * @param suggestedValue a suggested, valid value that is displayed + * to the user, and is also used as the default + * value if the user selects Cancel + * @param clarificationPrompt a follow-up prompt for input after + * the user has input invalid data + **/ + public static boolean getBoolean(String initialPrompt, + boolean suggestedValue, + String clarificationPrompt) + { + String suggested = "" + suggestedValue; + String response = getResponse(initialPrompt, suggested); + while (response != null) + try + { + String userEntered = (response.trim()).toUpperCase(); + if (userEntered.equals("TRUE")) + return true; + else if (userEntered.equals("FALSE")) + return false; + else + throw new DataFormatException(); + } + catch (DataFormatException ex) + { response = getResponse(clarificationPrompt, suggested); } + return suggestedValue; + } + + /** Displays the appropriate JOptionPane and gets the result. **/ + protected static String getResponse(String prompt, + String suggestedValue) + { + return (String)JOptionPane.showInputDialog(null, prompt, + "Input", JOptionPane.QUESTION_MESSAGE, null, null, + suggestedValue); + } + +} \ No newline at end of file diff --git a/02 Recursion/06 NQueens/edu_kzoo_grid Class Hierarchy.mht b/02 Recursion/06 NQueens/edu_kzoo_grid Class Hierarchy.mht new file mode 100644 index 0000000..4c6ebb3 --- /dev/null +++ b/02 Recursion/06 NQueens/edu_kzoo_grid Class Hierarchy.mht @@ -0,0 +1,357 @@ +From: +Subject: edu.kzoo.grid Class Hierarchy +Date: Tue, 5 Oct 2010 12:04:56 -0400 +MIME-Version: 1.0 +Content-Type: multipart/related; + type="text/html"; + boundary="----=_NextPart_000_0000_01CB6485.86AAF590" +X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.5994 + +This is a multi-part message in MIME format. + +------=_NextPart_000_0000_01CB6485.86AAF590 +Content-Type: text/html; + charset="Windows-1252" +Content-Transfer-Encoding: quoted-printable +Content-Location: http://www.cs.kzoo.edu/GridPkg/GridPkgClassDocumentation/edu/kzoo/grid/package-tree.html + + +edu.kzoo.grid Class Hierarchy + + + + + + + + +
      + + + + + + + + + + + + + + +
      Overview Package Class Use  Tree Deprecated Index Help 
       PREV =20 +  NEXTFRAMES    NO FRAMES     + +
      +
      + +
      +

      Hierarchy For Package edu.kzoo.grid

      +
      +
      Package Hierarchies: +
      All=20 + Packages
      +
      + +

      Class Hierarchy

      +
        +
      • class java.lang.Object +
          +
        • class edu.kzoo.grid.ArrayListGrid +
        • class edu.kzoo.grid.ArrayListGrid.ArrayListGrid= +Rep=20 + (implements edu.kzoo.grid.Grid.InternalRepresentation) = + + +
        • class edu.kzoo.grid.BoundedGrid.Array2DGridRep<= +/A>=20 + (implements edu.kzoo.grid.Grid.InternalRepresentation) = + + +
        • class edu.kzoo.grid.Direction +
        • class edu.kzoo.grid.Grid +
            +
          • class edu.kzoo.grid.ArrayListGrid.Bounded +
          • class edu.kzoo.grid.ArrayListGrid.Unbounded +
          • class edu.kzoo.grid.BoundedGrid
          +
        • class edu.kzoo.grid.Grid.BoundedGridValidityCh= +ecker=20 + (implements edu.kzoo.grid.Grid.ValidityChecker)=20 + +
        • class edu.kzoo.grid.Grid.UnboundedGridValidi= +tyChecker=20 + (implements edu.kzoo.grid.Grid.ValidityChecker)=20 + +
        • class edu.kzoo.grid.GridObject +
            +
          • class edu.kzoo.grid.ColorBlock +
          • class edu.kzoo.grid.PictureBlock +
          • class edu.kzoo.grid.TextCell
          +
        • class edu.kzoo.grid.Location=20 + (implements java.lang.Comparable)
      +

      Interface Hierarchy

      +
        +
      • interface edu.kzoo.grid.Grid.InternalRepresentation +
      • interface edu.kzoo.grid.Grid.ValidityChecker
        • +
        + + + + +
        + + + + + + + + + + + + + + +
        Overview Package Class Use  Tree Deprecated Index Help 
         PREV =20 +  NEXTFRAMES    NO FRAMES     + +
        +
        + + +------=_NextPart_000_0000_01CB6485.86AAF590 +Content-Type: text/css; + charset="iso-8859-1" +Content-Transfer-Encoding: 7bit +Content-Location: http://www.cs.kzoo.edu/GridPkg/GridPkgClassDocumentation/stylesheet.css + +BODY { + BACKGROUND-COLOR: #ffffff +} +.TableHeadingColor { + BACKGROUND: #ccccff +} +.TableSubHeadingColor { + BACKGROUND: #eeeeff +} +.TableRowColor { + BACKGROUND: #ffffff +} +.FrameTitleFont { + FONT-FAMILY: Helvetica, Arial, san-serif +} +.FrameHeadingFont { + FONT-FAMILY: Helvetica, Arial, san-serif +} +.FrameItemFont { + FONT-FAMILY: Helvetica, Arial, san-serif +} +.NavBarCell1 { + BACKGROUND-COLOR: #eeeeff +} +.NavBarCell1Rev { + BACKGROUND-COLOR: #00008b +} +.NavBarFont1 { + COLOR: #000000; FONT-FAMILY: Arial, Helvetica, sans-serif +} +.NavBarFont1Rev { + COLOR: #ffffff; FONT-FAMILY: Arial, Helvetica, sans-serif +} +.NavBarCell2 { + FONT-FAMILY: Arial, Helvetica, sans-serif; BACKGROUND-COLOR: #ffffff +} +.NavBarCell3 { + FONT-FAMILY: Arial, Helvetica, sans-serif; BACKGROUND-COLOR: #ffffff +} + +------=_NextPart_000_0000_01CB6485.86AAF590-- diff --git a/02 Recursion/06 NQueens/grid.jar b/02 Recursion/06 NQueens/grid.jar new file mode 100644 index 0000000..f3048a4 Binary files /dev/null and b/02 Recursion/06 NQueens/grid.jar differ diff --git a/02 Recursion/07 MazeMaster/Maze.class b/02 Recursion/07 MazeMaster/Maze.class new file mode 100644 index 0000000..57da8f3 Binary files /dev/null and b/02 Recursion/07 MazeMaster/Maze.class differ diff --git a/02 Recursion/07 MazeMaster/MazeMaster.class b/02 Recursion/07 MazeMaster/MazeMaster.class new file mode 100644 index 0000000..3453951 Binary files /dev/null and b/02 Recursion/07 MazeMaster/MazeMaster.class differ diff --git a/02 Recursion/07 MazeMaster/MazeMaster.doc b/02 Recursion/07 MazeMaster/MazeMaster.doc new file mode 100644 index 0000000..49d61f0 Binary files /dev/null and b/02 Recursion/07 MazeMaster/MazeMaster.doc differ diff --git a/02 Recursion/07 MazeMaster/MazeMaster.java b/02 Recursion/07 MazeMaster/MazeMaster.java new file mode 100644 index 0000000..b139b22 --- /dev/null +++ b/02 Recursion/07 MazeMaster/MazeMaster.java @@ -0,0 +1,488 @@ +// Name: B6-24 +// Date: 10/9/19 + +import java.util.*; +import java.io.*; + +public class MazeMaster +{ + public static void main(String[] args) + { + Scanner sc = new Scanner(System.in); + System.out.print("Enter the maze's filename (no .txt): "); + Maze m = new Maze(sc.next() + ".txt"); + //Maze m = new Maze(); //extension + m.display(); + System.out.println("Options: "); + System.out.println("1: Mark all dots."); + System.out.println("2: Mark all dots and display the number of recursive calls."); + System.out.println("3: Mark only the correct path."); + System.out.println("4: Mark only the correct path. If no path exists, say so."); + System.out.println("5: Mark only the correct path and display the number of steps.\n\tIf no path exists, say so."); + System.out.print("Please make a selection: "); + m.solve(sc.nextInt()); + m.display(); //display solved maze + } +} + +class Maze +{ + //constants + private final char WALL = 'W'; + private final char DOT = '.'; + private final char START = 'S'; + private final char EXIT = 'E'; + private final char TEMP = 'o'; + private final char PATH = '*'; + //instance fields + private char[][] maze; + private int startRow, startCol; + + //constructors + + /* + * EXTENSION + * This is a no-arg constructor that generates a random maze + */ + public Maze() + { + int rows = (int)Math.floor(Math.random() * Math.floor(20)) + 2; + int cols = (int)Math.floor(Math.random() * Math.floor(20)) + 2; + + maze = new char[rows][cols]; + startRow = (int)Math.floor(Math.random() * Math.floor(rows)); + startCol = (int)Math.floor(Math.random() * Math.floor(cols)); + maze[startRow][startCol] = START; + maze[(int)Math.floor(Math.random() * Math.floor(rows))][(int)Math.floor(Math.random() * Math.floor(cols))] = EXIT; + for (int i = 0; i < rows; i++) + for (int j = 0; j < cols; j++) + if (maze[i][j] != START && maze[i][j] != EXIT) + maze[i][j] = DOT; + + markTheCorrectPath(startRow, startCol); + for (int i = 0; i < rows; i++) { + for (int j = 0; j < cols; j++) { + if (maze[i][j] == DOT) { + if (Math.random() < 0.5) + maze[i][j] = WALL; + else + maze[i][j] = DOT; + } else if (maze[i][j] == PATH) { + maze[i][j] = DOT; + } + } + } + } + + /* + * Copy Constructor + */ + public Maze(char[][] m) + { + maze = m; + for(int r = 0; r < maze.length; r++) + { + for(int c = 0; c < maze[0].length; c++) + { + if(maze[r][c] == START) //identify start location + { + startRow = r; + startCol = c; + } + } + } + } + + /* + * Use a try-catch block + * Use next(), not nextLine() + */ + public Maze(String filename) + { + Scanner infile = null; + try + { + infile = new Scanner(new File(filename)); + } + catch (Exception e) + { + System.out.println("File not found"); + } + /* enter your code here */ + + int rows = infile.nextInt(); + int cols = infile.nextInt(); + maze = new char[rows][cols]; + infile.nextLine(); + + for (int i = 0; i < rows; i++) + maze[i] = infile.nextLine().toCharArray(); + + for(int r = 0; r < maze.length; r++) + { + for(int c = 0; c < maze[0].length; c++) + { + if(maze[r][c] == START) //identify start location + { + startRow = r; + startCol = c; + } + } + } + + } + + public char[][] getMaze() + { + return maze; + } + + public void display() + { + if(maze==null) + return; + for(int a = 0; a= 0 && r < maze.length && c >= 0 && c < maze[0].length) { + if(maze[r][c] == DOT || maze[r][c] == START) { + if (maze[r][c] != START) + maze[r][c] = PATH; + + markAll(r + 1, c); + markAll(r - 1, c); + markAll(r, c + 1); + markAll(r, c - 1); + + } + } + + + } + + /* + * From handout, #2. + * Fill the maze, mark and count every step as you go. + * Like AreaFill's counting without a static variable. + */ + public int markAllAndCountRecursions(int r, int c) + { + if (r >= 0 && r < maze.length && c >= 0 && c < maze[0].length) { + if(maze[r][c] == DOT || maze[r][c] == START) { + if (maze[r][c] != START) + maze[r][c] = PATH; + + return 1 + markAllAndCountRecursions(r + 1, c) + markAllAndCountRecursions(r - 1, c) + markAllAndCountRecursions(r, c + 1) + markAllAndCountRecursions(r, c - 1); + } + } + + return 0; + } + + /* + * From handout, #3. + * Solve the maze, OR the booleans, and mark the path through it with a “*” + * Recur until you find E, then mark the True path. + */ + public boolean markTheCorrectPath(int r, int c) + { + boolean done = false; + + if (r >= 0 && r < maze.length && c >= 0 && c < maze[0].length) { + + if (maze[r][c] == EXIT) + return true; + + if (maze[r][c] != WALL && maze[r][c] != TEMP) { + if (maze[r][c] == DOT) + maze[r][c] = TEMP; + + done = markTheCorrectPath(r + 1, c); + + if (!done) + done = markTheCorrectPath(r, c - 1); + if (!done) + done = markTheCorrectPath(r - 1, c); + if (!done) + done = markTheCorrectPath(r, c + 1); + + if (done) { + if (maze[r][c] == TEMP) + maze[r][c] = PATH; + return true; + } else { + if (maze[r][c] == TEMP) + maze[r][c] = DOT; + } + } + } + + return false; + } + + + /* 4 Mark only the correct path. If no path exists, say so. + Hint: the method above returns the boolean that you need. */ + + + /* + * From handout, #5. + * Solve the maze, mark the path, count the steps. + * Mark only the correct path and display the number of steps. + * If no path exists, say so. + */ + public boolean markCorrectPathAndCountSteps(int r, int c, int count) + { + boolean done = false; + + if (r >= 0 && r < maze.length && c >= 0 && c < maze[0].length) { + + if (maze[r][c] == EXIT) { + System.out.println("Number of steps = " + count); + return true; + } + + if (maze[r][c] != WALL && maze[r][c] != TEMP) { + if (maze[r][c] == DOT) + maze[r][c] = TEMP; + + count++; + + done = markCorrectPathAndCountSteps(r + 1, c, count); + + if (!done) + done = markCorrectPathAndCountSteps(r, c - 1, count); + if (!done) + done = markCorrectPathAndCountSteps(r, c + 1, count); + if (!done) + done = markCorrectPathAndCountSteps(r - 1, c, count); + + if (done) { + if (maze[r][c] == TEMP) + maze[r][c] = PATH; + return true; + } else { + if (maze[r][c] == TEMP) + maze[r][c] = DOT; + } + } + } + + return false; + + } +} + +/***************************************** + + ----jGRASP exec: java MazeMaster_teacher + Enter the maze's filename (no .txt): maze1 + WWWWWWWW + W....W.W + WW.WW..W + W....W.W + W.W.WW.E + S.W.WW.W + WW.....W + WWWWWWWW + + Options: + 1: Mark all dots. + 2: Mark all dots and display the number of recursive calls. + 3: Mark only the correct path. + 4: Mark only the correct path. If no path exists, say so. + 5: Mark only the correct path and display the number of steps. + If no path exists, say so. + Please make a selection: 1 + WWWWWWWW + W****W*W + WW*WW**W + W****W*W + W*W*WW*E + S*W*WW*W + WW*****W + WWWWWWWW + + + ----jGRASP: operation complete. + + ----jGRASP exec: java MazeMaster_teacher + Enter the maze's filename (no .txt): maze1 + WWWWWWWW + W....W.W + WW.WW..W + W....W.W + W.W.WW.E + S.W.WW.W + WW.....W + WWWWWWWW + + Options: + 1: Mark all dots. + 2: Mark all dots and display the number of recursive calls. + 3: Mark only the correct path. + 4: Mark only the correct path. If no path exists, say so. + 5: Mark only the correct path and display the number of steps. + If no path exists, say so. + Please make a selection: 2 + Number of recursions = 26 + WWWWWWWW + W****W*W + WW*WW**W + W****W*W + W*W*WW*E + S*W*WW*W + WW*****W + WWWWWWWW + + + ----jGRASP: operation complete. + + ----jGRASP exec: java MazeMaster_teacher + Enter the maze's filename (no .txt): maze1 + WWWWWWWW + W....W.W + WW.WW..W + W....W.W + W.W.WW.E + S.W.WW.W + WW.....W + WWWWWWWW + + Options: + 1: Mark all dots. + 2: Mark all dots and display the number of recursive calls. + 3: Mark only the correct path. + 4: Mark only the correct path. If no path exists, say so. + 5: Mark only the correct path and display the number of steps. + If no path exists, say so. + Please make a selection: 3 + WWWWWWWW + W....W.W + WW.WW..W + W***.W.W + W*W*WW*E + S*W*WW*W + WW.****W + WWWWWWWW + + + ----jGRASP: operation complete. + + + ----jGRASP exec: java MazeMaster_teacher + Enter the maze's filename (no .txt): mazeNoPath + WWWWWWWW + W....W.W + WW.WW..E + W..WW.WW + W.W.W..W + S.W.WW.W + WWW....W + WWWWWWWW + + Options: + 1: Mark all dots. + 2: Mark all dots and display the number of recursive calls. + 3: Mark only the correct path. + 4: Mark only the correct path. If no path exists, say so. + 5: Mark only the correct path and display the number of steps. + If no path exists, say so. + Please make a selection: 4 + No path exists. + WWWWWWWW + W....W.W + WW.WW..E + W..WW.WW + W.W.W..W + S.W.WW.W + WWW....W + WWWWWWWW + + + ----jGRASP: operation complete. + + ----jGRASP exec: java MazeMaster_teacher + Enter the maze's filename (no .txt): maze1 + WWWWWWWW + W....W.W + WW.WW..W + W....W.W + W.W.WW.E + S.W.WW.W + WW.....W + WWWWWWWW + + Options: + 1: Mark all dots. + 2: Mark all dots and display the number of recursive calls. + 3: Mark only the correct path. + 4: Mark only the correct path. If no path exists, say so. + 5: Mark only the correct path and display the number of steps. + If no path exists, say so. + Please make a selection: 5 + Number of steps = 14 + WWWWWWWW + W....W.W + WW.WW..W + W***.W.W + W*W*WW*E + S*W*WW*W + WW.****W + WWWWWWWW + + + ----jGRASP: operation complete. + ********************************************/ \ No newline at end of file diff --git a/02 Recursion/07 MazeMaster/maze1.txt b/02 Recursion/07 MazeMaster/maze1.txt new file mode 100644 index 0000000..3509e67 --- /dev/null +++ b/02 Recursion/07 MazeMaster/maze1.txt @@ -0,0 +1,9 @@ +8 8 +WWWWWWWW +W....W.W +WW.WW..W +W....W.W +W.W.WW.E +S.W.WW.W +WW.....W +WWWWWWWW \ No newline at end of file diff --git a/02 Recursion/07 MazeMaster/maze2.txt b/02 Recursion/07 MazeMaster/maze2.txt new file mode 100644 index 0000000..af12a82 --- /dev/null +++ b/02 Recursion/07 MazeMaster/maze2.txt @@ -0,0 +1,7 @@ +6 10 +WWWSWWWWWW +W....W.W.W +WWWW.....W +W...W.WW.W +W.W....W.W +WEWWWWWWWW diff --git a/02 Recursion/07 MazeMaster/maze3.txt b/02 Recursion/07 MazeMaster/maze3.txt new file mode 100644 index 0000000..311c814 --- /dev/null +++ b/02 Recursion/07 MazeMaster/maze3.txt @@ -0,0 +1,5 @@ +3 4 +..WW +W..S +E.WW + diff --git a/02 Recursion/07 MazeMaster/maze4.txt b/02 Recursion/07 MazeMaster/maze4.txt new file mode 100644 index 0000000..db2356e --- /dev/null +++ b/02 Recursion/07 MazeMaster/maze4.txt @@ -0,0 +1,7 @@ +5 4 +.... +.... +..S. +.E.. +.... + diff --git a/02 Recursion/07 MazeMaster/mazeNoE.txt b/02 Recursion/07 MazeMaster/mazeNoE.txt new file mode 100644 index 0000000..d1de980 --- /dev/null +++ b/02 Recursion/07 MazeMaster/mazeNoE.txt @@ -0,0 +1,9 @@ +8 8 +WWWWWWWW +W....W.W +WW.WW..W +W...W.WW +W.W.W..W +S.W.WW.W +WWW....W +WWWWWWWW \ No newline at end of file diff --git a/02 Recursion/07 MazeMaster/mazeNoPath.txt b/02 Recursion/07 MazeMaster/mazeNoPath.txt new file mode 100644 index 0000000..5d7d114 --- /dev/null +++ b/02 Recursion/07 MazeMaster/mazeNoPath.txt @@ -0,0 +1,9 @@ +8 8 +WWWWWWWW +W....W.W +WW.WW..E +W..WW.WW +W.W.W..W +S.W.WW.W +WWW....W +WWWWWWWW \ No newline at end of file diff --git a/02 Recursion/07 MazeMaster/mazeNoS.txt b/02 Recursion/07 MazeMaster/mazeNoS.txt new file mode 100644 index 0000000..f0249f4 --- /dev/null +++ b/02 Recursion/07 MazeMaster/mazeNoS.txt @@ -0,0 +1,9 @@ +8 8 +WWWWWWWW +W....W.W +WW.WW..E +W...W.WW +W.W.W..W +#.W.WW.W +WWW....W +WWWWWWWW \ No newline at end of file diff --git a/02 Recursion/08 WinnerWinner/Board.class b/02 Recursion/08 WinnerWinner/Board.class new file mode 100644 index 0000000..9e32bdd Binary files /dev/null and b/02 Recursion/08 WinnerWinner/Board.class differ diff --git a/02 Recursion/08 WinnerWinner/Winner Winner.doc b/02 Recursion/08 WinnerWinner/Winner Winner.doc new file mode 100644 index 0000000..e306f6e Binary files /dev/null and b/02 Recursion/08 WinnerWinner/Winner Winner.doc differ diff --git a/02 Recursion/08 WinnerWinner/WinnerWinner.class b/02 Recursion/08 WinnerWinner/WinnerWinner.class new file mode 100644 index 0000000..7bffce7 Binary files /dev/null and b/02 Recursion/08 WinnerWinner/WinnerWinner.class differ diff --git a/02 Recursion/08 WinnerWinner/WinnerWinner.java b/02 Recursion/08 WinnerWinner/WinnerWinner.java new file mode 100644 index 0000000..28497ca --- /dev/null +++ b/02 Recursion/08 WinnerWinner/WinnerWinner.java @@ -0,0 +1,182 @@ +// Name: B6-24 +// Date: 10/18/19 +public class WinnerWinner +{ + public static void main(String[] args) + { + Board b = null; + b = new Board(3,4,"W-S-------X-"); + b.display(); + System.out.println("Shortest path is " + b.win()); //2 + + b = new Board(4,3,"S-W-----X-W-"); + b.display(); + System.out.println("Shortest path is " + b.win()); //4 + + b = new Board(3,4,"X-WS--W-W---"); + b.display(); + System.out.println("Shortest path is " + b.win()); //7 + + b = new Board(3,5,"W--WW-X----SWWW"); + b.display(); + System.out.println("Shortest path is " + b.win()); //1 + + b = new Board(3,3,"-SW-W-W-X"); //no path exists + b.display(); + System.out.println("Shortest path is " + b.win()); //-1 + + b = new Board(5,7,"-W------W-W-WX--S----W----W-W--W---"); //Example Board 1 + b.display(); + System.out.println("Shortest path is " + b.win()); //5 + + b = new Board(4,4,"-WX--W-W-WW-S---"); //Example Board -1 + b.display(); + System.out.println("Shortest path is " + b.win()); //5 + + //what other test cases should you test? + + } +} + +class Board +{ + private char[][] board; + private int maxPath; + + public Board(int rows, int cols, String line) + { + board = new char[rows][cols]; + maxPath = rows * cols; + int index = 0; + for (int i = 0; i < rows; i++) + for (int j = 0; j < cols; j++) + board[i][j] = line.charAt(index++); + } + + /** returns the length of the longest possible path in the Board */ + public int getMaxPath() + { + return maxPath; + } + + public void display() + { + if(board==null) + return; + System.out.println(); + for(int a = 0; a= board.length || c < 0 || c >= board[0].length) + return getMaxPath(); + if (board[r][c] == 'W' || board[r][c] == 'T') + return getMaxPath(); + if (board[r][c] == 'X') + return 0; + + + board[r][c] = 'T'; + + int left = 1 + check(r, c-1); + int right = 1 + check(r, c+1); + int up = 1 + check(r + 1, c); + int down = 1 + check(r -1, c); + + int path = getMaxPath(); + + if (path > left) + path = left; + if (path > right) + path = right; + if (path > up) + path = up; + if (path > down) + path = down; + + board[r][c] = '-'; + return path; + + + + } + + /** + * precondition: S and X exist in board + * postcondition: returns either the length of the path + * from S to X, or -1, if no path exists. + */ + public int win() + { + int path = getMaxPath(); + + for (int i = 0; i < board.length; i++) + for (int j = 0; j < board[0].length; j++) + if (board[i][j] == 'S') + path = check(i, j); + + + if (path == getMaxPath()) + return -1; + return path; + + } +} + + + + + +/************************ output ************ + W-S- + ---- + --X- + Shortest path is 2 + + S-W + --- + --X + -W- + Shortest path is 4 + + X-WS + --W- + W--- + Shortest path is 7 + + W--WW + -X--- + -SWWW + Shortest path is 1 + + -SW + -W- + W-X + Shortest path is -1 + + -W----- + -W-W-WX + --S---- + W----W- + W--W--- + Shortest path is 5 + + -WX- + -W-W + -WW- + S--- + Shortest path is -1 + ***************************************/ \ No newline at end of file diff --git a/02 Recursion/DS_Oct.pub b/02 Recursion/DS_Oct.pub new file mode 100644 index 0000000..d898b44 Binary files /dev/null and b/02 Recursion/DS_Oct.pub differ diff --git a/02 Recursion/Ethical Case Studies/Ethical Case Studies Directions.docx b/02 Recursion/Ethical Case Studies/Ethical Case Studies Directions.docx new file mode 100644 index 0000000..91a93ab Binary files /dev/null and b/02 Recursion/Ethical Case Studies/Ethical Case Studies Directions.docx differ diff --git a/02 Recursion/Ethical Case Studies/Ethical Case Studies.docx b/02 Recursion/Ethical Case Studies/Ethical Case Studies.docx new file mode 100644 index 0000000..a810f7a Binary files /dev/null and b/02 Recursion/Ethical Case Studies/Ethical Case Studies.docx differ diff --git a/02 Recursion/Practice-It Student Accounts.docx b/02 Recursion/Practice-It Student Accounts.docx new file mode 100644 index 0000000..b9ce873 Binary files /dev/null and b/02 Recursion/Practice-It Student Accounts.docx differ diff --git a/02 Recursion/Practice-It and Recursion.docx b/02 Recursion/Practice-It and Recursion.docx new file mode 100644 index 0000000..3ed09b7 Binary files /dev/null and b/02 Recursion/Practice-It and Recursion.docx differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O Analysis.doc b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O Analysis.doc new file mode 100644 index 0000000..ba9d499 Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O Analysis.doc differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O WS1.doc b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O WS1.doc new file mode 100644 index 0000000..dfae31c Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O WS1.doc differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O in Program.doc b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O in Program.doc new file mode 100644 index 0000000..def156c Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Big-O in Program.doc differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Search Linear and Binary.doc b/03 Sorting _ Big-O/01 Big-O _ Searches/Search Linear and Binary.doc new file mode 100644 index 0000000..f505a87 Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Search Linear and Binary.doc differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Searches.class b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches.class new file mode 100644 index 0000000..4be2275 Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches.class differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.class b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.class new file mode 100644 index 0000000..b17b9bd Binary files /dev/null and b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.class differ diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.java b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.java new file mode 100644 index 0000000..18808d2 --- /dev/null +++ b/03 Sorting _ Big-O/01 Big-O _ Searches/Searches_Driver.java @@ -0,0 +1,103 @@ +// Name: B6-24 +// Date: 10/23/19 +import java.io.*; //imports File +import java.util.*; //imports Scanner + +public class Searches_Driver +{ + private static int amount = 1325; + + public static void main(String[] args) throws Exception + { + String[] apple = input("declaration.txt"); + Arrays.sort(apple); + Scanner sc = new Scanner(System.in); + while(true) + { + System.out.print("Enter a word: "); + String target = sc.next(); //Liberty + if(target.equals("-1") ) + break; + Searches.reset(); + int found = Searches.linear(apple, target); + if(found == -1) + System.out.println(target + " was not found by the linear search."); + else + System.out.println("Linear Search found it at location "+found+" in " + Searches.getLinearCount()+" comparisons."); + int found2 = Searches.binary(apple, target); + if(found2 == -1) + System.out.println(target + " was not found by the binary search."); + else + System.out.println("Binary Search found it at location "+found2+" in " + Searches.getBinaryCount()+" comparisons."); + } + } + + public static String[] input(String filename) throws Exception + { + Scanner infile = new Scanner( new File(filename) ); + String[] array = new String[amount]; + for (int k =0; k end) + return -1; + + binaryCount++; + int middle = start + (end - start) / 2; + int comp = target.compareTo(array[middle]); + if (comp == 0) + return middle; + else if (comp < 0) + return binaryhelper(array, target, start, middle - 1); + else if (comp > 0) + return binaryhelper(array, target, middle + 1, end); + return -1; + } +} \ No newline at end of file diff --git a/03 Sorting _ Big-O/01 Big-O _ Searches/declaration.txt b/03 Sorting _ Big-O/01 Big-O _ Searches/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/03 Sorting _ Big-O/01 Big-O _ Searches/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/03 Sorting _ Big-O/02 Selection Sort/Selection Sort.doc b/03 Sorting _ Big-O/02 Selection Sort/Selection Sort.doc new file mode 100644 index 0000000..63f4df8 Binary files /dev/null and b/03 Sorting _ Big-O/02 Selection Sort/Selection Sort.doc differ diff --git a/03 Sorting _ Big-O/02 Selection Sort/Selection.class b/03 Sorting _ Big-O/02 Selection Sort/Selection.class new file mode 100644 index 0000000..37aeac9 Binary files /dev/null and b/03 Sorting _ Big-O/02 Selection Sort/Selection.class differ diff --git a/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.class b/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.class new file mode 100644 index 0000000..4445f40 Binary files /dev/null and b/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.class differ diff --git a/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.java b/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.java new file mode 100644 index 0000000..5527145 --- /dev/null +++ b/03 Sorting _ Big-O/02 Selection Sort/SelectionSort_Driver.java @@ -0,0 +1,140 @@ +// Name: B6-24 +// Date: 10/25/19 + +import java.util.*; +import java.io.*; + +public class SelectionSort_Driver +{ + public static void main(String[] args) throws Exception + { + //Part 1, for doubles + int n = (int)(Math.random()*100)+20; + double[] array = new double[n]; + for(int k = 0; k < array.length; k++) + array[k] = Math.random()*100; + + Selection.sort(array); + print(array); + if( isAscending(array) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + System.out.println(); + + //Part 2, for Strings + int size = 100; + Scanner sc = new Scanner(new File("declaration.txt")); + Comparable[] arrayStr = new String[size]; + for(int k = 0; k < arrayStr.length; k++) + arrayStr[k] = sc.next(); + + Selection.sort(arrayStr); + print(arrayStr); + System.out.println(); + + if( isAscending(arrayStr) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + } + + public static void print(double[] a) + { + for(double d: a) //for-each + System.out.print(d+" "); + System.out.println(); + } + + public static void print(Object[] papaya) + { + for(Object abc : papaya) //for-each + System.out.print(abc+" "); + } + + public static boolean isAscending(double[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i] > a[i+1]) + return false; + + + return true; + } + + @SuppressWarnings("unchecked") + public static boolean isAscending(Comparable[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i].compareTo(a[i+1]) > 0) + return false; + + + return true; + + } +} +///////////////////////////////////////////////////// + +class Selection +{ + public static void sort(double[] array) + { + for (int upper = array.length - 1; 0 <= upper; upper--) + swap(array, findMax(array, upper), upper); + + } + + // upper controls where the inner loop of the Selection Sort ends + private static int findMax(double[] array, int upper) + { + double max = Double.MIN_VALUE; + int index = 0; + for(int i = 0; i <= upper; i++) { + if (array[i] > max) { + max = array[i]; + index = i; + } + } + + return index; + } + private static void swap(double[] array, int a, int b) + { + double temp = array[a]; + array[a] = array[b]; + array[b] = temp; + } + + /******* for Comparables ********************/ + @SuppressWarnings("unchecked") + public static void sort(Comparable[] array) + { + for (int upper = array.length - 1; 0 <= upper; upper--) + swap(array, findMax(array, upper), upper); + } + + @SuppressWarnings("unchecked") + public static int findMax(Comparable[] array, int upper) + { + Comparable max = array[0]; + int index = 0; + for(int i = 0; i <= upper; i++) { + if (max.compareTo(array[i]) <= 0) { + max = array[i]; + index = i; + } + } + + return index; + + + } + public static void swap(Object[] array, int a, int b) + { + Object temp = array[a]; + array[a] = array[b]; + array[b] = temp; + } +} + diff --git a/03 Sorting _ Big-O/02 Selection Sort/declaration.txt b/03 Sorting _ Big-O/02 Selection Sort/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/03 Sorting _ Big-O/02 Selection Sort/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/03 Sorting _ Big-O/03 Insertion Sort/Insertion Sort.doc b/03 Sorting _ Big-O/03 Insertion Sort/Insertion Sort.doc new file mode 100644 index 0000000..c17f067 Binary files /dev/null and b/03 Sorting _ Big-O/03 Insertion Sort/Insertion Sort.doc differ diff --git a/03 Sorting _ Big-O/03 Insertion Sort/Insertion.class b/03 Sorting _ Big-O/03 Insertion Sort/Insertion.class new file mode 100644 index 0000000..6df3f1a Binary files /dev/null and b/03 Sorting _ Big-O/03 Insertion Sort/Insertion.class differ diff --git a/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.class b/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.class new file mode 100644 index 0000000..ad8639a Binary files /dev/null and b/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.class differ diff --git a/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.java b/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.java new file mode 100644 index 0000000..5e05718 --- /dev/null +++ b/03 Sorting _ Big-O/03 Insertion Sort/InsertionSort_Driver.java @@ -0,0 +1,119 @@ + //Name: B6-24 + //Date: 10/25/19 + +import java.util.*; +import java.io.*; + +public class InsertionSort_Driver +{ + public static void main(String[] args) throws Exception + { + //Part 1, for doubles + int n = (int)(Math.random()*100)+20; + double[] array = new double[n]; + for(int k = 0; k < array.length; k++) + array[k] = Math.random()*100; + + Insertion.sort(array); + print(array); + + if( isAscending(array) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + System.out.println(); + + //Part 2, for Strings + int size = 100; + Scanner sc = new Scanner(new File("declaration.txt")); + Comparable[] arrayStr = new String[size]; + for(int k = 0; k < arrayStr.length; k++) + arrayStr[k] = sc.next(); + + Insertion.sort(arrayStr); + print(arrayStr); + System.out.println(); + + if( isAscending(arrayStr) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + } + + public static void print(double[] a) + { + for(double d: a) // for-each loop + System.out.print(d+" "); + System.out.println(); + } + + public static void print(Object[] papaya) + { + for(Object abc : papaya) + System.out.print(abc+" "); + } + + public static boolean isAscending(double[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i] > a[i+1]) + return false; + + + return true; + + } + + @SuppressWarnings("unchecked")//this removes the warning for Comparable + public static boolean isAscending(Comparable[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i].compareTo(a[i+1]) > 0) + return false; + + + return true; + + } +} + +//********************************************************** + +class Insertion +{ + public static void sort(double[] array) + { + for (int i = 1; i < array.length; ++i) + shift(array, i - 1, array[i]); + } + private static int shift(double[] array, int index, double value) + { + while (index >= 0 && array[index] > value) { + array[index + 1] = array[index]; + index--; + } + + array[index + 1] = value; + return index; + } + + @SuppressWarnings("unchecked") + public static void sort(Comparable[] array) + { + for (int i = 1; i < array.length; ++i) + shift(array, i - 1, array[i]); + } + + @SuppressWarnings("unchecked") + private static int shift(Comparable[] array, int index, Comparable value) + { + while (index >= 0 && array[index].compareTo(value) > 0) { + array[index + 1] = array[index]; + index--; + } + + array[index + 1] = value; + return index; + + } +} diff --git a/03 Sorting _ Big-O/03 Insertion Sort/declaration.txt b/03 Sorting _ Big-O/03 Insertion Sort/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/03 Sorting _ Big-O/03 Insertion Sort/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/03 Sorting _ Big-O/04 Merge Sort/Merge Sort Demo.docx b/03 Sorting _ Big-O/04 Merge Sort/Merge Sort Demo.docx new file mode 100644 index 0000000..e2fff51 Binary files /dev/null and b/03 Sorting _ Big-O/04 Merge Sort/Merge Sort Demo.docx differ diff --git a/03 Sorting _ Big-O/04 Merge Sort/Merge Sort.docx b/03 Sorting _ Big-O/04 Merge Sort/Merge Sort.docx new file mode 100644 index 0000000..575cbaa Binary files /dev/null and b/03 Sorting _ Big-O/04 Merge Sort/Merge Sort.docx differ diff --git a/03 Sorting _ Big-O/04 Merge Sort/MergeSort.class b/03 Sorting _ Big-O/04 Merge Sort/MergeSort.class new file mode 100644 index 0000000..c3d734e Binary files /dev/null and b/03 Sorting _ Big-O/04 Merge Sort/MergeSort.class differ diff --git a/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.class b/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.class new file mode 100644 index 0000000..d815001 Binary files /dev/null and b/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.class differ diff --git a/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.java b/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.java new file mode 100644 index 0000000..be67e56 --- /dev/null +++ b/03 Sorting _ Big-O/04 Merge Sort/MergeSort_Driver.java @@ -0,0 +1,285 @@ +// Name: B6-24 +// Date: 10/28/19 + +import java.util.*; +import java.io.*; + +public class MergeSort_Driver +{ + public static void main(String[] args) throws Exception + { + //Part 1, for doubles + //double[] array = {3,1,4,1,5,9,2,6}; // small example array from the MergeSort handout + int n = (int)(Math.random()*50+10); + double[] array = new double[n]; + for(int k = 0; k < array.length; k++) + array[k] = Math.random(); + + MergeSort.sort(array); + + print(array); + if( isAscending(array) ) + System.out.println("In order!"); + else + System.out.println("oops!"); + + //Part 2, for Comparables + int size = 100; + Scanner sc = new Scanner(new File("declaration.txt")); + Comparable[] arrayStr = new String[size]; + for(int k = 0; k < arrayStr.length; k++) + arrayStr[k] = sc.next(); + + MergeSort.sort(arrayStr); + print(arrayStr); + System.out.println(); + if( isAscending(arrayStr) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + } + + + public static void print(double[] a) + { + for(double number : a) + System.out.print(number+" "); + System.out.println(); + } + + public static boolean isAscending(double[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i] > a[i+1]) + return false; + + + return true; + + } + + public static void print(Object[] peach) + { + for(Object abc : peach) + System.out.print(abc+" "); + } + + @SuppressWarnings("unchecked") + public static boolean isAscending(Comparable[] a) + { + for (int i = 0; i < a.length - 1; i++) + if (a[i].compareTo(a[i+1]) > 0) + return false; + + + return true; + } +} +///////////////////////////////////////////// +// 15 Oct 07 +// MergeSort Code Handout +// from Lambert & Osborne, p. 482 - 485 + +class MergeSort +{ + private static final int CUTOFF = 10; // for small lists, recursion isn't worth it + + public static void sort(double[] array) + { + double[] copyBuffer = new double[array.length]; + mergeSortHelper(array, copyBuffer, 0, array.length - 1); + } + + /* array array that is being sorted + copyBuffer temp space needed during the merge process + low, high bounds of subarray + middle midpoint of subarray + */ + private static void mergeSortHelper(double[] array, double[] copyBuffer, + int low, int high) + { + if ( high - low < CUTOFF ) //switch to selection sort when + SelectionLowHigh.sort(array, low, high); //the list gets small enough + else { + if (low < high) + { + int middle = (low + high) / 2; + mergeSortHelper(array, copyBuffer, low, middle); + mergeSortHelper(array, copyBuffer, middle + 1, high); + merge(array, copyBuffer, low, middle, high); + } + } + } + + /* array array that is being sorted + copyBuffer temp space needed during the merge process + low beginning of first sorted subarray + middle end of first sorted subarray + middle + 1 beginning of second sorted subarray + high end of second sorted subarray + */ + public static void merge(double[] array, double[] copyBuffer, + int low, int middle, int high) + { + // Initialize i1 and i2 to the first items in each subarray + // Interleave items from the subarrays into the copyBuffer in such + // a way that order is maintained. + + + int r = middle - low + 1; + int l = high - middle; + + double[] right = new double[r]; + double[] left = new double[l]; + + for(int i = 0; i < r; ++i) + right[i] = array[low + i]; + for(int j = 0; j < l; ++j) + left[j] = array[middle + j + 1]; + + int i = 0, j = 0, k = 0; + + while (i < r && j < l) { + if (right[i] <= left[j]) { + copyBuffer[k] = right[i]; + i++; + } else { + copyBuffer[k] = left[j]; + j++; + } + + k++; + } + + while (i < r) { + copyBuffer[k] = right[i]; + i++; k++; + } + + while (j < l) { + copyBuffer[k] = left[j]; + j++; k++; + } + + //then copy the just-sorted values (from low to high) + // from the copyBuffer back to the array. + for (int m = 0; m < r + l; m++) + array[m + low] = copyBuffer[m]; + } + + @SuppressWarnings("unchecked")//this removes the warning for Comparable + public static void sort(Comparable[] array) + { + Comparable[] copyBuffer = new Comparable[array.length]; + mergeSortHelper(array, copyBuffer, 0, array.length - 1); + + } + + /* array array that is being sorted + copyBuffer temp space needed during the merge process + low, high bounds of subarray + middle midpoint of subarray */ + @SuppressWarnings("unchecked") + private static void mergeSortHelper(Comparable[] array, Comparable[] copyBuffer, int low, int high) + { + if (low < high) + { + int middle = (low + high) / 2; + mergeSortHelper(array, copyBuffer, low, middle); + mergeSortHelper(array, copyBuffer, middle + 1, high); + merge(array, copyBuffer, low, middle, high); + } + + } + + /* array array that is being sorted + copyBuffer temp space needed during the merge process + low beginning of first sorted subarray + middle end of first sorted subarray + middle + 1 beginning of second sorted subarray + high end of second sorted subarray */ + @SuppressWarnings("unchecked") + public static void merge(Comparable[] array, Comparable[] copyBuffer, + int low, int middle, int high) + { + // Initialize i1 and i2 to the first items in each subarray + // Interleave items from the subarrays into the copyBuffer in such + // a way that order is maintained. + + + int r = middle - low + 1; + int l = high - middle; + + Comparable[] right = new Comparable[r]; + Comparable[] left = new Comparable[l]; + + for(int i = 0; i < r; ++i) + right[i] = array[low + i]; + for(int j = 0; j < l; ++j) + left[j] = array[middle + j + 1]; + + int i = 0, j = 0, k = 0; + + while (i < r && j < l) { + if (right[i].compareTo(left[j]) < 0) { + copyBuffer[k] = right[i]; + i++; + } else { + copyBuffer[k] = left[j]; + j++; + } + + k++; + } + + while (i < r) { + copyBuffer[k] = right[i]; + i++; k++; + } + + while (j < l) { + copyBuffer[k] = left[j]; + j++; k++; + } + + //then copy the just-sorted values (from low to high) + // from the copyBuffer back to the array. + for (int m = 0; m < r + l; m++) + array[m + low] = copyBuffer[m]; + + } +} + +/*************************************************** +This is the extension. You will have to uncomment Lines 54-56 above. +***************************************************/ + +class SelectionLowHigh +{ + public static void sort(double[] array, int low, int high) + { + for (int upper = high; low <= upper; upper--) + swap(array, findMax(array, low, upper), upper); + } + private static int findMax(double[] array, int low, int upper) + { + double max = Double.MIN_VALUE; + int index = 0; + for(int i = low; i <= upper; i++) { + if (array[i] > max) { + max = array[i]; + index = i; + } + } + + return index; + + } + private static void swap(double[] array, int a, int b) + { + double temp = array[a]; + array[a] = array[b]; + array[b] = temp; + + } +} diff --git a/03 Sorting _ Big-O/04 Merge Sort/SelectionLowHigh.class b/03 Sorting _ Big-O/04 Merge Sort/SelectionLowHigh.class new file mode 100644 index 0000000..7333653 Binary files /dev/null and b/03 Sorting _ Big-O/04 Merge Sort/SelectionLowHigh.class differ diff --git a/03 Sorting _ Big-O/04 Merge Sort/declaration.txt b/03 Sorting _ Big-O/04 Merge Sort/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/03 Sorting _ Big-O/04 Merge Sort/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/03 Sorting _ Big-O/05 Quick Sort/QuickSort.class b/03 Sorting _ Big-O/05 Quick Sort/QuickSort.class new file mode 100644 index 0000000..96384cf Binary files /dev/null and b/03 Sorting _ Big-O/05 Quick Sort/QuickSort.class differ diff --git a/03 Sorting _ Big-O/05 Quick Sort/QuickSort.docx b/03 Sorting _ Big-O/05 Quick Sort/QuickSort.docx new file mode 100644 index 0000000..dfa8a2a Binary files /dev/null and b/03 Sorting _ Big-O/05 Quick Sort/QuickSort.docx differ diff --git a/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Demo.docx b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Demo.docx new file mode 100644 index 0000000..f77714e Binary files /dev/null and b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Demo.docx differ diff --git a/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.class b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.class new file mode 100644 index 0000000..9b4a4d6 Binary files /dev/null and b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.class differ diff --git a/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.java b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.java new file mode 100644 index 0000000..2a51e96 --- /dev/null +++ b/03 Sorting _ Big-O/05 Quick Sort/QuickSort_Driver.java @@ -0,0 +1,179 @@ +// Name: B6-24 +// Date: 10/30/19 + +import java.util.*; +import java.io.*; + +public class QuickSort_Driver +{ + public static void main(String[] args) throws Exception + { + //Part 1 for doubles + int n = (int)(Math.random()*50 + 10); + double[] array = new double[n]; + for(int k = 0; k < array.length; k++) + array[k] = Math.random(); + + QuickSort.sort(array); + print(array); + if( isAscending(array) ) + System.out.println("In order!"); + else + System.out.println("oops!"); + + //Part 2 for Comparables + int size = 100; + Scanner sc = new Scanner(new File("declaration.txt")); + Comparable[] arrayStr = new String[size]; + for(int k = 0; k < arrayStr.length; k++) + arrayStr[k] = sc.next(); + + QuickSort.sort(arrayStr); + print(arrayStr); + System.out.println(); + if( isAscending(arrayStr) ) + System.out.println("In order!"); + else + System.out.println("Out of order :-( "); + } + + public static void print(double[] a) + { + for(double number : a) //doing something to each element + System.out.print(number+" "); + System.out.println(); + } + + public static void print(Object[] grape) + { + for(Object fruit : grape) + System.out.print(fruit +" "); + } + + public static boolean isAscending(double[] a) + { + for(int i = 0; i < a.length - 1; i++) //we must access the index numbers + if(a[i] > a[i+1]) + return false; + return true; + } + + @SuppressWarnings("unchecked") + public static boolean isAscending(Comparable[] a) + { + for(int k = 1; k < a.length; k++) + if(a[k-1].compareTo(a[k]) > 0) + return false; + return true; + } +} + +class QuickSort +{ + public static void sort(double[] array) + { + sort(array, 0, array.length - 1); + } + private static void sort(double[] array, int first, int last) + { + int indexOfPivot; + if (first < last) // General case + { + indexOfPivot = rearrange(array, first, last); + sort(array, first, indexOfPivot - 1); // sort left side + sort(array, indexOfPivot + 1, last); // sort right side + } + } + + /* choose pivot and rearrange data so that + * array[first] ...array[splitPt - 1] <= pivot and + * array[splitPt + 1] ... array[last] >= pivot + */ + private static int rearrange(double[] array, int first, int last) + { + + int indexOfPivot = first; //save the index + double pivot = array[first]; //save the pivot + first++; + while (first <= last) + { + if(array[first] <= pivot) //if it's on the correct side, + first++; // move right + else if(array[last] >= pivot) //if it's on the correct side, + last--; // move left + else //if both on the wrong side, + { + swap(array, first, last); + first++; // then swap them, + last--; // update both right and left + + } + } + swap(array, last, indexOfPivot); // swap pivot with element at indexOfPivot + indexOfPivot = last; // set indexOfPivot to place where the halves meet + return indexOfPivot; + } + + private static void swap(double[] array, int a, int b) + { + double temp = array[a]; + array[a] = array[b]; + array[b] = temp; + } + + @SuppressWarnings("unchecked") + public static void sort(Comparable[] array) + { + sort(array, 0, array.length - 1); + + } + + @SuppressWarnings("unchecked") + private static void sort(Comparable[] array, int first, int last) + { + int indexOfPivot; + if (first < last) // General case + { + indexOfPivot = rearrange(array, first, last); + sort(array, first, indexOfPivot - 1); // sort left side + sort(array, indexOfPivot + 1, last); // sort right side + } + + } + + @SuppressWarnings("unchecked") + private static int rearrange(Comparable[] array, int first, int last) + { + int indexOfPivot = first; //save the index + Comparable pivot = array[first]; //save the pivot + first++; + while (first <= last) + { + if(array[first].compareTo(pivot) <= 0) //if it's on the correct side, + first++; // move right + else if(array[last].compareTo(pivot) >= 0) //if it's on the correct side, + last--; // move left + else //if both on the wrong side, + { + swap(array, first, last); + first++; // then swap them, + last--; // update both right and left + + } + } + swap(array, last, indexOfPivot); // swap pivot with element at indexOfPivot + indexOfPivot = last; // set indexOfPivot to place where the halves meet + return indexOfPivot; + + } + + @SuppressWarnings("unchecked") + private static void swap(Comparable[] array, int a, int b) + { + Comparable temp = array[a]; + array[a] = array[b]; + array[b] = temp; + + } +} + diff --git a/03 Sorting _ Big-O/05 Quick Sort/declaration.txt b/03 Sorting _ Big-O/05 Quick Sort/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/03 Sorting _ Big-O/05 Quick Sort/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Big-O Multiple Choice.doc b/03 Sorting _ Big-O/06 Big-O _ Widgets/Big-O Multiple Choice.doc new file mode 100644 index 0000000..9baa219 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Big-O Multiple Choice.doc differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Effect of Doubling.doc b/03 Sorting _ Big-O/06 Big-O _ Widgets/Effect of Doubling.doc new file mode 100644 index 0000000..b40685f Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Effect of Doubling.doc differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Insertion.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/Insertion.class new file mode 100644 index 0000000..5d77f77 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Insertion.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Know Thy Big-O.doc b/03 Sorting _ Big-O/06 Big-O _ Widgets/Know Thy Big-O.doc new file mode 100644 index 0000000..e92edd1 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Know Thy Big-O.doc differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/MergeSort.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/MergeSort.class new file mode 100644 index 0000000..f9973aa Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/MergeSort.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/QuickSort.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/QuickSort.class new file mode 100644 index 0000000..9e1dc26 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/QuickSort.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Selection.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/Selection.class new file mode 100644 index 0000000..5f4a5db Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Selection.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.class new file mode 100644 index 0000000..e2e3947 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.java b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.java new file mode 100644 index 0000000..38d9152 --- /dev/null +++ b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widget.java @@ -0,0 +1,64 @@ +// Name: B6-24 +// Date: 11/1/19 + +public class Widget implements Comparable +{ + //fields + private int myCubits, myHands; + + //constructors + public Widget() { + myCubits = 0; + myHands = 0; + } + + public Widget(int cubits, int hands) { + myCubits = cubits; + myHands = hands; + } + + public Widget(Widget w) { + myCubits = w.myCubits; + myHands = w.myHands; + } + + + //accessors and modifiers + int getCubits() { + return myCubits; + } + + int getHands() { + return myHands; + } + + void setCubits(int cubits) { + myCubits = cubits; + } + + void setHands(int hands) { + myHands = hands; + } + //compareTo and equals + public int compareTo(Widget other) { + int cubits = myCubits - other.myCubits; + if (cubits != 0) + return cubits; + else + return myHands - other.myHands; + } + + public boolean equals(Widget other) { + if (other.myCubits == myCubits && other.myHands == myHands) + return true; + + return false; + } + + //toString + + public String toString() { + return myCubits + " cubits " + myHands + " hands"; + } + +} diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets.doc b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets.doc new file mode 100644 index 0000000..62ac730 Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets.doc differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.class b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.class new file mode 100644 index 0000000..7c8492c Binary files /dev/null and b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.class differ diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.java b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.java new file mode 100644 index 0000000..e6befdb --- /dev/null +++ b/03 Sorting _ Big-O/06 Big-O _ Widgets/Widgets_Driver.java @@ -0,0 +1,168 @@ +// Name: B6-24 +// Date: 11/1/19 + +import java.io.*; +import java.util.*; + +public class Widgets_Driver +{ + public static final int numberOfWidgets = 57; + + public static void main(String[] args) throws Exception + { + // test the methods + Widget a = new Widget(); + System.out.println("Default widget A: " + a.toString()); + Widget b = new Widget(23, 10); + System.out.println("2-arg constructor B: " + b.toString()); + Widget c = new Widget(b); + System.out.println("Copy constructor C: " + c.toString()); + System.out.print("C's cubits = " + c.getCubits()); + System.out.println( " and hands = " + c.getHands()); + System.out.println("Test the equals methods: "); + System.out.println(" A equals B " + a.equals(b)); + System.out.println(" B equals C " + b.equals(c)); + + c.setCubits(3); + c.setHands(4); + System.out.print("C is reset to " + c.toString()); + + System.out.println("\nTest each sort on 57 Widgets"); + Comparable[] apple = input("widgets.txt"); + Scanner sc = new Scanner(System.in); + System.out.println(" 1 Selection Sort"); + System.out.println(" 2 Insertion Sort"); + System.out.println(" 3 Merge Sort"); + System.out.println(" 4 Quick Sort"); + System.out.print("Choose your sort: "); + int choice = Integer.parseInt(sc.next()); + System.out.println(); + switch( choice ) + { + case 1: // call your sort + Selection.sort(apple); + break; + case 2: // call your sort + Insertion.sort(apple); + break; + case 3: // call your sort + MergeSort.sort(apple); + break; + case 4: // call your sort + QuickSort.sort(apple); + break; + default: System.out.println("Wrong choice"); + } + print(apple); + } + + public static Comparable[] input(String filename) throws Exception + { + Scanner sc = null; + try { + sc = new Scanner(new File(filename)); + } catch(FileNotFoundException e) { + return new Comparable[0]; + } + + Comparable[] arr = new Comparable[57]; + int index = 0; + + for (int i = 0; i < 57; i++) { + int cubits = sc.nextInt(); + int hands = sc.nextInt(); + arr[index] = new Widget(cubits, hands); + + index++; + } + + return arr; + } + + public static void print(Object[] mango) + { + for (Object obj : mango) + System.out.println(obj); + } +} + + + + /*************************************** + + Default widget A: 0 cubits 0 hands + 2-arg constructor B: 23 cubits 10 hands + Copy constructor C: 23 cubits 10 hands + C's cubits = 23 and hands = 10 + Test the equals methods: + A equals B false + B equals C true + C is reset to 0 cubits 0 hands + + Test each sort on 57 Widgets + 1 Selection Sort + 2 Insertion Sort + 3 Merge Sort + 4 Quick Sort + Choose your sort: 2 + + 0 cubits 14 hands + 1 cubits 3 hands + 2 cubits 14 hands + 5 cubits 14 hands + 10 cubits 14 hands + 11 cubits 11 hands + 12 cubits 0 hands + 12 cubits 7 hands + 13 cubits 9 hands + 15 cubits 12 hands + 17 cubits 5 hands + 18 cubits 13 hands + 19 cubits 13 hands + 19 cubits 13 hands + 22 cubits 6 hands + 23 cubits 7 hands + 24 cubits 15 hands + 24 cubits 15 hands + 26 cubits 2 hands + 28 cubits 5 hands + 28 cubits 12 hands + 29 cubits 15 hands + 31 cubits 0 hands + 32 cubits 1 hands + 32 cubits 11 hands + 32 cubits 11 hands + 32 cubits 12 hands + 35 cubits 3 hands + 39 cubits 2 hands + 39 cubits 5 hands + 41 cubits 10 hands + 43 cubits 2 hands + 43 cubits 5 hands + 43 cubits 6 hands + 51 cubits 2 hands + 54 cubits 14 hands + 55 cubits 8 hands + 56 cubits 3 hands + 57 cubits 12 hands + 62 cubits 15 hands + 63 cubits 0 hands + 64 cubits 13 hands + 67 cubits 3 hands + 70 cubits 0 hands + 73 cubits 5 hands + 74 cubits 7 hands + 75 cubits 9 hands + 81 cubits 5 hands + 85 cubits 14 hands + 86 cubits 3 hands + 90 cubits 13 hands + 91 cubits 3 hands + 92 cubits 1 hands + 92 cubits 8 hands + 96 cubits 1 hands + 98 cubits 8 hands + 99 cubits 5 hands + + ----jGRASP: operation complete. + ************************************/ \ No newline at end of file diff --git a/03 Sorting _ Big-O/06 Big-O _ Widgets/widgets.txt b/03 Sorting _ Big-O/06 Big-O _ Widgets/widgets.txt new file mode 100644 index 0000000..1981e7d --- /dev/null +++ b/03 Sorting _ Big-O/06 Big-O _ Widgets/widgets.txt @@ -0,0 +1,114 @@ +64 +13 +15 +12 +67 +3 +10 +14 +32 +1 +5 +14 +39 +2 +29 +15 +12 +0 +12 +7 +70 +0 +19 +13 +63 +0 +24 +15 +0 +14 +31 +0 +43 +5 +18 +13 +74 +7 +43 +2 +32 +12 +55 +8 +73 +5 +96 +1 +75 +9 +98 +8 +81 +5 +57 +12 +51 +2 +24 +15 +85 +14 +13 +9 +32 +11 +43 +6 +19 +13 +2 +14 +92 +8 +62 +15 +86 +3 +39 +5 +91 +3 +35 +3 +28 +12 +90 +13 +17 +5 +92 +1 +23 +7 +11 +11 +1 +3 +54 +14 +32 +11 +41 +10 +99 +5 +56 +3 +22 +6 +26 +2 +28 +5 diff --git a/03 Sorting _ Big-O/DS_Oct.pub b/03 Sorting _ Big-O/DS_Oct.pub new file mode 100644 index 0000000..2a7f440 Binary files /dev/null and b/03 Sorting _ Big-O/DS_Oct.pub differ diff --git a/04 ListNode/01 ListLab1/ListLab1 support lecture.ppt b/04 ListNode/01 ListLab1/ListLab1 support lecture.ppt new file mode 100644 index 0000000..9689345 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListLab1 support lecture.ppt differ diff --git a/04 ListNode/01 ListLab1/ListLab1.class b/04 ListNode/01 ListLab1/ListLab1.class new file mode 100644 index 0000000..71621a3 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListLab1.class differ diff --git a/04 ListNode/01 ListLab1/ListLab1.java b/04 ListNode/01 ListLab1/ListLab1.java new file mode 100644 index 0000000..ee85c02 --- /dev/null +++ b/04 ListNode/01 ListLab1/ListLab1.java @@ -0,0 +1,156 @@ +// Name: B6-24 +// Date: 11/8/19 +import java.util.*; +public class ListLab1 +{ + public static void main(String[] args) + { + ListNode head = new ListNode("hello", null); + head = new ListNode("foo", head); + head = new ListNode("boo", head); + head = new ListNode("nonsense", head); + head = new ListNode("computer", + new ListNode("science", + new ListNode("java", + new ListNode("coffee", head) + ) + ) + ); + print(head); + print(head); + + /**** uncomment the code below for ListLab1 Assignment ****/ + + ListNode a = copyNode(head); + System.out.println("The head has a value \"" + head.getValue() + "\" at "+ head); + System.out.println("The copy of head has a value of \"" + a.getValue() + "\" at "+ a); + // + System.out.print("Copy the list: "); + ListNode copy = copyList(head); + print(copy); + // + System.out.print("The rest of the list: "); + ListNode theRest = rest(copy); + print(theRest); + // + System.out.println("First of the rest = " + first(theRest)); + System.out.println("Second of the rest = " + second(theRest)); + ListNode p = pointerToLast(theRest); + System.out.println("Pointer to Last = " + p.getValue()+ " at " + p); + ListNode c = copyOfLast(theRest); + System.out.println("Copy of Last = " + c.getValue()+ " at " + c); + // + Scanner in = new Scanner(System.in); + System.out.print("Insert what? "); + String x = in.next(); + theRest = insertFirst(theRest, x); + theRest = insertLast(theRest, x); + print(theRest); + } + public static void print(ListNode head) + { + System.out.print("["); + while(head != null) + { + System.out.print(head.getValue()); + head = head.getNext(); + if(head != null) + System.out.print(", "); + } + System.out.println("]"); + } + + /* enter your code here */ + + // returns a new node that is a copy of the argument node. + public static ListNode copyNode(ListNode arg) { + ListNode copy = new ListNode(arg.getValue(), arg.getNext()); + return copy; + } + + // returns a new list that is a copy of the original list. + // this method is recursive! + // example call: ListNode head2 = copyList(head); + public static ListNode copyList(ListNode arg) { + if (arg == null) + return arg; + + return new ListNode (arg.getValue(), copyList(arg.getNext())); + } + + //returns a new linked list containing copies of each node in + //the original list except the first node, maintaining the + //order of the original list. It is not correct to just + //return a pointer to the 2nd node of the original linked + //list. This method is recursive. + public static ListNode rest(ListNode h) { + if (h == null || h.getNext() == null) + return null; + + return new ListNode (h.getNext().getValue(), rest(h.getNext())); + } + // returns the value of the first node, or null if the list is empty + public static Object first(ListNode head) { + if (head != null) + return head.getValue(); + else + return null; + } + + // returns the value of the second node, or null if the list is empty or if there is only one node. // hint: second could call the first of rest. + public static Object second(ListNode head) { + return first(rest(head)); + } + + //returns a reference to the last node in the list, or null if the list is empty. + public static ListNode pointerToLast(ListNode head) { + if (head == null) + return null; + + ListNode pointer = head; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + + return pointer; + } + + //returns a copy of the last node (not just its value!). copyofLast can be recursive. + public static ListNode copyOfLast(ListNode head) { + if (head == null) + return head; + + return new ListNode(pointerToLast(head).getValue(), pointerToLast(head).getNext()); + } + + //returns a reference to a list whose first node's value is specified by the argument, and the + //first node's next links to the original list. + public static ListNode insertFirst(ListNode head, Object arg) { + ListNode temp = new ListNode(arg, head); + return temp; + } + + //returns a reference to a list whose last node's value is specified by the argument, such + //that this last node has been appended to the original list and had its next is set to null + public static ListNode insertLast(ListNode head, Object arg) { + ListNode last = pointerToLast(head); + last.setNext(new ListNode(arg, null)); + return head; + } +} + +/***************************************** + + [computer, science, java, coffee, nonsense, boo, foo, hello] + [computer, science, java, coffee, nonsense, boo, foo, hello] + The head has a value "computer" at ListNode@15db9742 + The copy of head has a value of "computer" at ListNode@6d06d69c + Copy the list: [computer, science, java, coffee, nonsense, boo, foo, hello] + The rest of the list: [science, java, coffee, nonsense, boo, foo, hello] + First of the rest = science + Second of the rest = java + Pointer to Last = hello at ListNode@7852e922 + Copy of Last = hello at ListNode@4e25154f + Insert what? p + [p, science, java, coffee, nonsense, boo, foo, hello, p] + + **********************************************/ \ No newline at end of file diff --git a/04 ListNode/01 ListLab1/ListLab1_ext.doc b/04 ListNode/01 ListLab1/ListLab1_ext.doc new file mode 100644 index 0000000..dc54aa7 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListLab1_ext.doc differ diff --git a/04 ListNode/01 ListLab1/ListNode Class.doc b/04 ListNode/01 ListLab1/ListNode Class.doc new file mode 100644 index 0000000..a0a7208 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListNode Class.doc differ diff --git a/04 ListNode/01 ListLab1/ListNode Lecture.doc b/04 ListNode/01 ListLab1/ListNode Lecture.doc new file mode 100644 index 0000000..702ecb9 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListNode Lecture.doc differ diff --git a/04 ListNode/01 ListLab1/ListNode.class b/04 ListNode/01 ListLab1/ListNode.class new file mode 100644 index 0000000..aaa68e5 Binary files /dev/null and b/04 ListNode/01 ListLab1/ListNode.class differ diff --git a/04 ListNode/01 ListLab1/ListNode.java b/04 ListNode/01 ListLab1/ListNode.java new file mode 100644 index 0000000..e29a2b8 --- /dev/null +++ b/04 ListNode/01 ListLab1/ListNode.java @@ -0,0 +1,27 @@ +//the College Board's standard ListNode class + public class ListNode + { + private Object value; + private ListNode next; + public ListNode(Object v, ListNode n) + { + value=v; + next=n; + } + public Object getValue() + { + return value; + } + public ListNode getNext() + { + return next; + } + public void setValue(Object newv) + { + value=newv; + } + public void setNext(ListNode newn) + { + next=newn; + } + } \ No newline at end of file diff --git a/04 ListNode/01a LinkedList Practice/Linked List Practice.doc b/04 ListNode/01a LinkedList Practice/Linked List Practice.doc new file mode 100644 index 0000000..08843d7 Binary files /dev/null and b/04 ListNode/01a LinkedList Practice/Linked List Practice.doc differ diff --git a/04 ListNode/01a LinkedList Practice/linked list 15-33-50.doc b/04 ListNode/01a LinkedList Practice/linked list 15-33-50.doc new file mode 100644 index 0000000..37024ef Binary files /dev/null and b/04 ListNode/01a LinkedList Practice/linked list 15-33-50.doc differ diff --git a/04 ListNode/01a LinkedList Practice/linked list MC.doc b/04 ListNode/01a LinkedList Practice/linked list MC.doc new file mode 100644 index 0000000..02df24b Binary files /dev/null and b/04 ListNode/01a LinkedList Practice/linked list MC.doc differ diff --git a/04 ListNode/02 ListLabReverse/02ReverseBuildNew.avi b/04 ListNode/02 ListLabReverse/02ReverseBuildNew.avi new file mode 100644 index 0000000..3989529 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/02ReverseBuildNew.avi differ diff --git a/04 ListNode/02 ListLabReverse/03iterateThreePointers.mp4 b/04 ListNode/02 ListLabReverse/03iterateThreePointers.mp4 new file mode 100644 index 0000000..2d6dcf1 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/03iterateThreePointers.mp4 differ diff --git a/04 ListNode/02 ListLabReverse/04recurTwoPointers.mp4 b/04 ListNode/02 ListLabReverse/04recurTwoPointers.mp4 new file mode 100644 index 0000000..471eb94 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/04recurTwoPointers.mp4 differ diff --git a/04 ListNode/02 ListLabReverse/05recurPointersAppend.mp4 b/04 ListNode/02 ListLabReverse/05recurPointersAppend.mp4 new file mode 100644 index 0000000..d1c6a3d Binary files /dev/null and b/04 ListNode/02 ListLabReverse/05recurPointersAppend.mp4 differ diff --git a/04 ListNode/02 ListLabReverse/ListLabReverse.class b/04 ListNode/02 ListLabReverse/ListLabReverse.class new file mode 100644 index 0000000..1564611 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/ListLabReverse.class differ diff --git a/04 ListNode/02 ListLabReverse/ListLabReverse.doc b/04 ListNode/02 ListLabReverse/ListLabReverse.doc new file mode 100644 index 0000000..2b861d8 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/ListLabReverse.doc differ diff --git a/04 ListNode/02 ListLabReverse/ListLabReverse.java b/04 ListNode/02 ListLabReverse/ListLabReverse.java new file mode 100644 index 0000000..934f163 --- /dev/null +++ b/04 ListNode/02 ListLabReverse/ListLabReverse.java @@ -0,0 +1,229 @@ +// Name: B6-24 +// Date: 11/8/19 + +/***************************************** +Demonstrates many ways to reverse a list made of ListNodes. +******************************************/ +public class ListLabReverse +{ + public static void main(String[] args) + { + ListNode head = new ListNode("hello", null); + head = new ListNode("foo", head); + head = new ListNode("boo", head); + head = new ListNode("nonsense", head); + head = new ListNode("computer", + new ListNode("science", + new ListNode("java", + new ListNode("coffee", head)))); + + System.out.print("print the original: \t\t\t\t"); + print(head); + + System.out.print("recur and print: \t\t\t\t\t"); + recurAndPrint(head); + + System.out.println(); + System.out.print("original is unchanged: \t\t\t\t"); + print(head); + + System.out.print("reverse by building a new list: \t"); + head = reverseBuildNew(head); + print(head); + + System.out.print("iterate with 3 pointers:\t\t\t"); + head = iterateThreePointers(head); + print(head); + + System.out.print("recur with 2 pointers: \t\t\t\t"); + head = recurTwoPointers(null, head); + print(head); + + System.out.print("recur with pointers and append: \t"); + head = recurPointersAppend(head); + print(head); + + System.out.print("Mind Bender reverse:\t\t\t\t\t"); + head = mindBender(head); + print(head); + } + + public static void print(ListNode head) + { + System.out.print("["); + while(head != null) + { + System.out.print(head.getValue()); + head = head.getNext(); + if(head != null) + System.out.print(", "); + } + + System.out.println("]"); + } + + /********************************************* + 1. This approach doesn't actually reverse the list. It only prints + the list in reverse order. recurAndPrint() prints the square + brackets and calls helper(). helper() is recursive. + ********************************************************/ + public static void recurAndPrint(ListNode h) + { + System.out.print("["); + helper(h); + System.out.print("]"); + + } + + private static void helper(ListNode p) + { + if (p == null) + return; + if (p.getNext() == null) + System.out.print(p.getValue()); + else { + helper(p.getNext()); + System.out.print(", " + p.getValue()); + } + + } + + /********************************************* + 2. This iterative method (for or while) produces a copy of the + reversed list. For each node going forward, make a new node and + link it to the list. The list will naturally be in reverse. + ***********************************************************/ + public static ListNode reverseBuildNew(ListNode head) + { + ListNode reverse = null; + for (ListNode pointer = head; pointer != null; pointer = pointer.getNext()) + reverse = new ListNode(pointer.getValue(), reverse); + + return reverse; + } + + /******************************************* + 3a. This iterative method (while) uses 3 pointers to reverse + the list in place. The two local pointers are called + prev and next. + ********************************************************/ + public static ListNode iterateThreePointers(ListNode head) + { + if(head == null) + return null; + ListNode prev = null, next = head.getNext(); + /* enter your code here */ + while (head != null) { + next = head.getNext(); + head.setNext(prev); + prev = head; + head = next; + } + + return prev; + } + + /************************************************** + 3b. This recursive method uses two pointers as arguments to reverse + the list in place. Each level creates and uses a third pointer, called "next". + ********************************************************/ + public static ListNode recurTwoPointers(ListNode prev, ListNode head) + { + if (head == null) { + return prev; + } else { + ListNode next = head.getNext(); + head.setNext(prev); + return recurTwoPointers(head, next); + } + } + + + /********************************************** + 3c. On each recursive level, find pointerToLast() and + nextToLast(). Make a new last. On way back, append() + one level to the other. + ********************************************************/ + public static ListNode recurPointersAppend(ListNode head) + { + if (head == null || head.getNext() == null) + return head; + + ListNode last = pointerToLast(head); + ListNode nextLast = nextToLast(head); + nextLast.setNext(null); + + return append(last, recurPointersAppend(head)); + } + + private static ListNode pointerToLast(ListNode head) + { + if (head == null) + return null; + + ListNode pointer = head; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + + return pointer; + } + + private static ListNode nextToLast(ListNode head) + { + if (head == null) + return null; + + ListNode pointer = head; + while (pointer.getNext().getNext() != null) + pointer = pointer.getNext(); + + return pointer; + } + + private static ListNode append(ListNode h1, ListNode h2) + { + if (h1 == null) + return null; + + ListNode temp = pointerToLast(h1); + temp.setNext(h2); + return temp; + } + + /********************************************** + 3d. This difficult method reverses the list in place, using one + local pointer. Start with pointerToLast(). The helper method + is recursive. + ********************************************************/ + public static ListNode mindBender(ListNode head) + { + ListNode temp = pointerToLast(head); + mindBenderHelper(head); + head.setNext(null); + return temp; + } + + public static void mindBenderHelper(ListNode head) + { + if (head == null || head.getNext() == null) + return; + + mindBenderHelper(head.getNext()); + ListNode rest = head.getNext(); + head.setNext(null); + rest.setNext(head); + } +} + +/******************************************** + print the original: [computer, science, java, coffee, nonsense, boo, foo, hello] + recur and print: [hello, foo, boo, nonsense, coffee, java, science, computer] + + original is unchanged: [computer, science, java, coffee, nonsense, boo, foo, hello] + reverse by building a new list: [hello, foo, boo, nonsense, coffee, java, science, computer] + iterate with 3 pointers: [computer, science, java, coffee, nonsense, boo, foo, hello] + recur with 2 pointers: [hello, foo, boo, nonsense, coffee, java, science, computer] + recur with pointers and append: [computer, science, java, coffee, nonsense, boo, foo, hello] + Mind Bender reverse: [hello, foo, boo, nonsense, coffee, java, science, computer] + +**************************************/ \ No newline at end of file diff --git a/04 ListNode/02 ListLabReverse/ListNode.class b/04 ListNode/02 ListLabReverse/ListNode.class new file mode 100644 index 0000000..aaa68e5 Binary files /dev/null and b/04 ListNode/02 ListLabReverse/ListNode.class differ diff --git a/04 ListNode/02 ListLabReverse/ListNode.java b/04 ListNode/02 ListLabReverse/ListNode.java new file mode 100644 index 0000000..e29a2b8 --- /dev/null +++ b/04 ListNode/02 ListLabReverse/ListNode.java @@ -0,0 +1,27 @@ +//the College Board's standard ListNode class + public class ListNode + { + private Object value; + private ListNode next; + public ListNode(Object v, ListNode n) + { + value=v; + next=n; + } + public Object getValue() + { + return value; + } + public ListNode getNext() + { + return next; + } + public void setValue(Object newv) + { + value=newv; + } + public void setNext(ListNode newn) + { + next=newn; + } + } \ No newline at end of file diff --git a/04 ListNode/03 Josephus/J_names.txt b/04 ListNode/03 Josephus/J_names.txt new file mode 100644 index 0000000..f4d8bb6 --- /dev/null +++ b/04 ListNode/03 Josephus/J_names.txt @@ -0,0 +1,4945 @@ +Aaren +Aarika +Abagael +Abagail +Abbe +Abbey +Abbi +Abbie +Abby +Abbye +Abigael +Abigail +Abigale +Abra +Ada +Adah +Adaline +Adan +Adara +Adda +Addi +Addia +Addie +Addy +Adel +Adela +Adelaida +Adelaide +Adele +Adelheid +Adelice +Adelina +Adelind +Adeline +Adella +Adelle +Adena +Adey +Adi +Adiana +Adina +Adora +Adore +Adoree +Adorne +Adrea +Adria +Adriaens +Adrian +Adriana +Adriane +Adrianna +Adrianne +Adriena +Adrienne +Aeriel +Aeriela +Aeriell +Afton +Ag +Agace +Agata +Agatha +Agathe +Aggi +Aggie +Aggy +Agna +Agnella +Agnes +Agnese +Agnesse +Agneta +Agnola +Agretha +Aida +Aidan +Aigneis +Aila +Aile +Ailee +Aileen +Ailene +Ailey +Aili +Ailina +Ailis +Ailsun +Ailyn +Aime +Aimee +Aimil +Aindrea +Ainslee +Ainsley +Ainslie +Ajay +Alaine +Alameda +Alana +Alanah +Alane +Alanna +Alayne +Alberta +Albertina +Albertine +Albina +Alecia +Aleda +Aleece +Aleen +Alejandra +Alejandrina +Alena +Alene +Alessandra +Aleta +Alethea +Alex +Alexa +Alexandra +Alexandrina +Alexi +Alexia +Alexina +Alexine +Alexis +Alfi +Alfie +Alfreda +Alfy +Ali +Alia +Alica +Alice +Alicea +Alicia +Alida +Alidia +Alie +Alika +Alikee +Alina +Aline +Alis +Alisa +Alisha +Alison +Alissa +Alisun +Alix +Aliza +Alla +Alleen +Allegra +Allene +Alli +Allianora +Allie +Allina +Allis +Allison +Allissa +Allix +Allsun +Allx +Ally +Allyce +Allyn +Allys +Allyson +Alma +Almeda +Almeria +Almeta +Almira +Almire +Aloise +Aloisia +Aloysia +Alta +Althea +Alvera +Alverta +Alvina +Alvinia +Alvira +Alyce +Alyda +Alys +Alysa +Alyse +Alysia +Alyson +Alyss +Alyssa +Amabel +Amabelle +Amalea +Amalee +Amaleta +Amalia +Amalie +Amalita +Amalle +Amanda +Amandi +Amandie +Amandy +Amara +Amargo +Amata +Amber +Amberly +Ambur +Ame +Amelia +Amelie +Amelina +Ameline +Amelita +Ami +Amie +Amii +Amil +Amitie +Amity +Ammamaria +Amy +Amye +Ana +Anabal +Anabel +Anabella +Anabelle +Analiese +Analise +Anallese +Anallise +Anastasia +Anastasie +Anastassia +Anatola +Andee +Andeee +Anderea +Andi +Andie +Andra +Andrea +Andreana +Andree +Andrei +Andria +Andriana +Andriette +Andromache +Andy +Anestassia +Anet +Anett +Anetta +Anette +Ange +Angel +Angela +Angele +Angelia +Angelica +Angelika +Angelina +Angeline +Angelique +Angelita +Angelle +Angie +Angil +Angy +Ania +Anica +Anissa +Anita +Anitra +Anjanette +Anjela +Ann +Ann-Marie +Anna +Anna-Diana +Anna-Diane +Anna-Maria +Annabal +Annabel +Annabela +Annabell +Annabella +Annabelle +Annadiana +Annadiane +Annalee +Annaliese +Annalise +Annamaria +Annamarie +Anne +Anne-Corinne +Anne-Marie +Annecorinne +Anneliese +Annelise +Annemarie +Annetta +Annette +Anni +Annice +Annie +Annis +Annissa +Annmaria +Annmarie +Annnora +Annora +Anny +Anselma +Ansley +Anstice +Anthe +Anthea +Anthia +Anthiathia +Antoinette +Antonella +Antonetta +Antonia +Antonie +Antonietta +Antonina +Anya +Appolonia +April +Aprilette +Ara +Arabel +Arabela +Arabele +Arabella +Arabelle +Arda +Ardath +Ardeen +Ardelia +Ardelis +Ardella +Ardelle +Arden +Ardene +Ardenia +Ardine +Ardis +Ardisj +Ardith +Ardra +Ardyce +Ardys +Ardyth +Aretha +Ariadne +Ariana +Aridatha +Ariel +Ariela +Ariella +Arielle +Arlana +Arlee +Arleen +Arlen +Arlena +Arlene +Arleta +Arlette +Arleyne +Arlie +Arliene +Arlina +Arlinda +Arline +Arluene +Arly +Arlyn +Arlyne +Aryn +Ashely +Ashia +Ashien +Ashil +Ashla +Ashlan +Ashlee +Ashleigh +Ashlen +Ashley +Ashli +Ashlie +Ashly +Asia +Astra +Astrid +Astrix +Atalanta +Athena +Athene +Atlanta +Atlante +Auberta +Aubine +Aubree +Aubrette +Aubrey +Aubrie +Aubry +Audi +Audie +Audra +Audre +Audrey +Audrie +Audry +Audrye +Audy +Augusta +Auguste +Augustina +Augustine +Aundrea +Aura +Aurea +Aurel +Aurelea +Aurelia +Aurelie +Auria +Aurie +Aurilia +Aurlie +Auroora +Aurora +Aurore +Austin +Austina +Austine +Ava +Aveline +Averil +Averyl +Avie +Avis +Aviva +Avivah +Avril +Avrit +Ayn +Bab +Babara +Babb +Babbette +Babbie +Babette +Babita +Babs +Bambi +Bambie +Bamby +Barb +Barbabra +Barbara +Barbara-Anne +Barbaraanne +Barbe +Barbee +Barbette +Barbey +Barbi +Barbie +Barbra +Barby +Bari +Barrie +Barry +Basia +Bathsheba +Batsheva +Bea +Beatrice +Beatrisa +Beatrix +Beatriz +Bebe +Becca +Becka +Becki +Beckie +Becky +Bee +Beilul +Beitris +Bekki +Bel +Belia +Belicia +Belinda +Belita +Bell +Bella +Bellanca +Belle +Bellina +Belva +Belvia +Bendite +Benedetta +Benedicta +Benedikta +Benetta +Benita +Benni +Bennie +Benny +Benoite +Berenice +Beret +Berget +Berna +Bernadene +Bernadette +Bernadina +Bernadine +Bernardina +Bernardine +Bernelle +Bernete +Bernetta +Bernette +Berni +Bernice +Bernie +Bernita +Berny +Berri +Berrie +Berry +Bert +Berta +Berte +Bertha +Berthe +Berti +Bertie +Bertina +Bertine +Berty +Beryl +Beryle +Bess +Bessie +Bessy +Beth +Bethanne +Bethany +Bethena +Bethina +Betsey +Betsy +Betta +Bette +Bette-Ann +Betteann +Betteanne +Betti +Bettina +Bettine +Betty +Bettye +Beulah +Bev +Beverie +Beverlee +Beverley +Beverlie +Beverly +Bevvy +Bianca +Bianka +Bibbie +Bibby +Bibbye +Bibi +Biddie +Biddy +Bidget +Bili +Bill +Billi +Billie +Billy +Billye +Binni +Binnie +Binny +Bird +Birdie +Birgit +Birgitta +Blair +Blaire +Blake +Blakelee +Blakeley +Blanca +Blanch +Blancha +Blanche +Blinni +Blinnie +Blinny +Bliss +Blisse +Blithe +Blondell +Blondelle +Blondie +Blondy +Blythe +Bobbe +Bobbee +Bobbette +Bobbi +Bobbie +Bobby +Bobbye +Bobette +Bobina +Bobine +Bobinette +Bonita +Bonnee +Bonni +Bonnibelle +Bonnie +Bonny +Brana +Brandais +Brande +Brandea +Brandi +Brandice +Brandie +Brandise +Brandy +Breanne +Brear +Bree +Breena +Bren +Brena +Brenda +Brenn +Brenna +Brett +Bria +Briana +Brianna +Brianne +Bride +Bridget +Bridgette +Bridie +Brier +Brietta +Brigid +Brigida +Brigit +Brigitta +Brigitte +Brina +Briney +Brinn +Brinna +Briny +Brit +Brita +Britney +Britni +Britt +Britta +Brittan +Brittaney +Brittani +Brittany +Britte +Britteny +Brittne +Brittney +Brittni +Brook +Brooke +Brooks +Brunhilda +Brunhilde +Bryana +Bryn +Bryna +Brynn +Brynna +Brynne +Buffy +Bunni +Bunnie +Bunny +Cacilia +Cacilie +Cahra +Cairistiona +Caitlin +Caitrin +Cal +Calida +Calla +Calley +Calli +Callida +Callie +Cally +Calypso +Cam +Camala +Camel +Camella +Camellia +Cami +Camila +Camile +Camilla +Camille +Cammi +Cammie +Cammy +Candace +Candi +Candice +Candida +Candide +Candie +Candis +Candra +Candy +Caprice +Cara +Caralie +Caren +Carena +Caresa +Caressa +Caresse +Carey +Cari +Caria +Carie +Caril +Carilyn +Carin +Carina +Carine +Cariotta +Carissa +Carita +Caritta +Carla +Carlee +Carleen +Carlen +Carlene +Carley +Carlie +Carlin +Carlina +Carline +Carlita +Carlota +Carlotta +Carly +Carlye +Carlyn +Carlynn +Carlynne +Carma +Carmel +Carmela +Carmelia +Carmelina +Carmelita +Carmella +Carmelle +Carmen +Carmencita +Carmina +Carmine +Carmita +Carmon +Caro +Carol +Carol-Jean +Carola +Carolan +Carolann +Carole +Carolee +Carolin +Carolina +Caroline +Caroljean +Carolyn +Carolyne +Carolynn +Caron +Carree +Carri +Carrie +Carrissa +Carroll +Carry +Cary +Caryl +Caryn +Casandra +Casey +Casi +Casie +Cass +Cassandra +Cassandre +Cassandry +Cassaundra +Cassey +Cassi +Cassie +Cassondra +Cassy +Catarina +Cate +Caterina +Catha +Catharina +Catharine +Cathe +Cathee +Catherin +Catherina +Catherine +Cathi +Cathie +Cathleen +Cathlene +Cathrin +Cathrine +Cathryn +Cathy +Cathyleen +Cati +Catie +Catina +Catlaina +Catlee +Catlin +Catrina +Catriona +Caty +Caye +Cayla +Cecelia +Cecil +Cecile +Ceciley +Cecilia +Cecilla +Cecily +Ceil +Cele +Celene +Celesta +Celeste +Celestia +Celestina +Celestine +Celestyn +Celestyna +Celia +Celie +Celina +Celinda +Celine +Celinka +Celisse +Celka +Celle +Cesya +Chad +Chanda +Chandal +Chandra +Channa +Chantal +Chantalle +Charil +Charin +Charis +Charissa +Charisse +Charita +Charity +Charla +Charlean +Charleen +Charlena +Charlene +Charline +Charlot +Charlotta +Charlotte +Charmain +Charmaine +Charmane +Charmian +Charmine +Charmion +Charo +Charyl +Chastity +Chelsae +Chelsea +Chelsey +Chelsie +Chelsy +Cher +Chere +Cherey +Cheri +Cherianne +Cherice +Cherida +Cherie +Cherilyn +Cherilynn +Cherin +Cherise +Cherish +Cherlyn +Cherri +Cherrita +Cherry +Chery +Cherye +Cheryl +Cheslie +Chiarra +Chickie +Chicky +Chiquia +Chiquita +Chlo +Chloe +Chloette +Chloris +Chris +Chrissie +Chrissy +Christa +Christabel +Christabella +Christal +Christalle +Christan +Christean +Christel +Christen +Christi +Christian +Christiana +Christiane +Christie +Christin +Christina +Christine +Christy +Christye +Christyna +Chrysa +Chrysler +Chrystal +Chryste +Chrystel +Cicely +Cicily +Ciel +Cilka +Cinda +Cindee +Cindelyn +Cinderella +Cindi +Cindie +Cindra +Cindy +Cinnamon +Cissiee +Cissy +Clair +Claire +Clara +Clarabelle +Clare +Claresta +Clareta +Claretta +Clarette +Clarey +Clari +Claribel +Clarice +Clarie +Clarinda +Clarine +Clarissa +Clarisse +Clarita +Clary +Claude +Claudelle +Claudetta +Claudette +Claudia +Claudie +Claudina +Claudine +Clea +Clem +Clemence +Clementia +Clementina +Clementine +Clemmie +Clemmy +Cleo +Cleopatra +Clerissa +Clio +Clo +Cloe +Cloris +Clotilda +Clovis +Codee +Codi +Codie +Cody +Coleen +Colene +Coletta +Colette +Colleen +Collen +Collete +Collette +Collie +Colline +Colly +Con +Concettina +Conchita +Concordia +Conni +Connie +Conny +Consolata +Constance +Constancia +Constancy +Constanta +Constantia +Constantina +Constantine +Consuela +Consuelo +Cookie +Cora +Corabel +Corabella +Corabelle +Coral +Coralie +Coraline +Coralyn +Cordelia +Cordelie +Cordey +Cordi +Cordie +Cordula +Cordy +Coreen +Corella +Corenda +Corene +Coretta +Corette +Corey +Cori +Corie +Corilla +Corina +Corine +Corinna +Corinne +Coriss +Corissa +Corliss +Corly +Cornela +Cornelia +Cornelle +Cornie +Corny +Correna +Correy +Corri +Corrianne +Corrie +Corrina +Corrine +Corrinne +Corry +Cortney +Cory +Cosetta +Cosette +Costanza +Courtenay +Courtnay +Courtney +Crin +Cris +Crissie +Crissy +Crista +Cristabel +Cristal +Cristen +Cristi +Cristie +Cristin +Cristina +Cristine +Cristionna +Cristy +Crysta +Crystal +Crystie +Cthrine +Cyb +Cybil +Cybill +Cymbre +Cynde +Cyndi +Cyndia +Cyndie +Cyndy +Cynthea +Cynthia +Cynthie +Cynthy +Dacey +Dacia +Dacie +Dacy +Dael +Daffi +Daffie +Daffy +Dagmar +Dahlia +Daile +Daisey +Daisi +Daisie +Daisy +Dale +Dalenna +Dalia +Dalila +Dallas +Daloris +Damara +Damaris +Damita +Dana +Danell +Danella +Danette +Dani +Dania +Danica +Danice +Daniela +Daniele +Daniella +Danielle +Danika +Danila +Danit +Danita +Danna +Danni +Dannie +Danny +Dannye +Danya +Danyelle +Danyette +Daphene +Daphna +Daphne +Dara +Darb +Darbie +Darby +Darcee +Darcey +Darci +Darcie +Darcy +Darda +Dareen +Darell +Darelle +Dari +Daria +Darice +Darla +Darleen +Darlene +Darline +Darlleen +Daron +Darrelle +Darryl +Darsey +Darsie +Darya +Daryl +Daryn +Dasha +Dasi +Dasie +Dasya +Datha +Daune +Daveen +Daveta +Davida +Davina +Davine +Davita +Dawn +Dawna +Dayle +Dayna +Ddene +De +Deana +Deane +Deanna +Deanne +Deb +Debbi +Debbie +Debby +Debee +Debera +Debi +Debor +Debora +Deborah +Debra +Dede +Dedie +Dedra +Dee +Dee Dee +Deeann +Deeanne +Deedee +Deena +Deerdre +Deeyn +Dehlia +Deidre +Deina +Deirdre +Del +Dela +Delcina +Delcine +Delia +Delila +Delilah +Delinda +Dell +Della +Delly +Delora +Delores +Deloria +Deloris +Delphine +Delphinia +Demeter +Demetra +Demetria +Demetris +Dena +Deni +Denice +Denise +Denna +Denni +Dennie +Denny +Deny +Denys +Denyse +Deonne +Desdemona +Desirae +Desiree +Desiri +Deva +Devan +Devi +Devin +Devina +Devinne +Devon +Devondra +Devonna +Devonne +Devora +Di +Diahann +Dian +Diana +Diandra +Diane +Diane-Marie +Dianemarie +Diann +Dianna +Dianne +Diannne +Didi +Dido +Diena +Dierdre +Dina +Dinah +Dinnie +Dinny +Dion +Dione +Dionis +Dionne +Dita +Dix +Dixie +Dniren +Dode +Dodi +Dodie +Dody +Doe +Doll +Dolley +Dolli +Dollie +Dolly +Dolores +Dolorita +Doloritas +Domeniga +Dominga +Domini +Dominica +Dominique +Dona +Donella +Donelle +Donetta +Donia +Donica +Donielle +Donna +Donnamarie +Donni +Donnie +Donny +Dora +Doralia +Doralin +Doralyn +Doralynn +Doralynne +Dore +Doreen +Dorelia +Dorella +Dorelle +Dorena +Dorene +Doretta +Dorette +Dorey +Dori +Doria +Dorian +Dorice +Dorie +Dorine +Doris +Dorisa +Dorise +Dorita +Doro +Dorolice +Dorolisa +Dorotea +Doroteya +Dorothea +Dorothee +Dorothy +Dorree +Dorri +Dorrie +Dorris +Dorry +Dorthea +Dorthy +Dory +Dosi +Dot +Doti +Dotti +Dottie +Dotty +Dre +Dreddy +Dredi +Drona +Dru +Druci +Drucie +Drucill +Drucy +Drusi +Drusie +Drusilla +Drusy +Dulce +Dulcea +Dulci +Dulcia +Dulciana +Dulcie +Dulcine +Dulcinea +Dulcy +Dulsea +Dusty +Dyan +Dyana +Dyane +Dyann +Dyanna +Dyanne +Dyna +Dynah +Eachelle +Eada +Eadie +Eadith +Ealasaid +Eartha +Easter +Eba +Ebba +Ebonee +Ebony +Eda +Eddi +Eddie +Eddy +Ede +Edee +Edeline +Eden +Edi +Edie +Edin +Edita +Edith +Editha +Edithe +Ediva +Edna +Edwina +Edy +Edyth +Edythe +Effie +Eileen +Eilis +Eimile +Eirena +Ekaterina +Elaina +Elaine +Elana +Elane +Elayne +Elberta +Elbertina +Elbertine +Eleanor +Eleanora +Eleanore +Electra +Eleen +Elena +Elene +Eleni +Elenore +Eleonora +Eleonore +Elfie +Elfreda +Elfrida +Elfrieda +Elga +Elianora +Elianore +Elicia +Elie +Elinor +Elinore +Elisa +Elisabet +Elisabeth +Elisabetta +Elise +Elisha +Elissa +Elita +Eliza +Elizabet +Elizabeth +Elka +Elke +Ella +Elladine +Elle +Ellen +Ellene +Ellette +Elli +Ellie +Ellissa +Elly +Ellyn +Ellynn +Elmira +Elna +Elnora +Elnore +Eloisa +Eloise +Elonore +Elora +Elsa +Elsbeth +Else +Elset +Elsey +Elsi +Elsie +Elsinore +Elspeth +Elsy +Elva +Elvera +Elvina +Elvira +Elwira +Elyn +Elyse +Elysee +Elysha +Elysia +Elyssa +Em +Ema +Emalee +Emalia +Emelda +Emelia +Emelina +Emeline +Emelita +Emelyne +Emera +Emilee +Emili +Emilia +Emilie +Emiline +Emily +Emlyn +Emlynn +Emlynne +Emma +Emmalee +Emmaline +Emmalyn +Emmalynn +Emmalynne +Emmeline +Emmey +Emmi +Emmie +Emmy +Emmye +Emogene +Emyle +Emylee +Engracia +Enid +Enrica +Enrichetta +Enrika +Enriqueta +Eolanda +Eolande +Eran +Erda +Erena +Erica +Ericha +Ericka +Erika +Erin +Erina +Erinn +Erinna +Erma +Ermengarde +Ermentrude +Ermina +Erminia +Erminie +Erna +Ernaline +Ernesta +Ernestine +Ertha +Eryn +Esma +Esmaria +Esme +Esmeralda +Essa +Essie +Essy +Esta +Estel +Estele +Estell +Estella +Estelle +Ester +Esther +Estrella +Estrellita +Ethel +Ethelda +Ethelin +Ethelind +Etheline +Ethelyn +Ethyl +Etta +Etti +Ettie +Etty +Eudora +Eugenia +Eugenie +Eugine +Eula +Eulalie +Eunice +Euphemia +Eustacia +Eva +Evaleen +Evangelia +Evangelin +Evangelina +Evangeline +Evania +Evanne +Eve +Eveleen +Evelina +Eveline +Evelyn +Evey +Evie +Evita +Evonne +Evvie +Evvy +Evy +Eyde +Eydie +Ezmeralda +Fae +Faina +Faith +Fallon +Fan +Fanchette +Fanchon +Fancie +Fancy +Fanechka +Fania +Fanni +Fannie +Fanny +Fanya +Fara +Farah +Farand +Farica +Farra +Farrah +Farrand +Faun +Faunie +Faustina +Faustine +Fawn +Fawne +Fawnia +Fay +Faydra +Faye +Fayette +Fayina +Fayre +Fayth +Faythe +Federica +Fedora +Felecia +Felicdad +Felice +Felicia +Felicity +Felicle +Felipa +Felisha +Felita +Feliza +Fenelia +Feodora +Ferdinanda +Ferdinande +Fern +Fernanda +Fernande +Fernandina +Ferne +Fey +Fiann +Fianna +Fidela +Fidelia +Fidelity +Fifi +Fifine +Filia +Filide +Filippa +Fina +Fiona +Fionna +Fionnula +Fiorenze +Fleur +Fleurette +Flo +Flor +Flora +Florance +Flore +Florella +Florence +Florencia +Florentia +Florenza +Florette +Flori +Floria +Florida +Florie +Florina +Florinda +Floris +Florri +Florrie +Florry +Flory +Flossi +Flossie +Flossy +Flss +Fran +Francene +Frances +Francesca +Francine +Francisca +Franciska +Francoise +Francyne +Frank +Frankie +Franky +Franni +Frannie +Franny +Frayda +Fred +Freda +Freddi +Freddie +Freddy +Fredelia +Frederica +Fredericka +Frederique +Fredi +Fredia +Fredra +Fredrika +Freida +Frieda +Friederike +Fulvia +Gabbey +Gabbi +Gabbie +Gabey +Gabi +Gabie +Gabriel +Gabriela +Gabriell +Gabriella +Gabrielle +Gabriellia +Gabrila +Gaby +Gae +Gael +Gail +Gale +Galina +Garland +Garnet +Garnette +Gates +Gavra +Gavrielle +Gay +Gaye +Gayel +Gayla +Gayle +Gayleen +Gaylene +Gaynor +Gelya +Gena +Gene +Geneva +Genevieve +Genevra +Genia +Genna +Genni +Gennie +Gennifer +Genny +Genovera +Genvieve +George +Georgeanna +Georgeanne +Georgena +Georgeta +Georgetta +Georgette +Georgia +Georgiana +Georgianna +Georgianne +Georgie +Georgina +Georgine +Geralda +Geraldine +Gerda +Gerhardine +Geri +Gerianna +Gerianne +Gerladina +Germain +Germaine +Germana +Gerri +Gerrie +Gerrilee +Gerry +Gert +Gerta +Gerti +Gertie +Gertrud +Gertruda +Gertrude +Gertrudis +Gerty +Giacinta +Giana +Gianina +Gianna +Gigi +Gilberta +Gilberte +Gilbertina +Gilbertine +Gilda +Gilemette +Gill +Gillan +Gilli +Gillian +Gillie +Gilligan +Gilly +Gina +Ginelle +Ginevra +Ginger +Ginni +Ginnie +Ginnifer +Ginny +Giorgia +Giovanna +Gipsy +Giralda +Gisela +Gisele +Gisella +Giselle +Giuditta +Giulia +Giulietta +Giustina +Gizela +Glad +Gladi +Gladys +Gleda +Glen +Glenda +Glenine +Glenn +Glenna +Glennie +Glennis +Glori +Gloria +Gloriana +Gloriane +Glory +Glyn +Glynda +Glynis +Glynnis +Gnni +Godiva +Golda +Goldarina +Goldi +Goldia +Goldie +Goldina +Goldy +Grace +Gracia +Gracie +Grata +Gratia +Gratiana +Gray +Grayce +Grazia +Greer +Greta +Gretal +Gretchen +Grete +Gretel +Grethel +Gretna +Gretta +Grier +Griselda +Grissel +Guendolen +Guenevere +Guenna +Guglielma +Gui +Guillema +Guillemette +Guinevere +Guinna +Gunilla +Gus +Gusella +Gussi +Gussie +Gussy +Gusta +Gusti +Gustie +Gusty +Gwen +Gwendolen +Gwendolin +Gwendolyn +Gweneth +Gwenette +Gwenneth +Gwenni +Gwennie +Gwenny +Gwenora +Gwenore +Gwyn +Gwyneth +Gwynne +Gypsy +Hadria +Hailee +Haily +Haleigh +Halette +Haley +Hali +Halie +Halimeda +Halley +Halli +Hallie +Hally +Hana +Hanna +Hannah +Hanni +Hannie +Hannis +Hanny +Happy +Harlene +Harley +Harli +Harlie +Harmonia +Harmonie +Harmony +Harri +Harrie +Harriet +Harriett +Harrietta +Harriette +Harriot +Harriott +Hatti +Hattie +Hatty +Hayley +Hazel +Heath +Heather +Heda +Hedda +Heddi +Heddie +Hedi +Hedvig +Hedvige +Hedwig +Hedwiga +Hedy +Heida +Heidi +Heidie +Helaina +Helaine +Helen +Helen-Elizabeth +Helena +Helene +Helenka +Helga +Helge +Helli +Heloise +Helsa +Helyn +Hendrika +Henka +Henrie +Henrieta +Henrietta +Henriette +Henryetta +Hephzibah +Hermia +Hermina +Hermine +Herminia +Hermione +Herta +Hertha +Hester +Hesther +Hestia +Hetti +Hettie +Hetty +Hilary +Hilda +Hildagard +Hildagarde +Hilde +Hildegaard +Hildegarde +Hildy +Hillary +Hilliary +Hinda +Holli +Hollie +Holly +Holly-Anne +Hollyanne +Honey +Honor +Honoria +Hope +Horatia +Hortense +Hortensia +Hulda +Hyacinth +Hyacintha +Hyacinthe +Hyacinthia +Hyacinthie +Hynda +Ianthe +Ibbie +Ibby +Ida +Idalia +Idalina +Idaline +Idell +Idelle +Idette +Ileana +Ileane +Ilene +Ilise +Ilka +Illa +Ilsa +Ilse +Ilysa +Ilyse +Ilyssa +Imelda +Imogen +Imogene +Imojean +Ina +Indira +Ines +Inesita +Inessa +Inez +Inga +Ingaberg +Ingaborg +Inge +Ingeberg +Ingeborg +Inger +Ingrid +Ingunna +Inna +Iolande +Iolanthe +Iona +Iormina +Ira +Irena +Irene +Irina +Iris +Irita +Irma +Isa +Isabel +Isabelita +Isabella +Isabelle +Isadora +Isahella +Iseabal +Isidora +Isis +Isobel +Issi +Issie +Issy +Ivett +Ivette +Ivie +Ivonne +Ivory +Ivy +Izabel +Jacenta +Jacinda +Jacinta +Jacintha +Jacinthe +Jackelyn +Jacki +Jackie +Jacklin +Jacklyn +Jackquelin +Jackqueline +Jacky +Jaclin +Jaclyn +Jacquelin +Jacqueline +Jacquelyn +Jacquelynn +Jacquenetta +Jacquenette +Jacquetta +Jacquette +Jacqui +Jacquie +Jacynth +Jada +Jade +Jaime +Jaimie +Jaine +Jami +Jamie +Jamima +Jammie +Jan +Jana +Janaya +Janaye +Jandy +Jane +Janean +Janeczka +Janeen +Janel +Janela +Janella +Janelle +Janene +Janenna +Janessa +Janet +Janeta +Janetta +Janette +Janeva +Janey +Jania +Janice +Janie +Janifer +Janina +Janine +Janis +Janith +Janka +Janna +Jannel +Jannelle +Janot +Jany +Jaquelin +Jaquelyn +Jaquenetta +Jaquenette +Jaquith +Jasmin +Jasmina +Jasmine +Jayme +Jaymee +Jayne +Jaynell +Jazmin +Jean +Jeana +Jeane +Jeanelle +Jeanette +Jeanie +Jeanine +Jeanna +Jeanne +Jeannette +Jeannie +Jeannine +Jehanna +Jelene +Jemie +Jemima +Jemimah +Jemmie +Jemmy +Jen +Jena +Jenda +Jenelle +Jeni +Jenica +Jeniece +Jenifer +Jeniffer +Jenilee +Jenine +Jenn +Jenna +Jennee +Jennette +Jenni +Jennica +Jennie +Jennifer +Jennilee +Jennine +Jenny +Jeralee +Jere +Jeri +Jermaine +Jerrie +Jerrilee +Jerrilyn +Jerrine +Jerry +Jerrylee +Jess +Jessa +Jessalin +Jessalyn +Jessamine +Jessamyn +Jesse +Jesselyn +Jessi +Jessica +Jessie +Jessika +Jessy +Jewel +Jewell +Jewelle +Jill +Jillana +Jillane +Jillayne +Jilleen +Jillene +Jilli +Jillian +Jillie +Jilly +Jinny +Jo +Jo Ann +Jo-Ann +Jo-Anne +Joan +Joana +Joane +Joanie +Joann +Joanna +Joanne +Joannes +Jobey +Jobi +Jobie +Jobina +Joby +Jobye +Jobyna +Jocelin +Joceline +Jocelyn +Jocelyne +Jodee +Jodi +Jodie +Jody +Joeann +Joela +Joelie +Joell +Joella +Joelle +Joellen +Joelly +Joellyn +Joelynn +Joete +Joey +Johanna +Johannah +Johna +Johnath +Johnette +Johnna +Joice +Jojo +Jolee +Joleen +Jolene +Joletta +Joli +Jolie +Joline +Joly +Jolyn +Jolynn +Jonell +Joni +Jonie +Jonis +Jordain +Jordan +Jordana +Jordanna +Jorey +Jori +Jorie +Jorrie +Jorry +Joscelin +Josee +Josefa +Josefina +Josepha +Josephina +Josephine +Josey +Josi +Josie +Josselyn +Josy +Jourdan +Joy +Joya +Joyan +Joyann +Joyce +Joycelin +Joye +Jsandye +Juana +Juanita +Judi +Judie +Judith +Juditha +Judy +Judye +Juieta +Julee +Juli +Julia +Juliana +Juliane +Juliann +Julianna +Julianne +Julie +Julienne +Juliet +Julieta +Julietta +Juliette +Julina +Juline +Julissa +Julita +June +Junette +Junia +Junie +Junina +Justina +Justine +Justinn +Jyoti +Kacey +Kacie +Kacy +Kaela +Kai +Kaia +Kaila +Kaile +Kailey +Kaitlin +Kaitlyn +Kaitlynn +Kaja +Kakalina +Kala +Kaleena +Kali +Kalie +Kalila +Kalina +Kalinda +Kalindi +Kalli +Kally +Kameko +Kamila +Kamilah +Kamillah +Kandace +Kandy +Kania +Kanya +Kara +Kara-Lynn +Karalee +Karalynn +Kare +Karee +Karel +Karen +Karena +Kari +Karia +Karie +Karil +Karilynn +Karin +Karina +Karine +Kariotta +Karisa +Karissa +Karita +Karla +Karlee +Karleen +Karlen +Karlene +Karlie +Karlotta +Karlotte +Karly +Karlyn +Karmen +Karna +Karol +Karola +Karole +Karolina +Karoline +Karoly +Karon +Karrah +Karrie +Karry +Kary +Karyl +Karylin +Karyn +Kasey +Kass +Kassandra +Kassey +Kassi +Kassia +Kassie +Kat +Kata +Katalin +Kate +Katee +Katerina +Katerine +Katey +Kath +Katha +Katharina +Katharine +Katharyn +Kathe +Katherina +Katherine +Katheryn +Kathi +Kathie +Kathleen +Kathlin +Kathrine +Kathryn +Kathryne +Kathy +Kathye +Kati +Katie +Katina +Katine +Katinka +Katleen +Katlin +Katrina +Katrine +Katrinka +Katti +Kattie +Katuscha +Katusha +Katy +Katya +Kay +Kaycee +Kaye +Kayla +Kayle +Kaylee +Kayley +Kaylil +Kaylyn +Keeley +Keelia +Keely +Kelcey +Kelci +Kelcie +Kelcy +Kelila +Kellen +Kelley +Kelli +Kellia +Kellie +Kellina +Kellsie +Kelly +Kellyann +Kelsey +Kelsi +Kelsy +Kendra +Kendre +Kenna +Keri +Keriann +Kerianne +Kerri +Kerrie +Kerrill +Kerrin +Kerry +Kerstin +Kesley +Keslie +Kessia +Kessiah +Ketti +Kettie +Ketty +Kevina +Kevyn +Ki +Kiah +Kial +Kiele +Kiersten +Kikelia +Kiley +Kim +Kimberlee +Kimberley +Kimberli +Kimberly +Kimberlyn +Kimbra +Kimmi +Kimmie +Kimmy +Kinna +Kip +Kipp +Kippie +Kippy +Kira +Kirbee +Kirbie +Kirby +Kiri +Kirsten +Kirsteni +Kirsti +Kirstin +Kirstyn +Kissee +Kissiah +Kissie +Kit +Kitti +Kittie +Kitty +Kizzee +Kizzie +Klara +Klarika +Klarrisa +Konstance +Konstanze +Koo +Kora +Koral +Koralle +Kordula +Kore +Korella +Koren +Koressa +Kori +Korie +Korney +Korrie +Korry +Kris +Krissie +Krissy +Krista +Kristal +Kristan +Kriste +Kristel +Kristen +Kristi +Kristien +Kristin +Kristina +Kristine +Kristy +Kristyn +Krysta +Krystal +Krystalle +Krystle +Krystyna +Kyla +Kyle +Kylen +Kylie +Kylila +Kylynn +Kym +Kynthia +Kyrstin +La Verne +Lacee +Lacey +Lacie +Lacy +Ladonna +Laetitia +Laina +Lainey +Lana +Lanae +Lane +Lanette +Laney +Lani +Lanie +Lanita +Lanna +Lanni +Lanny +Lara +Laraine +Lari +Larina +Larine +Larisa +Larissa +Lark +Laryssa +Latashia +Latia +Latisha +Latrena +Latrina +Laura +Lauraine +Laural +Lauralee +Laure +Lauree +Laureen +Laurel +Laurella +Lauren +Laurena +Laurene +Lauretta +Laurette +Lauri +Laurianne +Laurice +Laurie +Lauryn +Lavena +Laverna +Laverne +Lavina +Lavinia +Lavinie +Layla +Layne +Layney +Lea +Leah +Leandra +Leann +Leanna +Leanor +Leanora +Lebbie +Leda +Lee +Leeann +Leeanne +Leela +Leelah +Leena +Leesa +Leese +Legra +Leia +Leigh +Leigha +Leila +Leilah +Leisha +Lela +Lelah +Leland +Lelia +Lena +Lenee +Lenette +Lenka +Lenna +Lenora +Lenore +Leodora +Leoine +Leola +Leoline +Leona +Leonanie +Leone +Leonelle +Leonie +Leonora +Leonore +Leontine +Leontyne +Leora +Leshia +Lesley +Lesli +Leslie +Lesly +Lesya +Leta +Lethia +Leticia +Letisha +Letitia +Letizia +Letta +Letti +Lettie +Letty +Lexi +Lexie +Lexine +Lexis +Lexy +Leyla +Lezlie +Lia +Lian +Liana +Liane +Lianna +Lianne +Lib +Libbey +Libbi +Libbie +Libby +Licha +Lida +Lidia +Liesa +Lil +Lila +Lilah +Lilas +Lilia +Lilian +Liliane +Lilias +Lilith +Lilla +Lilli +Lillian +Lillis +Lilllie +Lilly +Lily +Lilyan +Lin +Lina +Lind +Linda +Lindi +Lindie +Lindsay +Lindsey +Lindsy +Lindy +Linea +Linell +Linet +Linette +Linn +Linnea +Linnell +Linnet +Linnie +Linzy +Lira +Lisa +Lisabeth +Lisbeth +Lise +Lisetta +Lisette +Lisha +Lishe +Lissa +Lissi +Lissie +Lissy +Lita +Liuka +Liv +Liva +Livia +Livvie +Livvy +Livvyy +Livy +Liz +Liza +Lizabeth +Lizbeth +Lizette +Lizzie +Lizzy +Loella +Lois +Loise +Lola +Loleta +Lolita +Lolly +Lona +Lonee +Loni +Lonna +Lonni +Lonnie +Lora +Lorain +Loraine +Loralee +Loralie +Loralyn +Loree +Loreen +Lorelei +Lorelle +Loren +Lorena +Lorene +Lorenza +Loretta +Lorette +Lori +Loria +Lorianna +Lorianne +Lorie +Lorilee +Lorilyn +Lorinda +Lorine +Lorita +Lorna +Lorne +Lorraine +Lorrayne +Lorri +Lorrie +Lorrin +Lorry +Lory +Lotta +Lotte +Lotti +Lottie +Lotty +Lou +Louella +Louisa +Louise +Louisette +Loutitia +Lu +Luce +Luci +Lucia +Luciana +Lucie +Lucienne +Lucila +Lucilia +Lucille +Lucina +Lucinda +Lucine +Lucita +Lucky +Lucretia +Lucy +Ludovika +Luella +Luelle +Luisa +Luise +Lula +Lulita +Lulu +Lura +Lurette +Lurleen +Lurlene +Lurline +Lusa +Luz +Lyda +Lydia +Lydie +Lyn +Lynda +Lynde +Lyndel +Lyndell +Lyndsay +Lyndsey +Lyndsie +Lyndy +Lynea +Lynelle +Lynett +Lynette +Lynn +Lynna +Lynne +Lynnea +Lynnell +Lynnelle +Lynnet +Lynnett +Lynnette +Lynsey +Lyssa +Mab +Mabel +Mabelle +Mable +Mada +Madalena +Madalyn +Maddalena +Maddi +Maddie +Maddy +Madel +Madelaine +Madeleine +Madelena +Madelene +Madelin +Madelina +Madeline +Madella +Madelle +Madelon +Madelyn +Madge +Madlen +Madlin +Madonna +Mady +Mae +Maegan +Mag +Magda +Magdaia +Magdalen +Magdalena +Magdalene +Maggee +Maggi +Maggie +Maggy +Mahala +Mahalia +Maia +Maible +Maiga +Maighdiln +Mair +Maire +Maisey +Maisie +Maitilde +Mala +Malanie +Malena +Malia +Malina +Malinda +Malinde +Malissa +Malissia +Mallissa +Mallorie +Mallory +Malorie +Malory +Malva +Malvina +Malynda +Mame +Mamie +Manda +Mandi +Mandie +Mandy +Manon +Manya +Mara +Marabel +Marcela +Marcelia +Marcella +Marcelle +Marcellina +Marcelline +Marchelle +Marci +Marcia +Marcie +Marcile +Marcille +Marcy +Mareah +Maren +Marena +Maressa +Marga +Margalit +Margalo +Margaret +Margareta +Margarete +Margaretha +Margarethe +Margaretta +Margarette +Margarita +Margaux +Marge +Margeaux +Margery +Marget +Margette +Margi +Margie +Margit +Margo +Margot +Margret +Marguerite +Margy +Mari +Maria +Mariam +Marian +Mariana +Mariann +Marianna +Marianne +Maribel +Maribelle +Maribeth +Marice +Maridel +Marie +Marie-Ann +Marie-Jeanne +Marieann +Mariejeanne +Mariel +Mariele +Marielle +Mariellen +Marietta +Mariette +Marigold +Marijo +Marika +Marilee +Marilin +Marillin +Marilyn +Marin +Marina +Marinna +Marion +Mariquilla +Maris +Marisa +Mariska +Marissa +Marita +Maritsa +Mariya +Marj +Marja +Marje +Marji +Marjie +Marjorie +Marjory +Marjy +Marketa +Marla +Marlane +Marleah +Marlee +Marleen +Marlena +Marlene +Marley +Marlie +Marline +Marlo +Marlyn +Marna +Marne +Marney +Marni +Marnia +Marnie +Marquita +Marrilee +Marris +Marrissa +Marsha +Marsiella +Marta +Martelle +Martguerita +Martha +Marthe +Marthena +Marti +Martica +Martie +Martina +Martita +Marty +Martynne +Mary +Marya +Maryann +Maryanna +Maryanne +Marybelle +Marybeth +Maryellen +Maryjane +Maryjo +Maryl +Marylee +Marylin +Marylinda +Marylou +Marylynne +Maryrose +Marys +Marysa +Masha +Matelda +Mathilda +Mathilde +Matilda +Matilde +Matti +Mattie +Matty +Maud +Maude +Maudie +Maura +Maure +Maureen +Maureene +Maurene +Maurine +Maurise +Maurita +Maurizia +Mavis +Mavra +Max +Maxi +Maxie +Maxine +Maxy +May +Maybelle +Maye +Mead +Meade +Meagan +Meaghan +Meara +Mechelle +Meg +Megan +Megen +Meggi +Meggie +Meggy +Meghan +Meghann +Mehetabel +Mei +Mel +Mela +Melamie +Melania +Melanie +Melantha +Melany +Melba +Melesa +Melessa +Melicent +Melina +Melinda +Melinde +Melisa +Melisande +Melisandra +Melisenda +Melisent +Melissa +Melisse +Melita +Melitta +Mella +Melli +Mellicent +Mellie +Mellisa +Mellisent +Melloney +Melly +Melodee +Melodie +Melody +Melonie +Melony +Melosa +Melva +Mercedes +Merci +Mercie +Mercy +Meredith +Meredithe +Meridel +Meridith +Meriel +Merilee +Merilyn +Meris +Merissa +Merl +Merla +Merle +Merlina +Merline +Merna +Merola +Merralee +Merridie +Merrie +Merrielle +Merrile +Merrilee +Merrili +Merrill +Merrily +Merry +Mersey +Meryl +Meta +Mia +Micaela +Michaela +Michaelina +Michaeline +Michaella +Michal +Michel +Michele +Michelina +Micheline +Michell +Michelle +Micki +Mickie +Micky +Midge +Mignon +Mignonne +Miguela +Miguelita +Mikaela +Mil +Mildred +Mildrid +Milena +Milicent +Milissent +Milka +Milli +Millicent +Millie +Millisent +Milly +Milzie +Mimi +Min +Mina +Minda +Mindy +Minerva +Minetta +Minette +Minna +Minnaminnie +Minne +Minni +Minnie +Minnnie +Minny +Minta +Miof Mela +Miquela +Mira +Mirabel +Mirabella +Mirabelle +Miran +Miranda +Mireielle +Mireille +Mirella +Mirelle +Miriam +Mirilla +Mirna +Misha +Missie +Missy +Misti +Misty +Mitzi +Modesta +Modestia +Modestine +Modesty +Moina +Moira +Moll +Mollee +Molli +Mollie +Molly +Mommy +Mona +Monah +Monica +Monika +Monique +Mora +Moreen +Morena +Morgan +Morgana +Morganica +Morganne +Morgen +Moria +Morissa +Morna +Moselle +Moyna +Moyra +Mozelle +Muffin +Mufi +Mufinella +Muire +Mureil +Murial +Muriel +Murielle +Myra +Myrah +Myranda +Myriam +Myrilla +Myrle +Myrlene +Myrna +Myrta +Myrtia +Myrtice +Myrtie +Myrtle +Nada +Nadean +Nadeen +Nadia +Nadine +Nadiya +Nady +Nadya +Nalani +Nan +Nana +Nananne +Nance +Nancee +Nancey +Nanci +Nancie +Nancy +Nanete +Nanette +Nani +Nanice +Nanine +Nannette +Nanni +Nannie +Nanny +Nanon +Naoma +Naomi +Nara +Nari +Nariko +Nat +Nata +Natala +Natalee +Natalie +Natalina +Nataline +Natalya +Natasha +Natassia +Nathalia +Nathalie +Natividad +Natka +Natty +Neala +Neda +Nedda +Nedi +Neely +Neila +Neile +Neilla +Neille +Nelia +Nelie +Nell +Nelle +Nelli +Nellie +Nelly +Nerissa +Nerita +Nert +Nerta +Nerte +Nerti +Nertie +Nerty +Nessa +Nessi +Nessie +Nessy +Nesta +Netta +Netti +Nettie +Nettle +Netty +Nevsa +Neysa +Nichol +Nichole +Nicholle +Nicki +Nickie +Nicky +Nicol +Nicola +Nicole +Nicolea +Nicolette +Nicoli +Nicolina +Nicoline +Nicolle +Nikaniki +Nike +Niki +Nikki +Nikkie +Nikoletta +Nikolia +Nina +Ninetta +Ninette +Ninnetta +Ninnette +Ninon +Nissa +Nisse +Nissie +Nissy +Nita +Nixie +Noami +Noel +Noelani +Noell +Noella +Noelle +Noellyn +Noelyn +Noemi +Nola +Nolana +Nolie +Nollie +Nomi +Nona +Nonah +Noni +Nonie +Nonna +Nonnah +Nora +Norah +Norean +Noreen +Norene +Norina +Norine +Norma +Norri +Norrie +Norry +Novelia +Nydia +Nyssa +Octavia +Odele +Odelia +Odelinda +Odella +Odelle +Odessa +Odetta +Odette +Odilia +Odille +Ofelia +Ofella +Ofilia +Ola +Olenka +Olga +Olia +Olimpia +Olive +Olivette +Olivia +Olivie +Oliy +Ollie +Olly +Olva +Olwen +Olympe +Olympia +Olympie +Ondrea +Oneida +Onida +Oona +Opal +Opalina +Opaline +Ophelia +Ophelie +Ora +Oralee +Oralia +Oralie +Oralla +Oralle +Orel +Orelee +Orelia +Orelie +Orella +Orelle +Oriana +Orly +Orsa +Orsola +Ortensia +Otha +Othelia +Othella +Othilia +Othilie +Ottilie +Page +Paige +Paloma +Pam +Pamela +Pamelina +Pamella +Pammi +Pammie +Pammy +Pandora +Pansie +Pansy +Paola +Paolina +Papagena +Pat +Patience +Patrica +Patrice +Patricia +Patrizia +Patsy +Patti +Pattie +Patty +Paula +Paule +Pauletta +Paulette +Pauli +Paulie +Paulina +Pauline +Paulita +Pauly +Pavia +Pavla +Pearl +Pearla +Pearle +Pearline +Peg +Pegeen +Peggi +Peggie +Peggy +Pen +Penelopa +Penelope +Penni +Pennie +Penny +Pepi +Pepita +Peri +Peria +Perl +Perla +Perle +Perri +Perrine +Perry +Persis +Pet +Peta +Petra +Petrina +Petronella +Petronia +Petronilla +Petronille +Petunia +Phaedra +Phaidra +Phebe +Phedra +Phelia +Phil +Philipa +Philippa +Philippe +Philippine +Philis +Phillida +Phillie +Phillis +Philly +Philomena +Phoebe +Phylis +Phyllida +Phyllis +Phyllys +Phylys +Pia +Pier +Pierette +Pierrette +Pietra +Piper +Pippa +Pippy +Polly +Pollyanna +Pooh +Poppy +Portia +Pris +Prisca +Priscella +Priscilla +Prissie +Pru +Prudence +Prudi +Prudy +Prue +Queenie +Quentin +Querida +Quinn +Quinta +Quintana +Quintilla +Quintina +Rachael +Rachel +Rachele +Rachelle +Rae +Raeann +Raf +Rafa +Rafaela +Rafaelia +Rafaelita +Rahal +Rahel +Raina +Raine +Rakel +Ralina +Ramona +Ramonda +Rana +Randa +Randee +Randene +Randi +Randie +Randy +Ranee +Rani +Rania +Ranice +Ranique +Ranna +Raphaela +Raquel +Raquela +Rasia +Rasla +Raven +Ray +Raychel +Raye +Rayna +Raynell +Rayshell +Rea +Reba +Rebbecca +Rebe +Rebeca +Rebecca +Rebecka +Rebeka +Rebekah +Rebekkah +Ree +Reeba +Reena +Reeta +Reeva +Regan +Reggi +Reggie +Regina +Regine +Reiko +Reina +Reine +Remy +Rena +Renae +Renata +Renate +Rene +Renee +Renell +Renelle +Renie +Rennie +Reta +Retha +Revkah +Rey +Reyna +Rhea +Rheba +Rheta +Rhetta +Rhiamon +Rhianna +Rhianon +Rhoda +Rhodia +Rhodie +Rhody +Rhona +Rhonda +Riane +Riannon +Rianon +Rica +Ricca +Rici +Ricki +Rickie +Ricky +Riki +Rikki +Rina +Risa +Rita +Riva +Rivalee +Rivi +Rivkah +Rivy +Roana +Roanna +Roanne +Robbi +Robbie +Robbin +Robby +Robbyn +Robena +Robenia +Roberta +Robin +Robina +Robinet +Robinett +Robinetta +Robinette +Robinia +Roby +Robyn +Roch +Rochell +Rochella +Rochelle +Rochette +Roda +Rodi +Rodie +Rodina +Rois +Romola +Romona +Romonda +Romy +Rona +Ronalda +Ronda +Ronica +Ronna +Ronni +Ronnica +Ronnie +Ronny +Roobbie +Rora +Rori +Rorie +Rory +Ros +Rosa +Rosabel +Rosabella +Rosabelle +Rosaleen +Rosalia +Rosalie +Rosalind +Rosalinda +Rosalinde +Rosaline +Rosalyn +Rosalynd +Rosamond +Rosamund +Rosana +Rosanna +Rosanne +Rose +Roseann +Roseanna +Roseanne +Roselia +Roselin +Roseline +Rosella +Roselle +Rosemaria +Rosemarie +Rosemary +Rosemonde +Rosene +Rosetta +Rosette +Roshelle +Rosie +Rosina +Rosita +Roslyn +Rosmunda +Rosy +Row +Rowe +Rowena +Roxana +Roxane +Roxanna +Roxanne +Roxi +Roxie +Roxine +Roxy +Roz +Rozalie +Rozalin +Rozamond +Rozanna +Rozanne +Roze +Rozele +Rozella +Rozelle +Rozina +Rubetta +Rubi +Rubia +Rubie +Rubina +Ruby +Ruperta +Ruth +Ruthann +Ruthanne +Ruthe +Ruthi +Ruthie +Ruthy +Ryann +Rycca +Saba +Sabina +Sabine +Sabra +Sabrina +Sacha +Sada +Sadella +Sadie +Sadye +Saidee +Sal +Salaidh +Sallee +Salli +Sallie +Sally +Sallyann +Sallyanne +Saloma +Salome +Salomi +Sam +Samantha +Samara +Samaria +Sammy +Sande +Sandi +Sandie +Sandra +Sandy +Sandye +Sapphira +Sapphire +Sara +Sara-Ann +Saraann +Sarah +Sarajane +Saree +Sarena +Sarene +Sarette +Sari +Sarina +Sarine +Sarita +Sascha +Sasha +Sashenka +Saudra +Saundra +Savina +Sayre +Scarlet +Scarlett +Sean +Seana +Seka +Sela +Selena +Selene +Selestina +Selia +Selie +Selina +Selinda +Seline +Sella +Selle +Selma +Sena +Sephira +Serena +Serene +Shae +Shaina +Shaine +Shalna +Shalne +Shana +Shanda +Shandee +Shandeigh +Shandie +Shandra +Shandy +Shane +Shani +Shanie +Shanna +Shannah +Shannen +Shannon +Shanon +Shanta +Shantee +Shara +Sharai +Shari +Sharia +Sharity +Sharl +Sharla +Sharleen +Sharlene +Sharline +Sharon +Sharona +Sharron +Sharyl +Shaun +Shauna +Shawn +Shawna +Shawnee +Shay +Shayla +Shaylah +Shaylyn +Shaylynn +Shayna +Shayne +Shea +Sheba +Sheela +Sheelagh +Sheelah +Sheena +Sheeree +Sheila +Sheila-Kathryn +Sheilah +Shel +Shela +Shelagh +Shelba +Shelbi +Shelby +Shelia +Shell +Shelley +Shelli +Shellie +Shelly +Shena +Sher +Sheree +Sheri +Sherie +Sherill +Sherilyn +Sherline +Sherri +Sherrie +Sherry +Sherye +Sheryl +Shina +Shir +Shirl +Shirlee +Shirleen +Shirlene +Shirley +Shirline +Shoshana +Shoshanna +Siana +Sianna +Sib +Sibbie +Sibby +Sibeal +Sibel +Sibella +Sibelle +Sibilla +Sibley +Sibyl +Sibylla +Sibylle +Sidoney +Sidonia +Sidonnie +Sigrid +Sile +Sileas +Silva +Silvana +Silvia +Silvie +Simona +Simone +Simonette +Simonne +Sindee +Siobhan +Sioux +Siouxie +Sisely +Sisile +Sissie +Sissy +Siusan +Sofia +Sofie +Sondra +Sonia +Sonja +Sonni +Sonnie +Sonnnie +Sonny +Sonya +Sophey +Sophi +Sophia +Sophie +Sophronia +Sorcha +Sosanna +Stace +Stacee +Stacey +Staci +Stacia +Stacie +Stacy +Stafani +Star +Starla +Starlene +Starlin +Starr +Stefa +Stefania +Stefanie +Steffane +Steffi +Steffie +Stella +Stepha +Stephana +Stephani +Stephanie +Stephannie +Stephenie +Stephi +Stephie +Stephine +Stesha +Stevana +Stevena +Stoddard +Storm +Stormi +Stormie +Stormy +Sue +Suellen +Sukey +Suki +Sula +Sunny +Sunshine +Susan +Susana +Susanetta +Susann +Susanna +Susannah +Susanne +Susette +Susi +Susie +Susy +Suzann +Suzanna +Suzanne +Suzette +Suzi +Suzie +Suzy +Sybil +Sybila +Sybilla +Sybille +Sybyl +Sydel +Sydelle +Sydney +Sylvia +Tabatha +Tabbatha +Tabbi +Tabbie +Tabbitha +Tabby +Tabina +Tabitha +Taffy +Talia +Tallia +Tallie +Tallou +Tallulah +Tally +Talya +Talyah +Tamar +Tamara +Tamarah +Tamarra +Tamera +Tami +Tamiko +Tamma +Tammara +Tammi +Tammie +Tammy +Tamqrah +Tamra +Tana +Tandi +Tandie +Tandy +Tanhya +Tani +Tania +Tanitansy +Tansy +Tanya +Tara +Tarah +Tarra +Tarrah +Taryn +Tasha +Tasia +Tate +Tatiana +Tatiania +Tatum +Tawnya +Tawsha +Ted +Tedda +Teddi +Teddie +Teddy +Tedi +Tedra +Teena +TEirtza +Teodora +Tera +Teresa +Terese +Teresina +Teresita +Teressa +Teri +Teriann +Terra +Terri +Terrie +Terrijo +Terry +Terrye +Tersina +Terza +Tess +Tessa +Tessi +Tessie +Tessy +Thalia +Thea +Theadora +Theda +Thekla +Thelma +Theo +Theodora +Theodosia +Theresa +Therese +Theresina +Theresita +Theressa +Therine +Thia +Thomasa +Thomasin +Thomasina +Thomasine +Tiena +Tierney +Tiertza +Tiff +Tiffani +Tiffanie +Tiffany +Tiffi +Tiffie +Tiffy +Tilda +Tildi +Tildie +Tildy +Tillie +Tilly +Tim +Timi +Timmi +Timmie +Timmy +Timothea +Tina +Tine +Tiphani +Tiphanie +Tiphany +Tish +Tisha +Tobe +Tobey +Tobi +Toby +Tobye +Toinette +Toma +Tomasina +Tomasine +Tomi +Tommi +Tommie +Tommy +Toni +Tonia +Tonie +Tony +Tonya +Tonye +Tootsie +Torey +Tori +Torie +Torrie +Tory +Tova +Tove +Tracee +Tracey +Traci +Tracie +Tracy +Trenna +Tresa +Trescha +Tressa +Tricia +Trina +Trish +Trisha +Trista +Trix +Trixi +Trixie +Trixy +Truda +Trude +Trudey +Trudi +Trudie +Trudy +Trula +Tuesday +Twila +Twyla +Tybi +Tybie +Tyne +Ula +Ulla +Ulrica +Ulrika +Ulrikaumeko +Ulrike +Umeko +Una +Ursa +Ursala +Ursola +Ursula +Ursulina +Ursuline +Uta +Val +Valaree +Valaria +Vale +Valeda +Valencia +Valene +Valenka +Valentia +Valentina +Valentine +Valera +Valeria +Valerie +Valery +Valerye +Valida +Valina +Valli +Vallie +Vally +Valma +Valry +Van +Vanda +Vanessa +Vania +Vanna +Vanni +Vannie +Vanny +Vanya +Veda +Velma +Velvet +Venita +Venus +Vera +Veradis +Vere +Verena +Verene +Veriee +Verile +Verina +Verine +Verla +Verna +Vernice +Veronica +Veronika +Veronike +Veronique +Vevay +Vi +Vicki +Vickie +Vicky +Victoria +Vida +Viki +Vikki +Vikky +Vilhelmina +Vilma +Vin +Vina +Vinita +Vinni +Vinnie +Vinny +Viola +Violante +Viole +Violet +Violetta +Violette +Virgie +Virgina +Virginia +Virginie +Vita +Vitia +Vitoria +Vittoria +Viv +Viva +Vivi +Vivia +Vivian +Viviana +Vivianna +Vivianne +Vivie +Vivien +Viviene +Vivienne +Viviyan +Vivyan +Vivyanne +Vonni +Vonnie +Vonny +Vyky +Wallie +Wallis +Walliw +Wally +Waly +Wanda +Wandie +Wandis +Waneta +Wanids +Wenda +Wendeline +Wendi +Wendie +Wendy +Wendye +Wenona +Wenonah +Whitney +Wileen +Wilhelmina +Wilhelmine +Wilie +Willa +Willabella +Willamina +Willetta +Willette +Willi +Willie +Willow +Willy +Willyt +Wilma +Wilmette +Wilona +Wilone +Wilow +Windy +Wini +Winifred +Winna +Winnah +Winne +Winni +Winnie +Winnifred +Winny +Winona +Winonah +Wren +Wrennie +Wylma +Wynn +Wynne +Wynnie +Wynny +Xaviera +Xena +Xenia +Xylia +Xylina +Yalonda +Yasmeen +Yasmin +Yelena +Yetta +Yettie +Yetty +Yevette +Ynes +Ynez +Yoko +Yolanda +Yolande +Yolane +Yolanthe +Yoshi +Yoshiko +Yovonnda +Ysabel +Yvette +Yvonne +Zabrina +Zahara +Zandra +Zaneta +Zara +Zarah +Zaria +Zarla +Zea +Zelda +Zelma +Zena +Zenia +Zia +Zilvia +Zita +Zitella +Zoe +Zola +Zonda +Zondra +Zonnya +Zora +Zorah +Zorana +Zorina +Zorine +Zsa Zsa +Zsazsa +Zulema +Zuzana \ No newline at end of file diff --git a/04 ListNode/03 Josephus/J_numbers.txt b/04 ListNode/03 Josephus/J_numbers.txt new file mode 100644 index 0000000..c3acffa --- /dev/null +++ b/04 ListNode/03 Josephus/J_numbers.txt @@ -0,0 +1,10000 @@ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 +95 +96 +97 +98 +99 +100 +101 +102 +103 +104 +105 +106 +107 +108 +109 +110 +111 +112 +113 +114 +115 +116 +117 +118 +119 +120 +121 +122 +123 +124 +125 +126 +127 +128 +129 +130 +131 +132 +133 +134 +135 +136 +137 +138 +139 +140 +141 +142 +143 +144 +145 +146 +147 +148 +149 +150 +151 +152 +153 +154 +155 +156 +157 +158 +159 +160 +161 +162 +163 +164 +165 +166 +167 +168 +169 +170 +171 +172 +173 +174 +175 +176 +177 +178 +179 +180 +181 +182 +183 +184 +185 +186 +187 +188 +189 +190 +191 +192 +193 +194 +195 +196 +197 +198 +199 +200 +201 +202 +203 +204 +205 +206 +207 +208 +209 +210 +211 +212 +213 +214 +215 +216 +217 +218 +219 +220 +221 +222 +223 +224 +225 +226 +227 +228 +229 +230 +231 +232 +233 +234 +235 +236 +237 +238 +239 +240 +241 +242 +243 +244 +245 +246 +247 +248 +249 +250 +251 +252 +253 +254 +255 +256 +257 +258 +259 +260 +261 +262 +263 +264 +265 +266 +267 +268 +269 +270 +271 +272 +273 +274 +275 +276 +277 +278 +279 +280 +281 +282 +283 +284 +285 +286 +287 +288 +289 +290 +291 +292 +293 +294 +295 +296 +297 +298 +299 +300 +301 +302 +303 +304 +305 +306 +307 +308 +309 +310 +311 +312 +313 +314 +315 +316 +317 +318 +319 +320 +321 +322 +323 +324 +325 +326 +327 +328 +329 +330 +331 +332 +333 +334 +335 +336 +337 +338 +339 +340 +341 +342 +343 +344 +345 +346 +347 +348 +349 +350 +351 +352 +353 +354 +355 +356 +357 +358 +359 +360 +361 +362 +363 +364 +365 +366 +367 +368 +369 +370 +371 +372 +373 +374 +375 +376 +377 +378 +379 +380 +381 +382 +383 +384 +385 +386 +387 +388 +389 +390 +391 +392 +393 +394 +395 +396 +397 +398 +399 +400 +401 +402 +403 +404 +405 +406 +407 +408 +409 +410 +411 +412 +413 +414 +415 +416 +417 +418 +419 +420 +421 +422 +423 +424 +425 +426 +427 +428 +429 +430 +431 +432 +433 +434 +435 +436 +437 +438 +439 +440 +441 +442 +443 +444 +445 +446 +447 +448 +449 +450 +451 +452 +453 +454 +455 +456 +457 +458 +459 +460 +461 +462 +463 +464 +465 +466 +467 +468 +469 +470 +471 +472 +473 +474 +475 +476 +477 +478 +479 +480 +481 +482 +483 +484 +485 +486 +487 +488 +489 +490 +491 +492 +493 +494 +495 +496 +497 +498 +499 +500 +501 +502 +503 +504 +505 +506 +507 +508 +509 +510 +511 +512 +513 +514 +515 +516 +517 +518 +519 +520 +521 +522 +523 +524 +525 +526 +527 +528 +529 +530 +531 +532 +533 +534 +535 +536 +537 +538 +539 +540 +541 +542 +543 +544 +545 +546 +547 +548 +549 +550 +551 +552 +553 +554 +555 +556 +557 +558 +559 +560 +561 +562 +563 +564 +565 +566 +567 +568 +569 +570 +571 +572 +573 +574 +575 +576 +577 +578 +579 +580 +581 +582 +583 +584 +585 +586 +587 +588 +589 +590 +591 +592 +593 +594 +595 +596 +597 +598 +599 +600 +601 +602 +603 +604 +605 +606 +607 +608 +609 +610 +611 +612 +613 +614 +615 +616 +617 +618 +619 +620 +621 +622 +623 +624 +625 +626 +627 +628 +629 +630 +631 +632 +633 +634 +635 +636 +637 +638 +639 +640 +641 +642 +643 +644 +645 +646 +647 +648 +649 +650 +651 +652 +653 +654 +655 +656 +657 +658 +659 +660 +661 +662 +663 +664 +665 +666 +667 +668 +669 +670 +671 +672 +673 +674 +675 +676 +677 +678 +679 +680 +681 +682 +683 +684 +685 +686 +687 +688 +689 +690 +691 +692 +693 +694 +695 +696 +697 +698 +699 +700 +701 +702 +703 +704 +705 +706 +707 +708 +709 +710 +711 +712 +713 +714 +715 +716 +717 +718 +719 +720 +721 +722 +723 +724 +725 +726 +727 +728 +729 +730 +731 +732 +733 +734 +735 +736 +737 +738 +739 +740 +741 +742 +743 +744 +745 +746 +747 +748 +749 +750 +751 +752 +753 +754 +755 +756 +757 +758 +759 +760 +761 +762 +763 +764 +765 +766 +767 +768 +769 +770 +771 +772 +773 +774 +775 +776 +777 +778 +779 +780 +781 +782 +783 +784 +785 +786 +787 +788 +789 +790 +791 +792 +793 +794 +795 +796 +797 +798 +799 +800 +801 +802 +803 +804 +805 +806 +807 +808 +809 +810 +811 +812 +813 +814 +815 +816 +817 +818 +819 +820 +821 +822 +823 +824 +825 +826 +827 +828 +829 +830 +831 +832 +833 +834 +835 +836 +837 +838 +839 +840 +841 +842 +843 +844 +845 +846 +847 +848 +849 +850 +851 +852 +853 +854 +855 +856 +857 +858 +859 +860 +861 +862 +863 +864 +865 +866 +867 +868 +869 +870 +871 +872 +873 +874 +875 +876 +877 +878 +879 +880 +881 +882 +883 +884 +885 +886 +887 +888 +889 +890 +891 +892 +893 +894 +895 +896 +897 +898 +899 +900 +901 +902 +903 +904 +905 +906 +907 +908 +909 +910 +911 +912 +913 +914 +915 +916 +917 +918 +919 +920 +921 +922 +923 +924 +925 +926 +927 +928 +929 +930 +931 +932 +933 +934 +935 +936 +937 +938 +939 +940 +941 +942 +943 +944 +945 +946 +947 +948 +949 +950 +951 +952 +953 +954 +955 +956 +957 +958 +959 +960 +961 +962 +963 +964 +965 +966 +967 +968 +969 +970 +971 +972 +973 +974 +975 +976 +977 +978 +979 +980 +981 +982 +983 +984 +985 +986 +987 +988 +989 +990 +991 +992 +993 +994 +995 +996 +997 +998 +999 +1000 +1001 +1002 +1003 +1004 +1005 +1006 +1007 +1008 +1009 +1010 +1011 +1012 +1013 +1014 +1015 +1016 +1017 +1018 +1019 +1020 +1021 +1022 +1023 +1024 +1025 +1026 +1027 +1028 +1029 +1030 +1031 +1032 +1033 +1034 +1035 +1036 +1037 +1038 +1039 +1040 +1041 +1042 +1043 +1044 +1045 +1046 +1047 +1048 +1049 +1050 +1051 +1052 +1053 +1054 +1055 +1056 +1057 +1058 +1059 +1060 +1061 +1062 +1063 +1064 +1065 +1066 +1067 +1068 +1069 +1070 +1071 +1072 +1073 +1074 +1075 +1076 +1077 +1078 +1079 +1080 +1081 +1082 +1083 +1084 +1085 +1086 +1087 +1088 +1089 +1090 +1091 +1092 +1093 +1094 +1095 +1096 +1097 +1098 +1099 +1100 +1101 +1102 +1103 +1104 +1105 +1106 +1107 +1108 +1109 +1110 +1111 +1112 +1113 +1114 +1115 +1116 +1117 +1118 +1119 +1120 +1121 +1122 +1123 +1124 +1125 +1126 +1127 +1128 +1129 +1130 +1131 +1132 +1133 +1134 +1135 +1136 +1137 +1138 +1139 +1140 +1141 +1142 +1143 +1144 +1145 +1146 +1147 +1148 +1149 +1150 +1151 +1152 +1153 +1154 +1155 +1156 +1157 +1158 +1159 +1160 +1161 +1162 +1163 +1164 +1165 +1166 +1167 +1168 +1169 +1170 +1171 +1172 +1173 +1174 +1175 +1176 +1177 +1178 +1179 +1180 +1181 +1182 +1183 +1184 +1185 +1186 +1187 +1188 +1189 +1190 +1191 +1192 +1193 +1194 +1195 +1196 +1197 +1198 +1199 +1200 +1201 +1202 +1203 +1204 +1205 +1206 +1207 +1208 +1209 +1210 +1211 +1212 +1213 +1214 +1215 +1216 +1217 +1218 +1219 +1220 +1221 +1222 +1223 +1224 +1225 +1226 +1227 +1228 +1229 +1230 +1231 +1232 +1233 +1234 +1235 +1236 +1237 +1238 +1239 +1240 +1241 +1242 +1243 +1244 +1245 +1246 +1247 +1248 +1249 +1250 +1251 +1252 +1253 +1254 +1255 +1256 +1257 +1258 +1259 +1260 +1261 +1262 +1263 +1264 +1265 +1266 +1267 +1268 +1269 +1270 +1271 +1272 +1273 +1274 +1275 +1276 +1277 +1278 +1279 +1280 +1281 +1282 +1283 +1284 +1285 +1286 +1287 +1288 +1289 +1290 +1291 +1292 +1293 +1294 +1295 +1296 +1297 +1298 +1299 +1300 +1301 +1302 +1303 +1304 +1305 +1306 +1307 +1308 +1309 +1310 +1311 +1312 +1313 +1314 +1315 +1316 +1317 +1318 +1319 +1320 +1321 +1322 +1323 +1324 +1325 +1326 +1327 +1328 +1329 +1330 +1331 +1332 +1333 +1334 +1335 +1336 +1337 +1338 +1339 +1340 +1341 +1342 +1343 +1344 +1345 +1346 +1347 +1348 +1349 +1350 +1351 +1352 +1353 +1354 +1355 +1356 +1357 +1358 +1359 +1360 +1361 +1362 +1363 +1364 +1365 +1366 +1367 +1368 +1369 +1370 +1371 +1372 +1373 +1374 +1375 +1376 +1377 +1378 +1379 +1380 +1381 +1382 +1383 +1384 +1385 +1386 +1387 +1388 +1389 +1390 +1391 +1392 +1393 +1394 +1395 +1396 +1397 +1398 +1399 +1400 +1401 +1402 +1403 +1404 +1405 +1406 +1407 +1408 +1409 +1410 +1411 +1412 +1413 +1414 +1415 +1416 +1417 +1418 +1419 +1420 +1421 +1422 +1423 +1424 +1425 +1426 +1427 +1428 +1429 +1430 +1431 +1432 +1433 +1434 +1435 +1436 +1437 +1438 +1439 +1440 +1441 +1442 +1443 +1444 +1445 +1446 +1447 +1448 +1449 +1450 +1451 +1452 +1453 +1454 +1455 +1456 +1457 +1458 +1459 +1460 +1461 +1462 +1463 +1464 +1465 +1466 +1467 +1468 +1469 +1470 +1471 +1472 +1473 +1474 +1475 +1476 +1477 +1478 +1479 +1480 +1481 +1482 +1483 +1484 +1485 +1486 +1487 +1488 +1489 +1490 +1491 +1492 +1493 +1494 +1495 +1496 +1497 +1498 +1499 +1500 +1501 +1502 +1503 +1504 +1505 +1506 +1507 +1508 +1509 +1510 +1511 +1512 +1513 +1514 +1515 +1516 +1517 +1518 +1519 +1520 +1521 +1522 +1523 +1524 +1525 +1526 +1527 +1528 +1529 +1530 +1531 +1532 +1533 +1534 +1535 +1536 +1537 +1538 +1539 +1540 +1541 +1542 +1543 +1544 +1545 +1546 +1547 +1548 +1549 +1550 +1551 +1552 +1553 +1554 +1555 +1556 +1557 +1558 +1559 +1560 +1561 +1562 +1563 +1564 +1565 +1566 +1567 +1568 +1569 +1570 +1571 +1572 +1573 +1574 +1575 +1576 +1577 +1578 +1579 +1580 +1581 +1582 +1583 +1584 +1585 +1586 +1587 +1588 +1589 +1590 +1591 +1592 +1593 +1594 +1595 +1596 +1597 +1598 +1599 +1600 +1601 +1602 +1603 +1604 +1605 +1606 +1607 +1608 +1609 +1610 +1611 +1612 +1613 +1614 +1615 +1616 +1617 +1618 +1619 +1620 +1621 +1622 +1623 +1624 +1625 +1626 +1627 +1628 +1629 +1630 +1631 +1632 +1633 +1634 +1635 +1636 +1637 +1638 +1639 +1640 +1641 +1642 +1643 +1644 +1645 +1646 +1647 +1648 +1649 +1650 +1651 +1652 +1653 +1654 +1655 +1656 +1657 +1658 +1659 +1660 +1661 +1662 +1663 +1664 +1665 +1666 +1667 +1668 +1669 +1670 +1671 +1672 +1673 +1674 +1675 +1676 +1677 +1678 +1679 +1680 +1681 +1682 +1683 +1684 +1685 +1686 +1687 +1688 +1689 +1690 +1691 +1692 +1693 +1694 +1695 +1696 +1697 +1698 +1699 +1700 +1701 +1702 +1703 +1704 +1705 +1706 +1707 +1708 +1709 +1710 +1711 +1712 +1713 +1714 +1715 +1716 +1717 +1718 +1719 +1720 +1721 +1722 +1723 +1724 +1725 +1726 +1727 +1728 +1729 +1730 +1731 +1732 +1733 +1734 +1735 +1736 +1737 +1738 +1739 +1740 +1741 +1742 +1743 +1744 +1745 +1746 +1747 +1748 +1749 +1750 +1751 +1752 +1753 +1754 +1755 +1756 +1757 +1758 +1759 +1760 +1761 +1762 +1763 +1764 +1765 +1766 +1767 +1768 +1769 +1770 +1771 +1772 +1773 +1774 +1775 +1776 +1777 +1778 +1779 +1780 +1781 +1782 +1783 +1784 +1785 +1786 +1787 +1788 +1789 +1790 +1791 +1792 +1793 +1794 +1795 +1796 +1797 +1798 +1799 +1800 +1801 +1802 +1803 +1804 +1805 +1806 +1807 +1808 +1809 +1810 +1811 +1812 +1813 +1814 +1815 +1816 +1817 +1818 +1819 +1820 +1821 +1822 +1823 +1824 +1825 +1826 +1827 +1828 +1829 +1830 +1831 +1832 +1833 +1834 +1835 +1836 +1837 +1838 +1839 +1840 +1841 +1842 +1843 +1844 +1845 +1846 +1847 +1848 +1849 +1850 +1851 +1852 +1853 +1854 +1855 +1856 +1857 +1858 +1859 +1860 +1861 +1862 +1863 +1864 +1865 +1866 +1867 +1868 +1869 +1870 +1871 +1872 +1873 +1874 +1875 +1876 +1877 +1878 +1879 +1880 +1881 +1882 +1883 +1884 +1885 +1886 +1887 +1888 +1889 +1890 +1891 +1892 +1893 +1894 +1895 +1896 +1897 +1898 +1899 +1900 +1901 +1902 +1903 +1904 +1905 +1906 +1907 +1908 +1909 +1910 +1911 +1912 +1913 +1914 +1915 +1916 +1917 +1918 +1919 +1920 +1921 +1922 +1923 +1924 +1925 +1926 +1927 +1928 +1929 +1930 +1931 +1932 +1933 +1934 +1935 +1936 +1937 +1938 +1939 +1940 +1941 +1942 +1943 +1944 +1945 +1946 +1947 +1948 +1949 +1950 +1951 +1952 +1953 +1954 +1955 +1956 +1957 +1958 +1959 +1960 +1961 +1962 +1963 +1964 +1965 +1966 +1967 +1968 +1969 +1970 +1971 +1972 +1973 +1974 +1975 +1976 +1977 +1978 +1979 +1980 +1981 +1982 +1983 +1984 +1985 +1986 +1987 +1988 +1989 +1990 +1991 +1992 +1993 +1994 +1995 +1996 +1997 +1998 +1999 +2000 +2001 +2002 +2003 +2004 +2005 +2006 +2007 +2008 +2009 +2010 +2011 +2012 +2013 +2014 +2015 +2016 +2017 +2018 +2019 +2020 +2021 +2022 +2023 +2024 +2025 +2026 +2027 +2028 +2029 +2030 +2031 +2032 +2033 +2034 +2035 +2036 +2037 +2038 +2039 +2040 +2041 +2042 +2043 +2044 +2045 +2046 +2047 +2048 +2049 +2050 +2051 +2052 +2053 +2054 +2055 +2056 +2057 +2058 +2059 +2060 +2061 +2062 +2063 +2064 +2065 +2066 +2067 +2068 +2069 +2070 +2071 +2072 +2073 +2074 +2075 +2076 +2077 +2078 +2079 +2080 +2081 +2082 +2083 +2084 +2085 +2086 +2087 +2088 +2089 +2090 +2091 +2092 +2093 +2094 +2095 +2096 +2097 +2098 +2099 +2100 +2101 +2102 +2103 +2104 +2105 +2106 +2107 +2108 +2109 +2110 +2111 +2112 +2113 +2114 +2115 +2116 +2117 +2118 +2119 +2120 +2121 +2122 +2123 +2124 +2125 +2126 +2127 +2128 +2129 +2130 +2131 +2132 +2133 +2134 +2135 +2136 +2137 +2138 +2139 +2140 +2141 +2142 +2143 +2144 +2145 +2146 +2147 +2148 +2149 +2150 +2151 +2152 +2153 +2154 +2155 +2156 +2157 +2158 +2159 +2160 +2161 +2162 +2163 +2164 +2165 +2166 +2167 +2168 +2169 +2170 +2171 +2172 +2173 +2174 +2175 +2176 +2177 +2178 +2179 +2180 +2181 +2182 +2183 +2184 +2185 +2186 +2187 +2188 +2189 +2190 +2191 +2192 +2193 +2194 +2195 +2196 +2197 +2198 +2199 +2200 +2201 +2202 +2203 +2204 +2205 +2206 +2207 +2208 +2209 +2210 +2211 +2212 +2213 +2214 +2215 +2216 +2217 +2218 +2219 +2220 +2221 +2222 +2223 +2224 +2225 +2226 +2227 +2228 +2229 +2230 +2231 +2232 +2233 +2234 +2235 +2236 +2237 +2238 +2239 +2240 +2241 +2242 +2243 +2244 +2245 +2246 +2247 +2248 +2249 +2250 +2251 +2252 +2253 +2254 +2255 +2256 +2257 +2258 +2259 +2260 +2261 +2262 +2263 +2264 +2265 +2266 +2267 +2268 +2269 +2270 +2271 +2272 +2273 +2274 +2275 +2276 +2277 +2278 +2279 +2280 +2281 +2282 +2283 +2284 +2285 +2286 +2287 +2288 +2289 +2290 +2291 +2292 +2293 +2294 +2295 +2296 +2297 +2298 +2299 +2300 +2301 +2302 +2303 +2304 +2305 +2306 +2307 +2308 +2309 +2310 +2311 +2312 +2313 +2314 +2315 +2316 +2317 +2318 +2319 +2320 +2321 +2322 +2323 +2324 +2325 +2326 +2327 +2328 +2329 +2330 +2331 +2332 +2333 +2334 +2335 +2336 +2337 +2338 +2339 +2340 +2341 +2342 +2343 +2344 +2345 +2346 +2347 +2348 +2349 +2350 +2351 +2352 +2353 +2354 +2355 +2356 +2357 +2358 +2359 +2360 +2361 +2362 +2363 +2364 +2365 +2366 +2367 +2368 +2369 +2370 +2371 +2372 +2373 +2374 +2375 +2376 +2377 +2378 +2379 +2380 +2381 +2382 +2383 +2384 +2385 +2386 +2387 +2388 +2389 +2390 +2391 +2392 +2393 +2394 +2395 +2396 +2397 +2398 +2399 +2400 +2401 +2402 +2403 +2404 +2405 +2406 +2407 +2408 +2409 +2410 +2411 +2412 +2413 +2414 +2415 +2416 +2417 +2418 +2419 +2420 +2421 +2422 +2423 +2424 +2425 +2426 +2427 +2428 +2429 +2430 +2431 +2432 +2433 +2434 +2435 +2436 +2437 +2438 +2439 +2440 +2441 +2442 +2443 +2444 +2445 +2446 +2447 +2448 +2449 +2450 +2451 +2452 +2453 +2454 +2455 +2456 +2457 +2458 +2459 +2460 +2461 +2462 +2463 +2464 +2465 +2466 +2467 +2468 +2469 +2470 +2471 +2472 +2473 +2474 +2475 +2476 +2477 +2478 +2479 +2480 +2481 +2482 +2483 +2484 +2485 +2486 +2487 +2488 +2489 +2490 +2491 +2492 +2493 +2494 +2495 +2496 +2497 +2498 +2499 +2500 +2501 +2502 +2503 +2504 +2505 +2506 +2507 +2508 +2509 +2510 +2511 +2512 +2513 +2514 +2515 +2516 +2517 +2518 +2519 +2520 +2521 +2522 +2523 +2524 +2525 +2526 +2527 +2528 +2529 +2530 +2531 +2532 +2533 +2534 +2535 +2536 +2537 +2538 +2539 +2540 +2541 +2542 +2543 +2544 +2545 +2546 +2547 +2548 +2549 +2550 +2551 +2552 +2553 +2554 +2555 +2556 +2557 +2558 +2559 +2560 +2561 +2562 +2563 +2564 +2565 +2566 +2567 +2568 +2569 +2570 +2571 +2572 +2573 +2574 +2575 +2576 +2577 +2578 +2579 +2580 +2581 +2582 +2583 +2584 +2585 +2586 +2587 +2588 +2589 +2590 +2591 +2592 +2593 +2594 +2595 +2596 +2597 +2598 +2599 +2600 +2601 +2602 +2603 +2604 +2605 +2606 +2607 +2608 +2609 +2610 +2611 +2612 +2613 +2614 +2615 +2616 +2617 +2618 +2619 +2620 +2621 +2622 +2623 +2624 +2625 +2626 +2627 +2628 +2629 +2630 +2631 +2632 +2633 +2634 +2635 +2636 +2637 +2638 +2639 +2640 +2641 +2642 +2643 +2644 +2645 +2646 +2647 +2648 +2649 +2650 +2651 +2652 +2653 +2654 +2655 +2656 +2657 +2658 +2659 +2660 +2661 +2662 +2663 +2664 +2665 +2666 +2667 +2668 +2669 +2670 +2671 +2672 +2673 +2674 +2675 +2676 +2677 +2678 +2679 +2680 +2681 +2682 +2683 +2684 +2685 +2686 +2687 +2688 +2689 +2690 +2691 +2692 +2693 +2694 +2695 +2696 +2697 +2698 +2699 +2700 +2701 +2702 +2703 +2704 +2705 +2706 +2707 +2708 +2709 +2710 +2711 +2712 +2713 +2714 +2715 +2716 +2717 +2718 +2719 +2720 +2721 +2722 +2723 +2724 +2725 +2726 +2727 +2728 +2729 +2730 +2731 +2732 +2733 +2734 +2735 +2736 +2737 +2738 +2739 +2740 +2741 +2742 +2743 +2744 +2745 +2746 +2747 +2748 +2749 +2750 +2751 +2752 +2753 +2754 +2755 +2756 +2757 +2758 +2759 +2760 +2761 +2762 +2763 +2764 +2765 +2766 +2767 +2768 +2769 +2770 +2771 +2772 +2773 +2774 +2775 +2776 +2777 +2778 +2779 +2780 +2781 +2782 +2783 +2784 +2785 +2786 +2787 +2788 +2789 +2790 +2791 +2792 +2793 +2794 +2795 +2796 +2797 +2798 +2799 +2800 +2801 +2802 +2803 +2804 +2805 +2806 +2807 +2808 +2809 +2810 +2811 +2812 +2813 +2814 +2815 +2816 +2817 +2818 +2819 +2820 +2821 +2822 +2823 +2824 +2825 +2826 +2827 +2828 +2829 +2830 +2831 +2832 +2833 +2834 +2835 +2836 +2837 +2838 +2839 +2840 +2841 +2842 +2843 +2844 +2845 +2846 +2847 +2848 +2849 +2850 +2851 +2852 +2853 +2854 +2855 +2856 +2857 +2858 +2859 +2860 +2861 +2862 +2863 +2864 +2865 +2866 +2867 +2868 +2869 +2870 +2871 +2872 +2873 +2874 +2875 +2876 +2877 +2878 +2879 +2880 +2881 +2882 +2883 +2884 +2885 +2886 +2887 +2888 +2889 +2890 +2891 +2892 +2893 +2894 +2895 +2896 +2897 +2898 +2899 +2900 +2901 +2902 +2903 +2904 +2905 +2906 +2907 +2908 +2909 +2910 +2911 +2912 +2913 +2914 +2915 +2916 +2917 +2918 +2919 +2920 +2921 +2922 +2923 +2924 +2925 +2926 +2927 +2928 +2929 +2930 +2931 +2932 +2933 +2934 +2935 +2936 +2937 +2938 +2939 +2940 +2941 +2942 +2943 +2944 +2945 +2946 +2947 +2948 +2949 +2950 +2951 +2952 +2953 +2954 +2955 +2956 +2957 +2958 +2959 +2960 +2961 +2962 +2963 +2964 +2965 +2966 +2967 +2968 +2969 +2970 +2971 +2972 +2973 +2974 +2975 +2976 +2977 +2978 +2979 +2980 +2981 +2982 +2983 +2984 +2985 +2986 +2987 +2988 +2989 +2990 +2991 +2992 +2993 +2994 +2995 +2996 +2997 +2998 +2999 +3000 +3001 +3002 +3003 +3004 +3005 +3006 +3007 +3008 +3009 +3010 +3011 +3012 +3013 +3014 +3015 +3016 +3017 +3018 +3019 +3020 +3021 +3022 +3023 +3024 +3025 +3026 +3027 +3028 +3029 +3030 +3031 +3032 +3033 +3034 +3035 +3036 +3037 +3038 +3039 +3040 +3041 +3042 +3043 +3044 +3045 +3046 +3047 +3048 +3049 +3050 +3051 +3052 +3053 +3054 +3055 +3056 +3057 +3058 +3059 +3060 +3061 +3062 +3063 +3064 +3065 +3066 +3067 +3068 +3069 +3070 +3071 +3072 +3073 +3074 +3075 +3076 +3077 +3078 +3079 +3080 +3081 +3082 +3083 +3084 +3085 +3086 +3087 +3088 +3089 +3090 +3091 +3092 +3093 +3094 +3095 +3096 +3097 +3098 +3099 +3100 +3101 +3102 +3103 +3104 +3105 +3106 +3107 +3108 +3109 +3110 +3111 +3112 +3113 +3114 +3115 +3116 +3117 +3118 +3119 +3120 +3121 +3122 +3123 +3124 +3125 +3126 +3127 +3128 +3129 +3130 +3131 +3132 +3133 +3134 +3135 +3136 +3137 +3138 +3139 +3140 +3141 +3142 +3143 +3144 +3145 +3146 +3147 +3148 +3149 +3150 +3151 +3152 +3153 +3154 +3155 +3156 +3157 +3158 +3159 +3160 +3161 +3162 +3163 +3164 +3165 +3166 +3167 +3168 +3169 +3170 +3171 +3172 +3173 +3174 +3175 +3176 +3177 +3178 +3179 +3180 +3181 +3182 +3183 +3184 +3185 +3186 +3187 +3188 +3189 +3190 +3191 +3192 +3193 +3194 +3195 +3196 +3197 +3198 +3199 +3200 +3201 +3202 +3203 +3204 +3205 +3206 +3207 +3208 +3209 +3210 +3211 +3212 +3213 +3214 +3215 +3216 +3217 +3218 +3219 +3220 +3221 +3222 +3223 +3224 +3225 +3226 +3227 +3228 +3229 +3230 +3231 +3232 +3233 +3234 +3235 +3236 +3237 +3238 +3239 +3240 +3241 +3242 +3243 +3244 +3245 +3246 +3247 +3248 +3249 +3250 +3251 +3252 +3253 +3254 +3255 +3256 +3257 +3258 +3259 +3260 +3261 +3262 +3263 +3264 +3265 +3266 +3267 +3268 +3269 +3270 +3271 +3272 +3273 +3274 +3275 +3276 +3277 +3278 +3279 +3280 +3281 +3282 +3283 +3284 +3285 +3286 +3287 +3288 +3289 +3290 +3291 +3292 +3293 +3294 +3295 +3296 +3297 +3298 +3299 +3300 +3301 +3302 +3303 +3304 +3305 +3306 +3307 +3308 +3309 +3310 +3311 +3312 +3313 +3314 +3315 +3316 +3317 +3318 +3319 +3320 +3321 +3322 +3323 +3324 +3325 +3326 +3327 +3328 +3329 +3330 +3331 +3332 +3333 +3334 +3335 +3336 +3337 +3338 +3339 +3340 +3341 +3342 +3343 +3344 +3345 +3346 +3347 +3348 +3349 +3350 +3351 +3352 +3353 +3354 +3355 +3356 +3357 +3358 +3359 +3360 +3361 +3362 +3363 +3364 +3365 +3366 +3367 +3368 +3369 +3370 +3371 +3372 +3373 +3374 +3375 +3376 +3377 +3378 +3379 +3380 +3381 +3382 +3383 +3384 +3385 +3386 +3387 +3388 +3389 +3390 +3391 +3392 +3393 +3394 +3395 +3396 +3397 +3398 +3399 +3400 +3401 +3402 +3403 +3404 +3405 +3406 +3407 +3408 +3409 +3410 +3411 +3412 +3413 +3414 +3415 +3416 +3417 +3418 +3419 +3420 +3421 +3422 +3423 +3424 +3425 +3426 +3427 +3428 +3429 +3430 +3431 +3432 +3433 +3434 +3435 +3436 +3437 +3438 +3439 +3440 +3441 +3442 +3443 +3444 +3445 +3446 +3447 +3448 +3449 +3450 +3451 +3452 +3453 +3454 +3455 +3456 +3457 +3458 +3459 +3460 +3461 +3462 +3463 +3464 +3465 +3466 +3467 +3468 +3469 +3470 +3471 +3472 +3473 +3474 +3475 +3476 +3477 +3478 +3479 +3480 +3481 +3482 +3483 +3484 +3485 +3486 +3487 +3488 +3489 +3490 +3491 +3492 +3493 +3494 +3495 +3496 +3497 +3498 +3499 +3500 +3501 +3502 +3503 +3504 +3505 +3506 +3507 +3508 +3509 +3510 +3511 +3512 +3513 +3514 +3515 +3516 +3517 +3518 +3519 +3520 +3521 +3522 +3523 +3524 +3525 +3526 +3527 +3528 +3529 +3530 +3531 +3532 +3533 +3534 +3535 +3536 +3537 +3538 +3539 +3540 +3541 +3542 +3543 +3544 +3545 +3546 +3547 +3548 +3549 +3550 +3551 +3552 +3553 +3554 +3555 +3556 +3557 +3558 +3559 +3560 +3561 +3562 +3563 +3564 +3565 +3566 +3567 +3568 +3569 +3570 +3571 +3572 +3573 +3574 +3575 +3576 +3577 +3578 +3579 +3580 +3581 +3582 +3583 +3584 +3585 +3586 +3587 +3588 +3589 +3590 +3591 +3592 +3593 +3594 +3595 +3596 +3597 +3598 +3599 +3600 +3601 +3602 +3603 +3604 +3605 +3606 +3607 +3608 +3609 +3610 +3611 +3612 +3613 +3614 +3615 +3616 +3617 +3618 +3619 +3620 +3621 +3622 +3623 +3624 +3625 +3626 +3627 +3628 +3629 +3630 +3631 +3632 +3633 +3634 +3635 +3636 +3637 +3638 +3639 +3640 +3641 +3642 +3643 +3644 +3645 +3646 +3647 +3648 +3649 +3650 +3651 +3652 +3653 +3654 +3655 +3656 +3657 +3658 +3659 +3660 +3661 +3662 +3663 +3664 +3665 +3666 +3667 +3668 +3669 +3670 +3671 +3672 +3673 +3674 +3675 +3676 +3677 +3678 +3679 +3680 +3681 +3682 +3683 +3684 +3685 +3686 +3687 +3688 +3689 +3690 +3691 +3692 +3693 +3694 +3695 +3696 +3697 +3698 +3699 +3700 +3701 +3702 +3703 +3704 +3705 +3706 +3707 +3708 +3709 +3710 +3711 +3712 +3713 +3714 +3715 +3716 +3717 +3718 +3719 +3720 +3721 +3722 +3723 +3724 +3725 +3726 +3727 +3728 +3729 +3730 +3731 +3732 +3733 +3734 +3735 +3736 +3737 +3738 +3739 +3740 +3741 +3742 +3743 +3744 +3745 +3746 +3747 +3748 +3749 +3750 +3751 +3752 +3753 +3754 +3755 +3756 +3757 +3758 +3759 +3760 +3761 +3762 +3763 +3764 +3765 +3766 +3767 +3768 +3769 +3770 +3771 +3772 +3773 +3774 +3775 +3776 +3777 +3778 +3779 +3780 +3781 +3782 +3783 +3784 +3785 +3786 +3787 +3788 +3789 +3790 +3791 +3792 +3793 +3794 +3795 +3796 +3797 +3798 +3799 +3800 +3801 +3802 +3803 +3804 +3805 +3806 +3807 +3808 +3809 +3810 +3811 +3812 +3813 +3814 +3815 +3816 +3817 +3818 +3819 +3820 +3821 +3822 +3823 +3824 +3825 +3826 +3827 +3828 +3829 +3830 +3831 +3832 +3833 +3834 +3835 +3836 +3837 +3838 +3839 +3840 +3841 +3842 +3843 +3844 +3845 +3846 +3847 +3848 +3849 +3850 +3851 +3852 +3853 +3854 +3855 +3856 +3857 +3858 +3859 +3860 +3861 +3862 +3863 +3864 +3865 +3866 +3867 +3868 +3869 +3870 +3871 +3872 +3873 +3874 +3875 +3876 +3877 +3878 +3879 +3880 +3881 +3882 +3883 +3884 +3885 +3886 +3887 +3888 +3889 +3890 +3891 +3892 +3893 +3894 +3895 +3896 +3897 +3898 +3899 +3900 +3901 +3902 +3903 +3904 +3905 +3906 +3907 +3908 +3909 +3910 +3911 +3912 +3913 +3914 +3915 +3916 +3917 +3918 +3919 +3920 +3921 +3922 +3923 +3924 +3925 +3926 +3927 +3928 +3929 +3930 +3931 +3932 +3933 +3934 +3935 +3936 +3937 +3938 +3939 +3940 +3941 +3942 +3943 +3944 +3945 +3946 +3947 +3948 +3949 +3950 +3951 +3952 +3953 +3954 +3955 +3956 +3957 +3958 +3959 +3960 +3961 +3962 +3963 +3964 +3965 +3966 +3967 +3968 +3969 +3970 +3971 +3972 +3973 +3974 +3975 +3976 +3977 +3978 +3979 +3980 +3981 +3982 +3983 +3984 +3985 +3986 +3987 +3988 +3989 +3990 +3991 +3992 +3993 +3994 +3995 +3996 +3997 +3998 +3999 +4000 +4001 +4002 +4003 +4004 +4005 +4006 +4007 +4008 +4009 +4010 +4011 +4012 +4013 +4014 +4015 +4016 +4017 +4018 +4019 +4020 +4021 +4022 +4023 +4024 +4025 +4026 +4027 +4028 +4029 +4030 +4031 +4032 +4033 +4034 +4035 +4036 +4037 +4038 +4039 +4040 +4041 +4042 +4043 +4044 +4045 +4046 +4047 +4048 +4049 +4050 +4051 +4052 +4053 +4054 +4055 +4056 +4057 +4058 +4059 +4060 +4061 +4062 +4063 +4064 +4065 +4066 +4067 +4068 +4069 +4070 +4071 +4072 +4073 +4074 +4075 +4076 +4077 +4078 +4079 +4080 +4081 +4082 +4083 +4084 +4085 +4086 +4087 +4088 +4089 +4090 +4091 +4092 +4093 +4094 +4095 +4096 +4097 +4098 +4099 +4100 +4101 +4102 +4103 +4104 +4105 +4106 +4107 +4108 +4109 +4110 +4111 +4112 +4113 +4114 +4115 +4116 +4117 +4118 +4119 +4120 +4121 +4122 +4123 +4124 +4125 +4126 +4127 +4128 +4129 +4130 +4131 +4132 +4133 +4134 +4135 +4136 +4137 +4138 +4139 +4140 +4141 +4142 +4143 +4144 +4145 +4146 +4147 +4148 +4149 +4150 +4151 +4152 +4153 +4154 +4155 +4156 +4157 +4158 +4159 +4160 +4161 +4162 +4163 +4164 +4165 +4166 +4167 +4168 +4169 +4170 +4171 +4172 +4173 +4174 +4175 +4176 +4177 +4178 +4179 +4180 +4181 +4182 +4183 +4184 +4185 +4186 +4187 +4188 +4189 +4190 +4191 +4192 +4193 +4194 +4195 +4196 +4197 +4198 +4199 +4200 +4201 +4202 +4203 +4204 +4205 +4206 +4207 +4208 +4209 +4210 +4211 +4212 +4213 +4214 +4215 +4216 +4217 +4218 +4219 +4220 +4221 +4222 +4223 +4224 +4225 +4226 +4227 +4228 +4229 +4230 +4231 +4232 +4233 +4234 +4235 +4236 +4237 +4238 +4239 +4240 +4241 +4242 +4243 +4244 +4245 +4246 +4247 +4248 +4249 +4250 +4251 +4252 +4253 +4254 +4255 +4256 +4257 +4258 +4259 +4260 +4261 +4262 +4263 +4264 +4265 +4266 +4267 +4268 +4269 +4270 +4271 +4272 +4273 +4274 +4275 +4276 +4277 +4278 +4279 +4280 +4281 +4282 +4283 +4284 +4285 +4286 +4287 +4288 +4289 +4290 +4291 +4292 +4293 +4294 +4295 +4296 +4297 +4298 +4299 +4300 +4301 +4302 +4303 +4304 +4305 +4306 +4307 +4308 +4309 +4310 +4311 +4312 +4313 +4314 +4315 +4316 +4317 +4318 +4319 +4320 +4321 +4322 +4323 +4324 +4325 +4326 +4327 +4328 +4329 +4330 +4331 +4332 +4333 +4334 +4335 +4336 +4337 +4338 +4339 +4340 +4341 +4342 +4343 +4344 +4345 +4346 +4347 +4348 +4349 +4350 +4351 +4352 +4353 +4354 +4355 +4356 +4357 +4358 +4359 +4360 +4361 +4362 +4363 +4364 +4365 +4366 +4367 +4368 +4369 +4370 +4371 +4372 +4373 +4374 +4375 +4376 +4377 +4378 +4379 +4380 +4381 +4382 +4383 +4384 +4385 +4386 +4387 +4388 +4389 +4390 +4391 +4392 +4393 +4394 +4395 +4396 +4397 +4398 +4399 +4400 +4401 +4402 +4403 +4404 +4405 +4406 +4407 +4408 +4409 +4410 +4411 +4412 +4413 +4414 +4415 +4416 +4417 +4418 +4419 +4420 +4421 +4422 +4423 +4424 +4425 +4426 +4427 +4428 +4429 +4430 +4431 +4432 +4433 +4434 +4435 +4436 +4437 +4438 +4439 +4440 +4441 +4442 +4443 +4444 +4445 +4446 +4447 +4448 +4449 +4450 +4451 +4452 +4453 +4454 +4455 +4456 +4457 +4458 +4459 +4460 +4461 +4462 +4463 +4464 +4465 +4466 +4467 +4468 +4469 +4470 +4471 +4472 +4473 +4474 +4475 +4476 +4477 +4478 +4479 +4480 +4481 +4482 +4483 +4484 +4485 +4486 +4487 +4488 +4489 +4490 +4491 +4492 +4493 +4494 +4495 +4496 +4497 +4498 +4499 +4500 +4501 +4502 +4503 +4504 +4505 +4506 +4507 +4508 +4509 +4510 +4511 +4512 +4513 +4514 +4515 +4516 +4517 +4518 +4519 +4520 +4521 +4522 +4523 +4524 +4525 +4526 +4527 +4528 +4529 +4530 +4531 +4532 +4533 +4534 +4535 +4536 +4537 +4538 +4539 +4540 +4541 +4542 +4543 +4544 +4545 +4546 +4547 +4548 +4549 +4550 +4551 +4552 +4553 +4554 +4555 +4556 +4557 +4558 +4559 +4560 +4561 +4562 +4563 +4564 +4565 +4566 +4567 +4568 +4569 +4570 +4571 +4572 +4573 +4574 +4575 +4576 +4577 +4578 +4579 +4580 +4581 +4582 +4583 +4584 +4585 +4586 +4587 +4588 +4589 +4590 +4591 +4592 +4593 +4594 +4595 +4596 +4597 +4598 +4599 +4600 +4601 +4602 +4603 +4604 +4605 +4606 +4607 +4608 +4609 +4610 +4611 +4612 +4613 +4614 +4615 +4616 +4617 +4618 +4619 +4620 +4621 +4622 +4623 +4624 +4625 +4626 +4627 +4628 +4629 +4630 +4631 +4632 +4633 +4634 +4635 +4636 +4637 +4638 +4639 +4640 +4641 +4642 +4643 +4644 +4645 +4646 +4647 +4648 +4649 +4650 +4651 +4652 +4653 +4654 +4655 +4656 +4657 +4658 +4659 +4660 +4661 +4662 +4663 +4664 +4665 +4666 +4667 +4668 +4669 +4670 +4671 +4672 +4673 +4674 +4675 +4676 +4677 +4678 +4679 +4680 +4681 +4682 +4683 +4684 +4685 +4686 +4687 +4688 +4689 +4690 +4691 +4692 +4693 +4694 +4695 +4696 +4697 +4698 +4699 +4700 +4701 +4702 +4703 +4704 +4705 +4706 +4707 +4708 +4709 +4710 +4711 +4712 +4713 +4714 +4715 +4716 +4717 +4718 +4719 +4720 +4721 +4722 +4723 +4724 +4725 +4726 +4727 +4728 +4729 +4730 +4731 +4732 +4733 +4734 +4735 +4736 +4737 +4738 +4739 +4740 +4741 +4742 +4743 +4744 +4745 +4746 +4747 +4748 +4749 +4750 +4751 +4752 +4753 +4754 +4755 +4756 +4757 +4758 +4759 +4760 +4761 +4762 +4763 +4764 +4765 +4766 +4767 +4768 +4769 +4770 +4771 +4772 +4773 +4774 +4775 +4776 +4777 +4778 +4779 +4780 +4781 +4782 +4783 +4784 +4785 +4786 +4787 +4788 +4789 +4790 +4791 +4792 +4793 +4794 +4795 +4796 +4797 +4798 +4799 +4800 +4801 +4802 +4803 +4804 +4805 +4806 +4807 +4808 +4809 +4810 +4811 +4812 +4813 +4814 +4815 +4816 +4817 +4818 +4819 +4820 +4821 +4822 +4823 +4824 +4825 +4826 +4827 +4828 +4829 +4830 +4831 +4832 +4833 +4834 +4835 +4836 +4837 +4838 +4839 +4840 +4841 +4842 +4843 +4844 +4845 +4846 +4847 +4848 +4849 +4850 +4851 +4852 +4853 +4854 +4855 +4856 +4857 +4858 +4859 +4860 +4861 +4862 +4863 +4864 +4865 +4866 +4867 +4868 +4869 +4870 +4871 +4872 +4873 +4874 +4875 +4876 +4877 +4878 +4879 +4880 +4881 +4882 +4883 +4884 +4885 +4886 +4887 +4888 +4889 +4890 +4891 +4892 +4893 +4894 +4895 +4896 +4897 +4898 +4899 +4900 +4901 +4902 +4903 +4904 +4905 +4906 +4907 +4908 +4909 +4910 +4911 +4912 +4913 +4914 +4915 +4916 +4917 +4918 +4919 +4920 +4921 +4922 +4923 +4924 +4925 +4926 +4927 +4928 +4929 +4930 +4931 +4932 +4933 +4934 +4935 +4936 +4937 +4938 +4939 +4940 +4941 +4942 +4943 +4944 +4945 +4946 +4947 +4948 +4949 +4950 +4951 +4952 +4953 +4954 +4955 +4956 +4957 +4958 +4959 +4960 +4961 +4962 +4963 +4964 +4965 +4966 +4967 +4968 +4969 +4970 +4971 +4972 +4973 +4974 +4975 +4976 +4977 +4978 +4979 +4980 +4981 +4982 +4983 +4984 +4985 +4986 +4987 +4988 +4989 +4990 +4991 +4992 +4993 +4994 +4995 +4996 +4997 +4998 +4999 +5000 +5001 +5002 +5003 +5004 +5005 +5006 +5007 +5008 +5009 +5010 +5011 +5012 +5013 +5014 +5015 +5016 +5017 +5018 +5019 +5020 +5021 +5022 +5023 +5024 +5025 +5026 +5027 +5028 +5029 +5030 +5031 +5032 +5033 +5034 +5035 +5036 +5037 +5038 +5039 +5040 +5041 +5042 +5043 +5044 +5045 +5046 +5047 +5048 +5049 +5050 +5051 +5052 +5053 +5054 +5055 +5056 +5057 +5058 +5059 +5060 +5061 +5062 +5063 +5064 +5065 +5066 +5067 +5068 +5069 +5070 +5071 +5072 +5073 +5074 +5075 +5076 +5077 +5078 +5079 +5080 +5081 +5082 +5083 +5084 +5085 +5086 +5087 +5088 +5089 +5090 +5091 +5092 +5093 +5094 +5095 +5096 +5097 +5098 +5099 +5100 +5101 +5102 +5103 +5104 +5105 +5106 +5107 +5108 +5109 +5110 +5111 +5112 +5113 +5114 +5115 +5116 +5117 +5118 +5119 +5120 +5121 +5122 +5123 +5124 +5125 +5126 +5127 +5128 +5129 +5130 +5131 +5132 +5133 +5134 +5135 +5136 +5137 +5138 +5139 +5140 +5141 +5142 +5143 +5144 +5145 +5146 +5147 +5148 +5149 +5150 +5151 +5152 +5153 +5154 +5155 +5156 +5157 +5158 +5159 +5160 +5161 +5162 +5163 +5164 +5165 +5166 +5167 +5168 +5169 +5170 +5171 +5172 +5173 +5174 +5175 +5176 +5177 +5178 +5179 +5180 +5181 +5182 +5183 +5184 +5185 +5186 +5187 +5188 +5189 +5190 +5191 +5192 +5193 +5194 +5195 +5196 +5197 +5198 +5199 +5200 +5201 +5202 +5203 +5204 +5205 +5206 +5207 +5208 +5209 +5210 +5211 +5212 +5213 +5214 +5215 +5216 +5217 +5218 +5219 +5220 +5221 +5222 +5223 +5224 +5225 +5226 +5227 +5228 +5229 +5230 +5231 +5232 +5233 +5234 +5235 +5236 +5237 +5238 +5239 +5240 +5241 +5242 +5243 +5244 +5245 +5246 +5247 +5248 +5249 +5250 +5251 +5252 +5253 +5254 +5255 +5256 +5257 +5258 +5259 +5260 +5261 +5262 +5263 +5264 +5265 +5266 +5267 +5268 +5269 +5270 +5271 +5272 +5273 +5274 +5275 +5276 +5277 +5278 +5279 +5280 +5281 +5282 +5283 +5284 +5285 +5286 +5287 +5288 +5289 +5290 +5291 +5292 +5293 +5294 +5295 +5296 +5297 +5298 +5299 +5300 +5301 +5302 +5303 +5304 +5305 +5306 +5307 +5308 +5309 +5310 +5311 +5312 +5313 +5314 +5315 +5316 +5317 +5318 +5319 +5320 +5321 +5322 +5323 +5324 +5325 +5326 +5327 +5328 +5329 +5330 +5331 +5332 +5333 +5334 +5335 +5336 +5337 +5338 +5339 +5340 +5341 +5342 +5343 +5344 +5345 +5346 +5347 +5348 +5349 +5350 +5351 +5352 +5353 +5354 +5355 +5356 +5357 +5358 +5359 +5360 +5361 +5362 +5363 +5364 +5365 +5366 +5367 +5368 +5369 +5370 +5371 +5372 +5373 +5374 +5375 +5376 +5377 +5378 +5379 +5380 +5381 +5382 +5383 +5384 +5385 +5386 +5387 +5388 +5389 +5390 +5391 +5392 +5393 +5394 +5395 +5396 +5397 +5398 +5399 +5400 +5401 +5402 +5403 +5404 +5405 +5406 +5407 +5408 +5409 +5410 +5411 +5412 +5413 +5414 +5415 +5416 +5417 +5418 +5419 +5420 +5421 +5422 +5423 +5424 +5425 +5426 +5427 +5428 +5429 +5430 +5431 +5432 +5433 +5434 +5435 +5436 +5437 +5438 +5439 +5440 +5441 +5442 +5443 +5444 +5445 +5446 +5447 +5448 +5449 +5450 +5451 +5452 +5453 +5454 +5455 +5456 +5457 +5458 +5459 +5460 +5461 +5462 +5463 +5464 +5465 +5466 +5467 +5468 +5469 +5470 +5471 +5472 +5473 +5474 +5475 +5476 +5477 +5478 +5479 +5480 +5481 +5482 +5483 +5484 +5485 +5486 +5487 +5488 +5489 +5490 +5491 +5492 +5493 +5494 +5495 +5496 +5497 +5498 +5499 +5500 +5501 +5502 +5503 +5504 +5505 +5506 +5507 +5508 +5509 +5510 +5511 +5512 +5513 +5514 +5515 +5516 +5517 +5518 +5519 +5520 +5521 +5522 +5523 +5524 +5525 +5526 +5527 +5528 +5529 +5530 +5531 +5532 +5533 +5534 +5535 +5536 +5537 +5538 +5539 +5540 +5541 +5542 +5543 +5544 +5545 +5546 +5547 +5548 +5549 +5550 +5551 +5552 +5553 +5554 +5555 +5556 +5557 +5558 +5559 +5560 +5561 +5562 +5563 +5564 +5565 +5566 +5567 +5568 +5569 +5570 +5571 +5572 +5573 +5574 +5575 +5576 +5577 +5578 +5579 +5580 +5581 +5582 +5583 +5584 +5585 +5586 +5587 +5588 +5589 +5590 +5591 +5592 +5593 +5594 +5595 +5596 +5597 +5598 +5599 +5600 +5601 +5602 +5603 +5604 +5605 +5606 +5607 +5608 +5609 +5610 +5611 +5612 +5613 +5614 +5615 +5616 +5617 +5618 +5619 +5620 +5621 +5622 +5623 +5624 +5625 +5626 +5627 +5628 +5629 +5630 +5631 +5632 +5633 +5634 +5635 +5636 +5637 +5638 +5639 +5640 +5641 +5642 +5643 +5644 +5645 +5646 +5647 +5648 +5649 +5650 +5651 +5652 +5653 +5654 +5655 +5656 +5657 +5658 +5659 +5660 +5661 +5662 +5663 +5664 +5665 +5666 +5667 +5668 +5669 +5670 +5671 +5672 +5673 +5674 +5675 +5676 +5677 +5678 +5679 +5680 +5681 +5682 +5683 +5684 +5685 +5686 +5687 +5688 +5689 +5690 +5691 +5692 +5693 +5694 +5695 +5696 +5697 +5698 +5699 +5700 +5701 +5702 +5703 +5704 +5705 +5706 +5707 +5708 +5709 +5710 +5711 +5712 +5713 +5714 +5715 +5716 +5717 +5718 +5719 +5720 +5721 +5722 +5723 +5724 +5725 +5726 +5727 +5728 +5729 +5730 +5731 +5732 +5733 +5734 +5735 +5736 +5737 +5738 +5739 +5740 +5741 +5742 +5743 +5744 +5745 +5746 +5747 +5748 +5749 +5750 +5751 +5752 +5753 +5754 +5755 +5756 +5757 +5758 +5759 +5760 +5761 +5762 +5763 +5764 +5765 +5766 +5767 +5768 +5769 +5770 +5771 +5772 +5773 +5774 +5775 +5776 +5777 +5778 +5779 +5780 +5781 +5782 +5783 +5784 +5785 +5786 +5787 +5788 +5789 +5790 +5791 +5792 +5793 +5794 +5795 +5796 +5797 +5798 +5799 +5800 +5801 +5802 +5803 +5804 +5805 +5806 +5807 +5808 +5809 +5810 +5811 +5812 +5813 +5814 +5815 +5816 +5817 +5818 +5819 +5820 +5821 +5822 +5823 +5824 +5825 +5826 +5827 +5828 +5829 +5830 +5831 +5832 +5833 +5834 +5835 +5836 +5837 +5838 +5839 +5840 +5841 +5842 +5843 +5844 +5845 +5846 +5847 +5848 +5849 +5850 +5851 +5852 +5853 +5854 +5855 +5856 +5857 +5858 +5859 +5860 +5861 +5862 +5863 +5864 +5865 +5866 +5867 +5868 +5869 +5870 +5871 +5872 +5873 +5874 +5875 +5876 +5877 +5878 +5879 +5880 +5881 +5882 +5883 +5884 +5885 +5886 +5887 +5888 +5889 +5890 +5891 +5892 +5893 +5894 +5895 +5896 +5897 +5898 +5899 +5900 +5901 +5902 +5903 +5904 +5905 +5906 +5907 +5908 +5909 +5910 +5911 +5912 +5913 +5914 +5915 +5916 +5917 +5918 +5919 +5920 +5921 +5922 +5923 +5924 +5925 +5926 +5927 +5928 +5929 +5930 +5931 +5932 +5933 +5934 +5935 +5936 +5937 +5938 +5939 +5940 +5941 +5942 +5943 +5944 +5945 +5946 +5947 +5948 +5949 +5950 +5951 +5952 +5953 +5954 +5955 +5956 +5957 +5958 +5959 +5960 +5961 +5962 +5963 +5964 +5965 +5966 +5967 +5968 +5969 +5970 +5971 +5972 +5973 +5974 +5975 +5976 +5977 +5978 +5979 +5980 +5981 +5982 +5983 +5984 +5985 +5986 +5987 +5988 +5989 +5990 +5991 +5992 +5993 +5994 +5995 +5996 +5997 +5998 +5999 +6000 +6001 +6002 +6003 +6004 +6005 +6006 +6007 +6008 +6009 +6010 +6011 +6012 +6013 +6014 +6015 +6016 +6017 +6018 +6019 +6020 +6021 +6022 +6023 +6024 +6025 +6026 +6027 +6028 +6029 +6030 +6031 +6032 +6033 +6034 +6035 +6036 +6037 +6038 +6039 +6040 +6041 +6042 +6043 +6044 +6045 +6046 +6047 +6048 +6049 +6050 +6051 +6052 +6053 +6054 +6055 +6056 +6057 +6058 +6059 +6060 +6061 +6062 +6063 +6064 +6065 +6066 +6067 +6068 +6069 +6070 +6071 +6072 +6073 +6074 +6075 +6076 +6077 +6078 +6079 +6080 +6081 +6082 +6083 +6084 +6085 +6086 +6087 +6088 +6089 +6090 +6091 +6092 +6093 +6094 +6095 +6096 +6097 +6098 +6099 +6100 +6101 +6102 +6103 +6104 +6105 +6106 +6107 +6108 +6109 +6110 +6111 +6112 +6113 +6114 +6115 +6116 +6117 +6118 +6119 +6120 +6121 +6122 +6123 +6124 +6125 +6126 +6127 +6128 +6129 +6130 +6131 +6132 +6133 +6134 +6135 +6136 +6137 +6138 +6139 +6140 +6141 +6142 +6143 +6144 +6145 +6146 +6147 +6148 +6149 +6150 +6151 +6152 +6153 +6154 +6155 +6156 +6157 +6158 +6159 +6160 +6161 +6162 +6163 +6164 +6165 +6166 +6167 +6168 +6169 +6170 +6171 +6172 +6173 +6174 +6175 +6176 +6177 +6178 +6179 +6180 +6181 +6182 +6183 +6184 +6185 +6186 +6187 +6188 +6189 +6190 +6191 +6192 +6193 +6194 +6195 +6196 +6197 +6198 +6199 +6200 +6201 +6202 +6203 +6204 +6205 +6206 +6207 +6208 +6209 +6210 +6211 +6212 +6213 +6214 +6215 +6216 +6217 +6218 +6219 +6220 +6221 +6222 +6223 +6224 +6225 +6226 +6227 +6228 +6229 +6230 +6231 +6232 +6233 +6234 +6235 +6236 +6237 +6238 +6239 +6240 +6241 +6242 +6243 +6244 +6245 +6246 +6247 +6248 +6249 +6250 +6251 +6252 +6253 +6254 +6255 +6256 +6257 +6258 +6259 +6260 +6261 +6262 +6263 +6264 +6265 +6266 +6267 +6268 +6269 +6270 +6271 +6272 +6273 +6274 +6275 +6276 +6277 +6278 +6279 +6280 +6281 +6282 +6283 +6284 +6285 +6286 +6287 +6288 +6289 +6290 +6291 +6292 +6293 +6294 +6295 +6296 +6297 +6298 +6299 +6300 +6301 +6302 +6303 +6304 +6305 +6306 +6307 +6308 +6309 +6310 +6311 +6312 +6313 +6314 +6315 +6316 +6317 +6318 +6319 +6320 +6321 +6322 +6323 +6324 +6325 +6326 +6327 +6328 +6329 +6330 +6331 +6332 +6333 +6334 +6335 +6336 +6337 +6338 +6339 +6340 +6341 +6342 +6343 +6344 +6345 +6346 +6347 +6348 +6349 +6350 +6351 +6352 +6353 +6354 +6355 +6356 +6357 +6358 +6359 +6360 +6361 +6362 +6363 +6364 +6365 +6366 +6367 +6368 +6369 +6370 +6371 +6372 +6373 +6374 +6375 +6376 +6377 +6378 +6379 +6380 +6381 +6382 +6383 +6384 +6385 +6386 +6387 +6388 +6389 +6390 +6391 +6392 +6393 +6394 +6395 +6396 +6397 +6398 +6399 +6400 +6401 +6402 +6403 +6404 +6405 +6406 +6407 +6408 +6409 +6410 +6411 +6412 +6413 +6414 +6415 +6416 +6417 +6418 +6419 +6420 +6421 +6422 +6423 +6424 +6425 +6426 +6427 +6428 +6429 +6430 +6431 +6432 +6433 +6434 +6435 +6436 +6437 +6438 +6439 +6440 +6441 +6442 +6443 +6444 +6445 +6446 +6447 +6448 +6449 +6450 +6451 +6452 +6453 +6454 +6455 +6456 +6457 +6458 +6459 +6460 +6461 +6462 +6463 +6464 +6465 +6466 +6467 +6468 +6469 +6470 +6471 +6472 +6473 +6474 +6475 +6476 +6477 +6478 +6479 +6480 +6481 +6482 +6483 +6484 +6485 +6486 +6487 +6488 +6489 +6490 +6491 +6492 +6493 +6494 +6495 +6496 +6497 +6498 +6499 +6500 +6501 +6502 +6503 +6504 +6505 +6506 +6507 +6508 +6509 +6510 +6511 +6512 +6513 +6514 +6515 +6516 +6517 +6518 +6519 +6520 +6521 +6522 +6523 +6524 +6525 +6526 +6527 +6528 +6529 +6530 +6531 +6532 +6533 +6534 +6535 +6536 +6537 +6538 +6539 +6540 +6541 +6542 +6543 +6544 +6545 +6546 +6547 +6548 +6549 +6550 +6551 +6552 +6553 +6554 +6555 +6556 +6557 +6558 +6559 +6560 +6561 +6562 +6563 +6564 +6565 +6566 +6567 +6568 +6569 +6570 +6571 +6572 +6573 +6574 +6575 +6576 +6577 +6578 +6579 +6580 +6581 +6582 +6583 +6584 +6585 +6586 +6587 +6588 +6589 +6590 +6591 +6592 +6593 +6594 +6595 +6596 +6597 +6598 +6599 +6600 +6601 +6602 +6603 +6604 +6605 +6606 +6607 +6608 +6609 +6610 +6611 +6612 +6613 +6614 +6615 +6616 +6617 +6618 +6619 +6620 +6621 +6622 +6623 +6624 +6625 +6626 +6627 +6628 +6629 +6630 +6631 +6632 +6633 +6634 +6635 +6636 +6637 +6638 +6639 +6640 +6641 +6642 +6643 +6644 +6645 +6646 +6647 +6648 +6649 +6650 +6651 +6652 +6653 +6654 +6655 +6656 +6657 +6658 +6659 +6660 +6661 +6662 +6663 +6664 +6665 +6666 +6667 +6668 +6669 +6670 +6671 +6672 +6673 +6674 +6675 +6676 +6677 +6678 +6679 +6680 +6681 +6682 +6683 +6684 +6685 +6686 +6687 +6688 +6689 +6690 +6691 +6692 +6693 +6694 +6695 +6696 +6697 +6698 +6699 +6700 +6701 +6702 +6703 +6704 +6705 +6706 +6707 +6708 +6709 +6710 +6711 +6712 +6713 +6714 +6715 +6716 +6717 +6718 +6719 +6720 +6721 +6722 +6723 +6724 +6725 +6726 +6727 +6728 +6729 +6730 +6731 +6732 +6733 +6734 +6735 +6736 +6737 +6738 +6739 +6740 +6741 +6742 +6743 +6744 +6745 +6746 +6747 +6748 +6749 +6750 +6751 +6752 +6753 +6754 +6755 +6756 +6757 +6758 +6759 +6760 +6761 +6762 +6763 +6764 +6765 +6766 +6767 +6768 +6769 +6770 +6771 +6772 +6773 +6774 +6775 +6776 +6777 +6778 +6779 +6780 +6781 +6782 +6783 +6784 +6785 +6786 +6787 +6788 +6789 +6790 +6791 +6792 +6793 +6794 +6795 +6796 +6797 +6798 +6799 +6800 +6801 +6802 +6803 +6804 +6805 +6806 +6807 +6808 +6809 +6810 +6811 +6812 +6813 +6814 +6815 +6816 +6817 +6818 +6819 +6820 +6821 +6822 +6823 +6824 +6825 +6826 +6827 +6828 +6829 +6830 +6831 +6832 +6833 +6834 +6835 +6836 +6837 +6838 +6839 +6840 +6841 +6842 +6843 +6844 +6845 +6846 +6847 +6848 +6849 +6850 +6851 +6852 +6853 +6854 +6855 +6856 +6857 +6858 +6859 +6860 +6861 +6862 +6863 +6864 +6865 +6866 +6867 +6868 +6869 +6870 +6871 +6872 +6873 +6874 +6875 +6876 +6877 +6878 +6879 +6880 +6881 +6882 +6883 +6884 +6885 +6886 +6887 +6888 +6889 +6890 +6891 +6892 +6893 +6894 +6895 +6896 +6897 +6898 +6899 +6900 +6901 +6902 +6903 +6904 +6905 +6906 +6907 +6908 +6909 +6910 +6911 +6912 +6913 +6914 +6915 +6916 +6917 +6918 +6919 +6920 +6921 +6922 +6923 +6924 +6925 +6926 +6927 +6928 +6929 +6930 +6931 +6932 +6933 +6934 +6935 +6936 +6937 +6938 +6939 +6940 +6941 +6942 +6943 +6944 +6945 +6946 +6947 +6948 +6949 +6950 +6951 +6952 +6953 +6954 +6955 +6956 +6957 +6958 +6959 +6960 +6961 +6962 +6963 +6964 +6965 +6966 +6967 +6968 +6969 +6970 +6971 +6972 +6973 +6974 +6975 +6976 +6977 +6978 +6979 +6980 +6981 +6982 +6983 +6984 +6985 +6986 +6987 +6988 +6989 +6990 +6991 +6992 +6993 +6994 +6995 +6996 +6997 +6998 +6999 +7000 +7001 +7002 +7003 +7004 +7005 +7006 +7007 +7008 +7009 +7010 +7011 +7012 +7013 +7014 +7015 +7016 +7017 +7018 +7019 +7020 +7021 +7022 +7023 +7024 +7025 +7026 +7027 +7028 +7029 +7030 +7031 +7032 +7033 +7034 +7035 +7036 +7037 +7038 +7039 +7040 +7041 +7042 +7043 +7044 +7045 +7046 +7047 +7048 +7049 +7050 +7051 +7052 +7053 +7054 +7055 +7056 +7057 +7058 +7059 +7060 +7061 +7062 +7063 +7064 +7065 +7066 +7067 +7068 +7069 +7070 +7071 +7072 +7073 +7074 +7075 +7076 +7077 +7078 +7079 +7080 +7081 +7082 +7083 +7084 +7085 +7086 +7087 +7088 +7089 +7090 +7091 +7092 +7093 +7094 +7095 +7096 +7097 +7098 +7099 +7100 +7101 +7102 +7103 +7104 +7105 +7106 +7107 +7108 +7109 +7110 +7111 +7112 +7113 +7114 +7115 +7116 +7117 +7118 +7119 +7120 +7121 +7122 +7123 +7124 +7125 +7126 +7127 +7128 +7129 +7130 +7131 +7132 +7133 +7134 +7135 +7136 +7137 +7138 +7139 +7140 +7141 +7142 +7143 +7144 +7145 +7146 +7147 +7148 +7149 +7150 +7151 +7152 +7153 +7154 +7155 +7156 +7157 +7158 +7159 +7160 +7161 +7162 +7163 +7164 +7165 +7166 +7167 +7168 +7169 +7170 +7171 +7172 +7173 +7174 +7175 +7176 +7177 +7178 +7179 +7180 +7181 +7182 +7183 +7184 +7185 +7186 +7187 +7188 +7189 +7190 +7191 +7192 +7193 +7194 +7195 +7196 +7197 +7198 +7199 +7200 +7201 +7202 +7203 +7204 +7205 +7206 +7207 +7208 +7209 +7210 +7211 +7212 +7213 +7214 +7215 +7216 +7217 +7218 +7219 +7220 +7221 +7222 +7223 +7224 +7225 +7226 +7227 +7228 +7229 +7230 +7231 +7232 +7233 +7234 +7235 +7236 +7237 +7238 +7239 +7240 +7241 +7242 +7243 +7244 +7245 +7246 +7247 +7248 +7249 +7250 +7251 +7252 +7253 +7254 +7255 +7256 +7257 +7258 +7259 +7260 +7261 +7262 +7263 +7264 +7265 +7266 +7267 +7268 +7269 +7270 +7271 +7272 +7273 +7274 +7275 +7276 +7277 +7278 +7279 +7280 +7281 +7282 +7283 +7284 +7285 +7286 +7287 +7288 +7289 +7290 +7291 +7292 +7293 +7294 +7295 +7296 +7297 +7298 +7299 +7300 +7301 +7302 +7303 +7304 +7305 +7306 +7307 +7308 +7309 +7310 +7311 +7312 +7313 +7314 +7315 +7316 +7317 +7318 +7319 +7320 +7321 +7322 +7323 +7324 +7325 +7326 +7327 +7328 +7329 +7330 +7331 +7332 +7333 +7334 +7335 +7336 +7337 +7338 +7339 +7340 +7341 +7342 +7343 +7344 +7345 +7346 +7347 +7348 +7349 +7350 +7351 +7352 +7353 +7354 +7355 +7356 +7357 +7358 +7359 +7360 +7361 +7362 +7363 +7364 +7365 +7366 +7367 +7368 +7369 +7370 +7371 +7372 +7373 +7374 +7375 +7376 +7377 +7378 +7379 +7380 +7381 +7382 +7383 +7384 +7385 +7386 +7387 +7388 +7389 +7390 +7391 +7392 +7393 +7394 +7395 +7396 +7397 +7398 +7399 +7400 +7401 +7402 +7403 +7404 +7405 +7406 +7407 +7408 +7409 +7410 +7411 +7412 +7413 +7414 +7415 +7416 +7417 +7418 +7419 +7420 +7421 +7422 +7423 +7424 +7425 +7426 +7427 +7428 +7429 +7430 +7431 +7432 +7433 +7434 +7435 +7436 +7437 +7438 +7439 +7440 +7441 +7442 +7443 +7444 +7445 +7446 +7447 +7448 +7449 +7450 +7451 +7452 +7453 +7454 +7455 +7456 +7457 +7458 +7459 +7460 +7461 +7462 +7463 +7464 +7465 +7466 +7467 +7468 +7469 +7470 +7471 +7472 +7473 +7474 +7475 +7476 +7477 +7478 +7479 +7480 +7481 +7482 +7483 +7484 +7485 +7486 +7487 +7488 +7489 +7490 +7491 +7492 +7493 +7494 +7495 +7496 +7497 +7498 +7499 +7500 +7501 +7502 +7503 +7504 +7505 +7506 +7507 +7508 +7509 +7510 +7511 +7512 +7513 +7514 +7515 +7516 +7517 +7518 +7519 +7520 +7521 +7522 +7523 +7524 +7525 +7526 +7527 +7528 +7529 +7530 +7531 +7532 +7533 +7534 +7535 +7536 +7537 +7538 +7539 +7540 +7541 +7542 +7543 +7544 +7545 +7546 +7547 +7548 +7549 +7550 +7551 +7552 +7553 +7554 +7555 +7556 +7557 +7558 +7559 +7560 +7561 +7562 +7563 +7564 +7565 +7566 +7567 +7568 +7569 +7570 +7571 +7572 +7573 +7574 +7575 +7576 +7577 +7578 +7579 +7580 +7581 +7582 +7583 +7584 +7585 +7586 +7587 +7588 +7589 +7590 +7591 +7592 +7593 +7594 +7595 +7596 +7597 +7598 +7599 +7600 +7601 +7602 +7603 +7604 +7605 +7606 +7607 +7608 +7609 +7610 +7611 +7612 +7613 +7614 +7615 +7616 +7617 +7618 +7619 +7620 +7621 +7622 +7623 +7624 +7625 +7626 +7627 +7628 +7629 +7630 +7631 +7632 +7633 +7634 +7635 +7636 +7637 +7638 +7639 +7640 +7641 +7642 +7643 +7644 +7645 +7646 +7647 +7648 +7649 +7650 +7651 +7652 +7653 +7654 +7655 +7656 +7657 +7658 +7659 +7660 +7661 +7662 +7663 +7664 +7665 +7666 +7667 +7668 +7669 +7670 +7671 +7672 +7673 +7674 +7675 +7676 +7677 +7678 +7679 +7680 +7681 +7682 +7683 +7684 +7685 +7686 +7687 +7688 +7689 +7690 +7691 +7692 +7693 +7694 +7695 +7696 +7697 +7698 +7699 +7700 +7701 +7702 +7703 +7704 +7705 +7706 +7707 +7708 +7709 +7710 +7711 +7712 +7713 +7714 +7715 +7716 +7717 +7718 +7719 +7720 +7721 +7722 +7723 +7724 +7725 +7726 +7727 +7728 +7729 +7730 +7731 +7732 +7733 +7734 +7735 +7736 +7737 +7738 +7739 +7740 +7741 +7742 +7743 +7744 +7745 +7746 +7747 +7748 +7749 +7750 +7751 +7752 +7753 +7754 +7755 +7756 +7757 +7758 +7759 +7760 +7761 +7762 +7763 +7764 +7765 +7766 +7767 +7768 +7769 +7770 +7771 +7772 +7773 +7774 +7775 +7776 +7777 +7778 +7779 +7780 +7781 +7782 +7783 +7784 +7785 +7786 +7787 +7788 +7789 +7790 +7791 +7792 +7793 +7794 +7795 +7796 +7797 +7798 +7799 +7800 +7801 +7802 +7803 +7804 +7805 +7806 +7807 +7808 +7809 +7810 +7811 +7812 +7813 +7814 +7815 +7816 +7817 +7818 +7819 +7820 +7821 +7822 +7823 +7824 +7825 +7826 +7827 +7828 +7829 +7830 +7831 +7832 +7833 +7834 +7835 +7836 +7837 +7838 +7839 +7840 +7841 +7842 +7843 +7844 +7845 +7846 +7847 +7848 +7849 +7850 +7851 +7852 +7853 +7854 +7855 +7856 +7857 +7858 +7859 +7860 +7861 +7862 +7863 +7864 +7865 +7866 +7867 +7868 +7869 +7870 +7871 +7872 +7873 +7874 +7875 +7876 +7877 +7878 +7879 +7880 +7881 +7882 +7883 +7884 +7885 +7886 +7887 +7888 +7889 +7890 +7891 +7892 +7893 +7894 +7895 +7896 +7897 +7898 +7899 +7900 +7901 +7902 +7903 +7904 +7905 +7906 +7907 +7908 +7909 +7910 +7911 +7912 +7913 +7914 +7915 +7916 +7917 +7918 +7919 +7920 +7921 +7922 +7923 +7924 +7925 +7926 +7927 +7928 +7929 +7930 +7931 +7932 +7933 +7934 +7935 +7936 +7937 +7938 +7939 +7940 +7941 +7942 +7943 +7944 +7945 +7946 +7947 +7948 +7949 +7950 +7951 +7952 +7953 +7954 +7955 +7956 +7957 +7958 +7959 +7960 +7961 +7962 +7963 +7964 +7965 +7966 +7967 +7968 +7969 +7970 +7971 +7972 +7973 +7974 +7975 +7976 +7977 +7978 +7979 +7980 +7981 +7982 +7983 +7984 +7985 +7986 +7987 +7988 +7989 +7990 +7991 +7992 +7993 +7994 +7995 +7996 +7997 +7998 +7999 +8000 +8001 +8002 +8003 +8004 +8005 +8006 +8007 +8008 +8009 +8010 +8011 +8012 +8013 +8014 +8015 +8016 +8017 +8018 +8019 +8020 +8021 +8022 +8023 +8024 +8025 +8026 +8027 +8028 +8029 +8030 +8031 +8032 +8033 +8034 +8035 +8036 +8037 +8038 +8039 +8040 +8041 +8042 +8043 +8044 +8045 +8046 +8047 +8048 +8049 +8050 +8051 +8052 +8053 +8054 +8055 +8056 +8057 +8058 +8059 +8060 +8061 +8062 +8063 +8064 +8065 +8066 +8067 +8068 +8069 +8070 +8071 +8072 +8073 +8074 +8075 +8076 +8077 +8078 +8079 +8080 +8081 +8082 +8083 +8084 +8085 +8086 +8087 +8088 +8089 +8090 +8091 +8092 +8093 +8094 +8095 +8096 +8097 +8098 +8099 +8100 +8101 +8102 +8103 +8104 +8105 +8106 +8107 +8108 +8109 +8110 +8111 +8112 +8113 +8114 +8115 +8116 +8117 +8118 +8119 +8120 +8121 +8122 +8123 +8124 +8125 +8126 +8127 +8128 +8129 +8130 +8131 +8132 +8133 +8134 +8135 +8136 +8137 +8138 +8139 +8140 +8141 +8142 +8143 +8144 +8145 +8146 +8147 +8148 +8149 +8150 +8151 +8152 +8153 +8154 +8155 +8156 +8157 +8158 +8159 +8160 +8161 +8162 +8163 +8164 +8165 +8166 +8167 +8168 +8169 +8170 +8171 +8172 +8173 +8174 +8175 +8176 +8177 +8178 +8179 +8180 +8181 +8182 +8183 +8184 +8185 +8186 +8187 +8188 +8189 +8190 +8191 +8192 +8193 +8194 +8195 +8196 +8197 +8198 +8199 +8200 +8201 +8202 +8203 +8204 +8205 +8206 +8207 +8208 +8209 +8210 +8211 +8212 +8213 +8214 +8215 +8216 +8217 +8218 +8219 +8220 +8221 +8222 +8223 +8224 +8225 +8226 +8227 +8228 +8229 +8230 +8231 +8232 +8233 +8234 +8235 +8236 +8237 +8238 +8239 +8240 +8241 +8242 +8243 +8244 +8245 +8246 +8247 +8248 +8249 +8250 +8251 +8252 +8253 +8254 +8255 +8256 +8257 +8258 +8259 +8260 +8261 +8262 +8263 +8264 +8265 +8266 +8267 +8268 +8269 +8270 +8271 +8272 +8273 +8274 +8275 +8276 +8277 +8278 +8279 +8280 +8281 +8282 +8283 +8284 +8285 +8286 +8287 +8288 +8289 +8290 +8291 +8292 +8293 +8294 +8295 +8296 +8297 +8298 +8299 +8300 +8301 +8302 +8303 +8304 +8305 +8306 +8307 +8308 +8309 +8310 +8311 +8312 +8313 +8314 +8315 +8316 +8317 +8318 +8319 +8320 +8321 +8322 +8323 +8324 +8325 +8326 +8327 +8328 +8329 +8330 +8331 +8332 +8333 +8334 +8335 +8336 +8337 +8338 +8339 +8340 +8341 +8342 +8343 +8344 +8345 +8346 +8347 +8348 +8349 +8350 +8351 +8352 +8353 +8354 +8355 +8356 +8357 +8358 +8359 +8360 +8361 +8362 +8363 +8364 +8365 +8366 +8367 +8368 +8369 +8370 +8371 +8372 +8373 +8374 +8375 +8376 +8377 +8378 +8379 +8380 +8381 +8382 +8383 +8384 +8385 +8386 +8387 +8388 +8389 +8390 +8391 +8392 +8393 +8394 +8395 +8396 +8397 +8398 +8399 +8400 +8401 +8402 +8403 +8404 +8405 +8406 +8407 +8408 +8409 +8410 +8411 +8412 +8413 +8414 +8415 +8416 +8417 +8418 +8419 +8420 +8421 +8422 +8423 +8424 +8425 +8426 +8427 +8428 +8429 +8430 +8431 +8432 +8433 +8434 +8435 +8436 +8437 +8438 +8439 +8440 +8441 +8442 +8443 +8444 +8445 +8446 +8447 +8448 +8449 +8450 +8451 +8452 +8453 +8454 +8455 +8456 +8457 +8458 +8459 +8460 +8461 +8462 +8463 +8464 +8465 +8466 +8467 +8468 +8469 +8470 +8471 +8472 +8473 +8474 +8475 +8476 +8477 +8478 +8479 +8480 +8481 +8482 +8483 +8484 +8485 +8486 +8487 +8488 +8489 +8490 +8491 +8492 +8493 +8494 +8495 +8496 +8497 +8498 +8499 +8500 +8501 +8502 +8503 +8504 +8505 +8506 +8507 +8508 +8509 +8510 +8511 +8512 +8513 +8514 +8515 +8516 +8517 +8518 +8519 +8520 +8521 +8522 +8523 +8524 +8525 +8526 +8527 +8528 +8529 +8530 +8531 +8532 +8533 +8534 +8535 +8536 +8537 +8538 +8539 +8540 +8541 +8542 +8543 +8544 +8545 +8546 +8547 +8548 +8549 +8550 +8551 +8552 +8553 +8554 +8555 +8556 +8557 +8558 +8559 +8560 +8561 +8562 +8563 +8564 +8565 +8566 +8567 +8568 +8569 +8570 +8571 +8572 +8573 +8574 +8575 +8576 +8577 +8578 +8579 +8580 +8581 +8582 +8583 +8584 +8585 +8586 +8587 +8588 +8589 +8590 +8591 +8592 +8593 +8594 +8595 +8596 +8597 +8598 +8599 +8600 +8601 +8602 +8603 +8604 +8605 +8606 +8607 +8608 +8609 +8610 +8611 +8612 +8613 +8614 +8615 +8616 +8617 +8618 +8619 +8620 +8621 +8622 +8623 +8624 +8625 +8626 +8627 +8628 +8629 +8630 +8631 +8632 +8633 +8634 +8635 +8636 +8637 +8638 +8639 +8640 +8641 +8642 +8643 +8644 +8645 +8646 +8647 +8648 +8649 +8650 +8651 +8652 +8653 +8654 +8655 +8656 +8657 +8658 +8659 +8660 +8661 +8662 +8663 +8664 +8665 +8666 +8667 +8668 +8669 +8670 +8671 +8672 +8673 +8674 +8675 +8676 +8677 +8678 +8679 +8680 +8681 +8682 +8683 +8684 +8685 +8686 +8687 +8688 +8689 +8690 +8691 +8692 +8693 +8694 +8695 +8696 +8697 +8698 +8699 +8700 +8701 +8702 +8703 +8704 +8705 +8706 +8707 +8708 +8709 +8710 +8711 +8712 +8713 +8714 +8715 +8716 +8717 +8718 +8719 +8720 +8721 +8722 +8723 +8724 +8725 +8726 +8727 +8728 +8729 +8730 +8731 +8732 +8733 +8734 +8735 +8736 +8737 +8738 +8739 +8740 +8741 +8742 +8743 +8744 +8745 +8746 +8747 +8748 +8749 +8750 +8751 +8752 +8753 +8754 +8755 +8756 +8757 +8758 +8759 +8760 +8761 +8762 +8763 +8764 +8765 +8766 +8767 +8768 +8769 +8770 +8771 +8772 +8773 +8774 +8775 +8776 +8777 +8778 +8779 +8780 +8781 +8782 +8783 +8784 +8785 +8786 +8787 +8788 +8789 +8790 +8791 +8792 +8793 +8794 +8795 +8796 +8797 +8798 +8799 +8800 +8801 +8802 +8803 +8804 +8805 +8806 +8807 +8808 +8809 +8810 +8811 +8812 +8813 +8814 +8815 +8816 +8817 +8818 +8819 +8820 +8821 +8822 +8823 +8824 +8825 +8826 +8827 +8828 +8829 +8830 +8831 +8832 +8833 +8834 +8835 +8836 +8837 +8838 +8839 +8840 +8841 +8842 +8843 +8844 +8845 +8846 +8847 +8848 +8849 +8850 +8851 +8852 +8853 +8854 +8855 +8856 +8857 +8858 +8859 +8860 +8861 +8862 +8863 +8864 +8865 +8866 +8867 +8868 +8869 +8870 +8871 +8872 +8873 +8874 +8875 +8876 +8877 +8878 +8879 +8880 +8881 +8882 +8883 +8884 +8885 +8886 +8887 +8888 +8889 +8890 +8891 +8892 +8893 +8894 +8895 +8896 +8897 +8898 +8899 +8900 +8901 +8902 +8903 +8904 +8905 +8906 +8907 +8908 +8909 +8910 +8911 +8912 +8913 +8914 +8915 +8916 +8917 +8918 +8919 +8920 +8921 +8922 +8923 +8924 +8925 +8926 +8927 +8928 +8929 +8930 +8931 +8932 +8933 +8934 +8935 +8936 +8937 +8938 +8939 +8940 +8941 +8942 +8943 +8944 +8945 +8946 +8947 +8948 +8949 +8950 +8951 +8952 +8953 +8954 +8955 +8956 +8957 +8958 +8959 +8960 +8961 +8962 +8963 +8964 +8965 +8966 +8967 +8968 +8969 +8970 +8971 +8972 +8973 +8974 +8975 +8976 +8977 +8978 +8979 +8980 +8981 +8982 +8983 +8984 +8985 +8986 +8987 +8988 +8989 +8990 +8991 +8992 +8993 +8994 +8995 +8996 +8997 +8998 +8999 +9000 +9001 +9002 +9003 +9004 +9005 +9006 +9007 +9008 +9009 +9010 +9011 +9012 +9013 +9014 +9015 +9016 +9017 +9018 +9019 +9020 +9021 +9022 +9023 +9024 +9025 +9026 +9027 +9028 +9029 +9030 +9031 +9032 +9033 +9034 +9035 +9036 +9037 +9038 +9039 +9040 +9041 +9042 +9043 +9044 +9045 +9046 +9047 +9048 +9049 +9050 +9051 +9052 +9053 +9054 +9055 +9056 +9057 +9058 +9059 +9060 +9061 +9062 +9063 +9064 +9065 +9066 +9067 +9068 +9069 +9070 +9071 +9072 +9073 +9074 +9075 +9076 +9077 +9078 +9079 +9080 +9081 +9082 +9083 +9084 +9085 +9086 +9087 +9088 +9089 +9090 +9091 +9092 +9093 +9094 +9095 +9096 +9097 +9098 +9099 +9100 +9101 +9102 +9103 +9104 +9105 +9106 +9107 +9108 +9109 +9110 +9111 +9112 +9113 +9114 +9115 +9116 +9117 +9118 +9119 +9120 +9121 +9122 +9123 +9124 +9125 +9126 +9127 +9128 +9129 +9130 +9131 +9132 +9133 +9134 +9135 +9136 +9137 +9138 +9139 +9140 +9141 +9142 +9143 +9144 +9145 +9146 +9147 +9148 +9149 +9150 +9151 +9152 +9153 +9154 +9155 +9156 +9157 +9158 +9159 +9160 +9161 +9162 +9163 +9164 +9165 +9166 +9167 +9168 +9169 +9170 +9171 +9172 +9173 +9174 +9175 +9176 +9177 +9178 +9179 +9180 +9181 +9182 +9183 +9184 +9185 +9186 +9187 +9188 +9189 +9190 +9191 +9192 +9193 +9194 +9195 +9196 +9197 +9198 +9199 +9200 +9201 +9202 +9203 +9204 +9205 +9206 +9207 +9208 +9209 +9210 +9211 +9212 +9213 +9214 +9215 +9216 +9217 +9218 +9219 +9220 +9221 +9222 +9223 +9224 +9225 +9226 +9227 +9228 +9229 +9230 +9231 +9232 +9233 +9234 +9235 +9236 +9237 +9238 +9239 +9240 +9241 +9242 +9243 +9244 +9245 +9246 +9247 +9248 +9249 +9250 +9251 +9252 +9253 +9254 +9255 +9256 +9257 +9258 +9259 +9260 +9261 +9262 +9263 +9264 +9265 +9266 +9267 +9268 +9269 +9270 +9271 +9272 +9273 +9274 +9275 +9276 +9277 +9278 +9279 +9280 +9281 +9282 +9283 +9284 +9285 +9286 +9287 +9288 +9289 +9290 +9291 +9292 +9293 +9294 +9295 +9296 +9297 +9298 +9299 +9300 +9301 +9302 +9303 +9304 +9305 +9306 +9307 +9308 +9309 +9310 +9311 +9312 +9313 +9314 +9315 +9316 +9317 +9318 +9319 +9320 +9321 +9322 +9323 +9324 +9325 +9326 +9327 +9328 +9329 +9330 +9331 +9332 +9333 +9334 +9335 +9336 +9337 +9338 +9339 +9340 +9341 +9342 +9343 +9344 +9345 +9346 +9347 +9348 +9349 +9350 +9351 +9352 +9353 +9354 +9355 +9356 +9357 +9358 +9359 +9360 +9361 +9362 +9363 +9364 +9365 +9366 +9367 +9368 +9369 +9370 +9371 +9372 +9373 +9374 +9375 +9376 +9377 +9378 +9379 +9380 +9381 +9382 +9383 +9384 +9385 +9386 +9387 +9388 +9389 +9390 +9391 +9392 +9393 +9394 +9395 +9396 +9397 +9398 +9399 +9400 +9401 +9402 +9403 +9404 +9405 +9406 +9407 +9408 +9409 +9410 +9411 +9412 +9413 +9414 +9415 +9416 +9417 +9418 +9419 +9420 +9421 +9422 +9423 +9424 +9425 +9426 +9427 +9428 +9429 +9430 +9431 +9432 +9433 +9434 +9435 +9436 +9437 +9438 +9439 +9440 +9441 +9442 +9443 +9444 +9445 +9446 +9447 +9448 +9449 +9450 +9451 +9452 +9453 +9454 +9455 +9456 +9457 +9458 +9459 +9460 +9461 +9462 +9463 +9464 +9465 +9466 +9467 +9468 +9469 +9470 +9471 +9472 +9473 +9474 +9475 +9476 +9477 +9478 +9479 +9480 +9481 +9482 +9483 +9484 +9485 +9486 +9487 +9488 +9489 +9490 +9491 +9492 +9493 +9494 +9495 +9496 +9497 +9498 +9499 +9500 +9501 +9502 +9503 +9504 +9505 +9506 +9507 +9508 +9509 +9510 +9511 +9512 +9513 +9514 +9515 +9516 +9517 +9518 +9519 +9520 +9521 +9522 +9523 +9524 +9525 +9526 +9527 +9528 +9529 +9530 +9531 +9532 +9533 +9534 +9535 +9536 +9537 +9538 +9539 +9540 +9541 +9542 +9543 +9544 +9545 +9546 +9547 +9548 +9549 +9550 +9551 +9552 +9553 +9554 +9555 +9556 +9557 +9558 +9559 +9560 +9561 +9562 +9563 +9564 +9565 +9566 +9567 +9568 +9569 +9570 +9571 +9572 +9573 +9574 +9575 +9576 +9577 +9578 +9579 +9580 +9581 +9582 +9583 +9584 +9585 +9586 +9587 +9588 +9589 +9590 +9591 +9592 +9593 +9594 +9595 +9596 +9597 +9598 +9599 +9600 +9601 +9602 +9603 +9604 +9605 +9606 +9607 +9608 +9609 +9610 +9611 +9612 +9613 +9614 +9615 +9616 +9617 +9618 +9619 +9620 +9621 +9622 +9623 +9624 +9625 +9626 +9627 +9628 +9629 +9630 +9631 +9632 +9633 +9634 +9635 +9636 +9637 +9638 +9639 +9640 +9641 +9642 +9643 +9644 +9645 +9646 +9647 +9648 +9649 +9650 +9651 +9652 +9653 +9654 +9655 +9656 +9657 +9658 +9659 +9660 +9661 +9662 +9663 +9664 +9665 +9666 +9667 +9668 +9669 +9670 +9671 +9672 +9673 +9674 +9675 +9676 +9677 +9678 +9679 +9680 +9681 +9682 +9683 +9684 +9685 +9686 +9687 +9688 +9689 +9690 +9691 +9692 +9693 +9694 +9695 +9696 +9697 +9698 +9699 +9700 +9701 +9702 +9703 +9704 +9705 +9706 +9707 +9708 +9709 +9710 +9711 +9712 +9713 +9714 +9715 +9716 +9717 +9718 +9719 +9720 +9721 +9722 +9723 +9724 +9725 +9726 +9727 +9728 +9729 +9730 +9731 +9732 +9733 +9734 +9735 +9736 +9737 +9738 +9739 +9740 +9741 +9742 +9743 +9744 +9745 +9746 +9747 +9748 +9749 +9750 +9751 +9752 +9753 +9754 +9755 +9756 +9757 +9758 +9759 +9760 +9761 +9762 +9763 +9764 +9765 +9766 +9767 +9768 +9769 +9770 +9771 +9772 +9773 +9774 +9775 +9776 +9777 +9778 +9779 +9780 +9781 +9782 +9783 +9784 +9785 +9786 +9787 +9788 +9789 +9790 +9791 +9792 +9793 +9794 +9795 +9796 +9797 +9798 +9799 +9800 +9801 +9802 +9803 +9804 +9805 +9806 +9807 +9808 +9809 +9810 +9811 +9812 +9813 +9814 +9815 +9816 +9817 +9818 +9819 +9820 +9821 +9822 +9823 +9824 +9825 +9826 +9827 +9828 +9829 +9830 +9831 +9832 +9833 +9834 +9835 +9836 +9837 +9838 +9839 +9840 +9841 +9842 +9843 +9844 +9845 +9846 +9847 +9848 +9849 +9850 +9851 +9852 +9853 +9854 +9855 +9856 +9857 +9858 +9859 +9860 +9861 +9862 +9863 +9864 +9865 +9866 +9867 +9868 +9869 +9870 +9871 +9872 +9873 +9874 +9875 +9876 +9877 +9878 +9879 +9880 +9881 +9882 +9883 +9884 +9885 +9886 +9887 +9888 +9889 +9890 +9891 +9892 +9893 +9894 +9895 +9896 +9897 +9898 +9899 +9900 +9901 +9902 +9903 +9904 +9905 +9906 +9907 +9908 +9909 +9910 +9911 +9912 +9913 +9914 +9915 +9916 +9917 +9918 +9919 +9920 +9921 +9922 +9923 +9924 +9925 +9926 +9927 +9928 +9929 +9930 +9931 +9932 +9933 +9934 +9935 +9936 +9937 +9938 +9939 +9940 +9941 +9942 +9943 +9944 +9945 +9946 +9947 +9948 +9949 +9950 +9951 +9952 +9953 +9954 +9955 +9956 +9957 +9958 +9959 +9960 +9961 +9962 +9963 +9964 +9965 +9966 +9967 +9968 +9969 +9970 +9971 +9972 +9973 +9974 +9975 +9976 +9977 +9978 +9979 +9980 +9981 +9982 +9983 +9984 +9985 +9986 +9987 +9988 +9989 +9990 +9991 +9992 +9993 +9994 +9995 +9996 +9997 +9998 +9999 +10000 \ No newline at end of file diff --git a/04 ListNode/03 Josephus/Josephus.class b/04 ListNode/03 Josephus/Josephus.class new file mode 100644 index 0000000..fe5c9e0 Binary files /dev/null and b/04 ListNode/03 Josephus/Josephus.class differ diff --git a/04 ListNode/03 Josephus/Josephus.docx b/04 ListNode/03 Josephus/Josephus.docx new file mode 100644 index 0000000..485fb1d Binary files /dev/null and b/04 ListNode/03 Josephus/Josephus.docx differ diff --git a/04 ListNode/03 Josephus/Josephus.java b/04 ListNode/03 Josephus/Josephus.java new file mode 100644 index 0000000..8e71562 --- /dev/null +++ b/04 ListNode/03 Josephus/Josephus.java @@ -0,0 +1,155 @@ +// Name: B6-24 +// Date: 11/15/19 + +import java.util.*; +import java.io.*; + +public class Josephus +{ + private static String WINNER = "Rushil"; + + public static void main(String[] args) throws FileNotFoundException + { + ListNode head, p; + head = p = new ListNode("A", null); + p.setNext(head); + p = insert(p, "B"); + p = insert(p, "C"); + p = insert(p, "D"); + print(p); + + /* run numberCircle first with J_numbers.txt */ + Scanner sc = new Scanner(System.in); + System.out.print("How many names (2-20)? "); + int n = Integer.parseInt(sc.next()); + System.out.print("How many names to count off each time?" ); + int countOff = Integer.parseInt(sc.next()); + ListNode winningPos = numberCircle(n, countOff, "J_numbers.txt"); + System.out.println(winningPos.getValue() + " wins!"); + + /* run josephusCircle next with J_names.txt */ + System.out.println("\n **** Now start all over. **** \n"); + System.out.print("Where should "+WINNER+" stand? "); + int winPos = Integer.parseInt(sc.next()); + ListNode theWinner = josephusCircle(n, countOff, "J_names.txt", winPos); + System.out.println(theWinner.getValue() + " wins!"); + } + + public static ListNode numberCircle(int n, int countOff, String filename) throws FileNotFoundException + { + ListNode p = null; + p = readNLinesOfFile(n, new File(filename)); + p = countingOff(p, countOff, n); + return p; + } + + public static ListNode josephusCircle(int n, int countOff, String filename, int winPos) throws FileNotFoundException + { + ListNode p = null; + p = readNLinesOfFile(n, new File(filename)); + replaceAt(p, WINNER, winPos); + p = countingOff(p, countOff, n); + return p; + } + + /* reads the names, calls insert(), builds the linked list. + */ + public static ListNode readNLinesOfFile(int n, File f) throws FileNotFoundException + { + Scanner file = null; + + try { + file = new Scanner(f); + } catch(FileNotFoundException e) { + return null; + } + + ListNode list = null; + for (int i = 0; i < n; i++) + list = insert(list, file.nextLine()); + return list; + } + + + + /* helper method to build the list. Creates the node, then + * inserts it in the circular linked list. + */ + public static ListNode insert(ListNode p, Object obj) + { + if (p == null) { + ListNode node = new ListNode(obj, null); + node.setNext(node); + return node; + } else { + ListNode head = new ListNode(obj, p.getNext()); + p.setNext(head); + return head; + } + } + + /* Runs a Josephus game, counting off and removing each name. Prints after each removal. + Ends with one remaining name, who is the winner. + */ + public static ListNode countingOff(ListNode p, int count, int n) + { + if (p == null) + return p; + + for (int i = 0; i < n; i++) { + print(p); + p = remove(p, count); + } + + return p; + } + + /* removes the node after counting off count-1 nodes. + */ + public static ListNode remove(ListNode p, int count) + { + p = p.getNext(); + ListNode temp = p; + if (count == 1) { + do { + temp = temp.getNext(); + } while (temp.getNext() != p); + temp.setNext(p.getNext()); + return temp; + } else { + + for (int i = 1; i < count - 1; i++) { + temp = temp.getNext(); + } + temp.setNext(temp.getNext().getNext()); + return temp; + } + } + + /* prints the circular linked list. + */ + public static void print(ListNode p) + { + ListNode pointer = p.getNext(); + if (p != null) { + do { + System.out.print(pointer.getValue()); + pointer = pointer.getNext(); + if (pointer != p.getNext()) + System.out.print(" "); + } while (pointer != p.getNext()); + System.out.println(); + } + } + + /* replaces the value (the string) at the winning node. + */ + public static void replaceAt(ListNode p, Object obj, int pos) + { + for (int i = 0; i < pos; i++) + p = p.getNext(); + p.setValue(obj); + + } +} + diff --git a/04 ListNode/03 Josephus/Josephus.jgrasp_canvas.xml b/04 ListNode/03 Josephus/Josephus.jgrasp_canvas.xml new file mode 100644 index 0000000..79cd28b --- /dev/null +++ b/04 ListNode/03 Josephus/Josephus.jgrasp_canvas.xml @@ -0,0 +1,58 @@ + + + Java + false + 2 + + true + false + + + readNLinesOfFile + (ILjava/io/File;)LListNode; + Josephus + 2 + + + + true + 320 + 140 + 330 + 360 + + + 0 + `local ListNode` list + jgrasp_viewers.java__lang__Object_LinkedView + + + + + true + 810 + 150 + 330 + 360 + + + jgrasp_viewers._X_ElementView0 + 4 + 483 + 526 + + + 0 + `local ListNode` prev + jgrasp_viewers.java__lang__Object_LinkedView + + + + 1600 + 900 + + + 1600 + 900 + + diff --git a/04 ListNode/03 Josephus/ListNode.class b/04 ListNode/03 Josephus/ListNode.class new file mode 100644 index 0000000..aaa68e5 Binary files /dev/null and b/04 ListNode/03 Josephus/ListNode.class differ diff --git a/04 ListNode/03 Josephus/ListNode.java b/04 ListNode/03 Josephus/ListNode.java new file mode 100644 index 0000000..e29a2b8 --- /dev/null +++ b/04 ListNode/03 Josephus/ListNode.java @@ -0,0 +1,27 @@ +//the College Board's standard ListNode class + public class ListNode + { + private Object value; + private ListNode next; + public ListNode(Object v, ListNode n) + { + value=v; + next=n; + } + public Object getValue() + { + return value; + } + public ListNode getNext() + { + return next; + } + public void setValue(Object newv) + { + value=newv; + } + public void setNext(ListNode newn) + { + next=newn; + } + } \ No newline at end of file diff --git a/04 ListNode/04 DLL/DLL.doc b/04 ListNode/04 DLL/DLL.doc new file mode 100644 index 0000000..0d83d29 Binary files /dev/null and b/04 ListNode/04 DLL/DLL.doc differ diff --git a/04 ListNode/04 DLL/DLL.java b/04 ListNode/04 DLL/DLL.java new file mode 100644 index 0000000..b93a864 --- /dev/null +++ b/04 ListNode/04 DLL/DLL.java @@ -0,0 +1,120 @@ +// Name: B6-24 +// Date: 11/22/19 + +// implements some of the List and LinkedList interfaces: +// size(), add(i, o), remove(i); addFirst(o), addLast(o); +// This class also overrides toString(). +// the list is zero-indexed. +// Uses DLNode. + +public class DLL //DoubleLinkedList +{ + private int size; + private DLNode head = new DLNode(); //dummy node--very useful--simplifies the code + + public int size() + { + return size; + } + + /* appends obj to end of list; increases size; + @return true */ + public boolean add(Object obj) + { + addLast(obj); + return true; + } + + /* inserts obj at position index. increments size. */ + public void add(int index, Object obj) throws IndexOutOfBoundsException //this the way the real LinkedList is coded + { + if( index > size || index < 0 ) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + /* enter your code below */ + if (size == 0) + addFirst(obj); + else if (index == size) + + + + } + + /* return obj at position index. */ + public Object get(int index) + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + /* enter your code below */ + + } + + /* replaces obj at position index. + returns the obj that was replaced*/ + public Object set(int index, Object obj) + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + /* enter your code below */ + + } + + /* removes the node from position index (zero-indexed). decrements size. + @return the object of the node that was removed. */ + public Object remove(int index) + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + /* enter your code below */ + + + } + + /* inserts obj at front of list, increases size */ + public void addFirst(Object obj) + { + DLNode p = new DLNode + if (size == 0) + + } + + /* appends obj to end of list, increases size */ + public void addLast(Object obj) + { + + } + + /* returns the first element in this list */ + public Object getFirst() + { + + } + + /* returns the last element in this list */ + public Object getLast() + { + + } + + /* returns and removes the first element in this list, or + returns null if the list is empty */ + public Object removeFirst() + { + + } + + /* returns and removes the last element in this list, or + returns null if the list is empty */ + public Object removeLast() + { + + } + + /* returns a String with the values in the list in a + friendly format, for example [Apple, Banana, Cucumber] + The values are enclosed in [], separated by one comma and one space. + */ + public String toString() + { + + } +} \ No newline at end of file diff --git a/04 ListNode/04 DLL/DLL_Driver.java b/04 ListNode/04 DLL/DLL_Driver.java new file mode 100644 index 0000000..a79da2c --- /dev/null +++ b/04 ListNode/04 DLL/DLL_Driver.java @@ -0,0 +1,89 @@ +// mlbillington@fcps.edu 11-2-2008. +// demonstrates some of the List and LinkedList interfaces: +// size(), add(i, o), remove(i); addFirst(o), addLast(o); toString(). +// the list is zero-indexed. +// Uses DLL +import java.util.LinkedList; +public class DLL_Driver +{ + public static void main(String args[]) + { + DLL list = new DLL(); + //LinkedList list = new LinkedList(); //for comparison purposes + list.addLast("Avocado"); + list.addLast("Banana"); + list.addLast("Cucumber"); + list.add("Durian"); + list.add("Eggplant"); + + System.out.println("The list is " + list); + System.out.println("Size: " + list.size()); + Object obj = list.remove(2); + System.out.println("Remove index 2: "+ obj); + System.out.println("The list is " + list); + System.out.println("Size: " + list.size()); + + list.add(2,"Carrot"); + System.out.println("Add Carrot at index 2: " + list); + list.add(0,"Apple"); + System.out.println("Add Apple at index 0: " + list); + + System.out.println("Get values at index 0 and First: " + list.get(0)+" and " + list.getFirst()); + System.out.println("No change in list: " +list); + + list.removeFirst(); + System.out.println( "Remove the First: " + list); + + list.addFirst("Artichoke"); + System.out.println("Add First: " + list); + System.out.println("Size: " + list.size()); + + System.out.println("Get Last: " + list.getLast()); + System.out.println(list); + + System.out.println("Remove Last: " + list.removeLast()); + System.out.println(list); + + Object oldValue = list.set(3, "Cherry"); + System.out.println("Set new value at index 3: " + list); + System.out.println("Old value was: " + oldValue); + + list.set(0, "Apricot"); + System.out.println("Set new value at index 0: " + list); + try + { + list.add(16,"Kiwi"); //test out-of-bounds + // list.remove(100); //test out-of-bounds + // list.get(-1); //test out-of-bounds + // list.set(16,"Kiwi"); //test out-of-bounds + } + catch(IndexOutOfBoundsException e) + { + System.out.println(e); + } + } +} + /******************************************** + The list is [Avocado, Banana, Cucumber, Durian, Eggplant] + Size: 5 + Remove index 2: Cucumber + The list is [Avocado, Banana, Durian, Eggplant] + Size: 4 + Add Carrot at index 2: [Avocado, Banana, Carrot, Durian, Eggplant] + Add Apple at index 0: [Apple, Avocado, Banana, Carrot, Durian, Eggplant] + Get values at index 0 and First: Apple and Apple + No change in list: [Apple, Avocado, Banana, Carrot, Durian, Eggplant] + Remove the First: [Avocado, Banana, Carrot, Durian, Eggplant] + Add First: [Artichoke, Avocado, Banana, Carrot, Durian, Eggplant] + Size: 6 + Get Last: Eggplant + [Artichoke, Avocado, Banana, Carrot, Durian, Eggplant] + Remove Last: Eggplant + [Artichoke, Avocado, Banana, Carrot, Durian] + Set new value at index 3: [Artichoke, Avocado, Banana, Cherry, Durian] + Old value was: Carrot + Set new value at index 0: [Apricot, Avocado, Banana, Cherry, Durian] + java.lang.IndexOutOfBoundsException: Index: 16, Size: 5 + + + ***********************************************/ diff --git a/04 ListNode/04 DLL/DLNode.java b/04 ListNode/04 DLL/DLNode.java new file mode 100644 index 0000000..73d04fa --- /dev/null +++ b/04 ListNode/04 DLL/DLNode.java @@ -0,0 +1,44 @@ +////////////////////////////////////// +//Keith Ainsworth, 11/13/2006 +class DLNode +{ + private Object value; + private DLNode prev; + private DLNode next; + public DLNode(Object arg, DLNode p, DLNode n) + { + value=arg; + prev=p; + next=n; + } + public DLNode() + { + value=null; + next=this; + prev=this; + } + public void setValue(Object arg) + { + value=arg; + } + public void setNext(DLNode arg) + { + next=arg; + } + public void setPrev(DLNode arg) + { + prev=arg; + } + public DLNode getNext() + { + return next; + } + public DLNode getPrev() + { + return prev; + } + public Object getValue() + { + return value; + } +} diff --git a/04 ListNode/04 DLL/Doubly Linked Lists WS.doc b/04 ListNode/04 DLL/Doubly Linked Lists WS.doc new file mode 100644 index 0000000..4970585 Binary files /dev/null and b/04 ListNode/04 DLL/Doubly Linked Lists WS.doc differ diff --git a/04 ListNode/05 Cards extra lab/Card.class b/04 ListNode/05 Cards extra lab/Card.class new file mode 100644 index 0000000..85be3c0 Binary files /dev/null and b/04 ListNode/05 Cards extra lab/Card.class differ diff --git a/04 ListNode/05 Cards extra lab/CardDeck.class b/04 ListNode/05 Cards extra lab/CardDeck.class new file mode 100644 index 0000000..0c28f3c Binary files /dev/null and b/04 ListNode/05 Cards extra lab/CardDeck.class differ diff --git a/04 ListNode/05 Cards extra lab/CardDriver.class b/04 ListNode/05 Cards extra lab/CardDriver.class new file mode 100644 index 0000000..c02aa4b Binary files /dev/null and b/04 ListNode/05 Cards extra lab/CardDriver.class differ diff --git a/04 ListNode/05 Cards extra lab/CardDriver.java b/04 ListNode/05 Cards extra lab/CardDriver.java new file mode 100644 index 0000000..4b7af16 --- /dev/null +++ b/04 ListNode/05 Cards extra lab/CardDriver.java @@ -0,0 +1,464 @@ +// Name: B6-24 +// Date: 11/23/19 +import java.io.*; +import java.util.*; + +public class CardDriver +{ + public static void main(String[] args) + { +//Make and print new QD +// Card c = new Card(1, 12); +// System.out.println(c); + +//Make and print new KC +// Card c1 = new Card(Card.CLUBS, Card.KING); +// System.out.println(c1); + +//Build and print new deck +// CardDeck cd = new CardDeck(); +// cd.printDeck(); + +// Test getTopCard +// System.out.println(cd.getTopCard()); +// System.out.println(); +// cd.printDeck(); + +// Shuffle and print new deck +// CardDeck cd = new CardDeck(); +// cd.shuffle(5); +// cd.printDeck(); + + War war = new War(); + war.playGame(); + +// Count Shuffled Deck + +// int count = 0; +// ListNode pointer = war.getComputerHand().getHand(); +// while (pointer != null) { +// count++; +// pointer = pointer.getNext(); +// } +// System.out.println("Count is: " + count); + } +} + +class CardDeck +{ + private ListNode myCards; + + public CardDeck() + { + for (int suit = Card.CLUBS; suit <= Card.SPADES; suit++) + for (int rank = Card.ACE; rank <= Card.KING; rank++) + { + Card card = new Card(suit, rank); + putAtEnd(card); + } + } + + /* returns the top card from the deck. + reassigns a pointer to the new top card. + */ + public Card getTopCard() + { + if (myCards == null) + return null; + + Card top = (Card)myCards.getValue(); + myCards = myCards.getNext(); + return top; + } + + public Card getTopCard(ListNode head) + { + if (head == null) + return null; + + Card top = (Card)head.getValue(); + head = head.getNext(); + return top; + } + + + + /* helper method to put a card at the end of the deck. + */ + private ListNode putAtEnd(ListNode head, Card c) + { + if (head == null) { + head = new ListNode(c, null); + return null; + } + + ListNode pointer = head; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + + pointer.setNext(new ListNode(c, null)); + return head; + } + + private void putAtEnd(Card c) + { + if (myCards == null) { + myCards = new ListNode(c, null); + return; + } + + ListNode pointer = myCards; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + + pointer.setNext(new ListNode(c, null)); + } + + + public void printDeck() + { + ListNode pointer = myCards; + while (pointer != null) { + System.out.print(pointer.getValue()); + if (pointer.getNext() != null) + System.out.print(", "); + pointer = pointer.getNext(); + } + System.out.println(); + + } + + /* splits this deck into two almost equal halves; + chooses the split point randomly at 26 +- 10; + the first half remains in this deck in the same order; + the second half is placed into a separate linked list in the same order; + @return a reference to the list that refers to the second half of the deck + */ + private ListNode split() + { + int splitPoint = ((int)(Math.random() * (20)) + 16); + ListNode pointer = myCards; + for (int i = 1; i < splitPoint; i++) + pointer = pointer.getNext(); + + ListNode lower = pointer.getNext(); + pointer.setNext(null); + + return lower; + } + + /* combines the cards from cards1 and cards2 into one list. + takes one card from cards1, the next from cards2, the third + from cards1, and so on, alternating decks; if there are cards + left over, all the rest of those cards are copied into the combined list. + @return a reference to the first node of the combined list. + */ + private ListNode combine(ListNode cards1, ListNode cards2) + { + ListNode head = new ListNode(null, null); + while (cards1 != null && cards2 != null) { + head = putAtEnd(head, getTopCard(cards1)); + cards1 = cards1.getNext(); + head = putAtEnd(head, getTopCard(cards2)); + cards2 = cards2.getNext(); + } + + ListNode pointer = head; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + if (cards1 != null) + pointer.setNext(cards1); + if (cards2 != null) + pointer.setNext(cards2); + + return head.getNext(); + } + + + /* splits the deck, then combines the 2 halves; + this operation is repeated numTimes number of times. + */ + public void shuffle(int numTimes) + { + for (int i = 0; i < numTimes; i++) { + ListNode split = split(); + myCards = combine(myCards, split); + } + } + + public ListNode getCards() { + return myCards; + } +} + +/* +using ideas from http://www.ccs.neu.edu/jpt/fhs-04-05/Cards/CardSampler/ +*/ +class Card implements Comparable +{ + + public static final int CLUBS = 0; //for playing Bridge + public static final int DIAMONDS = 1; + public static final int HEARTS = 2; + public static final int SPADES = 3; + + public static final int ACE = 1; //Aces are always low + public static final int JACK = 11; + public static final int QUEEN = 12; + public static final int KING = 13; + + private int rank; + private int suit; + + private String[] rankList = {"","Ace","2","3","4","5","6","7","8","9","10","Jack","Queen","King"}; + private String[] suitList = {"Clubs","Diamonds","Hearts","Spades"}; + private String[] abbRankList = {"", "A","2","3","4","5","6","7","8","9","10","J","Q","K"}; + private String[] abbSuitList = {"C", "D", "H", "S"}; + + public Card(int s, int r) { + if ((ACE <= r) && (r <= KING)) + this.rank = r; + else + throw new RuntimeException + ("Invalid rank in Card constructor: " + rank); + + if ((CLUBS <= s) && (s <= SPADES)) + this.suit = s; + else + throw new RuntimeException + ("Invalid suit in Card constructor: " + suit); + } + + public int getRank() + { + return rank; + } + + public int getSuit() + { + return suit; + } + + public String getRankAsString() + { + return rankList[rank]; + } + + public String getSuitAsString() + { + return suitList[suit]; + } + + public boolean equals(Card other) { + if (rank == other.getRank()) + return true; + else + return false; + } + + public int compareTo(Card other) { + return rank - other.getRank(); + } + + public String toString() + { + return ( getRankAsString()+" of "+getSuitAsString() ); + //return ( getRankAsString()+getSuitAsString() ); + } +} + +class CardHand{ + private ListNode hand; + + public CardHand (ListNode h) { + hand = h; + } + + public CardHand (CardHand c) { + hand = c.getHand(); + } + + public ListNode getHand() { + return hand; + } + + public void setHand(ListNode h) { + hand = h; + } + + public Card getTopCard() + { + if (hand == null) + return null; + + Card top = (Card)hand.getValue(); + hand = hand.getNext(); + return top; + } + + public void putAtEnd(Card c) + { + if (hand == null) { + hand = new ListNode(c, null); + return; + } + + ListNode pointer = hand; + while (pointer.getNext() != null) + pointer = pointer.getNext(); + + pointer.setNext(new ListNode(c, null)); + } + + + public void printHand() + { + ListNode pointer = hand; + while (pointer != null) { + System.out.print(pointer.getValue()); + if (pointer.getNext() != null) + System.out.print(", "); + pointer = pointer.getNext(); + } + System.out.println(); + + } +} + +class War { + + private Scanner in = new Scanner(System.in); + private CardHand playerHand, computerHand; + private int turn = 0, playerCount = 26, computerCount = 26; + + public War() { + CardDeck deck = new CardDeck(); + //deck.shuffle(10); + + computerHand = splitInHalf(deck.getCards()); + playerHand = new CardHand(deck.getCards()); +// computerHand.printHand(); +// playerHand.printHand(); + } + + private CardHand splitInHalf(ListNode deck) + { + + ListNode pointer = deck; + for (int i = 1; i < 26; i++) + pointer = pointer.getNext(); + + ListNode lower = pointer.getNext(); + pointer.setNext(null); + playerHand = new CardHand(deck); + + return new CardHand(lower); + } + + + public CardHand getPlayerHand() { + return playerHand; + } + + public CardHand getComputerHand() { + return computerHand; + } + + public void setPlayerHand(CardHand p) { + playerHand = p; + } + + public void setComputerHand(CardHand c) { + computerHand = c; + } + + + public void playGame() { + while (playerHand.getHand() != null && computerHand.getHand() != null) { + if (turn == 0) + System.out.println("Welcome to war!"); + turn++; + Card playerCard = playerHand.getTopCard(), computerCard = computerHand.getTopCard(); + playTurn(playerCard, computerCard); + + } + } + + private String countCards() { + playerCount = 1; computerCount = 1; + ListNode pointer; + + if (playerHand.getHand() != null) { + pointer = playerHand.getHand(); + while (pointer != null) { + pointer = pointer.getNext(); + playerCount++; + } + } + + if (computerHand.getHand() != null) { + pointer = computerHand.getHand(); + while (pointer != null) { + computerCount++; + pointer = pointer.getNext(); + } + } + + String playerPlural = "s", computerPlural = "s"; + if (playerCount < 2) + playerPlural = ""; + + if (computerCount < 2) + computerPlural = ""; + return "You have " + playerCount + " card" + playerPlural + " \t\t The computer has " + computerCount + " card" + computerPlural; + } + + + private void playTurn(Card playerCard, Card computerCard) { + System.out.println(countCards()); + System.out.println("Press enter to battle"); + in.nextLine(); + for (int i = 0; i < 15; i++) System.out.println(); + + System.out.println("You drew a " + playerCard + " \t\t The computer drew a " + computerCard); + if (playerCard.compareTo(computerCard) == 0) + tieRound(playerCard, computerCard); + else if (playerCard.compareTo(computerCard) > 0) + winRound(true, playerCard, computerCard); + else + winRound(false, playerCard, computerCard); + + } + + private void winRound(boolean isPlayerWinner, Card playerCard, Card computerCard) { + if (isPlayerWinner) { + System.out.println("Outstanding victory!"); + computerHand.putAtEnd(playerCard); + computerHand.putAtEnd(computerCard); + } else { + System.out.println("Damn, horrible loss."); + playerHand.putAtEnd(computerCard); + playerHand.putAtEnd(playerCard); + } + + System.out.println(); + } + + private void tieRound(Card playerCard, Card computerCard) { + System.out.println("\nThe battle was too close to call. It's time for war.\nPress enter to discard a card"); + in.nextLine(); + Card playerDiscard = playerHand.getTopCard(), computerDiscard = computerHand.getTopCard(); + for (int i = 0; i < 15; i++) System.out.println(); + System.out.println("And press it again to draw!"); + in.nextLine(); + Card playerDraw = playerHand.getTopCard(), computerDraw = computerHand.getTopCard(); + + if (playerCard.compareTo(computerCard) == 0) { + + } else if (playerCard.compareTo(computerCard) > 0) { + + } else { + + } + } +} \ No newline at end of file diff --git a/04 ListNode/05 Cards extra lab/CardHand.class b/04 ListNode/05 Cards extra lab/CardHand.class new file mode 100644 index 0000000..c61a695 Binary files /dev/null and b/04 ListNode/05 Cards extra lab/CardHand.class differ diff --git a/04 ListNode/05 Cards extra lab/Cards.doc b/04 ListNode/05 Cards extra lab/Cards.doc new file mode 100644 index 0000000..93f0b9f Binary files /dev/null and b/04 ListNode/05 Cards extra lab/Cards.doc differ diff --git a/04 ListNode/05 Cards extra lab/ListNode.class b/04 ListNode/05 Cards extra lab/ListNode.class new file mode 100644 index 0000000..aaa68e5 Binary files /dev/null and b/04 ListNode/05 Cards extra lab/ListNode.class differ diff --git a/04 ListNode/05 Cards extra lab/ListNode.java b/04 ListNode/05 Cards extra lab/ListNode.java new file mode 100644 index 0000000..9ea48e9 --- /dev/null +++ b/04 ListNode/05 Cards extra lab/ListNode.java @@ -0,0 +1,28 @@ +//Thomas Bettge, TJHSST, 10-20-2006 +public class ListNode +{ + private Object value; + private ListNode next; + public ListNode(Object v, ListNode n) + { + value=v; + next=n; + } + public Object getValue() + { + return value; + } + public ListNode getNext() + { + return next; + } + public void setValue(Object newv) + { + value=newv; + } + public void setNext(ListNode newn) + { + next=newn; + } + +} \ No newline at end of file diff --git a/04 ListNode/05 Cards extra lab/War.class b/04 ListNode/05 Cards extra lab/War.class new file mode 100644 index 0000000..d254f1f Binary files /dev/null and b/04 ListNode/05 Cards extra lab/War.class differ diff --git a/04 ListNode/06a CacheList/CacheList.pdf b/04 ListNode/06a CacheList/CacheList.pdf new file mode 100644 index 0000000..3344739 Binary files /dev/null and b/04 ListNode/06a CacheList/CacheList.pdf differ diff --git a/05 Collections _ Generics/01 TJArrayList/Collections.doc b/05 Collections _ Generics/01 TJArrayList/Collections.doc new file mode 100644 index 0000000..1faf82e Binary files /dev/null and b/05 Collections _ Generics/01 TJArrayList/Collections.doc differ diff --git a/05 Collections _ Generics/01 TJArrayList/TJArrayList.class b/05 Collections _ Generics/01 TJArrayList/TJArrayList.class new file mode 100644 index 0000000..8d93aeb Binary files /dev/null and b/05 Collections _ Generics/01 TJArrayList/TJArrayList.class differ diff --git a/05 Collections _ Generics/01 TJArrayList/TJArrayList.doc b/05 Collections _ Generics/01 TJArrayList/TJArrayList.doc new file mode 100644 index 0000000..e707c72 Binary files /dev/null and b/05 Collections _ Generics/01 TJArrayList/TJArrayList.doc differ diff --git a/05 Collections _ Generics/01 TJArrayList/TJArrayList.java b/05 Collections _ Generics/01 TJArrayList/TJArrayList.java new file mode 100644 index 0000000..5956cf8 --- /dev/null +++ b/05 Collections _ Generics/01 TJArrayList/TJArrayList.java @@ -0,0 +1,120 @@ +// Name: B6-24 +// Date: 12/4/19 + +/** + * Implements the cheat sheet's List interface. Implements generics. + * The backing array is an array of (E[]) new Object[10]; + * @override toString() + */ +public class TJArrayList +{ + private int size; //stores the number of objects + private E[] myArray; + public TJArrayList() //default constructor makes 10 cells + { + myArray = (E[]) new Object[10]; + size = 0; + } + public int size() + { + return size; + } + /* appends obj to end of list; increases size; + must be an O(1) operation when size < array.length, + and O(n) when it doubles the length of the array. + @return true */ + public boolean add(E obj) + { + if (size < myArray.length) { + myArray[size] = obj; + } else { + E[] temp = (E[]) new Object[myArray.length * 2]; + for (int i = 0; i < size; i++) + temp[i] = myArray[i]; + temp[size] = obj; + myArray = temp; + } + size++; + return true; + } + /* inserts obj at position index. increments size. + */ + public void add(int index, E obj) throws IndexOutOfBoundsException //this the way the real ArrayList is coded + { + if(index > size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + if (size < myArray.length) { + System.arraycopy(myArray, index, myArray, index + 1, size - index); + myArray[index] = obj; + size++; + } else { + E[] temp = (E[]) new Object[myArray.length * 2]; + for (int i = 0; i < size; i++) + temp[i] = myArray[i]; + myArray = temp; + add(index, obj); + } + } + + /* return obj at position index. + */ + public E get(int index) throws IndexOutOfBoundsException + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + return myArray[index]; + + } + /** + * Replaces obj at position index. + * @return the object is being replaced. + */ + public E set(int index, E obj) throws IndexOutOfBoundsException + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + E temp = myArray[index]; + myArray[index] = obj; + return temp; + } + /* removes the node from position index. shifts elements + to the left. Decrements size. + @return the object at position index. + */ + public E remove(int index) throws IndexOutOfBoundsException + { + if(index >= size || index < 0) + throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size); + + E temp = myArray[index]; + System.arraycopy(myArray, index + 1, myArray, index, size - index - 1); + myArray[size--] = null; + return temp; + } + /* + This method compares objects. + Must use .equals(), not == + */ + public boolean contains(E obj) + { + for (int i = 0; i < size; i++) + if (myArray[i].equals(obj)) + return true; + return false; + } + /*returns a String of E objects in the array with + square brackets and commas. + */ + public String toString() + { + String string = "["; + for (int i = 0; i < size; i++) { + string += myArray[i].toString(); + if (i != size - 1) { + string += ", "; + } + } + + return string + "]"; + } +} \ No newline at end of file diff --git a/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.class b/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.class new file mode 100644 index 0000000..f48a2f2 Binary files /dev/null and b/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.class differ diff --git a/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.java b/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.java new file mode 100644 index 0000000..0c312ed --- /dev/null +++ b/05 Collections _ Generics/01 TJArrayList/TJArrayList_Driver.java @@ -0,0 +1,74 @@ +import java.util.*; +import java.io.*; + +public class TJArrayList_Driver +{ + public static void main(String [] args) + { + //TJArrayList myList = new TJArrayList<>(); + //ArrayList myList = new ArrayList<>(); //for comparison purposes +// myList.add("Apple"); +// myList.add("Banana"); +// myList.add("Fig"); +// myList.add(2, "Cucumber"); +// myList.add(3, "Dates"); +// myList.add(0, "Apple"); +// System.out.println(myList); +// System.out.println("Size is " + myList.size()); +// try +// { +// myList.add(12, "Peach"); +// } +// catch(IndexOutOfBoundsException e) +// { +// System.out.println(e); +// } +// System.out.println("Get 2: " + myList.get(2)); +// System.out.print("Set at 2: "); +// String previous = myList.set(2, "Cherry"); +// System.out.println(previous +" " +myList); +// String obj = myList.remove(2); +// System.out.println("Removed " + obj+ " from " + myList); +// System.out.println("Size is " + myList.size()); +// System.out.print("Add too many items: "); +// for(int i = 3; i <= 10; i++) +// myList.add("fruit"); +// System.out.println(myList); +// System.out.println("Size is " + myList.size()); +// System.out.println("Contains \"Breadfruit\"? " + myList.contains("Breadfruit")); +// System.out.println("Contains \"Banana\"? " + myList.contains("Banana")); +// System.out.println(); + /* generics are type-safe for any Object. + Test your code with Widgets. + */ + //TJArrayList myList = new TJArrayList<>(); + //ArrayList myList = new ArrayList<>(); //for comparison purposes +// myList.add( new Widget(1,2) ); +// myList.add( new Widget(4,5) ); +// myList.add(2, new Widget(500, 501) ); +// myList.add( new Widget(7,8) ); +// System.out.println("Size is " + myList.size()); +// System.out.println(myList); + + } +} + +/************************ + + [Apple, Apple, Banana, Cucumber, Dates, Fig] + Size is 6 + java.lang.IndexOutOfBoundsException: Index: 12, Size: 6 + Get 2: Banana + Set at 2: Banana [Apple, Apple, Cherry, Cucumber, Dates, Fig] + Removed Cherry from [Apple, Apple, Cucumber, Dates, Fig] + Size is 5 + Add too many items: [Apple, Apple, Cucumber, Dates, Fig, fruit, fruit, fruit, fruit, fruit, fruit, fruit, fruit] + Size is 13 + Contains "Breadfruit"? false + Contains "Banana"? false + + Size is 4 + [1 cubits 2 hands, 4 cubits 5 hands, 500 cubits 501 hands, 7 cubits 8 hands] + + + *********************************************/ diff --git a/05 Collections _ Generics/01 TJArrayList/Widget.class b/05 Collections _ Generics/01 TJArrayList/Widget.class new file mode 100644 index 0000000..e2e3947 Binary files /dev/null and b/05 Collections _ Generics/01 TJArrayList/Widget.class differ diff --git a/05 Collections _ Generics/01 TJArrayList/Widget.java b/05 Collections _ Generics/01 TJArrayList/Widget.java new file mode 100644 index 0000000..38d9152 --- /dev/null +++ b/05 Collections _ Generics/01 TJArrayList/Widget.java @@ -0,0 +1,64 @@ +// Name: B6-24 +// Date: 11/1/19 + +public class Widget implements Comparable +{ + //fields + private int myCubits, myHands; + + //constructors + public Widget() { + myCubits = 0; + myHands = 0; + } + + public Widget(int cubits, int hands) { + myCubits = cubits; + myHands = hands; + } + + public Widget(Widget w) { + myCubits = w.myCubits; + myHands = w.myHands; + } + + + //accessors and modifiers + int getCubits() { + return myCubits; + } + + int getHands() { + return myHands; + } + + void setCubits(int cubits) { + myCubits = cubits; + } + + void setHands(int hands) { + myHands = hands; + } + //compareTo and equals + public int compareTo(Widget other) { + int cubits = myCubits - other.myCubits; + if (cubits != 0) + return cubits; + else + return myHands - other.myHands; + } + + public boolean equals(Widget other) { + if (other.myCubits == myCubits && other.myHands == myHands) + return true; + + return false; + } + + //toString + + public String toString() { + return myCubits + " cubits " + myHands + " hands"; + } + +} diff --git a/05 Collections _ Generics/02 SortingGenerically/Generic Types and Methods.docx b/05 Collections _ Generics/02 SortingGenerically/Generic Types and Methods.docx new file mode 100644 index 0000000..652ac2f Binary files /dev/null and b/05 Collections _ Generics/02 SortingGenerically/Generic Types and Methods.docx differ diff --git a/05 Collections _ Generics/02 SortingGenerically/SortingGenerically.java b/05 Collections _ Generics/02 SortingGenerically/SortingGenerically.java new file mode 100644 index 0000000..d6781f3 --- /dev/null +++ b/05 Collections _ Generics/02 SortingGenerically/SortingGenerically.java @@ -0,0 +1,170 @@ +// Name: B6-24 +// Date: 12/6/19 + +import java.io.*; //the File class +import java.util.*; //ArrayList & the Scanner class in Java 1.5 + +public class SortingGenerically +{ + public static void main(String[] args) throws Exception + { + //Widgets + List apple = inputWidgets("widgets.txt"); + sort(apple); + output(apple); + System.out.println("There are " + apple.size() +" widgets, sorted."); + + //Strings + List strList = inputStrings("strings.txt"); + sort(strList); + output(strList); + System.out.println("There are " + strList.size() +" strings, alphabetized."); + } + + public static List inputStrings(String filename) throws Exception + { + Scanner sc; + try { + sc = new Scanner(new File(filename)); + } + catch (FileNotFoundException e) { + return null; + } + + List list = new ArrayList<>(); + + while (sc.hasNextLine()) { + String[] strings = sc.nextLine().split(" "); + for (String s : strings) + list.add(s); + } + return list; + } + + public static List inputWidgets(String filename) throws Exception + { + Scanner sc; + try { + sc = new Scanner(new File(filename)); + } + catch (FileNotFoundException e) { + return null; + } + + List list = new ArrayList<>(); + + while (sc.hasNextLine()) { + list.add(new Widget(Integer.parseInt(sc.nextLine()), Integer.parseInt(sc.nextLine()))); + } + + return list; + } + + /* these methods are all GENERIC */ + public static > void sort(List array) + { + for (int upper = array.size() - 1; 0 <= upper; upper--) + swap(array, findMax(array, upper), upper); + } + public static > int findMax(List array, int upper) + { + T max = array.get(0); + int index = 0; + for(int i = 0; i <= upper; i++) { + if (array.get(i).compareTo(max) > 0) { + max = array.get(i); + index = i; + } + } + + return index; + } + + public static void swap(List array, int a, int b) + { + T temp = array.get(a); + array.set(a, array.get(b)); + array.set(b, temp); + } + + public static void output(Collection array) + { + Iterator i = array.iterator(); + while (i.hasNext()) + System.out.println(i.next()); + + } +} + +/************************************* + 0 cubits 14 hands + 1 cubits 3 hands + 2 cubits 14 hands + 5 cubits 14 hands + 10 cubits 14 hands + 11 cubits 11 hands + 12 cubits 0 hands + 12 cubits 7 hands + 13 cubits 9 hands + 15 cubits 12 hands + 17 cubits 5 hands + 18 cubits 13 hands + 19 cubits 13 hands + 19 cubits 13 hands + 22 cubits 6 hands + 23 cubits 7 hands + 24 cubits 15 hands + 24 cubits 15 hands + 26 cubits 2 hands + 28 cubits 5 hands + 28 cubits 12 hands + 29 cubits 15 hands + 31 cubits 0 hands + 32 cubits 1 hands + 32 cubits 11 hands + 32 cubits 11 hands + 32 cubits 12 hands + 35 cubits 3 hands + 39 cubits 2 hands + 39 cubits 5 hands + 41 cubits 10 hands + 43 cubits 2 hands + 43 cubits 5 hands + 43 cubits 6 hands + 51 cubits 2 hands + 54 cubits 14 hands + 55 cubits 8 hands + 56 cubits 3 hands + 57 cubits 12 hands + 62 cubits 15 hands + 63 cubits 0 hands + 64 cubits 13 hands + 67 cubits 3 hands + 70 cubits 0 hands + 73 cubits 5 hands + 74 cubits 7 hands + 75 cubits 9 hands + 81 cubits 5 hands + 85 cubits 14 hands + 86 cubits 3 hands + 90 cubits 13 hands + 91 cubits 3 hands + 92 cubits 1 hands + 92 cubits 8 hands + 96 cubits 1 hands + 98 cubits 8 hands + 99 cubits 5 hands + There are 57 widgets, sorted. + APCS + Encapsulation + Exam + Generics + Inheritance + Java + Method + OOP + Object + Oriented + Polymorphism + Programming + There are 12 strings, alphabetized. ****************************************/ \ No newline at end of file diff --git a/05 Collections _ Generics/02 SortingGenerically/Widget.java b/05 Collections _ Generics/02 SortingGenerically/Widget.java new file mode 100644 index 0000000..bf53458 --- /dev/null +++ b/05 Collections _ Generics/02 SortingGenerically/Widget.java @@ -0,0 +1,67 @@ +//resource class to demonstrate sorting with Generics +public class Widget implements Comparable +{ + // fields + private int myCubits, myHands; + + // constructors + public Widget() + { + myCubits = myHands = 0; + } + public Widget(int x) + { + myCubits = x; + myHands = 0; + } + public Widget(int x, int y) + { + myCubits = x; + myHands = y; + } + public Widget(Widget arg) //copy constructor + { + myCubits = arg.getCubits(); + myHands = arg.getHands(); + } + + //accessors and modifiers + public int getCubits() + { + return myCubits; + } + public int getHands() + { + return myHands; + } + public void setCubits(int x) + { + myCubits = x; + } + public void setHands(int x) + { + myHands = x; + } + + //other methods + public int compareTo(Widget other) + { + if(myCubits < other.getCubits()) + return -1; + if(myCubits > other.myCubits) + return 1; + if(myHands < other.myHands) //"private" is at the class level + return -1; + if(myHands > other.getHands()) + return 1; + return 0; + } + public boolean equals(Widget other) //not equals(Object arg) + { + return compareTo(other) == 0; + } + public String toString() + { + return myCubits + " cubits " + myHands + " hands"; + } +} diff --git a/05 Collections _ Generics/02 SortingGenerically/strings.txt b/05 Collections _ Generics/02 SortingGenerically/strings.txt new file mode 100644 index 0000000..9d70510 --- /dev/null +++ b/05 Collections _ Generics/02 SortingGenerically/strings.txt @@ -0,0 +1,4 @@ +Inheritance Generics Method +Polymorphism Java Encapsulation +Object Oriented Programming +OOP APCS Exam \ No newline at end of file diff --git a/05 Collections _ Generics/02 SortingGenerically/widgets.txt b/05 Collections _ Generics/02 SortingGenerically/widgets.txt new file mode 100644 index 0000000..1981e7d --- /dev/null +++ b/05 Collections _ Generics/02 SortingGenerically/widgets.txt @@ -0,0 +1,114 @@ +64 +13 +15 +12 +67 +3 +10 +14 +32 +1 +5 +14 +39 +2 +29 +15 +12 +0 +12 +7 +70 +0 +19 +13 +63 +0 +24 +15 +0 +14 +31 +0 +43 +5 +18 +13 +74 +7 +43 +2 +32 +12 +55 +8 +73 +5 +96 +1 +75 +9 +98 +8 +81 +5 +57 +12 +51 +2 +24 +15 +85 +14 +13 +9 +32 +11 +43 +6 +19 +13 +2 +14 +92 +8 +62 +15 +86 +3 +39 +5 +91 +3 +35 +3 +28 +12 +90 +13 +17 +5 +92 +1 +23 +7 +11 +11 +1 +3 +54 +14 +32 +11 +41 +10 +99 +5 +56 +3 +22 +6 +26 +2 +28 +5 diff --git a/05 Collections _ Generics/03 Collections Speed/Collections Speed.doc b/05 Collections _ Generics/03 Collections Speed/Collections Speed.doc new file mode 100644 index 0000000..5c0ad25 Binary files /dev/null and b/05 Collections _ Generics/03 Collections Speed/Collections Speed.doc differ diff --git a/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.class b/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.class new file mode 100644 index 0000000..dc36c4c Binary files /dev/null and b/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.class differ diff --git a/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.java b/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.java new file mode 100644 index 0000000..7e61902 --- /dev/null +++ b/05 Collections _ Generics/03 Collections Speed/CollectionsSpeed.java @@ -0,0 +1,90 @@ +// Name: B6-24 +// Date: 12/6/19 + +import java.util.*; + +public class CollectionsSpeed +{ + public static final int n = 10000; + + public static void main(String[] args) + { + ArrayList alist = new ArrayList(); + LinkedList llist = new LinkedList(); + makeValues(alist, llist); + + System.out.println("get each for ArrayList = " + timeGetEach(alist)); + System.out.println("get each for LinkedList = " + timeGetEach(llist)); + System.out.println("\nadd at 0 for ArrayList = " + timeAddFirst(alist)); + System.out.println("add at 0 for LinkedList = " + timeAddFirst(llist)); + System.out.println("\nadd at list.size() for ArrayList = " + timeAddLast(alist)); + System.out.println("add at list.size() for LinkedList = " + timeAddLast(llist)); + System.out.println("addLast for LinkedList = " + timeAddLastLL(llist)); + } + + public static void makeValues(ArrayList alist, LinkedList llist) + { + for( int i = 0; i < n; i++ ) + { + alist.add(i); + llist.add(i); + } + } + + /** + * Get n items by searching for each one. + */ + public static double timeGetEach(List list) + { + double start = System.nanoTime(); + for( int i = 0; i < n; i++ ) + { + int index = list.get(i); + } + return (System.nanoTime() - start)/1E6; + } + + /** + * Add 10000 new objects at position 0. + */ + public static double timeAddFirst(List list) + { + + double start = System.nanoTime(); + for( int i = 0; i < n; i++ ) + { + list.add(0, i); + } + return (System.nanoTime() - start)/1E6; + } + + /* + * Add 10000 new objects at position list.size() + */ + public static double timeAddLast(List list) + { + double start = System.nanoTime(); + for( int i = 0; i < n; i++ ) + { + list.add(list.size()); + } + return (System.nanoTime() - start)/1E6; + } + + /* + * Add 10000 new objects at the end. + * Uses the LinkedList method addLast(). + * You must cast List list into a LinkedList. + */ + public static double timeAddLastLL(List list) + { + double start = System.nanoTime(); + LinkedList llist = (LinkedList) list; + + for( int i = 0; i < n; i++ ) + { + llist.addLast(i); + } + return (System.nanoTime() - start)/1E6; + } +} diff --git a/05 Collections _ Generics/04 IteratorLab/Iterator Worksheet.doc b/05 Collections _ Generics/04 IteratorLab/Iterator Worksheet.doc new file mode 100644 index 0000000..64c42ef Binary files /dev/null and b/05 Collections _ Generics/04 IteratorLab/Iterator Worksheet.doc differ diff --git a/05 Collections _ Generics/04 IteratorLab/IteratorLab.class b/05 Collections _ Generics/04 IteratorLab/IteratorLab.class new file mode 100644 index 0000000..a880fb8 Binary files /dev/null and b/05 Collections _ Generics/04 IteratorLab/IteratorLab.class differ diff --git a/05 Collections _ Generics/04 IteratorLab/IteratorLab.java b/05 Collections _ Generics/04 IteratorLab/IteratorLab.java new file mode 100644 index 0000000..8d0951c --- /dev/null +++ b/05 Collections _ Generics/04 IteratorLab/IteratorLab.java @@ -0,0 +1,103 @@ + // Name: B6-24 + // Date: 12/11/19 + // use for-each loops or iterators, not regular for-loops +import java.io.*; +import java.util.*; +public class IteratorLab +{ + public static void main(String[] args) + { + System.out.println("Iterator Lab\n"); + int[] rawNumbers = {-9, 4, 2, 5, -10, 6, -4, 24, 20, -28}; + for(int n : rawNumbers ) + System.out.print(n + " "); + ArrayList numbers = createNumbers(rawNumbers); + System.out.println("\nArrayList: "+ numbers); //Implicit Iterator! + System.out.println("Count negative numbers: " + countNeg(numbers)); + System.out.println("Average: " + average(numbers)); + System.out.println("Replace negative numbers: " + replaceNeg(numbers)); + System.out.println("Delete zeros: " + deleteZero(numbers)); + String[] rawMovies = {"High_Noon", "High_Noon", "Star_Wars", "Tron", "Mary_Poppins", + "Dr_No", "Dr_No", "Mary_Poppins", "High_Noon", "Tron"}; + ArrayList movies = createMovies(rawMovies); + System.out.println("Movies: " + movies); + System.out.println("Movies: " + removeDupes(movies)); + } + // pre: an array of just int values + // post: return an ArrayList containing all the values + public static ArrayList createNumbers(int[] rawNumbers) + { + ArrayList list = new ArrayList(); + for (int i = 0; i < rawNumbers.length; i++) + list.add(rawNumbers[i]); + return list; + } + // pre: an array of just Strings + // post: return an ArrayList containing all the Strings + public static ArrayList createMovies(String[] rawWords) + { + ArrayList myList = new ArrayList(); + for ( String str : rawWords ) + myList.add( str ); + return myList; + } + + // pre: ArrayList a is not empty and contains only Integer objects + // post: return the number of negative values in the ArrayList a + public static int countNeg(ArrayList a) + { + Iterator it = a.iterator(); int count = 0; + while(it.hasNext()) + if (it.next() < 0) + count++; + return count; + } + // pre: ArrayList a is not empty and contains only Integer objects + // post: return the average of all values in the ArrayList a + public static double average(ArrayList a) + { + Iterator it = a.iterator(); double avg = 0; + while(it.hasNext()) + avg += it.next(); + + avg /= a.size(); + return avg; + } + // pre: ArrayList a is not empty and contains only Integer objects + // post: replaces all negative values with 0 + public static ArrayList replaceNeg(ArrayList a) + { + ListIterator it = a.listIterator(); + while (it.hasNext()) + if (it.next() < 0) + it.set(0); + + return a; + } + // pre: ArrayList a is not empty and contains only Integer objects + // post: deletes all zeros in the ArrayList a + public static ArrayList deleteZero(ArrayList a) + { + ListIterator it = a.listIterator(); + while(it.hasNext()) + if (it.next() == 0) + it.remove(); + + return a; + } + // pre: ArrayList a is not empty and contains only String objects + // post: return ArrayList without duplicate movie titles + // strategy: start with an empty array and add movies as needed + public static ArrayList removeDupes(ArrayList a) + { + ArrayList newList = new ArrayList<>(); ListIterator it = a.listIterator(); + while(it.hasNext()) { + String movie = it.next(); + if (!newList.contains(movie)) + newList.add(movie); + } + return newList; + } + +} + diff --git a/05 Collections _ Generics/05 IndexMaker/DocumentIndex.class b/05 Collections _ Generics/05 IndexMaker/DocumentIndex.class new file mode 100644 index 0000000..19dcd30 Binary files /dev/null and b/05 Collections _ Generics/05 IndexMaker/DocumentIndex.class differ diff --git a/05 Collections _ Generics/05 IndexMaker/IndexEntry.class b/05 Collections _ Generics/05 IndexMaker/IndexEntry.class new file mode 100644 index 0000000..612e3c0 Binary files /dev/null and b/05 Collections _ Generics/05 IndexMaker/IndexEntry.class differ diff --git a/05 Collections _ Generics/05 IndexMaker/IndexMaker.class b/05 Collections _ Generics/05 IndexMaker/IndexMaker.class new file mode 100644 index 0000000..8dc2f8c Binary files /dev/null and b/05 Collections _ Generics/05 IndexMaker/IndexMaker.class differ diff --git a/05 Collections _ Generics/05 IndexMaker/IndexMaker.doc b/05 Collections _ Generics/05 IndexMaker/IndexMaker.doc new file mode 100644 index 0000000..55ae334 Binary files /dev/null and b/05 Collections _ Generics/05 IndexMaker/IndexMaker.doc differ diff --git a/05 Collections _ Generics/05 IndexMaker/IndexMaker.java b/05 Collections _ Generics/05 IndexMaker/IndexMaker.java new file mode 100644 index 0000000..8349253 --- /dev/null +++ b/05 Collections _ Generics/05 IndexMaker/IndexMaker.java @@ -0,0 +1,146 @@ +// Name: B6-24 +// Date: 12/11/19 +// This program takes a text file, creates an index (by line numbers) +// for all the words in the file and writes the index +// into the output file. The program prompts the user for the file names. + +import java.util.*; +import java.io.*; + +public class IndexMaker +{ + public static void main(String[] args) throws IOException + { + Scanner keyboard = new Scanner(System.in); + System.out.print("\nEnter input file name: "); + String inFileName = keyboard.nextLine().trim(); + Scanner inputFile = new Scanner(new File(inFileName)); + String outFileName = "fishIndex.txt"; + PrintWriter outputFile = new PrintWriter(new FileWriter(outFileName)); + indexDocument(inputFile, outputFile); + inputFile.close(); + outputFile.close(); + System.out.println("Done."); + } + public static void indexDocument(Scanner inputFile, PrintWriter outputFile) + { + DocumentIndex index = new DocumentIndex(); + String line = null; + int lineNum = 0; + while(inputFile.hasNextLine()) + { + lineNum++; + index.addAllWords(inputFile.nextLine(), lineNum); + } + for(IndexEntry entry : index) + outputFile.println(entry); + } +} +class DocumentIndex extends ArrayList +{ + //constructors + public DocumentIndex() { + super(); + } + + public DocumentIndex(int a) { + super(a); + } + + /** extracts all the words from str, skipping punctuation and whitespace + and for each word calls addWord(). In this situation, a good way to + extract while also skipping punctuation is to use String's split method, + e.g., str.split("[., \"!?]") */ + public void addAllWords(String str, int lineNum) + { + String[] words = str.split("[., \"!?]"); + for (int i = 0; i < words.length; i++) + if (!words[i].trim().equals("")) + addWord(words[i].trim(), lineNum); + } + + /** calls foundOrInserted, which returns a position. At that position, + updates that IndexEntry's list of line numbers with lineNum. */ + public void addWord(String word, int lineNum) + { + int index = foundOrInserted(word); + if (index != -1) + get(index).add(lineNum); + } + + /** traverses this DocumentIndex and compares word to the words in the + IndexEntry objects in this list, looking for the correct position of + word. If an IndexEntry with word is not already in that position, the + method creates and inserts a new IndexEntry at that position. The + method returns the position of either the found or the inserted + IndexEntry.*/ + private int foundOrInserted(String word) + { + word = word.toUpperCase(); + + if (size() == 0) { + add(new IndexEntry(word)); + return 0; + } + + for (int i = 0; i < size(); i++) { + IndexEntry ie = (IndexEntry)get(i); + if (ie.getWord().equals(word)) + return i; + else if (ie.getWord().compareTo(word) > 0) { + add(i, new IndexEntry(word)); + return i; + } + } + + add(new IndexEntry(word)); + return size()-1; + } +} + +class IndexEntry implements Comparable +{ + //fields + private String word; + private ArrayList numsList; + + //constructors + public IndexEntry (String a) { + word = a.toUpperCase(); + numsList = new ArrayList(); + } + + + /** appends num to numsList, but only if it is not already in that list. + */ + public void add(int num) + { + if (!numsList.contains(num)) + numsList.add(num); + } + + /** this is a standard accessor method */ + public String getWord() + { + return word; + } + + /** returns a string representation of this Index Entry. */ + public String toString() + { + String list = ""; Iterator it = numsList.iterator(); + while(it.hasNext()) { + list += it.next(); + if (it.hasNext()) + list += ", "; + } + + return word + " " + list; + } + + public int compareTo(IndexEntry other) { + return word.compareTo(other.getWord()); + } + +} + diff --git a/05 Collections _ Generics/05 IndexMaker/fish.txt b/05 Collections _ Generics/05 IndexMaker/fish.txt new file mode 100644 index 0000000..312a5de --- /dev/null +++ b/05 Collections _ Generics/05 IndexMaker/fish.txt @@ -0,0 +1,18 @@ +One fish fish +two fish fish +Red fish +Blue fish. + +Black fish +Blue fish +Old fish +New fish. + +This one has +a little a star. + +This one has a little car. +Say! What a lot +of fish there are. + + diff --git a/05 Collections _ Generics/05 IndexMaker/fish1.txt b/05 Collections _ Generics/05 IndexMaker/fish1.txt new file mode 100644 index 0000000..e69de29 diff --git a/05 Collections _ Generics/05 IndexMaker/fish2.txt b/05 Collections _ Generics/05 IndexMaker/fish2.txt new file mode 100644 index 0000000..dedf751 --- /dev/null +++ b/05 Collections _ Generics/05 IndexMaker/fish2.txt @@ -0,0 +1,8 @@ +One fish two fish +Red fish Blue fish. + +Black fish Blue fish +Old fish New fish. + + + diff --git a/05 Collections _ Generics/05 IndexMaker/fish3.txt b/05 Collections _ Generics/05 IndexMaker/fish3.txt new file mode 100644 index 0000000..3e5aa14 --- /dev/null +++ b/05 Collections _ Generics/05 IndexMaker/fish3.txt @@ -0,0 +1,17 @@ +"One fish +two fish + Red fish +,,,,Blue fish." + +"Black fish" + Blue fish +. . . . Old fish +New fish. + +?????This one has +? a little star. + +This one" has a little car? +!Say! What a lot +!!!!!of fish there are. + diff --git a/05 Collections _ Generics/05 IndexMaker/fishIndex.txt b/05 Collections _ Generics/05 IndexMaker/fishIndex.txt new file mode 100644 index 0000000..bbf3238 --- /dev/null +++ b/05 Collections _ Generics/05 IndexMaker/fishIndex.txt @@ -0,0 +1,20 @@ +A 12, 14, 15 +ARE 16 +BLACK 6 +BLUE 4, 7 +CAR 14 +FISH 1, 2, 3, 4, 6, 7, 8, 9, 16 +HAS 11, 14 +LITTLE 12, 14 +LOT 15 +NEW 9 +OF 16 +OLD 8 +ONE 1, 11, 14 +RED 3 +SAY 15 +STAR 12 +THERE 16 +THIS 11, 14 +TWO 2 +WHAT 15 diff --git a/05 Collections _ Generics/AP AB Quick Reference--2 col.doc b/05 Collections _ Generics/AP AB Quick Reference--2 col.doc new file mode 100644 index 0000000..f532b82 Binary files /dev/null and b/05 Collections _ Generics/AP AB Quick Reference--2 col.doc differ diff --git a/05 Collections _ Generics/DS_Dec.pub b/05 Collections _ Generics/DS_Dec.pub new file mode 100644 index 0000000..4644bee Binary files /dev/null and b/05 Collections _ Generics/DS_Dec.pub differ diff --git a/06 Stacks _ Queues/01 ParenMatch/ParenMatch.class b/06 Stacks _ Queues/01 ParenMatch/ParenMatch.class new file mode 100644 index 0000000..f2e1f19 Binary files /dev/null and b/06 Stacks _ Queues/01 ParenMatch/ParenMatch.class differ diff --git a/06 Stacks _ Queues/01 ParenMatch/ParenMatch.java b/06 Stacks _ Queues/01 ParenMatch/ParenMatch.java new file mode 100644 index 0000000..d83e26c --- /dev/null +++ b/06 Stacks _ Queues/01 ParenMatch/ParenMatch.java @@ -0,0 +1,71 @@ +// Name: B6-24 +// Date: 1/5/2020 + +import java.util.*; + +public class ParenMatch +{ + public static final String LEFT = "([{<"; + public static final String RIGHT = ")]}>"; + + public static void main(String[] args) + { + System.out.println("Parentheses Match"); + ArrayList parenExp = new ArrayList(); + /* enter test cases here */ +// parenExp.add("5+7"); +// parenExp.add("(5+7)"); +// parenExp.add(")5+7("); +// parenExp.add("((5+7)*3)"); +// parenExp.add("<{5+7}*3>"); +// parenExp.add("[(5+7)*]3"); +// parenExp.add("(5+7)*3"); +// parenExp.add("5+(7*3)"); +// parenExp.add("((5+7)*3"); +// parenExp.add("[(5+7]*3)"); +// parenExp.add("[(5+7)*3])"); +// parenExp.add("([(5+7)*3]"); + parenExp.add("()[]{}<>"); + + for( String s : parenExp ) + { + boolean good = checkParen(s); + if(good) + System.out.println(s + "\t good!"); + else + System.out.println(s + "\t BAD"); + } + } + + public static boolean checkParen(String exp) { + Stack parens = new Stack<>(); + for (char c : exp.toCharArray()) { + if (LEFT.contains(String.valueOf(c))) + parens.push(c); + else if(RIGHT.contains(String.valueOf(c))) + if (parens.isEmpty() || RIGHT.indexOf(c) != LEFT.indexOf(parens.pop())) + return false; + } + + if (parens.isEmpty()) + return true; + else + return false; + } +} + +/* + Parentheses Match + 5+7 good! + (5+7) good! + )5+7( BAD + ((5+7)*3) good! + <{5+7}*3> good! + [(5+7)*]3 good! + (5+7)*3 good! + 5+(7*3) good! + ((5+7)*3 BAD + [(5+7]*3) BAD + [(5+7)*3]) BAD + ([(5+7)*3] BAD + */ diff --git a/06 Stacks _ Queues/01 ParenMatch/Parentheses Match.doc b/06 Stacks _ Queues/01 ParenMatch/Parentheses Match.doc new file mode 100644 index 0000000..9271ddd Binary files /dev/null and b/06 Stacks _ Queues/01 ParenMatch/Parentheses Match.doc differ diff --git a/06 Stacks _ Queues/01 ParenMatch/Stacks Queues Priority Queues.docx b/06 Stacks _ Queues/01 ParenMatch/Stacks Queues Priority Queues.docx new file mode 100644 index 0000000..3c37cf0 Binary files /dev/null and b/06 Stacks _ Queues/01 ParenMatch/Stacks Queues Priority Queues.docx differ diff --git a/06 Stacks _ Queues/02 Postfix/Postfix Expressions.doc b/06 Stacks _ Queues/02 Postfix/Postfix Expressions.doc new file mode 100644 index 0000000..454b6b5 Binary files /dev/null and b/06 Stacks _ Queues/02 Postfix/Postfix Expressions.doc differ diff --git a/06 Stacks _ Queues/02 Postfix/Postfix.class b/06 Stacks _ Queues/02 Postfix/Postfix.class new file mode 100644 index 0000000..23759d7 Binary files /dev/null and b/06 Stacks _ Queues/02 Postfix/Postfix.class differ diff --git a/06 Stacks _ Queues/02 Postfix/Postfix.java b/06 Stacks _ Queues/02 Postfix/Postfix.java new file mode 100644 index 0000000..0b7ccac --- /dev/null +++ b/06 Stacks _ Queues/02 Postfix/Postfix.java @@ -0,0 +1,103 @@ +// Name: B6-24 +// Date: 1/6/2020 + +import java.util.*; + +public class Postfix +{ + public static void main(String[] args) + { + System.out.println("Postfix --> Evaluate"); + ArrayList postfixExp = new ArrayList(); + /* build your list of expressions here */ + postfixExp.add("3 4 5 * +"); + postfixExp.add("3 4 * 5 +"); + postfixExp.add("10 20 + -6 6 * +"); + postfixExp.add("3 4 + 5 6 + *"); + postfixExp.add("3 4 5 + * 2 - 5 /"); + postfixExp.add("8 1 2 * + 9 3 / -"); + postfixExp.add("2 3 ^"); + postfixExp.add("20 3 %"); + postfixExp.add("21 3 %"); + postfixExp.add("22 3 %"); + postfixExp.add("23 3 %"); + postfixExp.add("5 !"); + postfixExp.add("1 1 1 1 1 + + + + !"); + + + for( String pf : postfixExp ) + { + System.out.println(pf + "\t\t" + eval(pf)); + } + } + + public static int eval(String pf) + { + List postfixParts = new ArrayList(Arrays.asList(pf.split(" "))); + /* enter your code here */ + Stack s = new Stack<>(); + + for (String str : postfixParts) { + if (!isOperator(str)) + s.push(Integer.valueOf(str)); + else { + if (str.equals("!")) { + int factorial = 1; int f = s.pop(); + for (int i = 2; i <= f; i++) + factorial *= i; + s.push(factorial); + } else + s.push(eval(s.pop(), s.pop(), str)); + } + } + + return s.pop(); + } + + public static int eval(int a, int b, String ch) + { + switch(ch) { + case "+": + return b + a; + case "-": + return b - a; + case "/": + return b / a; + case "*": + return b * a; + case "^": + return (int) Math.pow(b, a); + case "%": + return b % a; + } + + return -1; + } + + public static boolean isOperator(String op) + { + if ("+-/*^%!".contains(op)) + return true; + else + return false; + } +} + +/********************************************** +Postfix --> Evaluate + 3 4 5 * + 23 + 3 4 * 5 + 17 + 10 20 + -6 6 * + -6 + 3 4 + 5 6 + * 77 + 3 4 5 + * 2 - 5 / 5 + 8 1 2 * + 9 3 / - 7 + 2 3 ^ 8 + 20 3 % 2 + 21 3 % 0 + 22 3 % 1 + 23 3 % 2 + 5 ! 120 + 1 1 1 1 1 + + + + ! 120 + + + *************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/03 Infix/Infix Expressions.doc b/06 Stacks _ Queues/03 Infix/Infix Expressions.doc new file mode 100644 index 0000000..0c2b555 Binary files /dev/null and b/06 Stacks _ Queues/03 Infix/Infix Expressions.doc differ diff --git a/06 Stacks _ Queues/03 Infix/Infix.class b/06 Stacks _ Queues/03 Infix/Infix.class new file mode 100644 index 0000000..7a13611 Binary files /dev/null and b/06 Stacks _ Queues/03 Infix/Infix.class differ diff --git a/06 Stacks _ Queues/03 Infix/Infix.java b/06 Stacks _ Queues/03 Infix/Infix.java new file mode 100644 index 0000000..25f7b74 --- /dev/null +++ b/06 Stacks _ Queues/03 Infix/Infix.java @@ -0,0 +1,90 @@ +// Name: B6-24 +// Date: 1/7/20 + +import java.util.*; + +public class Infix +{ + public static void main(String[] args) + { + System.out.println("Infix \t-->\tPostfix\t\t-->\tEvaluate"); + /*build your list of Infix expressions here */ + ArrayList infixExp = new ArrayList(); + infixExp.add("3 - 4 + 5"); + infixExp.add("3 + 4 * 5"); + infixExp.add("3 * 4 + 5"); + infixExp.add("( -5 + 15 ) - 6 / 3"); + infixExp.add("( 3 + 4 ) * ( 5 + 6 )"); + infixExp.add("( 3 * ( 4 + 5 ) - 2 ) / 5"); + infixExp.add("8 + -1 * 2 - 9 / 3"); + infixExp.add("3 * ( 4 * 5 + 6 )"); + infixExp.add("3 * ( 4 * 5 - 6 + 2 )"); + + for( String infix : infixExp ) + { + String pf = infixToPostfix(infix); //get this to work first + // System.out.println(infix + "\t\t\t" + pf); + System.out.println(infix + "\t\t\t" + pf + "\t\t\t" + Postfix.eval(pf)); //Postfix must work! + } + } + + public static String infixToPostfix(String infix) + { + List infixParts = new ArrayList(Arrays.asList(infix.split(" "))); + /* enter your code here */ + Stack s = new Stack<>(); + String postfix = ""; + + for (String str : infixParts) { + switch(str) { + case "(": + s.push(str); + break; + case ")": + while (!s.peek().equals("(")) + postfix += s.pop() + " "; + s.pop(); + break; + case "+": case "-": case "/": case "*": + while(!s.isEmpty() && isLowerOrEqual(str.charAt(0), s.peek().charAt(0))) + postfix += s.pop() + " "; + s.push(str); + break; + + default: + postfix += str + " "; + break; + } + } + + while (!s.isEmpty()) + postfix += s.pop() + " "; + + return postfix.trim(); + } + + //returns true if c1 has lower or equal precedence than c2 + public static boolean isLowerOrEqual(char c1, char c2) + { + String str1 = Character.toString(c1), str2 = Character.toString(c2); + if (("*/".contains(str2) && "+-".contains(str1)) || ("+-".contains(str2) && "+-".contains(str1)) || ("*/".contains(str2) && "*/".contains(str1))) + return true; + else + return false; + } +} + +/******************************************** + + Infix --> Postfix --> Evaluate + 3 - 4 + 5 3 4 - 5 + 4 + 3 + 4 * 5 3 4 5 * + 23 + 3 * 4 + 5 3 4 * 5 + 17 + ( -5 + 15 ) - 6 / 3 -5 15 + 6 3 / - 8 + ( 3 + 4 ) * ( 5 + 6 ) 3 4 + 5 6 + * 77 + ( 3 * ( 4 + 5 ) - 2 ) / 5 3 4 5 + * 2 - 5 / 5 + 8 + -1 * 2 - 9 / 3 8 -1 2 * + 9 3 / - 3 + 3 * ( 4 * 5 + 6 ) 3 4 5 * 6 + * 78 + 3 * ( 4 * 5 - 6 + 2 ) 3 4 5 * 6 - 2 + * 48 + +***********************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/03 Infix/Infix_Extension.class b/06 Stacks _ Queues/03 Infix/Infix_Extension.class new file mode 100644 index 0000000..6ecc419 Binary files /dev/null and b/06 Stacks _ Queues/03 Infix/Infix_Extension.class differ diff --git a/06 Stacks _ Queues/03 Infix/Infix_Extension.java b/06 Stacks _ Queues/03 Infix/Infix_Extension.java new file mode 100644 index 0000000..0e749c9 --- /dev/null +++ b/06 Stacks _ Queues/03 Infix/Infix_Extension.java @@ -0,0 +1,116 @@ +// Name: B6-24 +// Date: 1/7/20 + +import java.util.*; + +public class Infix_Extension +{ + public static void main(String[] args) + { + System.out.println("Infix \t-->\tPostfix\t\t-->\tEvaluate"); + /*build your list of Infix expressions here */ + ArrayList infixExp = new ArrayList(); + infixExp.add("3 * (4 + 5]"); + infixExp.add("4 2 : 3 +"); + + for( String infix : infixExp ) + { + String pf = infixToPostfix(infix); //get this to work first + int result = checkParen(infix); + if (result == 2) + pf = "ERROR: String contains an invalid character"; + else if (result == 1) + pf = "ERROR: String does not have matching parentheses"; + + System.out.println(infix + "\t\t\t" + pf); + // System.out.println(infix + "\t\t\t" + pf + "\t\t\t" + Postfix.eval(pf)); //Postfix must work! + } + } + + public static String infixToPostfix(String infix) + { + List infixParts = new ArrayList(Arrays.asList(infix.split(" "))); + /* enter your code here */ + Stack s = new Stack<>(); + String postfix = ""; + + for (String str : infixParts) { + switch(str) { + case "(": + s.push(str); + break; + case ")": + while (!s.peek().equals("(")) + postfix += s.pop() + " "; + s.pop(); + break; + case "+": case "-": case "/": case "*": + while(!s.isEmpty() && isLowerOrEqual(str.charAt(0), s.peek().charAt(0))) + postfix += s.pop() + " "; + s.push(str); + break; + + default: + postfix += str + " "; + break; + } + } + + while (!s.isEmpty()) + postfix += s.pop() + " "; + + return postfix.trim(); + } + + //returns true if c1 has lower or equal precedence than c2 + public static boolean isLowerOrEqual(char c1, char c2) + { + String str1 = Character.toString(c1), str2 = Character.toString(c2); + if (("*/".contains(str2) && "+-".contains(str1)) || ("+-".contains(str2) && "+-".contains(str1)) || ("*/".contains(str2) && "*/".contains(str1))) + return true; + else + return false; + } + + public static int checkParen(String exp) { + String LEFT = "([{<"; + String RIGHT = ")]}>"; + String OPS = ".1234567890+-/*([{<)]}>%^! "; + + for (char c : exp.toCharArray()) + if (!OPS.contains(String.valueOf(c))) + return 2; + + exp = exp.replace(" ", ""); + + + Stack parens = new Stack<>(); + for (char c : exp.toCharArray()) { + if (LEFT.contains(String.valueOf(c))) + parens.push(c); + else if(RIGHT.contains(String.valueOf(c))) + if (parens.isEmpty() || RIGHT.indexOf(c) != LEFT.indexOf(parens.pop())) + return 1; + } + + if (parens.isEmpty()) + return 0; + else + return 1; + } +} + +/******************************************** + + Infix --> Postfix --> Evaluate + 3 - 4 + 5 3 4 - 5 + 4 + 3 + 4 * 5 3 4 5 * + 23 + 3 * 4 + 5 3 4 * 5 + 17 + ( -5 + 15 ) - 6 / 3 -5 15 + 6 3 / - 8 + ( 3 + 4 ) * ( 5 + 6 ) 3 4 + 5 6 + * 77 + ( 3 * ( 4 + 5 ) - 2 ) / 5 3 4 5 + * 2 - 5 / 5 + 8 + -1 * 2 - 9 / 3 8 -1 2 * + 9 3 / - 3 + 3 * ( 4 * 5 + 6 ) 3 4 5 * 6 + * 78 + 3 * ( 4 * 5 - 6 + 2 ) 3 4 5 * 6 - 2 + * 48 + +***********************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/03 Infix/Postfix.class b/06 Stacks _ Queues/03 Infix/Postfix.class new file mode 100644 index 0000000..23759d7 Binary files /dev/null and b/06 Stacks _ Queues/03 Infix/Postfix.class differ diff --git a/06 Stacks _ Queues/03 Infix/Postfix.java b/06 Stacks _ Queues/03 Infix/Postfix.java new file mode 100644 index 0000000..0b7ccac --- /dev/null +++ b/06 Stacks _ Queues/03 Infix/Postfix.java @@ -0,0 +1,103 @@ +// Name: B6-24 +// Date: 1/6/2020 + +import java.util.*; + +public class Postfix +{ + public static void main(String[] args) + { + System.out.println("Postfix --> Evaluate"); + ArrayList postfixExp = new ArrayList(); + /* build your list of expressions here */ + postfixExp.add("3 4 5 * +"); + postfixExp.add("3 4 * 5 +"); + postfixExp.add("10 20 + -6 6 * +"); + postfixExp.add("3 4 + 5 6 + *"); + postfixExp.add("3 4 5 + * 2 - 5 /"); + postfixExp.add("8 1 2 * + 9 3 / -"); + postfixExp.add("2 3 ^"); + postfixExp.add("20 3 %"); + postfixExp.add("21 3 %"); + postfixExp.add("22 3 %"); + postfixExp.add("23 3 %"); + postfixExp.add("5 !"); + postfixExp.add("1 1 1 1 1 + + + + !"); + + + for( String pf : postfixExp ) + { + System.out.println(pf + "\t\t" + eval(pf)); + } + } + + public static int eval(String pf) + { + List postfixParts = new ArrayList(Arrays.asList(pf.split(" "))); + /* enter your code here */ + Stack s = new Stack<>(); + + for (String str : postfixParts) { + if (!isOperator(str)) + s.push(Integer.valueOf(str)); + else { + if (str.equals("!")) { + int factorial = 1; int f = s.pop(); + for (int i = 2; i <= f; i++) + factorial *= i; + s.push(factorial); + } else + s.push(eval(s.pop(), s.pop(), str)); + } + } + + return s.pop(); + } + + public static int eval(int a, int b, String ch) + { + switch(ch) { + case "+": + return b + a; + case "-": + return b - a; + case "/": + return b / a; + case "*": + return b * a; + case "^": + return (int) Math.pow(b, a); + case "%": + return b % a; + } + + return -1; + } + + public static boolean isOperator(String op) + { + if ("+-/*^%!".contains(op)) + return true; + else + return false; + } +} + +/********************************************** +Postfix --> Evaluate + 3 4 5 * + 23 + 3 4 * 5 + 17 + 10 20 + -6 6 * + -6 + 3 4 + 5 6 + * 77 + 3 4 5 + * 2 - 5 / 5 + 8 1 2 * + 9 3 / - 7 + 2 3 ^ 8 + 20 3 % 2 + 21 3 % 0 + 22 3 % 1 + 23 3 % 2 + 5 ! 120 + 1 1 1 1 1 + + + + ! 120 + + + *************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/04 Song Queue/Song Queue.doc b/06 Stacks _ Queues/04 Song Queue/Song Queue.doc new file mode 100644 index 0000000..6480d83 Binary files /dev/null and b/06 Stacks _ Queues/04 Song Queue/Song Queue.doc differ diff --git a/06 Stacks _ Queues/04 Song Queue/SongQueue.class b/06 Stacks _ Queues/04 Song Queue/SongQueue.class new file mode 100644 index 0000000..930022d Binary files /dev/null and b/06 Stacks _ Queues/04 Song Queue/SongQueue.class differ diff --git a/06 Stacks _ Queues/04 Song Queue/SongQueue.java b/06 Stacks _ Queues/04 Song Queue/SongQueue.java new file mode 100644 index 0000000..0a22539 --- /dev/null +++ b/06 Stacks _ Queues/04 Song Queue/SongQueue.java @@ -0,0 +1,162 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.io.*; +import java.util.*; + +public class SongQueue +{ + private static Scanner keyboard; //use this global Scanner for this lab only + private static Queue songQueue; + + public static void main(String[] args) throws Exception + { + keyboard = new Scanner(System.in); + songQueue = readPlayList(); + // System.out.println(songQueue); //not allowed + System.out.println("Your music queue: " + queueAsString()); + + String prompt = "Add song (A), Play song (P), Delete song (D), Quit (Q): "; + String str = ""; + do{ + System.out.print(prompt); + str = keyboard.nextLine().toUpperCase(); + processRequest( str ); + + System.out.println(); + }while(!str.equals("Q")); + } + + /* reads the file "songs.txt". Extracts the song's title + and stores it in a queue. + @return the queue of songs + */ + public static Queue readPlayList() throws IOException + { + Scanner infile = new Scanner (new File("songs.txt")); + Queue q = new LinkedList(); + while (infile.hasNextLine()) + q.add(infile.nextLine().split(" - ")[0]); + + return q; + } + + /* processes the character codes A, P, D, Q, a, p, d, q. + "A" prompts the user to enter the name of the song, + adds it to the queue, and displays the whole queue + after "Your music queue: " . Do not add the same song twice. + + "P" plays the song, if one exists, by displaying + "Now playing: " and its title and then removing it from the queue. + If there is nothing play, the program displays "Empty queue!" + + "D" displays the queue, prompts the user by showing + "Delete which song (exact match)?" and will either delete the + song and display the queue or show "Error: Song not in list." + + "Q" displays "No more music for you today. Goodbye!" + and ends the program. + + @param str - the character code + */ + + public static void processRequest(String str) + { + str = str.toLowerCase(); + + switch(str) { + case "a": + System.out.print("Song Name: "); + String song = keyboard.nextLine(); + if (!songQueue.contains(song)); + songQueue.add(song); + break; + case "p": + if (songQueue.isEmpty()) + System.out.println("Empty queue!"); + else + System.out.println("Now Playing: " + songQueue.remove()); + System.out.println("Your music queue: " + queueAsString()); + break; + case "d": + if(songQueue.isEmpty()) + System.out.println("Error: No songs in queue!"); + System.out.println(queueAsString()); + System.out.print("Delete which song (exact match)?"); + String del = keyboard.nextLine(); + if (!songQueue.contains(del)) + System.out.println("Error: Song not in list." ); + else { + Queue temp = new LinkedList<>(); + while (!songQueue.isEmpty()) { + if (!songQueue.peek().equals(del)) + temp.add(songQueue.peek()); + songQueue.remove(); + } + + while (!temp.isEmpty()) + songQueue.add(temp.remove()); + } + System.out.println("Your music queue: " + queueAsString()); + break; + case "q": + System.out.println("No more music for you today. Goodbye!"); + break; + default: + System.out.println("Error: Invalid Input"); + } + + } + + /* returns the songs in the queue, separated by commas. + */ + public static String queueAsString() + { + Queue temp = new LinkedList<>(); + String str = ""; + + while (!songQueue.isEmpty()) { + str += songQueue.peek() + ", "; + temp.add(songQueue.remove()); + } + + while (!temp.isEmpty()) + songQueue.add(temp.remove()); + + return str.substring(0, str.length() - 2); + } + + /* standard accessor method. + */ + public static Queue getQueue() + { + return songQueue; + } +} + +/********************************************* + + Your music queue: Really Love, Uptown Funk, Thinking Out Loud, Alright, Traveller, Shallow + Add song (A), Play song (P), Delete song (D), Quit (Q): p + Now playing: Really Love + Your music queue: Uptown Funk, Thinking Out Loud, Alright, Traveller, Shallow + + Add song (A), Play song (P), Delete song (D), Quit (Q): x + Invalid. Try again. + + Add song (A), Play song (P), Delete song (D), Quit (Q): d + Your music queue: Uptown Funk, Thinking Out Loud, Alright, Traveller, Shallow + Delete which song (exact match)? xxx + Error: Song not in list. + Your music queue: Uptown Funk, Thinking Out Loud, Alright, Traveller, Shallow + + Add song (A), Play song (P), Delete song (D), Quit (Q): d + Your music queue: Uptown Funk, Thinking Out Loud, Alright, Traveller, Shallow + Delete which song (exact match)? Alright + Your music queue: Uptown Funk, Thinking Out Loud, Traveller, Shallow + + Add song (A), Play song (P), Delete song (D), Quit (Q): q + + No more music for you today. Goodbye! + +**********************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/04 Song Queue/songs.txt b/06 Stacks _ Queues/04 Song Queue/songs.txt new file mode 100644 index 0000000..cb3bd0e --- /dev/null +++ b/06 Stacks _ Queues/04 Song Queue/songs.txt @@ -0,0 +1,6 @@ +Really Love - D'Angelo +Uptown Funk - Mark Ronson & Bruno Mars +Thinking Out Loud - Ed Sheeran +Alright - Kendrick Lamar +Traveller - Chris Stapleton +Shallow - Lady Gaga diff --git a/06 Stacks _ Queues/05-08 McRonald/Customer.class b/06 Stacks _ Queues/05-08 McRonald/Customer.class new file mode 100644 index 0000000..e535162 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/Customer.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald.class b/06 Stacks _ Queues/05-08 McRonald/McRonald.class new file mode 100644 index 0000000..c242568 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonald.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald.doc b/06 Stacks _ Queues/05-08 McRonald/McRonald.doc new file mode 100644 index 0000000..e891aaa Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonald.doc differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald.java b/06 Stacks _ Queues/05-08 McRonald/McRonald.java new file mode 100644 index 0000000..46a4690 --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/McRonald.java @@ -0,0 +1,1289 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.util.*; + +public class McRonald +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + int totalCustomers, totalWait, longestWait, longestQueue; + totalWait = totalCustomers = longestWait = longestQueue = 0; + + int wait = (int) (Math.random() * 6) + 2; + + Queue customers = new LinkedList<>(); + + for (int i = 0; i < TIME; i++) { + if (Math.random() < 0.2) + customers.add(i); + + if (wait == 0) { + if (i - customers.peek() > longestWait) + longestWait = i - customers.peek(); + totalWait += i - customers.remove(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + for (int i = TIME; !customers.isEmpty(); i++) { + if (wait == 0) { + if (i - customers.peek() > longestWait) + longestWait = i - customers.peek(); + totalWait += i - customers.remove(); + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + System.out.println("Total customers served = " + totalCustomers); + System.out.println("Average wait time = " + (double) totalWait / totalCustomers); + System.out.println("Longest wait time = " + longestWait); + System.out.println("Longest queue = " + longestQueue); + + } + + public static void display(Queue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + System.out.println(min + ": " + q); + } +} + +// class Customer // if you want a Customer class +// { +// +// } + + +/********************** Sample output + + 0: [] + 1: [] + 2: [2] + 3: [2] + 4: [2] + 5: [2] + 6: [2, 6] + 7: [6, 7] + 8: [6, 7] + 9: [6, 7] + 10: [6, 7, 10] + 11: [6, 7, 10] + 12: [7, 10, 12] + 13: [7, 10, 12] + 14: [7, 10, 12] + 15: [7, 10, 12] + 16: [10, 12] + 17: [10, 12] + 18: [10, 12] + 19: [10, 12] + 20: [10, 12] + 21: [10, 12] + 22: [10, 12] + 23: [12] + 24: [12] + 25: [12] + 26: [] + 27: [] + 28: [] + 29: [] + 30: [] + 31: [] + 32: [] + 33: [] + 34: [] + 35: [] + 36: [] + 37: [] + 38: [] + 39: [] + 40: [40] + 41: [40, 41] + 42: [40, 41] + 43: [41] + 44: [41] + 45: [41] + 46: [41] + 47: [] + 48: [48] + 49: [48] + 50: [48] + 51: [] + 52: [52] + 53: [52, 53] + 54: [52, 53, 54] + 55: [52, 53, 54] + 56: [52, 53, 54] + 57: [52, 53, 54] + 58: [53, 54, 58] + 59: [53, 54, 58] + 60: [53, 54, 58] + 61: [53, 54, 58] + 62: [54, 58] + 63: [54, 58] + 64: [54, 58] + 65: [58, 65] + 66: [58, 65] + 67: [58, 65] + 68: [58, 65] + 69: [58, 65] + 70: [65] + 71: [65] + 72: [65, 72] + 73: [65, 72] + 74: [65, 72, 74] + 75: [65, 72, 74] + 76: [65, 72, 74] + 77: [72, 74] + 78: [72, 74, 78] + 79: [72, 74, 78] + 80: [72, 74, 78] + 81: [74, 78] + 82: [74, 78] + 83: [74, 78, 83] + 84: [74, 78, 83] + 85: [74, 78, 83, 85] + 86: [74, 78, 83, 85] + 87: [78, 83, 85] + 88: [78, 83, 85] + 89: [78, 83, 85] + 90: [78, 83, 85] + 91: [78, 83, 85] + 92: [78, 83, 85] + 93: [83, 85] + 94: [83, 85, 94] + 95: [83, 85, 94] + 96: [83, 85, 94] + 97: [85, 94] + 98: [85, 94, 98] + 99: [85, 94, 98, 99] + 100: [85, 94, 98, 99, 100] + 101: [85, 94, 98, 99, 100] + 102: [85, 94, 98, 99, 100] + 103: [85, 94, 98, 99, 100] + 104: [94, 98, 99, 100] + 105: [94, 98, 99, 100, 105] + 106: [94, 98, 99, 100, 105, 106] + 107: [98, 99, 100, 105, 106] + 108: [98, 99, 100, 105, 106] + 109: [98, 99, 100, 105, 106, 109] + 110: [99, 100, 105, 106, 109] + 111: [99, 100, 105, 106, 109, 111] + 112: [99, 100, 105, 106, 109, 111] + 113: [100, 105, 106, 109, 111, 113] + 114: [100, 105, 106, 109, 111, 113] + 115: [100, 105, 106, 109, 111, 113] + 116: [100, 105, 106, 109, 111, 113] + 117: [100, 105, 106, 109, 111, 113] + 118: [100, 105, 106, 109, 111, 113] + 119: [100, 105, 106, 109, 111, 113] + 120: [105, 106, 109, 111, 113] + 121: [105, 106, 109, 111, 113] + 122: [105, 106, 109, 111, 113] + 123: [106, 109, 111, 113] + 124: [106, 109, 111, 113] + 125: [106, 109, 111, 113] + 126: [106, 109, 111, 113] + 127: [106, 109, 111, 113] + 128: [106, 109, 111, 113] + 129: [106, 109, 111, 113] + 130: [109, 111, 113, 130] + 131: [109, 111, 113, 130] + 132: [109, 111, 113, 130] + 133: [109, 111, 113, 130] + 134: [111, 113, 130, 134] + 135: [111, 113, 130, 134] + 136: [111, 113, 130, 134] + 137: [111, 113, 130, 134] + 138: [111, 113, 130, 134] + 139: [111, 113, 130, 134] + 140: [111, 113, 130, 134] + 141: [113, 130, 134] + 142: [113, 130, 134, 142] + 143: [113, 130, 134, 142, 143] + 144: [113, 130, 134, 142, 143] + 145: [130, 134, 142, 143] + 146: [130, 134, 142, 143] + 147: [130, 134, 142, 143] + 148: [130, 134, 142, 143] + 149: [130, 134, 142, 143] + 150: [130, 134, 142, 143] + 151: [130, 134, 142, 143, 151] + 152: [134, 142, 143, 151] + 153: [134, 142, 143, 151] + 154: [134, 142, 143, 151] + 155: [142, 143, 151] + 156: [142, 143, 151, 156] + 157: [142, 143, 151, 156] + 158: [142, 143, 151, 156] + 159: [142, 143, 151, 156] + 160: [142, 143, 151, 156] + 161: [142, 143, 151, 156, 161] + 162: [143, 151, 156, 161] + 163: [143, 151, 156, 161, 163] + 164: [143, 151, 156, 161, 163] + 165: [151, 156, 161, 163, 165] + 166: [151, 156, 161, 163, 165, 166] + 167: [151, 156, 161, 163, 165, 166] + 168: [151, 156, 161, 163, 165, 166] + 169: [156, 161, 163, 165, 166] + 170: [156, 161, 163, 165, 166] + 171: [156, 161, 163, 165, 166] + 172: [156, 161, 163, 165, 166] + 173: [156, 161, 163, 165, 166] + 174: [161, 163, 165, 166] + 175: [161, 163, 165, 166] + 176: [161, 163, 165, 166] + 177: [161, 163, 165, 166] + 178: [161, 163, 165, 166, 178] + 179: [161, 163, 165, 166, 178] + 180: [163, 165, 166, 178, 180] + 181: [163, 165, 166, 178, 180, 181] + 182: [163, 165, 166, 178, 180, 181] + 183: [163, 165, 166, 178, 180, 181] + 184: [165, 166, 178, 180, 181] + 185: [165, 166, 178, 180, 181, 185] + 186: [165, 166, 178, 180, 181, 185] + 187: [166, 178, 180, 181, 185, 187] + 188: [166, 178, 180, 181, 185, 187] + 189: [166, 178, 180, 181, 185, 187] + 190: [166, 178, 180, 181, 185, 187] + 191: [166, 178, 180, 181, 185, 187] + 192: [178, 180, 181, 185, 187] + 193: [178, 180, 181, 185, 187] + 194: [178, 180, 181, 185, 187] + 195: [178, 180, 181, 185, 187] + 196: [178, 180, 181, 185, 187, 196] + 197: [178, 180, 181, 185, 187, 196, 197] + 198: [178, 180, 181, 185, 187, 196, 197] + 199: [180, 181, 185, 187, 196, 197, 199] + 200: [180, 181, 185, 187, 196, 197, 199] + 201: [180, 181, 185, 187, 196, 197, 199] + 202: [180, 181, 185, 187, 196, 197, 199, 202] + 203: [181, 185, 187, 196, 197, 199, 202] + 204: [181, 185, 187, 196, 197, 199, 202, 204] + 205: [181, 185, 187, 196, 197, 199, 202, 204] + 206: [185, 187, 196, 197, 199, 202, 204] + 207: [185, 187, 196, 197, 199, 202, 204] + 208: [185, 187, 196, 197, 199, 202, 204] + 209: [185, 187, 196, 197, 199, 202, 204] + 210: [185, 187, 196, 197, 199, 202, 204] + 211: [185, 187, 196, 197, 199, 202, 204] + 212: [185, 187, 196, 197, 199, 202, 204] + 213: [187, 196, 197, 199, 202, 204, 213] + 214: [187, 196, 197, 199, 202, 204, 213] + 215: [187, 196, 197, 199, 202, 204, 213] + 216: [187, 196, 197, 199, 202, 204, 213] + 217: [187, 196, 197, 199, 202, 204, 213] + 218: [196, 197, 199, 202, 204, 213] + 219: [196, 197, 199, 202, 204, 213, 219] + 220: [196, 197, 199, 202, 204, 213, 219, 220] + 221: [196, 197, 199, 202, 204, 213, 219, 220, 221] + 222: [197, 199, 202, 204, 213, 219, 220, 221] + 223: [197, 199, 202, 204, 213, 219, 220, 221, 223] + 224: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 225: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 226: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 227: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 228: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 229: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 230: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 231: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 232: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 233: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 234: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 235: [199, 202, 204, 213, 219, 220, 221, 223, 224, 235] + 236: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 237: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 238: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 239: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 240: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 241: [204, 213, 219, 220, 221, 223, 224, 235] + 242: [204, 213, 219, 220, 221, 223, 224, 235] + 243: [204, 213, 219, 220, 221, 223, 224, 235] + 244: [213, 219, 220, 221, 223, 224, 235, 244] + 245: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 246: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 247: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 248: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 249: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 250: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 251: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 252: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 253: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 254: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 255: [220, 221, 223, 224, 235, 244, 245, 250] + 256: [220, 221, 223, 224, 235, 244, 245, 250] + 257: [220, 221, 223, 224, 235, 244, 245, 250] + 258: [220, 221, 223, 224, 235, 244, 245, 250] + 259: [220, 221, 223, 224, 235, 244, 245, 250] + 260: [220, 221, 223, 224, 235, 244, 245, 250] + 261: [221, 223, 224, 235, 244, 245, 250] + 262: [221, 223, 224, 235, 244, 245, 250] + 263: [221, 223, 224, 235, 244, 245, 250, 263] + 264: [221, 223, 224, 235, 244, 245, 250, 263] + 265: [221, 223, 224, 235, 244, 245, 250, 263] + 266: [221, 223, 224, 235, 244, 245, 250, 263] + 267: [223, 224, 235, 244, 245, 250, 263] + 268: [223, 224, 235, 244, 245, 250, 263] + 269: [223, 224, 235, 244, 245, 250, 263] + 270: [224, 235, 244, 245, 250, 263] + 271: [224, 235, 244, 245, 250, 263] + 272: [224, 235, 244, 245, 250, 263, 272] + 273: [224, 235, 244, 245, 250, 263, 272] + 274: [235, 244, 245, 250, 263, 272] + 275: [235, 244, 245, 250, 263, 272] + 276: [235, 244, 245, 250, 263, 272] + 277: [235, 244, 245, 250, 263, 272] + 278: [244, 245, 250, 263, 272] + 279: [244, 245, 250, 263, 272] + 280: [244, 245, 250, 263, 272] + 281: [244, 245, 250, 263, 272] + 282: [245, 250, 263, 272] + 283: [245, 250, 263, 272, 283] + 284: [245, 250, 263, 272, 283] + 285: [245, 250, 263, 272, 283, 285] + 286: [245, 250, 263, 272, 283, 285] + 287: [245, 250, 263, 272, 283, 285] + 288: [250, 263, 272, 283, 285, 288] + 289: [250, 263, 272, 283, 285, 288] + 290: [250, 263, 272, 283, 285, 288] + 291: [250, 263, 272, 283, 285, 288] + 292: [250, 263, 272, 283, 285, 288] + 293: [250, 263, 272, 283, 285, 288] + 294: [263, 272, 283, 285, 288] + 295: [263, 272, 283, 285, 288] + 296: [263, 272, 283, 285, 288, 296] + 297: [263, 272, 283, 285, 288, 296] + 298: [272, 283, 285, 288, 296] + 299: [272, 283, 285, 288, 296] + 300: [272, 283, 285, 288, 296] + 301: [272, 283, 285, 288, 296] + 302: [272, 283, 285, 288, 296] + 303: [272, 283, 285, 288, 296] + 304: [283, 285, 288, 296] + 305: [283, 285, 288, 296, 305] + 306: [283, 285, 288, 296, 305, 306] + 307: [283, 285, 288, 296, 305, 306] + 308: [285, 288, 296, 305, 306] + 309: [285, 288, 296, 305, 306] + 310: [285, 288, 296, 305, 306] + 311: [285, 288, 296, 305, 306] + 312: [285, 288, 296, 305, 306] + 313: [288, 296, 305, 306] + 314: [288, 296, 305, 306, 314] + 315: [288, 296, 305, 306, 314] + 316: [288, 296, 305, 306, 314] + 317: [288, 296, 305, 306, 314, 317] + 318: [288, 296, 305, 306, 314, 317, 318] + 319: [296, 305, 306, 314, 317, 318] + 320: [296, 305, 306, 314, 317, 318] + 321: [296, 305, 306, 314, 317, 318] + 322: [296, 305, 306, 314, 317, 318] + 323: [296, 305, 306, 314, 317, 318] + 324: [305, 306, 314, 317, 318] + 325: [305, 306, 314, 317, 318, 325] + 326: [305, 306, 314, 317, 318, 325, 326] + 327: [305, 306, 314, 317, 318, 325, 326] + 328: [305, 306, 314, 317, 318, 325, 326] + 329: [306, 314, 317, 318, 325, 326] + 330: [306, 314, 317, 318, 325, 326] + 331: [306, 314, 317, 318, 325, 326] + 332: [314, 317, 318, 325, 326] + 333: [314, 317, 318, 325, 326] + 334: [314, 317, 318, 325, 326] + 335: [314, 317, 318, 325, 326] + 336: [314, 317, 318, 325, 326] + 337: [314, 317, 318, 325, 326] + 338: [317, 318, 325, 326] + 339: [317, 318, 325, 326] + 340: [317, 318, 325, 326] + 341: [318, 325, 326] + 342: [318, 325, 326] + 343: [318, 325, 326] + 344: [318, 325, 326, 344] + 345: [318, 325, 326, 344] + 346: [325, 326, 344] + 347: [325, 326, 344, 347] + 348: [325, 326, 344, 347] + 349: [325, 326, 344, 347] + 350: [325, 326, 344, 347] + 351: [325, 326, 344, 347] + 352: [326, 344, 347] + 353: [326, 344, 347] + 354: [326, 344, 347] + 355: [326, 344, 347] + 356: [344, 347] + 357: [344, 347] + 358: [344, 347] + 359: [344, 347, 359] + 360: [344, 347, 359, 360] + 361: [344, 347, 359, 360, 361] + 362: [347, 359, 360, 361] + 363: [347, 359, 360, 361] + 364: [347, 359, 360, 361, 364] + 365: [359, 360, 361, 364] + 366: [359, 360, 361, 364] + 367: [359, 360, 361, 364] + 368: [359, 360, 361, 364, 368] + 369: [359, 360, 361, 364, 368, 369] + 370: [359, 360, 361, 364, 368, 369] + 371: [359, 360, 361, 364, 368, 369] + 372: [360, 361, 364, 368, 369] + 373: [360, 361, 364, 368, 369] + 374: [360, 361, 364, 368, 369] + 375: [360, 361, 364, 368, 369] + 376: [361, 364, 368, 369] + 377: [361, 364, 368, 369] + 378: [361, 364, 368, 369] + 379: [361, 364, 368, 369] + 380: [361, 364, 368, 369] + 381: [364, 368, 369] + 382: [364, 368, 369] + 383: [364, 368, 369, 383] + 384: [368, 369, 383] + 385: [368, 369, 383] + 386: [368, 369, 383] + 387: [368, 369, 383] + 388: [369, 383] + 389: [369, 383] + 390: [369, 383] + 391: [369, 383] + 392: [369, 383, 392] + 393: [369, 383, 392] + 394: [383, 392] + 395: [383, 392] + 396: [383, 392] + 397: [383, 392] + 398: [383, 392] + 399: [392] + 400: [392, 400] + 401: [392, 400] + 402: [392, 400] + 403: [400] + 404: [400] + 405: [400] + 406: [400] + 407: [407] + 408: [407] + 409: [407, 409] + 410: [407, 409] + 411: [407, 409, 411] + 412: [409, 411, 412] + 413: [409, 411, 412] + 414: [409, 411, 412] + 415: [409, 411, 412, 415] + 416: [409, 411, 412, 415] + 417: [409, 411, 412, 415] + 418: [409, 411, 412, 415] + 419: [411, 412, 415] + 420: [411, 412, 415] + 421: [411, 412, 415] + 422: [411, 412, 415] + 423: [411, 412, 415] + 424: [411, 412, 415, 424] + 425: [412, 415, 424] + 426: [412, 415, 424, 426] + 427: [412, 415, 424, 426, 427] + 428: [415, 424, 426, 427] + 429: [415, 424, 426, 427, 429] + 430: [415, 424, 426, 427, 429] + 431: [415, 424, 426, 427, 429] + 432: [415, 424, 426, 427, 429] + 433: [415, 424, 426, 427, 429] + 434: [415, 424, 426, 427, 429] + 435: [424, 426, 427, 429] + 436: [424, 426, 427, 429, 436] + 437: [424, 426, 427, 429, 436] + 438: [424, 426, 427, 429, 436, 438] + 439: [424, 426, 427, 429, 436, 438] + 440: [426, 427, 429, 436, 438, 440] + 441: [426, 427, 429, 436, 438, 440] + 442: [426, 427, 429, 436, 438, 440] + 443: [426, 427, 429, 436, 438, 440] + 444: [427, 429, 436, 438, 440] + 445: [427, 429, 436, 438, 440] + 446: [427, 429, 436, 438, 440] + 447: [427, 429, 436, 438, 440] + 448: [429, 436, 438, 440] + 449: [429, 436, 438, 440] + 450: [429, 436, 438, 440] + 451: [429, 436, 438, 440] + 452: [429, 436, 438, 440] + 453: [429, 436, 438, 440, 453] + 454: [436, 438, 440, 453] + 455: [436, 438, 440, 453] + 456: [436, 438, 440, 453, 456] + 457: [436, 438, 440, 453, 456, 457] + 458: [436, 438, 440, 453, 456, 457, 458] + 459: [438, 440, 453, 456, 457, 458] + 460: [438, 440, 453, 456, 457, 458] + 461: [438, 440, 453, 456, 457, 458] + 462: [438, 440, 453, 456, 457, 458] + 463: [438, 440, 453, 456, 457, 458] + 464: [438, 440, 453, 456, 457, 458, 464] + 465: [440, 453, 456, 457, 458, 464] + 466: [440, 453, 456, 457, 458, 464] + 467: [440, 453, 456, 457, 458, 464] + 468: [440, 453, 456, 457, 458, 464, 468] + 469: [440, 453, 456, 457, 458, 464, 468] + 470: [440, 453, 456, 457, 458, 464, 468] + 471: [453, 456, 457, 458, 464, 468] + 472: [453, 456, 457, 458, 464, 468, 472] + 473: [453, 456, 457, 458, 464, 468, 472] + 474: [453, 456, 457, 458, 464, 468, 472, 474] + 475: [456, 457, 458, 464, 468, 472, 474] + 476: [456, 457, 458, 464, 468, 472, 474] + 477: [456, 457, 458, 464, 468, 472, 474] + 478: [456, 457, 458, 464, 468, 472, 474] + 479: [456, 457, 458, 464, 468, 472, 474] + 480: [457, 458, 464, 468, 472, 474] + 481: [457, 458, 464, 468, 472, 474] + 482: [457, 458, 464, 468, 472, 474] + 483: [457, 458, 464, 468, 472, 474] + 484: [457, 458, 464, 468, 472, 474, 484] + 485: [457, 458, 464, 468, 472, 474, 484] + 486: [458, 464, 468, 472, 474, 484] + 487: [458, 464, 468, 472, 474, 484] + 488: [458, 464, 468, 472, 474, 484] + 489: [458, 464, 468, 472, 474, 484] + 490: [458, 464, 468, 472, 474, 484] + 491: [458, 464, 468, 472, 474, 484] + 492: [464, 468, 472, 474, 484] + 493: [464, 468, 472, 474, 484] + 494: [464, 468, 472, 474, 484] + 495: [464, 468, 472, 474, 484, 495] + 496: [464, 468, 472, 474, 484, 495] + 497: [468, 472, 474, 484, 495, 497] + 498: [468, 472, 474, 484, 495, 497, 498] + 499: [468, 472, 474, 484, 495, 497, 498, 499] + 500: [468, 472, 474, 484, 495, 497, 498, 499] + 501: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 502: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 503: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 504: [472, 474, 484, 495, 497, 498, 499, 501] + 505: [472, 474, 484, 495, 497, 498, 499, 501] + 506: [472, 474, 484, 495, 497, 498, 499, 501, 506] + 507: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 508: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 509: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 510: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 511: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 512: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 513: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 514: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 515: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 516: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 517: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 518: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 519: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 520: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 521: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 522: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 523: [495, 497, 498, 499, 501, 506, 507, 510, 516, 523] + 524: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 525: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 526: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 527: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 528: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 529: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 530: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 531: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 532: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 533: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 534: [499, 501, 506, 507, 510, 516, 523, 530, 534] + 535: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 536: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 537: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 538: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 539: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 540: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 541: [506, 507, 510, 516, 523, 530, 534, 535, 541] + 542: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542] + 543: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 544: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 545: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 546: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 547: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 548: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 549: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 550: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 551: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 552: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 553: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 554: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 555: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 556: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 557: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 558: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 559: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 560: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 561: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 562: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 563: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 564: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 565: [523, 530, 534, 535, 541, 542, 543, 548, 565] + 566: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 567: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 568: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 569: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 570: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 571: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 572: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572] + 573: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 574: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 575: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 576: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 577: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 578: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 579: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 580: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 581: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 582: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 583: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 584: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 585: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 586: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 587: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 588: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 589: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 590: [543, 548, 565, 566, 572, 573, 578, 583] + 591: [543, 548, 565, 566, 572, 573, 578, 583] + 592: [543, 548, 565, 566, 572, 573, 578, 583] + 593: [543, 548, 565, 566, 572, 573, 578, 583] + 594: [543, 548, 565, 566, 572, 573, 578, 583] + 595: [543, 548, 565, 566, 572, 573, 578, 583, 595] + 596: [548, 565, 566, 572, 573, 578, 583, 595] + 597: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 598: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 599: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 600: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 601: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 602: [565, 566, 572, 573, 578, 583, 595, 597, 602] + 603: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 604: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 605: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 606: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603, 606] + 607: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 608: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 609: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 610: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 611: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 612: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 613: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 614: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 615: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 616: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 617: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 618: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 619: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 620: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 621: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610, 621] + 622: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 623: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 624: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 625: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 626: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 627: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 628: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 629: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 630: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 631: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 632: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 633: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 634: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 635: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 636: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 637: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 638: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 639: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 640: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 641: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 642: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 643: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 644: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 645: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 646: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 647: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 648: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648] + 649: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649] + 650: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650] + 651: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 652: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 653: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 654: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 655: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 656: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 657: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 658: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 659: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 660: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 661: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 662: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 663: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 664: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 665: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 666: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 667: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 668: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 669: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 670: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 671: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 672: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 673: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 674: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 675: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 676: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 677: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 678: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 679: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 680: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 681: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 682: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 683: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 684: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 685: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 686: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 687: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 688: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 689: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 690: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 691: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691] + 692: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 693: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 694: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 695: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 696: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 697: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 698: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 699: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 700: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 701: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 702: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 703: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 704: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 705: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 706: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 707: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 708: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 709: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 710: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 711: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 712: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 713: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 714: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 715: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 716: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 717: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 718: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 719: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 720: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 721: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 722: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 723: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 724: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 725: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 726: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 727: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 728: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 729: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 730: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 731: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 732: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 733: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 734: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 735: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 736: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 737: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 738: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 739: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739] + 740: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 741: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 742: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 743: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 744: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 745: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 746: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 747: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 748: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 749: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 750: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 751: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 752: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 753: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 754: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 755: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 756: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 757: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 758: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 759: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 760: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 761: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 762: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 763: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 764: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 765: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 766: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 767: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 768: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 769: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 770: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 771: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 772: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 773: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 774: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 775: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 776: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 777: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 778: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 779: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 780: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 781: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 782: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 783: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 784: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 785: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 786: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 787: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 788: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 789: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 790: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 791: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 792: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 793: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 794: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 795: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 796: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 797: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 798: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 799: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 800: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 801: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 802: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 803: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 804: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 805: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 806: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 807: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 808: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 809: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 810: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810] + 811: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 812: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 813: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 814: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 815: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 816: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 817: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 818: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 819: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 820: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 821: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 822: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 823: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 824: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 825: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 826: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 827: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 828: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 829: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 830: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 831: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 832: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 833: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 834: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 835: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 836: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 837: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 838: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 839: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 840: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 841: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 842: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 843: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 844: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 845: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 846: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 847: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 848: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 849: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 850: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 851: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 852: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 853: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 854: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 855: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855] + 856: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 857: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 858: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 859: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 860: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 861: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 862: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 863: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 864: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 865: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 866: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 867: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 868: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 869: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 870: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 871: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 872: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 873: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 874: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 875: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 876: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 877: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 878: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 879: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 880: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 881: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 882: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 883: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 884: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 885: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 886: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 887: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 888: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 889: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 890: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 891: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 892: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 893: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 894: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 895: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 896: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 897: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 898: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 899: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 900: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 901: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 902: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 903: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903] + 904: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904] + 905: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 906: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 907: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 908: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 909: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 910: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 911: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 912: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 913: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 914: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 915: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 916: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 917: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 918: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918] + 919: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 920: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 921: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 922: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 923: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 924: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 925: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 926: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 927: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 928: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 929: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 930: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 931: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 932: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 933: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 934: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 935: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 936: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 937: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 938: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 939: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 940: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 941: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 942: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 943: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 944: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 945: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 946: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 947: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 948: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 949: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 950: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 951: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 952: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 953: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 954: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 955: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 956: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956] + 957: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 958: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 959: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 960: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 961: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 962: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 963: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 964: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 965: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 966: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 967: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 968: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 969: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 970: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 971: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 972: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 973: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973] + 974: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 975: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 976: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 977: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 978: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 979: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 980: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 981: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 982: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 983: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 984: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 985: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 986: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 987: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 988: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 989: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 990: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 991: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 992: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 993: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 994: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 995: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 996: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 997: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 998: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 999: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1000: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1001: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1002: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1003: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1004: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1005: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1006: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1007: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007] + 1008: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1009: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1010: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1011: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1012: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1013: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1014: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1015: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1016: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1017: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1018: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1019: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1020: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1021: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1022: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1023: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1024: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1025: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1026: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1027: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1028: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1029: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1030: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1031: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1032: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1033: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1034: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1035: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1036: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1037: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1038: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1039: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1040: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1041: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1042: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1043: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1044: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1045: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1046: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1047: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1048: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1049: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1050: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1051: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1052: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052] + 1053: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053] + 1054: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1055: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1056: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1057: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1058: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1059: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1060: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1061: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1062: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1063: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063] + 1064: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1065: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1066: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066] + 1067: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1068: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1069: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1070: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1071: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1072: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1073: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1074: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1075: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1076: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1077: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1078: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1079: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1080: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1081: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1082: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1083: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1084: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1085: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1086: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1087: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1088: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1089: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1090: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1091: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1092: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1093: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1094: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1095: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1096: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1097: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1098: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1099: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1100: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1101: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1102: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1103: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1104: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1105: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1106: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1107: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1108: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1109: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1110: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1111: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1112: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1113: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1114: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1115: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1116: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1117: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1118: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1119: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1120: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1121: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1122: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1123: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1124: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1125: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1126: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1127: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1128: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1129: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1130: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1131: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1132: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1133: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1134: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1135: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1136: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1137: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1138: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1139: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1140: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1141: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1142: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1143: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1144: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1145: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1146: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1147: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1148: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1149: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1150: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1151: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1152: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1153: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1154: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1155: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1156: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1157: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1158: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1159: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1160: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1161: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1162: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1163: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1164: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1165: [1063, 1064, 1066, 1067, 1075, 1078] + 1166: [1063, 1064, 1066, 1067, 1075, 1078] + 1167: [1063, 1064, 1066, 1067, 1075, 1078] + 1168: [1063, 1064, 1066, 1067, 1075, 1078] + 1169: [1063, 1064, 1066, 1067, 1075, 1078] + 1170: [1063, 1064, 1066, 1067, 1075, 1078] + 1171: [1064, 1066, 1067, 1075, 1078] + 1172: [1064, 1066, 1067, 1075, 1078] + 1173: [1064, 1066, 1067, 1075, 1078] + 1174: [1064, 1066, 1067, 1075, 1078] + 1175: [1064, 1066, 1067, 1075, 1078] + 1176: [1064, 1066, 1067, 1075, 1078] + 1177: [1064, 1066, 1067, 1075, 1078] + 1178: [1064, 1066, 1067, 1075, 1078] + 1179: [1066, 1067, 1075, 1078] + 1180: [1066, 1067, 1075, 1078] + 1181: [1066, 1067, 1075, 1078] + 1182: [1066, 1067, 1075, 1078] + 1183: [1066, 1067, 1075, 1078] + 1184: [1066, 1067, 1075, 1078] + 1185: [1066, 1067, 1075, 1078] + 1186: [1066, 1067, 1075, 1078] + 1187: [1067, 1075, 1078] + 1188: [1067, 1075, 1078] + 1189: [1067, 1075, 1078] + 1190: [1067, 1075, 1078] + 1191: [1067, 1075, 1078] + 1192: [1067, 1075, 1078] + 1193: [1067, 1075, 1078] + 1194: [1067, 1075, 1078] + 1195: [1067, 1075, 1078] + 1196: [1075, 1078] + 1197: [1075, 1078] + 1198: [1075, 1078] + 1199: [1075, 1078] + 1200: [1075, 1078] + 1201: [1078] + 1202: [1078] + 1203: [1078] + 1204: [1078] + 1205: [] + Total customers served = 234 + Average wait time = 48.36752136752137 + Longest wait time = 129 + Longest queue = 22 + + ----jGRASP: operation complete. + **************************************/ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald1000.class b/06 Stacks _ Queues/05-08 McRonald/McRonald1000.class new file mode 100644 index 0000000..cc5b9dc Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonald1000.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald1000.java b/06 Stacks _ Queues/05-08 McRonald/McRonald1000.java new file mode 100644 index 0000000..2e8bb60 --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/McRonald1000.java @@ -0,0 +1,78 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.util.*; + +public class McRonald1000 +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + int totalCustomers, totalWait, totalOverall, longestWait, longestQueue, longestDay; + totalCustomers = totalWait = totalOverall = longestWait = longestQueue = longestDay = 0; + + int wait = (int) (Math.random() * 6) + 2; + + Queue customers = new LinkedList<>(); + for (int j = 0; j < 1000; j++) { + for (int i = 0; i < TIME; i++) { + if (Math.random() < 0.2) + customers.add(i); + if (wait == 0) { + if (i - customers.peek() > longestWait) + longestWait = i - customers.peek(); + totalWait += i - customers.remove(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + } + + for (int i = TIME; !customers.isEmpty(); i++) { + if (wait == 0) { + if (i - customers.peek() > longestWait) + longestWait = i - customers.peek(); + totalWait += i - customers.remove(); + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + } + + totalOverall += totalCustomers; + if (totalCustomers > longestDay) + longestDay = totalCustomers; + + + totalCustomers = 0; + wait = (int) (Math.random() * 6) + 2; + } + + + System.out.println("Total customers served = " + totalOverall); + System.out.println("Average wait time = " + (double) totalWait / totalOverall); + System.out.println("Longest wait time = " + longestWait); + System.out.println("Longest queue = " + longestQueue); + System.out.println("Average served per day = " + (double) totalOverall / 1000); + System.out.println("Largest day = " + longestDay); + } + + public static void display(Queue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + System.out.println(min + ": " + q); + } +} + +// class Customer // if you want a Customer class +// { +// +// } diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald3.class b/06 Stacks _ Queues/05-08 McRonald/McRonald3.class new file mode 100644 index 0000000..f1ea8c2 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonald3.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald3.java b/06 Stacks _ Queues/05-08 McRonald/McRonald3.java new file mode 100644 index 0000000..ac39f78 --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/McRonald3.java @@ -0,0 +1,176 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.util.*; + +public class McRonald3 +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + int totalCustomers, totalWait, longestWait, longestQueue; + totalWait = totalCustomers = longestWait = longestQueue = 0; + + int wait = (int) (Math.random() * 6) + 2; + + + ArrayList windows = new ArrayList<>(); + for (int i = 0; i < 5; i++) + windows.add(new Window()); + + Queue displayQueue = new LinkedList(); + int i = 0; + for (i = 0; i < TIME; i++) { + for (Window window : windows) + displayQueue.addAll(window.processList(i)); + display(displayQueue, i); + displayQueue = new LinkedList(); + } + + while (!windows.get(0).getCustomers().isEmpty() || !windows.get(1).getCustomers().isEmpty() || !windows.get(2).getCustomers().isEmpty()) { + i++; + for (Window window : windows) + if (!window.getCustomers().isEmpty()) + displayQueue.addAll(window.finishList(i)); + display(displayQueue, i); + displayQueue = new LinkedList(); + } + + // } + // for (Queue customers : windows) { + // int i = TIME; + // while (!customers.isEmpty()) { + // if (wait == 0) { + // if (i - (int)customers.peek() > longestWait) + // longestWait = i - (int)customers.peek(); + // totalWait += i - (int)customers.remove(); + // totalCustomers++; + // } else + // if (!customers.isEmpty()) + // wait--; + // + // if (customers.size() > longestQueue) + // longestQueue = customers.size(); + // + // display(customers, i); + // i++; + // } + // } + + + for (Window window : windows) { + totalCustomers += window.getTotalCustomers(); + totalWait += window.getTotalWait(); + if (window.getLongestWait() > longestWait) + longestWait = window.getLongestWait(); + + if (window.getLongestQueue() > longestQueue) + longestQueue = window.getLongestQueue(); + + } + + System.out.println("Total customers served = " + totalCustomers); + System.out.println("Average wait time = " + (double) totalWait / totalCustomers); + System.out.println("Longest wait time = " + longestWait); + System.out.println("Longest queue = " + longestQueue); + + } + + public static void display(Queue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + + ArrayList list = new ArrayList(q); + Collections.sort(list); + System.out.println(min + ": " + list); + } +} + + + + +class Window // if you want a Customer class +{ + private Queue customers; + private int totalCustomers, totalWait, longestWait, longestQueue, wait; + + public int getTotalCustomers() { + return totalCustomers; + } + + public int getTotalWait() { + return totalWait; + } + + public int getLongestWait() { + return longestWait; + } + + public int getLongestQueue () { + return longestQueue; + } + + public void addToLine (int i) { + customers.add(i); + } + + public Window() { + customers = new LinkedList<>(); + totalWait = totalCustomers = longestWait = longestQueue = 0; + wait = (int) (Math.random() * 6) + 2; + } + + public Queue processList(int i) { + //for (int i = 0; i < 1080; i++) { + if (Math.random() < 0.2) + customers.add(i); + + if (wait == 0) { + if (i - (int)customers.peek() > longestWait) + longestWait = i - (int)customers.peek(); + totalWait += i - (int)customers.remove(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + return customers; + + } + public Queue finishList(int i) { + //for (int i = 0; i < 1080; i++) { + if (wait == 0) { + if (i - (int)customers.peek() > longestWait) + longestWait = i - (int)customers.peek(); + totalWait += i - (int)customers.remove(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + return customers; + + } + + + + public void display(Queue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + System.out.println(min + ": " + q); + } + + public Queue getCustomers(){ + return customers; + } + +} diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald5.class b/06 Stacks _ Queues/05-08 McRonald/McRonald5.class new file mode 100644 index 0000000..25bfbbd Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonald5.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonald5.java b/06 Stacks _ Queues/05-08 McRonald/McRonald5.java new file mode 100644 index 0000000..443deb0 --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/McRonald5.java @@ -0,0 +1,1308 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.util.*; + +public class McRonald5 +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + int totalCustomers, totalWait, longestWait, longestQueue; + totalWait = totalCustomers = longestWait = longestQueue = 0; + + int wait = (int) (Math.random() * 6) + 2; + + Queue customers = new LinkedList<>(); + + for (int i = 0; i < TIME; i++) { + double prob = -0.5 * Math.cos((Math.PI/180) * i) + 0.5; + if (Math.random() < prob) + customers.add(new Customer(i)); + + if (wait == 0) { + if (i - customers.peek().getArrival() > longestWait) + longestWait = i - customers.peek().getArrival(); + totalWait += i - customers.remove().getArrival(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + for (int i = TIME; !customers.isEmpty(); i++) { + if (wait == 0) { + if (i - customers.peek().getArrival() > longestWait) + longestWait = i - customers.peek().getArrival(); + totalWait += i - customers.remove().getArrival(); + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + System.out.println("Total customers served = " + totalCustomers); + System.out.println("Average wait time = " + (double) totalWait / totalCustomers); + System.out.println("Longest wait time = " + longestWait); + System.out.println("Longest queue = " + longestQueue); + + } + + public static void display(Queue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + System.out.println(min/60 + ":" + min%60 + ": " + q); + } +} + +class Customer // if you want a Customer class +{ + int arrivalTime; + + public Customer (int time) { + arrivalTime = time; + } + + public int getArrival () { + return arrivalTime; + } + + public String toString () { + return arrivalTime/60 + ":" + arrivalTime%60; + } +} + + +// class Customer // if you want a Customer class +// { +// +// } + + +/********************** Sample output + + 0: [] + 1: [] + 2: [2] + 3: [2] + 4: [2] + 5: [2] + 6: [2, 6] + 7: [6, 7] + 8: [6, 7] + 9: [6, 7] + 10: [6, 7, 10] + 11: [6, 7, 10] + 12: [7, 10, 12] + 13: [7, 10, 12] + 14: [7, 10, 12] + 15: [7, 10, 12] + 16: [10, 12] + 17: [10, 12] + 18: [10, 12] + 19: [10, 12] + 20: [10, 12] + 21: [10, 12] + 22: [10, 12] + 23: [12] + 24: [12] + 25: [12] + 26: [] + 27: [] + 28: [] + 29: [] + 30: [] + 31: [] + 32: [] + 33: [] + 34: [] + 35: [] + 36: [] + 37: [] + 38: [] + 39: [] + 40: [40] + 41: [40, 41] + 42: [40, 41] + 43: [41] + 44: [41] + 45: [41] + 46: [41] + 47: [] + 48: [48] + 49: [48] + 50: [48] + 51: [] + 52: [52] + 53: [52, 53] + 54: [52, 53, 54] + 55: [52, 53, 54] + 56: [52, 53, 54] + 57: [52, 53, 54] + 58: [53, 54, 58] + 59: [53, 54, 58] + 60: [53, 54, 58] + 61: [53, 54, 58] + 62: [54, 58] + 63: [54, 58] + 64: [54, 58] + 65: [58, 65] + 66: [58, 65] + 67: [58, 65] + 68: [58, 65] + 69: [58, 65] + 70: [65] + 71: [65] + 72: [65, 72] + 73: [65, 72] + 74: [65, 72, 74] + 75: [65, 72, 74] + 76: [65, 72, 74] + 77: [72, 74] + 78: [72, 74, 78] + 79: [72, 74, 78] + 80: [72, 74, 78] + 81: [74, 78] + 82: [74, 78] + 83: [74, 78, 83] + 84: [74, 78, 83] + 85: [74, 78, 83, 85] + 86: [74, 78, 83, 85] + 87: [78, 83, 85] + 88: [78, 83, 85] + 89: [78, 83, 85] + 90: [78, 83, 85] + 91: [78, 83, 85] + 92: [78, 83, 85] + 93: [83, 85] + 94: [83, 85, 94] + 95: [83, 85, 94] + 96: [83, 85, 94] + 97: [85, 94] + 98: [85, 94, 98] + 99: [85, 94, 98, 99] + 100: [85, 94, 98, 99, 100] + 101: [85, 94, 98, 99, 100] + 102: [85, 94, 98, 99, 100] + 103: [85, 94, 98, 99, 100] + 104: [94, 98, 99, 100] + 105: [94, 98, 99, 100, 105] + 106: [94, 98, 99, 100, 105, 106] + 107: [98, 99, 100, 105, 106] + 108: [98, 99, 100, 105, 106] + 109: [98, 99, 100, 105, 106, 109] + 110: [99, 100, 105, 106, 109] + 111: [99, 100, 105, 106, 109, 111] + 112: [99, 100, 105, 106, 109, 111] + 113: [100, 105, 106, 109, 111, 113] + 114: [100, 105, 106, 109, 111, 113] + 115: [100, 105, 106, 109, 111, 113] + 116: [100, 105, 106, 109, 111, 113] + 117: [100, 105, 106, 109, 111, 113] + 118: [100, 105, 106, 109, 111, 113] + 119: [100, 105, 106, 109, 111, 113] + 120: [105, 106, 109, 111, 113] + 121: [105, 106, 109, 111, 113] + 122: [105, 106, 109, 111, 113] + 123: [106, 109, 111, 113] + 124: [106, 109, 111, 113] + 125: [106, 109, 111, 113] + 126: [106, 109, 111, 113] + 127: [106, 109, 111, 113] + 128: [106, 109, 111, 113] + 129: [106, 109, 111, 113] + 130: [109, 111, 113, 130] + 131: [109, 111, 113, 130] + 132: [109, 111, 113, 130] + 133: [109, 111, 113, 130] + 134: [111, 113, 130, 134] + 135: [111, 113, 130, 134] + 136: [111, 113, 130, 134] + 137: [111, 113, 130, 134] + 138: [111, 113, 130, 134] + 139: [111, 113, 130, 134] + 140: [111, 113, 130, 134] + 141: [113, 130, 134] + 142: [113, 130, 134, 142] + 143: [113, 130, 134, 142, 143] + 144: [113, 130, 134, 142, 143] + 145: [130, 134, 142, 143] + 146: [130, 134, 142, 143] + 147: [130, 134, 142, 143] + 148: [130, 134, 142, 143] + 149: [130, 134, 142, 143] + 150: [130, 134, 142, 143] + 151: [130, 134, 142, 143, 151] + 152: [134, 142, 143, 151] + 153: [134, 142, 143, 151] + 154: [134, 142, 143, 151] + 155: [142, 143, 151] + 156: [142, 143, 151, 156] + 157: [142, 143, 151, 156] + 158: [142, 143, 151, 156] + 159: [142, 143, 151, 156] + 160: [142, 143, 151, 156] + 161: [142, 143, 151, 156, 161] + 162: [143, 151, 156, 161] + 163: [143, 151, 156, 161, 163] + 164: [143, 151, 156, 161, 163] + 165: [151, 156, 161, 163, 165] + 166: [151, 156, 161, 163, 165, 166] + 167: [151, 156, 161, 163, 165, 166] + 168: [151, 156, 161, 163, 165, 166] + 169: [156, 161, 163, 165, 166] + 170: [156, 161, 163, 165, 166] + 171: [156, 161, 163, 165, 166] + 172: [156, 161, 163, 165, 166] + 173: [156, 161, 163, 165, 166] + 174: [161, 163, 165, 166] + 175: [161, 163, 165, 166] + 176: [161, 163, 165, 166] + 177: [161, 163, 165, 166] + 178: [161, 163, 165, 166, 178] + 179: [161, 163, 165, 166, 178] + 180: [163, 165, 166, 178, 180] + 181: [163, 165, 166, 178, 180, 181] + 182: [163, 165, 166, 178, 180, 181] + 183: [163, 165, 166, 178, 180, 181] + 184: [165, 166, 178, 180, 181] + 185: [165, 166, 178, 180, 181, 185] + 186: [165, 166, 178, 180, 181, 185] + 187: [166, 178, 180, 181, 185, 187] + 188: [166, 178, 180, 181, 185, 187] + 189: [166, 178, 180, 181, 185, 187] + 190: [166, 178, 180, 181, 185, 187] + 191: [166, 178, 180, 181, 185, 187] + 192: [178, 180, 181, 185, 187] + 193: [178, 180, 181, 185, 187] + 194: [178, 180, 181, 185, 187] + 195: [178, 180, 181, 185, 187] + 196: [178, 180, 181, 185, 187, 196] + 197: [178, 180, 181, 185, 187, 196, 197] + 198: [178, 180, 181, 185, 187, 196, 197] + 199: [180, 181, 185, 187, 196, 197, 199] + 200: [180, 181, 185, 187, 196, 197, 199] + 201: [180, 181, 185, 187, 196, 197, 199] + 202: [180, 181, 185, 187, 196, 197, 199, 202] + 203: [181, 185, 187, 196, 197, 199, 202] + 204: [181, 185, 187, 196, 197, 199, 202, 204] + 205: [181, 185, 187, 196, 197, 199, 202, 204] + 206: [185, 187, 196, 197, 199, 202, 204] + 207: [185, 187, 196, 197, 199, 202, 204] + 208: [185, 187, 196, 197, 199, 202, 204] + 209: [185, 187, 196, 197, 199, 202, 204] + 210: [185, 187, 196, 197, 199, 202, 204] + 211: [185, 187, 196, 197, 199, 202, 204] + 212: [185, 187, 196, 197, 199, 202, 204] + 213: [187, 196, 197, 199, 202, 204, 213] + 214: [187, 196, 197, 199, 202, 204, 213] + 215: [187, 196, 197, 199, 202, 204, 213] + 216: [187, 196, 197, 199, 202, 204, 213] + 217: [187, 196, 197, 199, 202, 204, 213] + 218: [196, 197, 199, 202, 204, 213] + 219: [196, 197, 199, 202, 204, 213, 219] + 220: [196, 197, 199, 202, 204, 213, 219, 220] + 221: [196, 197, 199, 202, 204, 213, 219, 220, 221] + 222: [197, 199, 202, 204, 213, 219, 220, 221] + 223: [197, 199, 202, 204, 213, 219, 220, 221, 223] + 224: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 225: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 226: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 227: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 228: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 229: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 230: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 231: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 232: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 233: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 234: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 235: [199, 202, 204, 213, 219, 220, 221, 223, 224, 235] + 236: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 237: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 238: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 239: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 240: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 241: [204, 213, 219, 220, 221, 223, 224, 235] + 242: [204, 213, 219, 220, 221, 223, 224, 235] + 243: [204, 213, 219, 220, 221, 223, 224, 235] + 244: [213, 219, 220, 221, 223, 224, 235, 244] + 245: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 246: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 247: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 248: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 249: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 250: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 251: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 252: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 253: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 254: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 255: [220, 221, 223, 224, 235, 244, 245, 250] + 256: [220, 221, 223, 224, 235, 244, 245, 250] + 257: [220, 221, 223, 224, 235, 244, 245, 250] + 258: [220, 221, 223, 224, 235, 244, 245, 250] + 259: [220, 221, 223, 224, 235, 244, 245, 250] + 260: [220, 221, 223, 224, 235, 244, 245, 250] + 261: [221, 223, 224, 235, 244, 245, 250] + 262: [221, 223, 224, 235, 244, 245, 250] + 263: [221, 223, 224, 235, 244, 245, 250, 263] + 264: [221, 223, 224, 235, 244, 245, 250, 263] + 265: [221, 223, 224, 235, 244, 245, 250, 263] + 266: [221, 223, 224, 235, 244, 245, 250, 263] + 267: [223, 224, 235, 244, 245, 250, 263] + 268: [223, 224, 235, 244, 245, 250, 263] + 269: [223, 224, 235, 244, 245, 250, 263] + 270: [224, 235, 244, 245, 250, 263] + 271: [224, 235, 244, 245, 250, 263] + 272: [224, 235, 244, 245, 250, 263, 272] + 273: [224, 235, 244, 245, 250, 263, 272] + 274: [235, 244, 245, 250, 263, 272] + 275: [235, 244, 245, 250, 263, 272] + 276: [235, 244, 245, 250, 263, 272] + 277: [235, 244, 245, 250, 263, 272] + 278: [244, 245, 250, 263, 272] + 279: [244, 245, 250, 263, 272] + 280: [244, 245, 250, 263, 272] + 281: [244, 245, 250, 263, 272] + 282: [245, 250, 263, 272] + 283: [245, 250, 263, 272, 283] + 284: [245, 250, 263, 272, 283] + 285: [245, 250, 263, 272, 283, 285] + 286: [245, 250, 263, 272, 283, 285] + 287: [245, 250, 263, 272, 283, 285] + 288: [250, 263, 272, 283, 285, 288] + 289: [250, 263, 272, 283, 285, 288] + 290: [250, 263, 272, 283, 285, 288] + 291: [250, 263, 272, 283, 285, 288] + 292: [250, 263, 272, 283, 285, 288] + 293: [250, 263, 272, 283, 285, 288] + 294: [263, 272, 283, 285, 288] + 295: [263, 272, 283, 285, 288] + 296: [263, 272, 283, 285, 288, 296] + 297: [263, 272, 283, 285, 288, 296] + 298: [272, 283, 285, 288, 296] + 299: [272, 283, 285, 288, 296] + 300: [272, 283, 285, 288, 296] + 301: [272, 283, 285, 288, 296] + 302: [272, 283, 285, 288, 296] + 303: [272, 283, 285, 288, 296] + 304: [283, 285, 288, 296] + 305: [283, 285, 288, 296, 305] + 306: [283, 285, 288, 296, 305, 306] + 307: [283, 285, 288, 296, 305, 306] + 308: [285, 288, 296, 305, 306] + 309: [285, 288, 296, 305, 306] + 310: [285, 288, 296, 305, 306] + 311: [285, 288, 296, 305, 306] + 312: [285, 288, 296, 305, 306] + 313: [288, 296, 305, 306] + 314: [288, 296, 305, 306, 314] + 315: [288, 296, 305, 306, 314] + 316: [288, 296, 305, 306, 314] + 317: [288, 296, 305, 306, 314, 317] + 318: [288, 296, 305, 306, 314, 317, 318] + 319: [296, 305, 306, 314, 317, 318] + 320: [296, 305, 306, 314, 317, 318] + 321: [296, 305, 306, 314, 317, 318] + 322: [296, 305, 306, 314, 317, 318] + 323: [296, 305, 306, 314, 317, 318] + 324: [305, 306, 314, 317, 318] + 325: [305, 306, 314, 317, 318, 325] + 326: [305, 306, 314, 317, 318, 325, 326] + 327: [305, 306, 314, 317, 318, 325, 326] + 328: [305, 306, 314, 317, 318, 325, 326] + 329: [306, 314, 317, 318, 325, 326] + 330: [306, 314, 317, 318, 325, 326] + 331: [306, 314, 317, 318, 325, 326] + 332: [314, 317, 318, 325, 326] + 333: [314, 317, 318, 325, 326] + 334: [314, 317, 318, 325, 326] + 335: [314, 317, 318, 325, 326] + 336: [314, 317, 318, 325, 326] + 337: [314, 317, 318, 325, 326] + 338: [317, 318, 325, 326] + 339: [317, 318, 325, 326] + 340: [317, 318, 325, 326] + 341: [318, 325, 326] + 342: [318, 325, 326] + 343: [318, 325, 326] + 344: [318, 325, 326, 344] + 345: [318, 325, 326, 344] + 346: [325, 326, 344] + 347: [325, 326, 344, 347] + 348: [325, 326, 344, 347] + 349: [325, 326, 344, 347] + 350: [325, 326, 344, 347] + 351: [325, 326, 344, 347] + 352: [326, 344, 347] + 353: [326, 344, 347] + 354: [326, 344, 347] + 355: [326, 344, 347] + 356: [344, 347] + 357: [344, 347] + 358: [344, 347] + 359: [344, 347, 359] + 360: [344, 347, 359, 360] + 361: [344, 347, 359, 360, 361] + 362: [347, 359, 360, 361] + 363: [347, 359, 360, 361] + 364: [347, 359, 360, 361, 364] + 365: [359, 360, 361, 364] + 366: [359, 360, 361, 364] + 367: [359, 360, 361, 364] + 368: [359, 360, 361, 364, 368] + 369: [359, 360, 361, 364, 368, 369] + 370: [359, 360, 361, 364, 368, 369] + 371: [359, 360, 361, 364, 368, 369] + 372: [360, 361, 364, 368, 369] + 373: [360, 361, 364, 368, 369] + 374: [360, 361, 364, 368, 369] + 375: [360, 361, 364, 368, 369] + 376: [361, 364, 368, 369] + 377: [361, 364, 368, 369] + 378: [361, 364, 368, 369] + 379: [361, 364, 368, 369] + 380: [361, 364, 368, 369] + 381: [364, 368, 369] + 382: [364, 368, 369] + 383: [364, 368, 369, 383] + 384: [368, 369, 383] + 385: [368, 369, 383] + 386: [368, 369, 383] + 387: [368, 369, 383] + 388: [369, 383] + 389: [369, 383] + 390: [369, 383] + 391: [369, 383] + 392: [369, 383, 392] + 393: [369, 383, 392] + 394: [383, 392] + 395: [383, 392] + 396: [383, 392] + 397: [383, 392] + 398: [383, 392] + 399: [392] + 400: [392, 400] + 401: [392, 400] + 402: [392, 400] + 403: [400] + 404: [400] + 405: [400] + 406: [400] + 407: [407] + 408: [407] + 409: [407, 409] + 410: [407, 409] + 411: [407, 409, 411] + 412: [409, 411, 412] + 413: [409, 411, 412] + 414: [409, 411, 412] + 415: [409, 411, 412, 415] + 416: [409, 411, 412, 415] + 417: [409, 411, 412, 415] + 418: [409, 411, 412, 415] + 419: [411, 412, 415] + 420: [411, 412, 415] + 421: [411, 412, 415] + 422: [411, 412, 415] + 423: [411, 412, 415] + 424: [411, 412, 415, 424] + 425: [412, 415, 424] + 426: [412, 415, 424, 426] + 427: [412, 415, 424, 426, 427] + 428: [415, 424, 426, 427] + 429: [415, 424, 426, 427, 429] + 430: [415, 424, 426, 427, 429] + 431: [415, 424, 426, 427, 429] + 432: [415, 424, 426, 427, 429] + 433: [415, 424, 426, 427, 429] + 434: [415, 424, 426, 427, 429] + 435: [424, 426, 427, 429] + 436: [424, 426, 427, 429, 436] + 437: [424, 426, 427, 429, 436] + 438: [424, 426, 427, 429, 436, 438] + 439: [424, 426, 427, 429, 436, 438] + 440: [426, 427, 429, 436, 438, 440] + 441: [426, 427, 429, 436, 438, 440] + 442: [426, 427, 429, 436, 438, 440] + 443: [426, 427, 429, 436, 438, 440] + 444: [427, 429, 436, 438, 440] + 445: [427, 429, 436, 438, 440] + 446: [427, 429, 436, 438, 440] + 447: [427, 429, 436, 438, 440] + 448: [429, 436, 438, 440] + 449: [429, 436, 438, 440] + 450: [429, 436, 438, 440] + 451: [429, 436, 438, 440] + 452: [429, 436, 438, 440] + 453: [429, 436, 438, 440, 453] + 454: [436, 438, 440, 453] + 455: [436, 438, 440, 453] + 456: [436, 438, 440, 453, 456] + 457: [436, 438, 440, 453, 456, 457] + 458: [436, 438, 440, 453, 456, 457, 458] + 459: [438, 440, 453, 456, 457, 458] + 460: [438, 440, 453, 456, 457, 458] + 461: [438, 440, 453, 456, 457, 458] + 462: [438, 440, 453, 456, 457, 458] + 463: [438, 440, 453, 456, 457, 458] + 464: [438, 440, 453, 456, 457, 458, 464] + 465: [440, 453, 456, 457, 458, 464] + 466: [440, 453, 456, 457, 458, 464] + 467: [440, 453, 456, 457, 458, 464] + 468: [440, 453, 456, 457, 458, 464, 468] + 469: [440, 453, 456, 457, 458, 464, 468] + 470: [440, 453, 456, 457, 458, 464, 468] + 471: [453, 456, 457, 458, 464, 468] + 472: [453, 456, 457, 458, 464, 468, 472] + 473: [453, 456, 457, 458, 464, 468, 472] + 474: [453, 456, 457, 458, 464, 468, 472, 474] + 475: [456, 457, 458, 464, 468, 472, 474] + 476: [456, 457, 458, 464, 468, 472, 474] + 477: [456, 457, 458, 464, 468, 472, 474] + 478: [456, 457, 458, 464, 468, 472, 474] + 479: [456, 457, 458, 464, 468, 472, 474] + 480: [457, 458, 464, 468, 472, 474] + 481: [457, 458, 464, 468, 472, 474] + 482: [457, 458, 464, 468, 472, 474] + 483: [457, 458, 464, 468, 472, 474] + 484: [457, 458, 464, 468, 472, 474, 484] + 485: [457, 458, 464, 468, 472, 474, 484] + 486: [458, 464, 468, 472, 474, 484] + 487: [458, 464, 468, 472, 474, 484] + 488: [458, 464, 468, 472, 474, 484] + 489: [458, 464, 468, 472, 474, 484] + 490: [458, 464, 468, 472, 474, 484] + 491: [458, 464, 468, 472, 474, 484] + 492: [464, 468, 472, 474, 484] + 493: [464, 468, 472, 474, 484] + 494: [464, 468, 472, 474, 484] + 495: [464, 468, 472, 474, 484, 495] + 496: [464, 468, 472, 474, 484, 495] + 497: [468, 472, 474, 484, 495, 497] + 498: [468, 472, 474, 484, 495, 497, 498] + 499: [468, 472, 474, 484, 495, 497, 498, 499] + 500: [468, 472, 474, 484, 495, 497, 498, 499] + 501: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 502: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 503: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 504: [472, 474, 484, 495, 497, 498, 499, 501] + 505: [472, 474, 484, 495, 497, 498, 499, 501] + 506: [472, 474, 484, 495, 497, 498, 499, 501, 506] + 507: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 508: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 509: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 510: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 511: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 512: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 513: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 514: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 515: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 516: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 517: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 518: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 519: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 520: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 521: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 522: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 523: [495, 497, 498, 499, 501, 506, 507, 510, 516, 523] + 524: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 525: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 526: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 527: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 528: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 529: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 530: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 531: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 532: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 533: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 534: [499, 501, 506, 507, 510, 516, 523, 530, 534] + 535: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 536: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 537: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 538: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 539: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 540: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 541: [506, 507, 510, 516, 523, 530, 534, 535, 541] + 542: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542] + 543: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 544: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 545: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 546: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 547: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 548: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 549: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 550: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 551: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 552: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 553: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 554: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 555: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 556: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 557: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 558: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 559: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 560: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 561: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 562: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 563: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 564: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 565: [523, 530, 534, 535, 541, 542, 543, 548, 565] + 566: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 567: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 568: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 569: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 570: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 571: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 572: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572] + 573: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 574: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 575: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 576: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 577: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 578: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 579: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 580: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 581: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 582: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 583: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 584: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 585: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 586: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 587: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 588: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 589: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 590: [543, 548, 565, 566, 572, 573, 578, 583] + 591: [543, 548, 565, 566, 572, 573, 578, 583] + 592: [543, 548, 565, 566, 572, 573, 578, 583] + 593: [543, 548, 565, 566, 572, 573, 578, 583] + 594: [543, 548, 565, 566, 572, 573, 578, 583] + 595: [543, 548, 565, 566, 572, 573, 578, 583, 595] + 596: [548, 565, 566, 572, 573, 578, 583, 595] + 597: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 598: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 599: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 600: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 601: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 602: [565, 566, 572, 573, 578, 583, 595, 597, 602] + 603: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 604: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 605: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 606: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603, 606] + 607: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 608: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 609: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 610: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 611: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 612: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 613: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 614: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 615: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 616: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 617: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 618: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 619: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 620: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 621: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610, 621] + 622: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 623: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 624: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 625: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 626: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 627: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 628: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 629: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 630: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 631: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 632: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 633: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 634: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 635: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 636: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 637: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 638: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 639: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 640: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 641: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 642: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 643: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 644: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 645: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 646: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 647: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 648: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648] + 649: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649] + 650: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650] + 651: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 652: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 653: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 654: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 655: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 656: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 657: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 658: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 659: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 660: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 661: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 662: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 663: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 664: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 665: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 666: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 667: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 668: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 669: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 670: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 671: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 672: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 673: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 674: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 675: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 676: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 677: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 678: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 679: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 680: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 681: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 682: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 683: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 684: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 685: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 686: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 687: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 688: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 689: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 690: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 691: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691] + 692: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 693: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 694: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 695: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 696: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 697: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 698: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 699: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 700: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 701: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 702: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 703: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 704: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 705: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 706: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 707: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 708: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 709: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 710: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 711: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 712: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 713: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 714: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 715: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 716: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 717: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 718: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 719: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 720: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 721: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 722: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 723: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 724: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 725: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 726: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 727: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 728: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 729: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 730: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 731: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 732: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 733: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 734: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 735: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 736: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 737: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 738: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 739: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739] + 740: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 741: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 742: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 743: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 744: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 745: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 746: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 747: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 748: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 749: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 750: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 751: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 752: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 753: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 754: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 755: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 756: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 757: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 758: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 759: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 760: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 761: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 762: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 763: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 764: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 765: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 766: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 767: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 768: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 769: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 770: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 771: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 772: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 773: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 774: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 775: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 776: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 777: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 778: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 779: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 780: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 781: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 782: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 783: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 784: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 785: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 786: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 787: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 788: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 789: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 790: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 791: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 792: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 793: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 794: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 795: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 796: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 797: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 798: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 799: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 800: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 801: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 802: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 803: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 804: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 805: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 806: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 807: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 808: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 809: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 810: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810] + 811: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 812: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 813: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 814: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 815: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 816: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 817: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 818: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 819: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 820: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 821: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 822: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 823: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 824: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 825: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 826: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 827: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 828: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 829: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 830: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 831: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 832: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 833: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 834: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 835: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 836: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 837: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 838: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 839: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 840: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 841: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 842: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 843: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 844: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 845: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 846: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 847: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 848: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 849: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 850: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 851: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 852: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 853: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 854: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 855: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855] + 856: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 857: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 858: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 859: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 860: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 861: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 862: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 863: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 864: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 865: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 866: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 867: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 868: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 869: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 870: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 871: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 872: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 873: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 874: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 875: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 876: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 877: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 878: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 879: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 880: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 881: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 882: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 883: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 884: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 885: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 886: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 887: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 888: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 889: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 890: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 891: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 892: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 893: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 894: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 895: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 896: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 897: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 898: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 899: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 900: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 901: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 902: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 903: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903] + 904: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904] + 905: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 906: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 907: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 908: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 909: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 910: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 911: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 912: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 913: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 914: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 915: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 916: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 917: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 918: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918] + 919: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 920: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 921: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 922: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 923: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 924: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 925: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 926: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 927: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 928: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 929: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 930: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 931: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 932: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 933: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 934: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 935: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 936: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 937: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 938: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 939: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 940: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 941: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 942: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 943: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 944: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 945: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 946: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 947: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 948: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 949: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 950: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 951: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 952: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 953: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 954: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 955: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 956: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956] + 957: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 958: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 959: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 960: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 961: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 962: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 963: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 964: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 965: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 966: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 967: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 968: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 969: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 970: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 971: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 972: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 973: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973] + 974: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 975: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 976: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 977: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 978: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 979: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 980: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 981: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 982: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 983: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 984: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 985: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 986: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 987: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 988: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 989: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 990: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 991: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 992: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 993: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 994: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 995: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 996: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 997: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 998: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 999: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1000: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1001: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1002: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1003: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1004: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1005: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1006: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1007: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007] + 1008: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1009: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1010: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1011: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1012: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1013: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1014: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1015: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1016: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1017: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1018: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1019: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1020: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1021: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1022: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1023: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1024: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1025: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1026: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1027: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1028: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1029: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1030: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1031: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1032: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1033: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1034: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1035: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1036: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1037: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1038: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1039: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1040: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1041: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1042: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1043: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1044: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1045: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1046: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1047: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1048: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1049: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1050: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1051: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1052: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052] + 1053: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053] + 1054: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1055: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1056: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1057: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1058: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1059: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1060: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1061: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1062: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1063: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063] + 1064: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1065: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1066: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066] + 1067: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1068: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1069: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1070: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1071: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1072: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1073: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1074: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1075: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1076: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1077: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1078: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1079: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1080: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1081: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1082: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1083: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1084: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1085: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1086: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1087: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1088: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1089: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1090: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1091: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1092: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1093: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1094: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1095: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1096: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1097: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1098: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1099: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1100: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1101: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1102: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1103: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1104: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1105: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1106: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1107: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1108: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1109: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1110: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1111: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1112: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1113: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1114: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1115: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1116: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1117: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1118: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1119: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1120: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1121: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1122: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1123: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1124: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1125: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1126: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1127: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1128: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1129: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1130: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1131: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1132: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1133: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1134: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1135: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1136: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1137: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1138: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1139: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1140: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1141: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1142: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1143: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1144: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1145: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1146: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1147: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1148: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1149: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1150: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1151: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1152: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1153: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1154: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1155: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1156: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1157: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1158: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1159: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1160: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1161: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1162: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1163: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1164: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1165: [1063, 1064, 1066, 1067, 1075, 1078] + 1166: [1063, 1064, 1066, 1067, 1075, 1078] + 1167: [1063, 1064, 1066, 1067, 1075, 1078] + 1168: [1063, 1064, 1066, 1067, 1075, 1078] + 1169: [1063, 1064, 1066, 1067, 1075, 1078] + 1170: [1063, 1064, 1066, 1067, 1075, 1078] + 1171: [1064, 1066, 1067, 1075, 1078] + 1172: [1064, 1066, 1067, 1075, 1078] + 1173: [1064, 1066, 1067, 1075, 1078] + 1174: [1064, 1066, 1067, 1075, 1078] + 1175: [1064, 1066, 1067, 1075, 1078] + 1176: [1064, 1066, 1067, 1075, 1078] + 1177: [1064, 1066, 1067, 1075, 1078] + 1178: [1064, 1066, 1067, 1075, 1078] + 1179: [1066, 1067, 1075, 1078] + 1180: [1066, 1067, 1075, 1078] + 1181: [1066, 1067, 1075, 1078] + 1182: [1066, 1067, 1075, 1078] + 1183: [1066, 1067, 1075, 1078] + 1184: [1066, 1067, 1075, 1078] + 1185: [1066, 1067, 1075, 1078] + 1186: [1066, 1067, 1075, 1078] + 1187: [1067, 1075, 1078] + 1188: [1067, 1075, 1078] + 1189: [1067, 1075, 1078] + 1190: [1067, 1075, 1078] + 1191: [1067, 1075, 1078] + 1192: [1067, 1075, 1078] + 1193: [1067, 1075, 1078] + 1194: [1067, 1075, 1078] + 1195: [1067, 1075, 1078] + 1196: [1075, 1078] + 1197: [1075, 1078] + 1198: [1075, 1078] + 1199: [1075, 1078] + 1200: [1075, 1078] + 1201: [1078] + 1202: [1078] + 1203: [1078] + 1204: [1078] + 1205: [] + Total customers served = 234 + Average wait time = 48.36752136752137 + Longest wait time = 129 + Longest queue = 22 + + ----jGRASP: operation complete. + **************************************/ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.class b/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.class new file mode 100644 index 0000000..e13aa88 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.java b/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.java new file mode 100644 index 0000000..761b51d --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/McRonaldVIP.java @@ -0,0 +1,1333 @@ +// Name: B6-24 +// Date: 1/8/20 + +import java.util.*; + +public class McRonaldVIP +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + int totalCustomers, totalWait, longestWait, longestQueue, totalVIP, totalVIPWait; + totalWait = totalCustomers = longestWait = longestQueue = totalVIP = totalVIPWait = 0; + + int wait = (int) (Math.random() * 6) + 2; + + PriorityQueue customers = new PriorityQueue<>(); + + for (int i = 0; i < TIME; i++) { + if (Math.random() < 0.2) + customers.add(new Customer(i, false)); + + if (Math.random() < 0.05) + customers.add(new Customer(i, true)); + + if (wait == 0) { + if (i - customers.peek().getArrival() > longestWait) + longestWait = i - customers.peek().getArrival(); + Customer temp = customers.remove(); + totalWait += i - temp.getArrival(); + if (temp.getVIP()) { + totalVIPWait += i - temp.getArrival(); + totalVIP++; + } + wait = (int) (Math.random() * 6) + 2; + totalCustomers++; + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + for (int i = TIME; !customers.isEmpty(); i++) { + if (wait == 0) { + if (i - customers.peek().getArrival() > longestWait) + longestWait = i - customers.peek().getArrival(); + Customer temp = customers.remove(); + totalWait += i - temp.getArrival(); + totalCustomers++; + if (temp.getVIP()) { + totalVIPWait += i - temp.getArrival(); + totalVIP++; + } + } else + if (!customers.isEmpty()) + wait--; + + if (customers.size() > longestQueue) + longestQueue = customers.size(); + + display(customers, i); + } + + System.out.println("Total customers served = " + totalCustomers); + System.out.println("Average wait time = " + (double) totalWait / totalCustomers); + System.out.println("Longest wait time = " + longestWait); + System.out.println("Longest queue = " + longestQueue); + System.out.println("Total VIPs served = " + totalVIP); + System.out.println("Average VIP wait time = " + (double) totalVIPWait / totalVIP); + + } + + public static void display(PriorityQueue q, int min) //if you are storing arrival times + //public static void display(Queue q, int min) //if you have a Customer class + { + System.out.println(min + ": " + q); + } +} + +class Customer implements Comparable // if you want a Customer class +{ + int arrivalTime; + boolean isVIP; + + public Customer (int time, boolean vip) { + arrivalTime = time; + isVIP = vip; + } + + public boolean getVIP () { + return isVIP; + } + + public int getArrival () { + return arrivalTime; + } + + public int compareTo (Customer other) { + if (isVIP && !other.getVIP()) + return Integer.MIN_VALUE; + else if (!isVIP && other.getVIP()) + return Integer.MAX_VALUE; + else + return arrivalTime - other.getArrival(); + } + + public String toString() { + if (isVIP) + return "VIP"; + return "" + arrivalTime; + } +} + + +/********************** Sample output + + 0: [] + 1: [] + 2: [2] + 3: [2] + 4: [2] + 5: [2] + 6: [2, 6] + 7: [6, 7] + 8: [6, 7] + 9: [6, 7] + 10: [6, 7, 10] + 11: [6, 7, 10] + 12: [7, 10, 12] + 13: [7, 10, 12] + 14: [7, 10, 12] + 15: [7, 10, 12] + 16: [10, 12] + 17: [10, 12] + 18: [10, 12] + 19: [10, 12] + 20: [10, 12] + 21: [10, 12] + 22: [10, 12] + 23: [12] + 24: [12] + 25: [12] + 26: [] + 27: [] + 28: [] + 29: [] + 30: [] + 31: [] + 32: [] + 33: [] + 34: [] + 35: [] + 36: [] + 37: [] + 38: [] + 39: [] + 40: [40] + 41: [40, 41] + 42: [40, 41] + 43: [41] + 44: [41] + 45: [41] + 46: [41] + 47: [] + 48: [48] + 49: [48] + 50: [48] + 51: [] + 52: [52] + 53: [52, 53] + 54: [52, 53, 54] + 55: [52, 53, 54] + 56: [52, 53, 54] + 57: [52, 53, 54] + 58: [53, 54, 58] + 59: [53, 54, 58] + 60: [53, 54, 58] + 61: [53, 54, 58] + 62: [54, 58] + 63: [54, 58] + 64: [54, 58] + 65: [58, 65] + 66: [58, 65] + 67: [58, 65] + 68: [58, 65] + 69: [58, 65] + 70: [65] + 71: [65] + 72: [65, 72] + 73: [65, 72] + 74: [65, 72, 74] + 75: [65, 72, 74] + 76: [65, 72, 74] + 77: [72, 74] + 78: [72, 74, 78] + 79: [72, 74, 78] + 80: [72, 74, 78] + 81: [74, 78] + 82: [74, 78] + 83: [74, 78, 83] + 84: [74, 78, 83] + 85: [74, 78, 83, 85] + 86: [74, 78, 83, 85] + 87: [78, 83, 85] + 88: [78, 83, 85] + 89: [78, 83, 85] + 90: [78, 83, 85] + 91: [78, 83, 85] + 92: [78, 83, 85] + 93: [83, 85] + 94: [83, 85, 94] + 95: [83, 85, 94] + 96: [83, 85, 94] + 97: [85, 94] + 98: [85, 94, 98] + 99: [85, 94, 98, 99] + 100: [85, 94, 98, 99, 100] + 101: [85, 94, 98, 99, 100] + 102: [85, 94, 98, 99, 100] + 103: [85, 94, 98, 99, 100] + 104: [94, 98, 99, 100] + 105: [94, 98, 99, 100, 105] + 106: [94, 98, 99, 100, 105, 106] + 107: [98, 99, 100, 105, 106] + 108: [98, 99, 100, 105, 106] + 109: [98, 99, 100, 105, 106, 109] + 110: [99, 100, 105, 106, 109] + 111: [99, 100, 105, 106, 109, 111] + 112: [99, 100, 105, 106, 109, 111] + 113: [100, 105, 106, 109, 111, 113] + 114: [100, 105, 106, 109, 111, 113] + 115: [100, 105, 106, 109, 111, 113] + 116: [100, 105, 106, 109, 111, 113] + 117: [100, 105, 106, 109, 111, 113] + 118: [100, 105, 106, 109, 111, 113] + 119: [100, 105, 106, 109, 111, 113] + 120: [105, 106, 109, 111, 113] + 121: [105, 106, 109, 111, 113] + 122: [105, 106, 109, 111, 113] + 123: [106, 109, 111, 113] + 124: [106, 109, 111, 113] + 125: [106, 109, 111, 113] + 126: [106, 109, 111, 113] + 127: [106, 109, 111, 113] + 128: [106, 109, 111, 113] + 129: [106, 109, 111, 113] + 130: [109, 111, 113, 130] + 131: [109, 111, 113, 130] + 132: [109, 111, 113, 130] + 133: [109, 111, 113, 130] + 134: [111, 113, 130, 134] + 135: [111, 113, 130, 134] + 136: [111, 113, 130, 134] + 137: [111, 113, 130, 134] + 138: [111, 113, 130, 134] + 139: [111, 113, 130, 134] + 140: [111, 113, 130, 134] + 141: [113, 130, 134] + 142: [113, 130, 134, 142] + 143: [113, 130, 134, 142, 143] + 144: [113, 130, 134, 142, 143] + 145: [130, 134, 142, 143] + 146: [130, 134, 142, 143] + 147: [130, 134, 142, 143] + 148: [130, 134, 142, 143] + 149: [130, 134, 142, 143] + 150: [130, 134, 142, 143] + 151: [130, 134, 142, 143, 151] + 152: [134, 142, 143, 151] + 153: [134, 142, 143, 151] + 154: [134, 142, 143, 151] + 155: [142, 143, 151] + 156: [142, 143, 151, 156] + 157: [142, 143, 151, 156] + 158: [142, 143, 151, 156] + 159: [142, 143, 151, 156] + 160: [142, 143, 151, 156] + 161: [142, 143, 151, 156, 161] + 162: [143, 151, 156, 161] + 163: [143, 151, 156, 161, 163] + 164: [143, 151, 156, 161, 163] + 165: [151, 156, 161, 163, 165] + 166: [151, 156, 161, 163, 165, 166] + 167: [151, 156, 161, 163, 165, 166] + 168: [151, 156, 161, 163, 165, 166] + 169: [156, 161, 163, 165, 166] + 170: [156, 161, 163, 165, 166] + 171: [156, 161, 163, 165, 166] + 172: [156, 161, 163, 165, 166] + 173: [156, 161, 163, 165, 166] + 174: [161, 163, 165, 166] + 175: [161, 163, 165, 166] + 176: [161, 163, 165, 166] + 177: [161, 163, 165, 166] + 178: [161, 163, 165, 166, 178] + 179: [161, 163, 165, 166, 178] + 180: [163, 165, 166, 178, 180] + 181: [163, 165, 166, 178, 180, 181] + 182: [163, 165, 166, 178, 180, 181] + 183: [163, 165, 166, 178, 180, 181] + 184: [165, 166, 178, 180, 181] + 185: [165, 166, 178, 180, 181, 185] + 186: [165, 166, 178, 180, 181, 185] + 187: [166, 178, 180, 181, 185, 187] + 188: [166, 178, 180, 181, 185, 187] + 189: [166, 178, 180, 181, 185, 187] + 190: [166, 178, 180, 181, 185, 187] + 191: [166, 178, 180, 181, 185, 187] + 192: [178, 180, 181, 185, 187] + 193: [178, 180, 181, 185, 187] + 194: [178, 180, 181, 185, 187] + 195: [178, 180, 181, 185, 187] + 196: [178, 180, 181, 185, 187, 196] + 197: [178, 180, 181, 185, 187, 196, 197] + 198: [178, 180, 181, 185, 187, 196, 197] + 199: [180, 181, 185, 187, 196, 197, 199] + 200: [180, 181, 185, 187, 196, 197, 199] + 201: [180, 181, 185, 187, 196, 197, 199] + 202: [180, 181, 185, 187, 196, 197, 199, 202] + 203: [181, 185, 187, 196, 197, 199, 202] + 204: [181, 185, 187, 196, 197, 199, 202, 204] + 205: [181, 185, 187, 196, 197, 199, 202, 204] + 206: [185, 187, 196, 197, 199, 202, 204] + 207: [185, 187, 196, 197, 199, 202, 204] + 208: [185, 187, 196, 197, 199, 202, 204] + 209: [185, 187, 196, 197, 199, 202, 204] + 210: [185, 187, 196, 197, 199, 202, 204] + 211: [185, 187, 196, 197, 199, 202, 204] + 212: [185, 187, 196, 197, 199, 202, 204] + 213: [187, 196, 197, 199, 202, 204, 213] + 214: [187, 196, 197, 199, 202, 204, 213] + 215: [187, 196, 197, 199, 202, 204, 213] + 216: [187, 196, 197, 199, 202, 204, 213] + 217: [187, 196, 197, 199, 202, 204, 213] + 218: [196, 197, 199, 202, 204, 213] + 219: [196, 197, 199, 202, 204, 213, 219] + 220: [196, 197, 199, 202, 204, 213, 219, 220] + 221: [196, 197, 199, 202, 204, 213, 219, 220, 221] + 222: [197, 199, 202, 204, 213, 219, 220, 221] + 223: [197, 199, 202, 204, 213, 219, 220, 221, 223] + 224: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 225: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 226: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 227: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 228: [197, 199, 202, 204, 213, 219, 220, 221, 223, 224] + 229: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 230: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 231: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 232: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 233: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 234: [199, 202, 204, 213, 219, 220, 221, 223, 224] + 235: [199, 202, 204, 213, 219, 220, 221, 223, 224, 235] + 236: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 237: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 238: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 239: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 240: [202, 204, 213, 219, 220, 221, 223, 224, 235] + 241: [204, 213, 219, 220, 221, 223, 224, 235] + 242: [204, 213, 219, 220, 221, 223, 224, 235] + 243: [204, 213, 219, 220, 221, 223, 224, 235] + 244: [213, 219, 220, 221, 223, 224, 235, 244] + 245: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 246: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 247: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 248: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 249: [213, 219, 220, 221, 223, 224, 235, 244, 245] + 250: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 251: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 252: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 253: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 254: [219, 220, 221, 223, 224, 235, 244, 245, 250] + 255: [220, 221, 223, 224, 235, 244, 245, 250] + 256: [220, 221, 223, 224, 235, 244, 245, 250] + 257: [220, 221, 223, 224, 235, 244, 245, 250] + 258: [220, 221, 223, 224, 235, 244, 245, 250] + 259: [220, 221, 223, 224, 235, 244, 245, 250] + 260: [220, 221, 223, 224, 235, 244, 245, 250] + 261: [221, 223, 224, 235, 244, 245, 250] + 262: [221, 223, 224, 235, 244, 245, 250] + 263: [221, 223, 224, 235, 244, 245, 250, 263] + 264: [221, 223, 224, 235, 244, 245, 250, 263] + 265: [221, 223, 224, 235, 244, 245, 250, 263] + 266: [221, 223, 224, 235, 244, 245, 250, 263] + 267: [223, 224, 235, 244, 245, 250, 263] + 268: [223, 224, 235, 244, 245, 250, 263] + 269: [223, 224, 235, 244, 245, 250, 263] + 270: [224, 235, 244, 245, 250, 263] + 271: [224, 235, 244, 245, 250, 263] + 272: [224, 235, 244, 245, 250, 263, 272] + 273: [224, 235, 244, 245, 250, 263, 272] + 274: [235, 244, 245, 250, 263, 272] + 275: [235, 244, 245, 250, 263, 272] + 276: [235, 244, 245, 250, 263, 272] + 277: [235, 244, 245, 250, 263, 272] + 278: [244, 245, 250, 263, 272] + 279: [244, 245, 250, 263, 272] + 280: [244, 245, 250, 263, 272] + 281: [244, 245, 250, 263, 272] + 282: [245, 250, 263, 272] + 283: [245, 250, 263, 272, 283] + 284: [245, 250, 263, 272, 283] + 285: [245, 250, 263, 272, 283, 285] + 286: [245, 250, 263, 272, 283, 285] + 287: [245, 250, 263, 272, 283, 285] + 288: [250, 263, 272, 283, 285, 288] + 289: [250, 263, 272, 283, 285, 288] + 290: [250, 263, 272, 283, 285, 288] + 291: [250, 263, 272, 283, 285, 288] + 292: [250, 263, 272, 283, 285, 288] + 293: [250, 263, 272, 283, 285, 288] + 294: [263, 272, 283, 285, 288] + 295: [263, 272, 283, 285, 288] + 296: [263, 272, 283, 285, 288, 296] + 297: [263, 272, 283, 285, 288, 296] + 298: [272, 283, 285, 288, 296] + 299: [272, 283, 285, 288, 296] + 300: [272, 283, 285, 288, 296] + 301: [272, 283, 285, 288, 296] + 302: [272, 283, 285, 288, 296] + 303: [272, 283, 285, 288, 296] + 304: [283, 285, 288, 296] + 305: [283, 285, 288, 296, 305] + 306: [283, 285, 288, 296, 305, 306] + 307: [283, 285, 288, 296, 305, 306] + 308: [285, 288, 296, 305, 306] + 309: [285, 288, 296, 305, 306] + 310: [285, 288, 296, 305, 306] + 311: [285, 288, 296, 305, 306] + 312: [285, 288, 296, 305, 306] + 313: [288, 296, 305, 306] + 314: [288, 296, 305, 306, 314] + 315: [288, 296, 305, 306, 314] + 316: [288, 296, 305, 306, 314] + 317: [288, 296, 305, 306, 314, 317] + 318: [288, 296, 305, 306, 314, 317, 318] + 319: [296, 305, 306, 314, 317, 318] + 320: [296, 305, 306, 314, 317, 318] + 321: [296, 305, 306, 314, 317, 318] + 322: [296, 305, 306, 314, 317, 318] + 323: [296, 305, 306, 314, 317, 318] + 324: [305, 306, 314, 317, 318] + 325: [305, 306, 314, 317, 318, 325] + 326: [305, 306, 314, 317, 318, 325, 326] + 327: [305, 306, 314, 317, 318, 325, 326] + 328: [305, 306, 314, 317, 318, 325, 326] + 329: [306, 314, 317, 318, 325, 326] + 330: [306, 314, 317, 318, 325, 326] + 331: [306, 314, 317, 318, 325, 326] + 332: [314, 317, 318, 325, 326] + 333: [314, 317, 318, 325, 326] + 334: [314, 317, 318, 325, 326] + 335: [314, 317, 318, 325, 326] + 336: [314, 317, 318, 325, 326] + 337: [314, 317, 318, 325, 326] + 338: [317, 318, 325, 326] + 339: [317, 318, 325, 326] + 340: [317, 318, 325, 326] + 341: [318, 325, 326] + 342: [318, 325, 326] + 343: [318, 325, 326] + 344: [318, 325, 326, 344] + 345: [318, 325, 326, 344] + 346: [325, 326, 344] + 347: [325, 326, 344, 347] + 348: [325, 326, 344, 347] + 349: [325, 326, 344, 347] + 350: [325, 326, 344, 347] + 351: [325, 326, 344, 347] + 352: [326, 344, 347] + 353: [326, 344, 347] + 354: [326, 344, 347] + 355: [326, 344, 347] + 356: [344, 347] + 357: [344, 347] + 358: [344, 347] + 359: [344, 347, 359] + 360: [344, 347, 359, 360] + 361: [344, 347, 359, 360, 361] + 362: [347, 359, 360, 361] + 363: [347, 359, 360, 361] + 364: [347, 359, 360, 361, 364] + 365: [359, 360, 361, 364] + 366: [359, 360, 361, 364] + 367: [359, 360, 361, 364] + 368: [359, 360, 361, 364, 368] + 369: [359, 360, 361, 364, 368, 369] + 370: [359, 360, 361, 364, 368, 369] + 371: [359, 360, 361, 364, 368, 369] + 372: [360, 361, 364, 368, 369] + 373: [360, 361, 364, 368, 369] + 374: [360, 361, 364, 368, 369] + 375: [360, 361, 364, 368, 369] + 376: [361, 364, 368, 369] + 377: [361, 364, 368, 369] + 378: [361, 364, 368, 369] + 379: [361, 364, 368, 369] + 380: [361, 364, 368, 369] + 381: [364, 368, 369] + 382: [364, 368, 369] + 383: [364, 368, 369, 383] + 384: [368, 369, 383] + 385: [368, 369, 383] + 386: [368, 369, 383] + 387: [368, 369, 383] + 388: [369, 383] + 389: [369, 383] + 390: [369, 383] + 391: [369, 383] + 392: [369, 383, 392] + 393: [369, 383, 392] + 394: [383, 392] + 395: [383, 392] + 396: [383, 392] + 397: [383, 392] + 398: [383, 392] + 399: [392] + 400: [392, 400] + 401: [392, 400] + 402: [392, 400] + 403: [400] + 404: [400] + 405: [400] + 406: [400] + 407: [407] + 408: [407] + 409: [407, 409] + 410: [407, 409] + 411: [407, 409, 411] + 412: [409, 411, 412] + 413: [409, 411, 412] + 414: [409, 411, 412] + 415: [409, 411, 412, 415] + 416: [409, 411, 412, 415] + 417: [409, 411, 412, 415] + 418: [409, 411, 412, 415] + 419: [411, 412, 415] + 420: [411, 412, 415] + 421: [411, 412, 415] + 422: [411, 412, 415] + 423: [411, 412, 415] + 424: [411, 412, 415, 424] + 425: [412, 415, 424] + 426: [412, 415, 424, 426] + 427: [412, 415, 424, 426, 427] + 428: [415, 424, 426, 427] + 429: [415, 424, 426, 427, 429] + 430: [415, 424, 426, 427, 429] + 431: [415, 424, 426, 427, 429] + 432: [415, 424, 426, 427, 429] + 433: [415, 424, 426, 427, 429] + 434: [415, 424, 426, 427, 429] + 435: [424, 426, 427, 429] + 436: [424, 426, 427, 429, 436] + 437: [424, 426, 427, 429, 436] + 438: [424, 426, 427, 429, 436, 438] + 439: [424, 426, 427, 429, 436, 438] + 440: [426, 427, 429, 436, 438, 440] + 441: [426, 427, 429, 436, 438, 440] + 442: [426, 427, 429, 436, 438, 440] + 443: [426, 427, 429, 436, 438, 440] + 444: [427, 429, 436, 438, 440] + 445: [427, 429, 436, 438, 440] + 446: [427, 429, 436, 438, 440] + 447: [427, 429, 436, 438, 440] + 448: [429, 436, 438, 440] + 449: [429, 436, 438, 440] + 450: [429, 436, 438, 440] + 451: [429, 436, 438, 440] + 452: [429, 436, 438, 440] + 453: [429, 436, 438, 440, 453] + 454: [436, 438, 440, 453] + 455: [436, 438, 440, 453] + 456: [436, 438, 440, 453, 456] + 457: [436, 438, 440, 453, 456, 457] + 458: [436, 438, 440, 453, 456, 457, 458] + 459: [438, 440, 453, 456, 457, 458] + 460: [438, 440, 453, 456, 457, 458] + 461: [438, 440, 453, 456, 457, 458] + 462: [438, 440, 453, 456, 457, 458] + 463: [438, 440, 453, 456, 457, 458] + 464: [438, 440, 453, 456, 457, 458, 464] + 465: [440, 453, 456, 457, 458, 464] + 466: [440, 453, 456, 457, 458, 464] + 467: [440, 453, 456, 457, 458, 464] + 468: [440, 453, 456, 457, 458, 464, 468] + 469: [440, 453, 456, 457, 458, 464, 468] + 470: [440, 453, 456, 457, 458, 464, 468] + 471: [453, 456, 457, 458, 464, 468] + 472: [453, 456, 457, 458, 464, 468, 472] + 473: [453, 456, 457, 458, 464, 468, 472] + 474: [453, 456, 457, 458, 464, 468, 472, 474] + 475: [456, 457, 458, 464, 468, 472, 474] + 476: [456, 457, 458, 464, 468, 472, 474] + 477: [456, 457, 458, 464, 468, 472, 474] + 478: [456, 457, 458, 464, 468, 472, 474] + 479: [456, 457, 458, 464, 468, 472, 474] + 480: [457, 458, 464, 468, 472, 474] + 481: [457, 458, 464, 468, 472, 474] + 482: [457, 458, 464, 468, 472, 474] + 483: [457, 458, 464, 468, 472, 474] + 484: [457, 458, 464, 468, 472, 474, 484] + 485: [457, 458, 464, 468, 472, 474, 484] + 486: [458, 464, 468, 472, 474, 484] + 487: [458, 464, 468, 472, 474, 484] + 488: [458, 464, 468, 472, 474, 484] + 489: [458, 464, 468, 472, 474, 484] + 490: [458, 464, 468, 472, 474, 484] + 491: [458, 464, 468, 472, 474, 484] + 492: [464, 468, 472, 474, 484] + 493: [464, 468, 472, 474, 484] + 494: [464, 468, 472, 474, 484] + 495: [464, 468, 472, 474, 484, 495] + 496: [464, 468, 472, 474, 484, 495] + 497: [468, 472, 474, 484, 495, 497] + 498: [468, 472, 474, 484, 495, 497, 498] + 499: [468, 472, 474, 484, 495, 497, 498, 499] + 500: [468, 472, 474, 484, 495, 497, 498, 499] + 501: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 502: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 503: [468, 472, 474, 484, 495, 497, 498, 499, 501] + 504: [472, 474, 484, 495, 497, 498, 499, 501] + 505: [472, 474, 484, 495, 497, 498, 499, 501] + 506: [472, 474, 484, 495, 497, 498, 499, 501, 506] + 507: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 508: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 509: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507] + 510: [472, 474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 511: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 512: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 513: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 514: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 515: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510] + 516: [474, 484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 517: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 518: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 519: [484, 495, 497, 498, 499, 501, 506, 507, 510, 516] + 520: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 521: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 522: [495, 497, 498, 499, 501, 506, 507, 510, 516] + 523: [495, 497, 498, 499, 501, 506, 507, 510, 516, 523] + 524: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 525: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 526: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 527: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 528: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 529: [497, 498, 499, 501, 506, 507, 510, 516, 523] + 530: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 531: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 532: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 533: [498, 499, 501, 506, 507, 510, 516, 523, 530] + 534: [499, 501, 506, 507, 510, 516, 523, 530, 534] + 535: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 536: [499, 501, 506, 507, 510, 516, 523, 530, 534, 535] + 537: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 538: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 539: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 540: [501, 506, 507, 510, 516, 523, 530, 534, 535] + 541: [506, 507, 510, 516, 523, 530, 534, 535, 541] + 542: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542] + 543: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 544: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 545: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 546: [506, 507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 547: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543] + 548: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 549: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 550: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 551: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 552: [507, 510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 553: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 554: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 555: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 556: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 557: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 558: [510, 516, 523, 530, 534, 535, 541, 542, 543, 548] + 559: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 560: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 561: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 562: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 563: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 564: [516, 523, 530, 534, 535, 541, 542, 543, 548] + 565: [523, 530, 534, 535, 541, 542, 543, 548, 565] + 566: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 567: [523, 530, 534, 535, 541, 542, 543, 548, 565, 566] + 568: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 569: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 570: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 571: [530, 534, 535, 541, 542, 543, 548, 565, 566] + 572: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572] + 573: [530, 534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 574: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 575: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 576: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 577: [534, 535, 541, 542, 543, 548, 565, 566, 572, 573] + 578: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 579: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 580: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 581: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 582: [535, 541, 542, 543, 548, 565, 566, 572, 573, 578] + 583: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 584: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 585: [541, 542, 543, 548, 565, 566, 572, 573, 578, 583] + 586: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 587: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 588: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 589: [542, 543, 548, 565, 566, 572, 573, 578, 583] + 590: [543, 548, 565, 566, 572, 573, 578, 583] + 591: [543, 548, 565, 566, 572, 573, 578, 583] + 592: [543, 548, 565, 566, 572, 573, 578, 583] + 593: [543, 548, 565, 566, 572, 573, 578, 583] + 594: [543, 548, 565, 566, 572, 573, 578, 583] + 595: [543, 548, 565, 566, 572, 573, 578, 583, 595] + 596: [548, 565, 566, 572, 573, 578, 583, 595] + 597: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 598: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 599: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 600: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 601: [548, 565, 566, 572, 573, 578, 583, 595, 597] + 602: [565, 566, 572, 573, 578, 583, 595, 597, 602] + 603: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 604: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 605: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603] + 606: [565, 566, 572, 573, 578, 583, 595, 597, 602, 603, 606] + 607: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 608: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 609: [566, 572, 573, 578, 583, 595, 597, 602, 603, 606, 607] + 610: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 611: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 612: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 613: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 614: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 615: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 616: [572, 573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 617: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 618: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 619: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 620: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610] + 621: [573, 578, 583, 595, 597, 602, 603, 606, 607, 610, 621] + 622: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 623: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 624: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 625: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 626: [578, 583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 627: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 628: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 629: [583, 595, 597, 602, 603, 606, 607, 610, 621, 622] + 630: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 631: [595, 597, 602, 603, 606, 607, 610, 621, 622] + 632: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 633: [595, 597, 602, 603, 606, 607, 610, 621, 622, 632] + 634: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 635: [597, 602, 603, 606, 607, 610, 621, 622, 632] + 636: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 637: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 638: [597, 602, 603, 606, 607, 610, 621, 622, 632, 636] + 639: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 640: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 641: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 642: [602, 603, 606, 607, 610, 621, 622, 632, 636] + 643: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 644: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 645: [602, 603, 606, 607, 610, 621, 622, 632, 636, 643] + 646: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 647: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646] + 648: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648] + 649: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649] + 650: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650] + 651: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 652: [603, 606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 653: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 654: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 655: [606, 607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651] + 656: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 657: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 658: [607, 610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 659: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 660: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 661: [610, 621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 662: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 663: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 664: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 665: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 666: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 667: [621, 622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 668: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 669: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 670: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 671: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656] + 672: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 673: [622, 632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 674: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 675: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672] + 676: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 677: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676] + 678: [632, 636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 679: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 680: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 681: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 682: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 683: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 684: [636, 643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 685: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678] + 686: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 687: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686] + 688: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 689: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 690: [643, 646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688] + 691: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691] + 692: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 693: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 694: [646, 648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692] + 695: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 696: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 697: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 698: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695] + 699: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 700: [648, 649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 701: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699] + 702: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 703: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 704: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 705: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702] + 706: [649, 650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 707: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 708: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 709: [650, 651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 710: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 711: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 712: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 713: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 714: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 715: [651, 656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 716: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 717: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706] + 718: [656, 672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 719: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 720: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 721: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 722: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 723: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 724: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718] + 725: [672, 676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 726: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 727: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 728: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 729: [676, 678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 730: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725] + 731: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 732: [678, 686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 733: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 734: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731] + 735: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 736: [686, 688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735] + 737: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 738: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737] + 739: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739] + 740: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 741: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 742: [688, 691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 743: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740] + 744: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 745: [691, 692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 746: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 747: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 748: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 749: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 750: [692, 695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 751: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 752: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 753: [695, 699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 754: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 755: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 756: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 757: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744] + 758: [699, 702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 759: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 760: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 761: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 762: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758] + 763: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 764: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763] + 765: [702, 706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 766: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 767: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765] + 768: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 769: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 770: [706, 718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768] + 771: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 772: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 773: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 774: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 775: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 776: [718, 725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 777: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 778: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 779: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771] + 780: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 781: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 782: [725, 731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 783: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 784: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 785: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 786: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 787: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780] + 788: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 789: [731, 735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 790: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 791: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 792: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 793: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 794: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 795: [735, 737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 796: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 797: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 798: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 799: [737, 739, 740, 744, 758, 763, 765, 768, 771, 780, 788] + 800: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 801: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 802: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 803: [739, 740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 804: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 805: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 806: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800] + 807: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 808: [740, 744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 809: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807] + 810: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810] + 811: [744, 758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 812: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811] + 813: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 814: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 815: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 816: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 817: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 818: [758, 763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 819: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 820: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813] + 821: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 822: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821] + 823: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 824: [763, 765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 825: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 826: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 827: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823] + 828: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 829: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 830: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 831: [765, 768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828] + 832: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 833: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 834: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 835: [768, 771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 836: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 837: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 838: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 839: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832] + 840: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 841: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 842: [771, 780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 843: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840] + 844: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 845: [780, 788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 846: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 847: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 848: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 849: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 850: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 851: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 852: [788, 800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844] + 853: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 854: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853] + 855: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855] + 856: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 857: [800, 807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 858: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 859: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856] + 860: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 861: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 862: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 863: [807, 810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 864: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 865: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 866: [810, 811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 867: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 868: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 869: [811, 813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 870: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 871: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 872: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860] + 873: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 874: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 875: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 876: [813, 821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 877: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873] + 878: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 879: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 880: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878] + 881: [821, 823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 882: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881] + 883: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 884: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 885: [823, 828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 886: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883] + 887: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 888: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 889: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 890: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 891: [828, 832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 892: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 893: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 894: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 895: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 896: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887] + 897: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 898: [832, 840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 899: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 900: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897] + 901: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 902: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901] + 903: [840, 844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903] + 904: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904] + 905: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 906: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 907: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905] + 908: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 909: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 910: [844, 853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908] + 911: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 912: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 913: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 914: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 915: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 916: [853, 855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 917: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911] + 918: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918] + 919: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 920: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 921: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 922: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 923: [855, 856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 924: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 925: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 926: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 927: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 928: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 929: [856, 860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 930: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 931: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919] + 932: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 933: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932] + 934: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 935: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 936: [860, 873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 937: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934] + 938: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 939: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938] + 940: [873, 878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 941: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 942: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 943: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 944: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 945: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940] + 946: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 947: [878, 881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 948: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 949: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 950: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 951: [881, 883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 952: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 953: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 954: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 955: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946] + 956: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956] + 957: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 958: [883, 887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 959: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 960: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 961: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 962: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957] + 963: [887, 897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 964: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 965: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 966: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 967: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 968: [897, 901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 969: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 970: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 971: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 972: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963] + 973: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973] + 974: [901, 903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 975: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974] + 976: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 977: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976] + 978: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 979: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 980: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 981: [903, 904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 982: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 983: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 984: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 985: [904, 905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 986: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 987: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 988: [905, 908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 989: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 990: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 991: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 992: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 993: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978] + 994: [908, 911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 995: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 996: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 997: [911, 918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 998: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994] + 999: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1000: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999] + 1001: [918, 919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1002: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1003: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001] + 1004: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1005: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1006: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004] + 1007: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007] + 1008: [919, 932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1009: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1010: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1011: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1012: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1013: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1014: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1015: [932, 934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1016: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1017: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1018: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1019: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1020: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1021: [934, 938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1022: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1023: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1024: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008] + 1025: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1026: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1027: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1028: [938, 940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1029: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1030: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1031: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1032: [940, 946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1033: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1034: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1035: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025] + 1036: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1037: [946, 956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036] + 1038: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1039: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1040: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1041: [956, 957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038] + 1042: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1043: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042] + 1044: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1045: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044] + 1046: [957, 963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1047: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1048: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1049: [963, 973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046] + 1050: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1051: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050] + 1052: [973, 974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052] + 1053: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053] + 1054: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1055: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1056: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054] + 1057: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1058: [974, 976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1059: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057] + 1060: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1061: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1062: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060] + 1063: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063] + 1064: [976, 978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1065: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064] + 1066: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066] + 1067: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1068: [978, 994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1069: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1070: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1071: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1072: [994, 999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1073: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1074: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067] + 1075: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1076: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1077: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075] + 1078: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1079: [999, 1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1080: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1081: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1082: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1083: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1084: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1085: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1086: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1087: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1088: [1001, 1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1089: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1090: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1091: [1004, 1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1092: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1093: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1094: [1007, 1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1095: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1096: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1097: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1098: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1099: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1100: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1101: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1102: [1008, 1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1103: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1104: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1105: [1025, 1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1106: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1107: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1108: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1109: [1036, 1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1110: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1111: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1112: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1113: [1038, 1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1114: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1115: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1116: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1117: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1118: [1042, 1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1119: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1120: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1121: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1122: [1044, 1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1123: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1124: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1125: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1126: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1127: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1128: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1129: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1130: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1131: [1046, 1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1132: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1133: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1134: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1135: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1136: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1137: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1138: [1050, 1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1139: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1140: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1141: [1052, 1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1142: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1143: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1144: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1145: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1146: [1053, 1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1147: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1148: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1149: [1054, 1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1150: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1151: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1152: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1153: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1154: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1155: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1156: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1157: [1057, 1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1158: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1159: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1160: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1161: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1162: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1163: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1164: [1060, 1063, 1064, 1066, 1067, 1075, 1078] + 1165: [1063, 1064, 1066, 1067, 1075, 1078] + 1166: [1063, 1064, 1066, 1067, 1075, 1078] + 1167: [1063, 1064, 1066, 1067, 1075, 1078] + 1168: [1063, 1064, 1066, 1067, 1075, 1078] + 1169: [1063, 1064, 1066, 1067, 1075, 1078] + 1170: [1063, 1064, 1066, 1067, 1075, 1078] + 1171: [1064, 1066, 1067, 1075, 1078] + 1172: [1064, 1066, 1067, 1075, 1078] + 1173: [1064, 1066, 1067, 1075, 1078] + 1174: [1064, 1066, 1067, 1075, 1078] + 1175: [1064, 1066, 1067, 1075, 1078] + 1176: [1064, 1066, 1067, 1075, 1078] + 1177: [1064, 1066, 1067, 1075, 1078] + 1178: [1064, 1066, 1067, 1075, 1078] + 1179: [1066, 1067, 1075, 1078] + 1180: [1066, 1067, 1075, 1078] + 1181: [1066, 1067, 1075, 1078] + 1182: [1066, 1067, 1075, 1078] + 1183: [1066, 1067, 1075, 1078] + 1184: [1066, 1067, 1075, 1078] + 1185: [1066, 1067, 1075, 1078] + 1186: [1066, 1067, 1075, 1078] + 1187: [1067, 1075, 1078] + 1188: [1067, 1075, 1078] + 1189: [1067, 1075, 1078] + 1190: [1067, 1075, 1078] + 1191: [1067, 1075, 1078] + 1192: [1067, 1075, 1078] + 1193: [1067, 1075, 1078] + 1194: [1067, 1075, 1078] + 1195: [1067, 1075, 1078] + 1196: [1075, 1078] + 1197: [1075, 1078] + 1198: [1075, 1078] + 1199: [1075, 1078] + 1200: [1075, 1078] + 1201: [1078] + 1202: [1078] + 1203: [1078] + 1204: [1078] + 1205: [] + Total customers served = 234 + Average wait time = 48.36752136752137 + Longest wait time = 129 + Longest queue = 22 + + ----jGRASP: operation complete. + **************************************/ diff --git a/06 Stacks _ Queues/05-08 McRonald/ProbTest.class b/06 Stacks _ Queues/05-08 McRonald/ProbTest.class new file mode 100644 index 0000000..c451b27 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/ProbTest.class differ diff --git a/06 Stacks _ Queues/05-08 McRonald/ProbTest.java b/06 Stacks _ Queues/05-08 McRonald/ProbTest.java new file mode 100644 index 0000000..3365b4b --- /dev/null +++ b/06 Stacks _ Queues/05-08 McRonald/ProbTest.java @@ -0,0 +1,9 @@ +public class ProbTest { + + public static void main(String[] args) { + for (int i = 0; i < 1080; i++) + System.out.println(-0.5 * Math.cos((Math.PI/180) * i) + 0.5); + + + } +} \ No newline at end of file diff --git a/06 Stacks _ Queues/05-08 McRonald/Window.class b/06 Stacks _ Queues/05-08 McRonald/Window.class new file mode 100644 index 0000000..0232bb9 Binary files /dev/null and b/06 Stacks _ Queues/05-08 McRonald/Window.class differ diff --git a/06 Stacks _ Queues/09 LunchRoom/Customer.class b/06 Stacks _ Queues/09 LunchRoom/Customer.class new file mode 100644 index 0000000..8d1ee81 Binary files /dev/null and b/06 Stacks _ Queues/09 LunchRoom/Customer.class differ diff --git a/06 Stacks _ Queues/09 LunchRoom/LunchRoom.class b/06 Stacks _ Queues/09 LunchRoom/LunchRoom.class new file mode 100644 index 0000000..d436acd Binary files /dev/null and b/06 Stacks _ Queues/09 LunchRoom/LunchRoom.class differ diff --git a/06 Stacks _ Queues/09 LunchRoom/LunchRoom.java b/06 Stacks _ Queues/09 LunchRoom/LunchRoom.java new file mode 100644 index 0000000..82caed3 --- /dev/null +++ b/06 Stacks _ Queues/09 LunchRoom/LunchRoom.java @@ -0,0 +1,1277 @@ +// Name: B6-24 +// Date: 1/18/20 + +import java.util.*; + +public class LunchRoom +{ + public static final int TIME = 1080; //18 hrs * 60 min + + public static void main(String[] args) + { + /* write code for the simulation */ + + int[] totalCustomers = new int[]{0,0,0,0}; + int[] totalWait = new int[]{0,0,0,0}; + int[] longestWait = new int[]{0,0,0,0}; + String[] classes = {"Freshman ", "Sophomore ", "Junior ", "Senior "}; + + int wait = (int) (Math.random() * 6) + 2; + + MyPriorityQueue customers = new MyPriorityQueue(); + + for (int i = 0; i < TIME; i++) { + if (Math.random() < 0.2) + customers.add(new Customer(i, (int)(Math.random() * 4))); + + if (wait == 0) { + Customer student = (Customer)customers.remove(); + if (i - student.getArrival() > longestWait[student.getClassNum()]) + longestWait[student.getClassNum()] = i - student.getArrival(); + totalWait[student.getClassNum()] += i - student.getArrival(); + wait = (int) (Math.random() * 6) + 2; + totalCustomers[student.getClassNum()]++; + } else + if (!customers.isEmpty()) + wait--; + + display(i, customers); + } + + for (int i = TIME; !customers.isEmpty(); i++) { + if (wait == 0) { + Customer student = (Customer) customers.remove(); + if (i - student.getArrival() > longestWait[student.getClassNum()]) + longestWait[student.getClassNum()] = i - student.getArrival(); + totalWait[student.getClassNum()] += i - student.getArrival(); + totalCustomers[student.getClassNum()]++; + } else + if (!customers.isEmpty()) + wait--; + + display(i, customers); + } + + + + System.out.println("Customer\t\tTotal\t\tLongest\t\tAverage Wait"); + /* report the data */ + for (int i = 3; i >= 0; i--) + System.out.printf("%s%d\t\t\t%d\t\t\t\t%f%n", classes[i], totalCustomers[i], longestWait[i], (double)totalWait[i] / totalCustomers[i]); + + + } + + public static void display(int t, MyPriorityQueue q) + { + System.out.println(t + ": " + q); + } +} + +class Customer implements Comparable +{ + private int arrivalTime, classNum; + private String[] classes = {"Fr", "So", "Jr", "Sr"}; + + public Customer (int myTime, int myClass) { + arrivalTime = myTime; + classNum = myClass; + } + + public int getClassNum () { + return classNum; + } + + public int getArrival () { + return arrivalTime; + } + + public int compareTo (Customer other) { + if (classNum > other.getClassNum()) + return Integer.MIN_VALUE; + else if (classNum < other.getClassNum()) + return Integer.MAX_VALUE; + else + return arrivalTime - other.getArrival(); + } + + public String toString() { + return classes[classNum] + ": " + arrivalTime; + } +} + + +/*------------------------- + + 0: [0:So] + 1: [1:Ju, 0:So] + 2: [1:Ju, 0:So] + 3: [1:Ju, 0:So] + 4: [1:Ju, 0:So] + 5: [0:So, 5:Fr] + 6: [0:So, 5:Fr] + 7: [0:So, 5:Fr] + 8: [5:Fr] + 9: [5:Fr] + 10: [5:Fr] + 11: [5:Fr] + 12: [5:Fr] + 13: [5:Fr] + 14: [5:Fr] + 15: [] + 16: [] + 17: [] + 18: [] + 19: [] + 20: [20:Fr] + 21: [21:So, 20:Fr] + 22: [21:So, 20:Fr] + 23: [20:Fr] + 24: [20:Fr] + 25: [20:Fr, 25:Fr] + 26: [26:Se, 25:Fr] + 27: [26:Se, 25:Fr, 27:Ju] + 28: [26:Se, 25:Fr, 27:Ju] + 29: [26:Se, 25:Fr, 27:Ju] + 30: [26:Se, 30:Se, 27:Ju, 25:Fr] + 31: [26:Se, 30:Se, 27:Ju, 25:Fr, 31:Fr] + 32: [30:Se, 25:Fr, 27:Ju, 31:Fr] + 33: [30:Se, 33:Ju, 27:Ju, 31:Fr, 25:Fr] + 34: [30:Se, 33:Ju, 27:Ju, 31:Fr, 25:Fr, 34:Fr] + 35: [30:Se, 33:Ju, 27:Ju, 31:Fr, 25:Fr, 34:Fr] + 36: [30:Se, 33:Ju, 27:Ju, 31:Fr, 25:Fr, 34:Fr] + 37: [27:Ju, 33:Ju, 34:Fr, 31:Fr, 25:Fr] + 38: [27:Ju, 33:Ju, 34:Fr, 31:Fr, 25:Fr] + 39: [27:Ju, 33:Ju, 39:So, 31:Fr, 25:Fr, 34:Fr] + 40: [27:Ju, 33:Ju, 39:So, 31:Fr, 25:Fr, 34:Fr] + 41: [27:Ju, 33:Ju, 39:So, 31:Fr, 25:Fr, 34:Fr] + 42: [27:Ju, 33:Ju, 39:So, 31:Fr, 25:Fr, 34:Fr] + 43: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr] + 44: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr] + 45: [45:Se, 25:Fr, 33:Ju, 31:Fr, 34:Fr, 39:So] + 46: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 47: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 48: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 49: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 50: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 51: [33:Ju, 25:Fr, 39:So, 31:Fr, 34:Fr, 46:Fr] + 52: [39:So, 25:Fr, 46:Fr, 31:Fr, 34:Fr] + 53: [39:So, 25:Fr, 46:Fr, 31:Fr, 34:Fr] + 54: [39:So, 25:Fr, 46:Fr, 31:Fr, 34:Fr] + 55: [39:So, 25:Fr, 46:Fr, 31:Fr, 34:Fr] + 56: [25:Fr, 31:Fr, 46:Fr, 34:Fr] + 57: [25:Fr, 31:Fr, 46:Fr, 34:Fr, 57:Fr] + 58: [25:Fr, 31:Fr, 46:Fr, 34:Fr, 57:Fr] + 59: [25:Fr, 31:Fr, 46:Fr, 34:Fr, 57:Fr] + 60: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 61: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 62: [62:Se, 31:Fr, 46:Fr, 57:Fr, 34:Fr] + 63: [62:Se, 31:Fr, 46:Fr, 57:Fr, 34:Fr] + 64: [62:Se, 31:Fr, 46:Fr, 57:Fr, 34:Fr] + 65: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 66: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 67: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 68: [31:Fr, 34:Fr, 46:Fr, 57:Fr] + 69: [34:Fr, 57:Fr, 46:Fr] + 70: [34:Fr, 57:Fr, 46:Fr] + 71: [34:Fr, 57:Fr, 46:Fr] + 72: [34:Fr, 57:Fr, 46:Fr] + 73: [34:Fr, 57:Fr, 46:Fr] + 74: [34:Fr, 57:Fr, 46:Fr] + 75: [46:Fr, 57:Fr] + 76: [46:Fr, 57:Fr] + 77: [46:Fr, 57:Fr] + 78: [46:Fr, 57:Fr] + 79: [57:Fr] + 80: [57:Fr] + 81: [57:Fr] + 82: [57:Fr] + 83: [57:Fr] + 84: [84:So, 57:Fr] + 85: [84:So, 57:Fr] + 86: [84:So, 57:Fr] + 87: [57:Fr] + 88: [57:Fr] + 89: [57:Fr] + 90: [57:Fr] + 91: [57:Fr, 91:Fr] + 92: [91:Fr] + 93: [91:Fr] + 94: [91:Fr] + 95: [91:Fr] + 96: [96:So, 91:Fr] + 97: [91:Fr] + 98: [98:Se, 91:Fr] + 99: [98:Se, 91:Fr] + 100: [91:Fr] + 101: [91:Fr] + 102: [91:Fr] + 103: [91:Fr] + 104: [91:Fr] + 105: [91:Fr] + 106: [106:Ju, 91:Fr] + 107: [91:Fr] + 108: [91:Fr] + 109: [109:Se, 91:Fr] + 110: [109:Se, 91:Fr] + 111: [109:Se, 91:Fr] + 112: [109:Se, 91:Fr, 112:Se] + 113: [109:Se, 91:Fr, 112:Se] + 114: [112:Se, 91:Fr] + 115: [112:Se, 91:Fr] + 116: [112:Se, 91:Fr] + 117: [112:Se, 91:Fr, 117:Fr] + 118: [112:Se, 91:Fr, 117:Fr] + 119: [112:Se, 91:Fr, 117:Fr] + 120: [112:Se, 91:Fr, 117:Fr] + 121: [112:Se, 91:Fr, 117:Fr] + 122: [91:Fr, 117:Fr] + 123: [91:Fr, 117:Fr, 123:Fr] + 124: [91:Fr, 117:Fr, 123:Fr] + 125: [117:Fr, 123:Fr] + 126: [117:Fr, 123:Fr] + 127: [117:Fr, 123:Fr] + 128: [117:Fr, 123:Fr] + 129: [117:Fr, 123:Fr] + 130: [117:Fr, 123:Fr] + 131: [123:Fr] + 132: [123:Fr] + 133: [123:Fr] + 134: [123:Fr] + 135: [123:Fr] + 136: [123:Fr] + 137: [123:Fr] + 138: [] + 139: [139:Ju] + 140: [139:Ju] + 141: [139:Ju] + 142: [] + 143: [143:Se] + 144: [143:Se] + 145: [143:Se] + 146: [143:Se] + 147: [143:Se] + 148: [] + 149: [149:Fr] + 150: [149:Fr] + 151: [149:Fr] + 152: [149:Fr] + 153: [149:Fr] + 154: [149:Fr] + 155: [] + 156: [] + 157: [] + 158: [] + 159: [] + 160: [] + 161: [161:Ju] + 162: [161:Ju, 162:So] + 163: [161:Ju, 162:So] + 164: [162:So] + 165: [162:So] + 166: [162:So] + 167: [162:So] + 168: [162:So] + 169: [162:So, 169:So] + 170: [169:So] + 171: [169:So] + 172: [169:So] + 173: [169:So, 173:So] + 174: [169:So, 173:So] + 175: [173:So] + 176: [173:So] + 177: [173:So] + 178: [178:Se, 173:So] + 179: [178:Se, 173:So] + 180: [178:Se, 173:So] + 181: [173:So] + 182: [173:So] + 183: [173:So] + 184: [173:So] + 185: [] + 186: [] + 187: [] + 188: [188:Ju] + 189: [188:Ju] + 190: [188:Ju, 190:So] + 191: [188:Ju, 190:So] + 192: [188:Ju, 190:So] + 193: [188:Ju, 190:So] + 194: [188:Ju, 190:So] + 195: [188:Ju, 190:So] + 196: [190:So] + 197: [190:So] + 198: [190:So, 198:So] + 199: [199:Ju, 198:So] + 200: [199:Ju, 198:So, 200:Ju] + 201: [199:Ju, 198:So, 200:Ju] + 202: [199:Ju, 198:So, 200:Ju] + 203: [199:Ju, 198:So, 200:Ju] + 204: [199:Ju, 198:So, 200:Ju] + 205: [199:Ju, 198:So, 200:Ju] + 206: [200:Ju, 198:So] + 207: [200:Ju, 198:So] + 208: [200:Ju, 198:So, 208:Fr] + 209: [200:Ju, 198:So, 208:Fr, 209:So] + 210: [198:So, 209:So, 208:Fr] + 211: [211:Se, 198:So, 208:Fr, 209:So] + 212: [211:Se, 198:So, 208:Fr, 209:So] + 213: [211:Se, 198:So, 208:Fr, 209:So] + 214: [211:Se, 214:Ju, 208:Fr, 209:So, 198:So] + 215: [211:Se, 214:Ju, 215:Se, 209:So, 198:So, 208:Fr] + 216: [211:Se, 214:Ju, 215:Se, 209:So, 198:So, 208:Fr] + 217: [215:Se, 214:Ju, 217:Ju, 209:So, 198:So, 208:Fr] + 218: [215:Se, 214:Ju, 218:Se, 209:So, 198:So, 208:Fr, 217:Ju] + 219: [215:Se, 214:Ju, 218:Se, 209:So, 198:So, 208:Fr, 217:Ju] + 220: [215:Se, 214:Ju, 218:Se, 209:So, 198:So, 208:Fr, 217:Ju] + 221: [218:Se, 214:Ju, 217:Ju, 209:So, 198:So, 208:Fr] + 222: [218:Se, 214:Ju, 217:Ju, 209:So, 198:So, 208:Fr] + 223: [218:Se, 214:Ju, 217:Ju, 209:So, 198:So, 208:Fr] + 224: [218:Se, 214:Ju, 217:Ju, 209:So, 198:So, 208:Fr] + 225: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 226: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 227: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 228: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 229: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 230: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 231: [214:Ju, 198:So, 217:Ju, 209:So, 208:Fr] + 232: [217:Ju, 198:So, 208:Fr, 209:So] + 233: [217:Ju, 198:So, 208:Fr, 209:So] + 234: [217:Ju, 198:So, 208:Fr, 209:So] + 235: [217:Ju, 198:So, 208:Fr, 209:So] + 236: [198:So, 209:So, 208:Fr, 236:Fr] + 237: [198:So, 209:So, 208:Fr, 236:Fr] + 238: [198:So, 209:So, 208:Fr, 236:Fr] + 239: [198:So, 209:So, 208:Fr, 236:Fr] + 240: [198:So, 209:So, 208:Fr, 236:Fr] + 241: [198:So, 209:So, 208:Fr, 236:Fr] + 242: [209:So, 236:Fr, 208:Fr] + 243: [209:So, 236:Fr, 208:Fr] + 244: [209:So, 236:Fr, 208:Fr] + 245: [209:So, 236:Fr, 208:Fr] + 246: [209:So, 236:Fr, 208:Fr] + 247: [209:So, 236:Fr, 208:Fr] + 248: [209:So, 236:Fr, 208:Fr] + 249: [208:Fr, 236:Fr] + 250: [208:Fr, 236:Fr] + 251: [208:Fr, 236:Fr] + 252: [208:Fr, 236:Fr] + 253: [208:Fr, 236:Fr] + 254: [236:Fr] + 255: [236:Fr] + 256: [256:Se, 236:Fr] + 257: [256:Se, 236:Fr, 257:Fr] + 258: [256:Se, 236:Fr, 257:Fr] + 259: [256:Se, 236:Fr, 257:Fr] + 260: [236:Fr, 257:Fr] + 261: [236:Fr, 257:Fr] + 262: [236:Fr, 257:Fr] + 263: [236:Fr, 257:Fr] + 264: [236:Fr, 257:Fr] + 265: [236:Fr, 257:Fr] + 266: [266:Se, 257:Fr] + 267: [266:Se, 257:Fr] + 268: [266:Se, 257:Fr, 268:So] + 269: [268:So, 257:Fr] + 270: [268:So, 257:Fr] + 271: [268:So, 257:Fr] + 272: [268:So, 257:Fr] + 273: [268:So, 257:Fr] + 274: [257:Fr] + 275: [257:Fr] + 276: [276:So, 257:Fr] + 277: [277:Se, 257:Fr, 276:So] + 278: [277:Se, 257:Fr, 276:So] + 279: [277:Se, 257:Fr, 276:So] + 280: [277:Se, 257:Fr, 276:So] + 281: [277:Se, 257:Fr, 276:So] + 282: [276:So, 257:Fr] + 283: [276:So, 257:Fr] + 284: [276:So, 257:Fr] + 285: [276:So, 257:Fr] + 286: [276:So, 257:Fr] + 287: [257:Fr] + 288: [257:Fr] + 289: [257:Fr] + 290: [290:Se, 257:Fr] + 291: [290:Se, 257:Fr] + 292: [290:Se, 257:Fr] + 293: [257:Fr] + 294: [294:So, 257:Fr] + 295: [294:So, 257:Fr, 295:So] + 296: [296:Ju, 294:So, 295:So, 257:Fr] + 297: [294:So, 257:Fr, 295:So] + 298: [294:So, 257:Fr, 295:So] + 299: [294:So, 257:Fr, 295:So] + 300: [294:So, 257:Fr, 295:So] + 301: [294:So, 257:Fr, 295:So] + 302: [295:So, 257:Fr] + 303: [295:So, 257:Fr] + 304: [295:So, 257:Fr] + 305: [295:So, 257:Fr, 305:Fr] + 306: [295:So, 257:Fr, 305:Fr] + 307: [295:So, 257:Fr, 305:Fr] + 308: [308:Ju, 305:Fr, 257:Fr] + 309: [308:Ju, 305:Fr, 257:Fr] + 310: [308:Ju, 310:Ju, 257:Fr, 305:Fr] + 311: [310:Ju, 305:Fr, 257:Fr] + 312: [310:Ju, 305:Fr, 257:Fr] + 313: [313:Se, 310:Ju, 257:Fr, 305:Fr] + 314: [313:Se, 310:Ju, 257:Fr, 305:Fr, 314:So] + 315: [313:Se, 310:Ju, 257:Fr, 305:Fr, 314:So] + 316: [313:Se, 310:Ju, 257:Fr, 305:Fr, 314:So] + 317: [310:Ju, 314:So, 257:Fr, 305:Fr] + 318: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So] + 319: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So] + 320: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So] + 321: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So] + 322: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So, 322:Fr] + 323: [310:Ju, 318:Ju, 257:Fr, 305:Fr, 314:So, 322:Fr] + 324: [318:Ju, 314:So, 257:Fr, 305:Fr, 322:Fr] + 325: [318:Ju, 314:So, 257:Fr, 305:Fr, 322:Fr] + 326: [318:Ju, 314:So, 257:Fr, 305:Fr, 322:Fr] + 327: [318:Ju, 314:So, 257:Fr, 305:Fr, 322:Fr] + 328: [314:So, 305:Fr, 257:Fr, 322:Fr] + 329: [314:So, 305:Fr, 257:Fr, 322:Fr] + 330: [314:So, 305:Fr, 257:Fr, 322:Fr] + 331: [314:So, 305:Fr, 257:Fr, 322:Fr] + 332: [314:So, 305:Fr, 257:Fr, 322:Fr] + 333: [314:So, 305:Fr, 257:Fr, 322:Fr] + 334: [257:Fr, 305:Fr, 322:Fr] + 335: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 336: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 337: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 338: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 339: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 340: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 341: [335:Ju, 257:Fr, 322:Fr, 305:Fr] + 342: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 343: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 344: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 345: [345:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 346: [345:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 347: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 348: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 349: [257:Fr, 305:Fr, 322:Fr, 342:Fr] + 350: [350:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 351: [350:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 352: [350:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 353: [350:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr] + 354: [350:Se, 257:Fr, 322:Fr, 342:Fr, 305:Fr, 354:Fr] + 355: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr] + 356: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr] + 357: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr] + 358: [358:Se, 305:Fr, 357:So, 342:Fr, 354:Fr, 322:Fr, 257:Fr] + 359: [358:Se, 305:Fr, 357:So, 342:Fr, 354:Fr, 322:Fr, 257:Fr, 359:Fr] + 360: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 361: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 362: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 363: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 364: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 365: [365:Ju, 357:So, 257:Fr, 305:Fr, 354:Fr, 322:Fr, 359:Fr, 342:Fr] + 366: [365:Ju, 357:So, 257:Fr, 305:Fr, 354:Fr, 322:Fr, 359:Fr, 342:Fr] + 367: [365:Ju, 357:So, 257:Fr, 305:Fr, 354:Fr, 322:Fr, 359:Fr, 342:Fr] + 368: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 369: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 370: [357:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 322:Fr, 359:Fr] + 371: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr] + 372: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr] + 373: [373:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr] + 374: [373:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr] + 375: [373:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr] + 376: [373:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr] + 377: [373:So, 305:Fr, 257:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr] + 378: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr] + 379: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 380: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 381: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 382: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 383: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 384: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 385: [385:Ju, 257:Fr, 322:Fr, 305:Fr, 354:Fr, 359:Fr, 379:Fr, 342:Fr] + 386: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 387: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 388: [388:Se, 257:Fr, 322:Fr, 305:Fr, 354:Fr, 359:Fr, 379:Fr, 342:Fr] + 389: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 390: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 391: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 392: [392:So, 257:Fr, 322:Fr, 305:Fr, 354:Fr, 359:Fr, 379:Fr, 342:Fr] + 393: [392:So, 257:Fr, 322:Fr, 305:Fr, 354:Fr, 359:Fr, 379:Fr, 342:Fr] + 394: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 395: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 396: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 397: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 398: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 399: [257:Fr, 305:Fr, 322:Fr, 342:Fr, 354:Fr, 359:Fr, 379:Fr] + 400: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 401: [401:Se, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 402: [401:Se, 402:Se, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 403: [401:Se, 402:Se, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 404: [401:Se, 402:Se, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 405: [401:Se, 402:Se, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 406: [401:Se, 402:Se, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 407: [402:Se, 407:Ju, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 408: [402:Se, 407:Ju, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 409: [402:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 410: [402:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 411: [402:Se, 411:Se, 305:Fr, 409:So, 407:Ju, 359:Fr, 322:Fr, 379:Fr, 342:Fr, 354:Fr] + 412: [402:Se, 411:Se, 305:Fr, 409:So, 407:Ju, 359:Fr, 322:Fr, 379:Fr, 342:Fr, 354:Fr] + 413: [402:Se, 411:Se, 305:Fr, 409:So, 407:Ju, 359:Fr, 322:Fr, 379:Fr, 342:Fr, 354:Fr] + 414: [402:Se, 411:Se, 305:Fr, 409:So, 407:Ju, 359:Fr, 322:Fr, 379:Fr, 342:Fr, 354:Fr] + 415: [411:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 416: [411:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 417: [411:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 418: [411:Se, 407:Ju, 305:Fr, 409:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 419: [407:Ju, 409:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 420: [407:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 421: [407:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 422: [407:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 423: [409:So, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 424: [424:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 425: [424:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 426: [424:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 427: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 428: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 429: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 430: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 431: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 432: [427:Ju, 409:So, 305:Fr, 420:So, 354:Fr, 359:Fr, 322:Fr, 379:Fr, 342:Fr] + 433: [409:So, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 434: [409:So, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 435: [409:So, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 436: [409:So, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 437: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 438: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 439: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 440: [440:Ju, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 441: [440:Ju, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 442: [440:Ju, 420:So, 305:Fr, 342:Fr, 354:Fr, 359:Fr, 322:Fr, 379:Fr] + 443: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 444: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 445: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 446: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 447: [420:So, 342:Fr, 305:Fr, 379:Fr, 354:Fr, 359:Fr, 322:Fr] + 448: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 449: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 450: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 451: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 452: [305:Fr, 342:Fr, 322:Fr, 379:Fr, 354:Fr, 359:Fr] + 453: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 454: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 455: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 456: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 457: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 458: [322:Fr, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 459: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 460: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 461: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 462: [462:Ju, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 463: [462:Ju, 342:Fr, 359:Fr, 379:Fr, 354:Fr] + 464: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 465: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 466: [342:Fr, 354:Fr, 359:Fr, 379:Fr] + 467: [354:Fr, 379:Fr, 359:Fr] + 468: [354:Fr, 379:Fr, 359:Fr] + 469: [469:So, 354:Fr, 359:Fr, 379:Fr] + 470: [469:So, 354:Fr, 359:Fr, 379:Fr] + 471: [469:So, 354:Fr, 359:Fr, 379:Fr] + 472: [354:Fr, 379:Fr, 359:Fr] + 473: [354:Fr, 379:Fr, 359:Fr] + 474: [354:Fr, 379:Fr, 359:Fr] + 475: [354:Fr, 379:Fr, 359:Fr] + 476: [359:Fr, 379:Fr] + 477: [359:Fr, 379:Fr] + 478: [359:Fr, 379:Fr] + 479: [359:Fr, 379:Fr] + 480: [379:Fr] + 481: [379:Fr] + 482: [379:Fr] + 483: [379:Fr] + 484: [] + 485: [] + 486: [] + 487: [] + 488: [] + 489: [] + 490: [] + 491: [] + 492: [] + 493: [] + 494: [] + 495: [] + 496: [496:Ju] + 497: [496:Ju] + 498: [496:Ju] + 499: [496:Ju] + 500: [496:Ju] + 501: [496:Ju, 501:Ju] + 502: [496:Ju, 501:Ju] + 503: [501:Ju, 503:Fr] + 504: [501:Ju, 503:Fr] + 505: [501:Ju, 503:Fr] + 506: [501:Ju, 503:Fr, 506:So] + 507: [506:So, 503:Fr] + 508: [506:So, 503:Fr] + 509: [509:Ju, 503:Fr, 506:So] + 510: [509:Ju, 510:So, 506:So, 503:Fr] + 511: [506:So, 510:So, 503:Fr] + 512: [506:So, 510:So, 503:Fr] + 513: [506:So, 510:So, 503:Fr] + 514: [506:So, 510:So, 503:Fr] + 515: [506:So, 510:So, 503:Fr] + 516: [506:So, 510:So, 503:Fr, 516:So] + 517: [517:Ju, 510:So, 503:Fr, 516:So] + 518: [517:Ju, 510:So, 503:Fr, 516:So] + 519: [517:Ju, 510:So, 503:Fr, 516:So] + 520: [520:Se, 517:Ju, 503:Fr, 516:So, 510:So] + 521: [517:Ju, 510:So, 503:Fr, 516:So] + 522: [517:Ju, 510:So, 503:Fr, 516:So] + 523: [517:Ju, 510:So, 503:Fr, 516:So] + 524: [517:Ju, 524:Ju, 503:Fr, 516:So, 510:So] + 525: [517:Ju, 524:Ju, 503:Fr, 516:So, 510:So] + 526: [517:Ju, 524:Ju, 503:Fr, 516:So, 510:So] + 527: [517:Ju, 524:Ju, 503:Fr, 516:So, 510:So] + 528: [524:Ju, 510:So, 503:Fr, 516:So] + 529: [524:Ju, 510:So, 503:Fr, 516:So, 529:Fr] + 530: [524:Ju, 510:So, 503:Fr, 516:So, 529:Fr] + 531: [524:Ju, 510:So, 503:Fr, 516:So, 529:Fr] + 532: [524:Ju, 510:So, 503:Fr, 516:So, 529:Fr] + 533: [533:Se, 510:So, 503:Fr, 529:Fr, 516:So] + 534: [533:Se, 510:So, 503:Fr, 529:Fr, 516:So] + 535: [533:Se, 510:So, 503:Fr, 529:Fr, 516:So] + 536: [533:Se, 510:So, 503:Fr, 529:Fr, 516:So] + 537: [533:Se, 510:So, 503:Fr, 529:Fr, 516:So] + 538: [533:Se, 510:So, 538:So, 529:Fr, 516:So, 503:Fr] + 539: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr] + 540: [540:Se, 516:So, 510:So, 529:Fr, 503:Fr, 539:Fr, 538:So] + 541: [540:Se, 516:So, 510:So, 529:Fr, 503:Fr, 539:Fr, 538:So] + 542: [540:Se, 516:So, 510:So, 529:Fr, 503:Fr, 539:Fr, 538:So] + 543: [540:Se, 516:So, 510:So, 529:Fr, 503:Fr, 539:Fr, 538:So] + 544: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr] + 545: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr] + 546: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr] + 547: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr] + 548: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 549: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 550: [550:Ju, 510:So, 538:So, 516:So, 503:Fr, 539:Fr, 548:Fr, 529:Fr] + 551: [550:Ju, 510:So, 538:So, 516:So, 503:Fr, 539:Fr, 548:Fr, 529:Fr] + 552: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 553: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 554: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 555: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 556: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 557: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 558: [510:So, 516:So, 538:So, 529:Fr, 503:Fr, 539:Fr, 548:Fr] + 559: [516:So, 503:Fr, 538:So, 529:Fr, 548:Fr, 539:Fr] + 560: [560:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 561: [560:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 562: [560:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 563: [560:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 564: [560:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 565: [516:So, 503:Fr, 538:So, 529:Fr, 548:Fr, 539:Fr] + 566: [516:So, 503:Fr, 538:So, 529:Fr, 548:Fr, 539:Fr] + 567: [567:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 568: [568:Se, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 569: [568:Se, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 570: [568:Se, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 571: [568:Se, 571:Ju, 516:So, 503:Fr, 548:Fr, 539:Fr, 538:So, 529:Fr] + 572: [568:Se, 571:Ju, 516:So, 503:Fr, 548:Fr, 539:Fr, 538:So, 529:Fr] + 573: [571:Ju, 503:Fr, 516:So, 529:Fr, 548:Fr, 539:Fr, 538:So] + 574: [571:Ju, 574:So, 516:So, 503:Fr, 548:Fr, 539:Fr, 538:So, 529:Fr] + 575: [571:Ju, 574:So, 516:So, 503:Fr, 548:Fr, 539:Fr, 538:So, 529:Fr] + 576: [571:Ju, 574:So, 516:So, 503:Fr, 548:Fr, 539:Fr, 538:So, 529:Fr] + 577: [516:So, 574:So, 538:So, 503:Fr, 548:Fr, 539:Fr, 529:Fr] + 578: [516:So, 574:So, 538:So, 503:Fr, 548:Fr, 539:Fr, 529:Fr] + 579: [516:So, 574:So, 538:So, 503:Fr, 548:Fr, 539:Fr, 529:Fr] + 580: [580:Ju, 516:So, 538:So, 574:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 581: [580:Ju, 516:So, 538:So, 574:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 581:So] + 582: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 583: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 584: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 585: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 586: [586:Ju, 516:So, 538:So, 574:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 581:So] + 587: [586:Ju, 516:So, 538:So, 574:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 581:So] + 588: [586:Ju, 516:So, 538:So, 574:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 581:So] + 589: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 590: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 591: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr] + 592: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 592:So] + 593: [593:Ju, 516:So, 538:So, 581:So, 574:So, 539:Fr, 529:Fr, 503:Fr, 592:So, 548:Fr] + 594: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 592:So] + 595: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 592:So] + 596: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 592:So] + 597: [516:So, 574:So, 538:So, 581:So, 548:Fr, 539:Fr, 529:Fr, 503:Fr, 592:So] + 598: [516:So, 574:So, 538:So, 581:So, 598:So, 539:Fr, 529:Fr, 503:Fr, 592:So, 548:Fr] + 599: [516:So, 574:So, 538:So, 581:So, 598:So, 539:Fr, 529:Fr, 503:Fr, 592:So, 548:Fr] + 600: [516:So, 574:So, 538:So, 581:So, 598:So, 539:Fr, 529:Fr, 503:Fr, 592:So, 548:Fr] + 601: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So] + 602: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 603: [603:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 604: [603:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 605: [603:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 606: [603:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 607: [603:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 608: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 609: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 610: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 611: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 612: [612:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 613: [612:Se, 538:So, 529:Fr, 581:So, 574:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 598:So] + 614: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 615: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 616: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 617: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 618: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr] + 619: [538:So, 574:So, 529:Fr, 581:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 592:So, 602:Fr, 619:Fr] + 620: [574:So, 581:So, 529:Fr, 592:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 619:Fr, 602:Fr] + 621: [574:So, 581:So, 529:Fr, 592:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 619:Fr, 602:Fr] + 622: [574:So, 581:So, 529:Fr, 592:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 619:Fr, 602:Fr] + 623: [574:So, 581:So, 529:Fr, 592:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 619:Fr, 602:Fr] + 624: [574:So, 581:So, 529:Fr, 592:So, 598:So, 539:Fr, 548:Fr, 503:Fr, 619:Fr, 602:Fr] + 625: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 626: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 627: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 628: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 629: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr, 629:Fr] + 630: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr, 629:Fr] + 631: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr, 629:Fr] + 632: [581:So, 592:So, 529:Fr, 503:Fr, 598:So, 539:Fr, 548:Fr, 602:Fr, 619:Fr, 629:Fr] + 633: [592:So, 598:So, 529:Fr, 503:Fr, 629:Fr, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 634: [592:So, 598:So, 529:Fr, 503:Fr, 629:Fr, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 635: [592:So, 598:So, 529:Fr, 503:Fr, 629:Fr, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 636: [592:So, 598:So, 529:Fr, 503:Fr, 629:Fr, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 637: [592:So, 598:So, 529:Fr, 503:Fr, 629:Fr, 539:Fr, 548:Fr, 602:Fr, 619:Fr] + 638: [598:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 619:Fr] + 639: [598:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 619:Fr] + 640: [598:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 619:Fr] + 641: [598:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 619:Fr] + 642: [503:Fr, 602:Fr, 529:Fr, 619:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr] + 643: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr] + 644: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr, 644:Fr] + 645: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr, 644:Fr] + 646: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr, 644:Fr] + 647: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr, 644:Fr] + 648: [643:So, 503:Fr, 529:Fr, 602:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 619:Fr, 644:Fr] + 649: [503:Fr, 602:Fr, 529:Fr, 619:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 644:Fr] + 650: [503:Fr, 602:Fr, 529:Fr, 619:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 644:Fr] + 651: [503:Fr, 602:Fr, 529:Fr, 619:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 644:Fr] + 652: [503:Fr, 602:Fr, 529:Fr, 619:Fr, 629:Fr, 539:Fr, 548:Fr, 642:Fr, 644:Fr] + 653: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr] + 654: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 655: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 656: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 657: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 658: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 659: [529:Fr, 602:Fr, 539:Fr, 619:Fr, 629:Fr, 644:Fr, 548:Fr, 642:Fr, 654:Fr] + 660: [539:Fr, 602:Fr, 548:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr, 642:Fr] + 661: [539:Fr, 602:Fr, 548:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr, 642:Fr] + 662: [539:Fr, 602:Fr, 548:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr, 642:Fr] + 663: [539:Fr, 602:Fr, 548:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr, 642:Fr] + 664: [548:Fr, 602:Fr, 642:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr] + 665: [548:Fr, 602:Fr, 642:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr] + 666: [548:Fr, 602:Fr, 642:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr] + 667: [548:Fr, 602:Fr, 642:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr] + 668: [548:Fr, 602:Fr, 642:Fr, 619:Fr, 629:Fr, 644:Fr, 654:Fr] + 669: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 670: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 671: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 672: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 673: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 674: [602:Fr, 619:Fr, 642:Fr, 654:Fr, 629:Fr, 644:Fr] + 675: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr] + 676: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr] + 677: [677:Se, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 676:Fr, 642:Fr] + 678: [678:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 676:Fr, 642:Fr] + 679: [678:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 676:Fr, 642:Fr, 679:Fr] + 680: [678:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 676:Fr, 642:Fr, 679:Fr] + 681: [678:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 676:Fr, 642:Fr, 679:Fr, 681:Fr] + 682: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 683: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 684: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 685: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 686: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 687: [687:Ju, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr] + 688: [687:Ju, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr] + 689: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 690: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr] + 691: [691:Ju, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr] + 692: [691:Ju, 692:Ju, 642:Fr, 629:Fr, 619:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 644:Fr] + 693: [692:Ju, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr] + 694: [692:Ju, 694:Ju, 642:Fr, 629:Fr, 619:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr] + 695: [692:Ju, 694:Ju, 642:Fr, 629:Fr, 619:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr] + 696: [692:Ju, 694:Ju, 642:Fr, 629:Fr, 619:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr] + 697: [692:Ju, 694:Ju, 697:So, 629:Fr, 619:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr, 676:Fr] + 698: [692:Ju, 694:Ju, 697:So, 629:Fr, 619:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr, 676:Fr, 698:Fr] + 699: [692:Ju, 694:Ju, 697:So, 629:Fr, 619:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 644:Fr, 676:Fr, 698:Fr] + 700: [694:Ju, 619:Fr, 697:So, 629:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr] + 701: [694:Ju, 619:Fr, 697:So, 629:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr] + 702: [702:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr] + 703: [702:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 704: [702:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 705: [702:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 706: [702:Se, 619:Fr, 706:Se, 629:Fr, 644:Fr, 697:So, 694:Ju, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr, 703:So] + 707: [702:Se, 619:Fr, 706:Se, 629:Fr, 644:Fr, 697:So, 694:Ju, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr, 703:So] + 708: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 709: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 710: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 711: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr] + 712: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr, 712:Fr] + 713: [706:Se, 619:Fr, 694:Ju, 629:Fr, 644:Fr, 697:So, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 642:Fr, 681:Fr, 712:Fr] + 714: [694:Ju, 619:Fr, 697:So, 629:Fr, 644:Fr, 642:Fr, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr, 681:Fr] + 715: [694:Ju, 619:Fr, 697:So, 629:Fr, 644:Fr, 642:Fr, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr, 681:Fr] + 716: [694:Ju, 619:Fr, 697:So, 629:Fr, 644:Fr, 642:Fr, 703:So, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr, 681:Fr] + 717: [697:So, 619:Fr, 703:So, 629:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr] + 718: [697:So, 619:Fr, 703:So, 629:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr] + 719: [697:So, 619:Fr, 703:So, 629:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 676:Fr, 712:Fr] + 720: [703:So, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 712:Fr] + 721: [703:So, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 712:Fr] + 722: [703:So, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 712:Fr, 722:Fr] + 723: [703:So, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 712:Fr, 722:Fr] + 724: [703:So, 619:Fr, 642:Fr, 629:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 654:Fr, 693:Fr, 698:Fr, 712:Fr, 722:Fr] + 725: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 726: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 727: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 728: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 729: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 730: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 731: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 732: [732:So, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 733: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 734: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 735: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 736: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 737: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 738: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 739: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 740: [733:Ju, 629:Fr, 619:Fr, 654:Fr, 644:Fr, 642:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr, 676:Fr] + 741: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 742: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 743: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 744: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 745: [619:Fr, 629:Fr, 642:Fr, 654:Fr, 644:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 693:Fr, 698:Fr, 712:Fr] + 746: [629:Fr, 644:Fr, 642:Fr, 654:Fr, 693:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr, 698:Fr] + 747: [629:Fr, 644:Fr, 642:Fr, 654:Fr, 693:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr, 698:Fr] + 748: [629:Fr, 644:Fr, 642:Fr, 654:Fr, 693:Fr, 676:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr, 698:Fr] + 749: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 750: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 751: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 752: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 753: [753:So, 642:Fr, 676:Fr, 654:Fr, 644:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr, 693:Fr] + 754: [753:So, 642:Fr, 676:Fr, 654:Fr, 644:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr, 693:Fr] + 755: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 756: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 757: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 758: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 759: [642:Fr, 644:Fr, 676:Fr, 654:Fr, 693:Fr, 698:Fr, 681:Fr, 679:Fr, 722:Fr, 712:Fr] + 760: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr] + 761: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr] + 762: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr] + 763: [763:So, 644:Fr, 676:Fr, 679:Fr, 654:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr, 693:Fr] + 764: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr, 764:Fr] + 765: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr, 764:Fr] + 766: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr, 764:Fr] + 767: [644:Fr, 654:Fr, 676:Fr, 679:Fr, 693:Fr, 698:Fr, 681:Fr, 712:Fr, 722:Fr, 764:Fr] + 768: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 693:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr] + 769: [769:Se, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr] + 770: [769:Se, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr] + 771: [769:Se, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr] + 772: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 693:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr] + 773: [773:Se, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr] + 774: [773:Se, 774:So, 676:Fr, 712:Fr, 654:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr] + 775: [773:Se, 774:So, 676:Fr, 712:Fr, 654:Fr, 698:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr] + 776: [773:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr] + 777: [773:Se, 774:So, 777:Se, 712:Fr, 654:Fr, 776:So, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 676:Fr] + 778: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr] + 779: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr] + 780: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr] + 781: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr] + 782: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 681:Fr, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr] + 783: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr, 681:Fr] + 784: [777:Se, 774:So, 776:So, 712:Fr, 654:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 679:Fr, 698:Fr, 779:Fr, 681:Fr] + 785: [774:So, 654:Fr, 776:So, 712:Fr, 679:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr] + 786: [774:So, 654:Fr, 776:So, 712:Fr, 679:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr, 786:Fr] + 787: [774:So, 654:Fr, 776:So, 712:Fr, 679:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr, 786:Fr] + 788: [774:So, 654:Fr, 776:So, 712:Fr, 679:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr, 786:Fr] + 789: [774:So, 654:Fr, 776:So, 712:Fr, 679:Fr, 676:Fr, 783:So, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr, 786:Fr] + 790: [776:So, 654:Fr, 783:So, 712:Fr, 679:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr] + 791: [776:So, 654:Fr, 783:So, 712:Fr, 679:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr] + 792: [776:So, 654:Fr, 783:So, 712:Fr, 679:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr] + 793: [776:So, 654:Fr, 783:So, 712:Fr, 679:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 698:Fr, 779:Fr] + 794: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 795: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 796: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 797: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 798: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 799: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 800: [783:So, 654:Fr, 676:Fr, 712:Fr, 679:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 681:Fr, 779:Fr] + 801: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 802: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 803: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 804: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 805: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 806: [806:Ju, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr] + 807: [806:Ju, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr] + 808: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr] + 809: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr] + 810: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr] + 811: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr, 811:Fr] + 812: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr, 811:Fr] + 813: [808:Se, 679:Fr, 654:Fr, 712:Fr, 681:Fr, 676:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 698:Fr, 811:Fr] + 814: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 811:Fr] + 815: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 811:Fr] + 816: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 811:Fr] + 817: [654:Fr, 679:Fr, 676:Fr, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr, 811:Fr] + 818: [676:Fr, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 819: [676:Fr, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 820: [676:Fr, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 821: [676:Fr, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 693:Fr, 779:Fr] + 822: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr] + 823: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr] + 824: [824:Ju, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 825: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr] + 826: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr] + 827: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr] + 828: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 829: [829:Ju, 679:Fr, 828:So, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr, 811:Fr] + 830: [829:Ju, 679:Fr, 828:So, 712:Fr, 681:Fr, 698:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr, 811:Fr] + 831: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 832: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 833: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 834: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 835: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 836: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr] + 837: [828:So, 679:Fr, 698:Fr, 712:Fr, 681:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 693:Fr, 837:Fr] + 838: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 837:Fr] + 839: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 837:Fr] + 840: [679:Fr, 681:Fr, 698:Fr, 712:Fr, 693:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 779:Fr, 837:Fr] + 841: [681:Fr, 693:Fr, 698:Fr, 712:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 837:Fr] + 842: [681:Fr, 693:Fr, 698:Fr, 712:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 837:Fr] + 843: [681:Fr, 693:Fr, 698:Fr, 712:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 837:Fr] + 844: [681:Fr, 693:Fr, 698:Fr, 712:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 722:Fr, 837:Fr] + 845: [693:Fr, 712:Fr, 698:Fr, 722:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 837:Fr] + 846: [693:Fr, 712:Fr, 698:Fr, 722:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 837:Fr] + 847: [693:Fr, 712:Fr, 698:Fr, 722:Fr, 779:Fr, 811:Fr, 786:Fr, 764:Fr, 837:Fr] + 848: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr] + 849: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr] + 850: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr] + 851: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr] + 852: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr] + 853: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr] + 854: [854:Se, 849:So, 786:Fr, 712:Fr, 698:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 779:Fr] + 855: [854:Se, 849:So, 786:Fr, 712:Fr, 698:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 779:Fr, 855:Fr] + 856: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 857: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 858: [858:Se, 849:So, 786:Fr, 712:Fr, 698:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr, 779:Fr] + 859: [858:Se, 849:So, 786:Fr, 712:Fr, 698:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr, 779:Fr] + 860: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 861: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 862: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 863: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 864: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 865: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 866: [866:Ju, 849:So, 786:Fr, 712:Fr, 698:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr, 779:Fr] + 867: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 868: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 869: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 870: [849:So, 698:Fr, 786:Fr, 712:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 722:Fr, 855:Fr] + 871: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr] + 872: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr, 872:Fr] + 873: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr, 872:Fr] + 874: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr, 872:Fr] + 875: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr, 872:Fr] + 876: [698:Fr, 712:Fr, 786:Fr, 722:Fr, 779:Fr, 811:Fr, 837:Fr, 764:Fr, 855:Fr, 872:Fr] + 877: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr] + 878: [878:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr] + 879: [878:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr] + 880: [878:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr] + 881: [881:Ju, 878:So, 786:Fr, 764:Fr, 712:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 722:Fr] + 882: [881:Ju, 878:So, 786:Fr, 764:Fr, 712:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 722:Fr] + 883: [878:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr] + 884: [878:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 885: [878:So, 712:Fr, 885:So, 764:Fr, 722:Fr, 786:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr, 811:Fr] + 886: [878:So, 712:Fr, 885:So, 764:Fr, 722:Fr, 786:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr, 811:Fr] + 887: [878:So, 712:Fr, 885:So, 764:Fr, 722:Fr, 786:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr, 811:Fr] + 888: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 889: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 890: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 891: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 892: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 893: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 894: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 895: [885:So, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 779:Fr, 884:Fr] + 896: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 897: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 898: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 899: [899:Ju, 712:Fr, 786:Fr, 764:Fr, 722:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr, 779:Fr] + 900: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 901: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 902: [712:Fr, 722:Fr, 786:Fr, 764:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 855:Fr, 884:Fr] + 903: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr] + 904: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr] + 905: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr] + 906: [906:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 907: [906:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 908: [906:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 909: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr] + 910: [910:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 911: [910:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 912: [910:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 913: [910:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 914: [910:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 915: [915:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 916: [915:Ju, 722:Fr, 916:Ju, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 811:Fr] + 917: [915:Ju, 722:Fr, 916:Ju, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 811:Fr] + 918: [915:Ju, 722:Fr, 916:Ju, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 811:Fr] + 919: [916:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 920: [916:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr] + 921: [916:Ju, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 922: [916:Ju, 722:Fr, 922:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 923: [916:Ju, 722:Fr, 922:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 924: [916:Ju, 722:Fr, 922:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 925: [916:Ju, 722:Fr, 922:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 926: [916:Ju, 722:Fr, 922:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 927: [922:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 928: [922:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 929: [922:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 930: [922:So, 722:Fr, 930:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 931: [922:So, 722:Fr, 930:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 932: [922:So, 722:Fr, 930:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 933: [922:So, 722:Fr, 930:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 934: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 935: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 936: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 937: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 938: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 939: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 940: [930:So, 722:Fr, 934:So, 855:Fr, 764:Fr, 786:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr, 811:Fr] + 941: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 942: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 943: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 944: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 945: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 946: [934:So, 722:Fr, 786:Fr, 855:Fr, 764:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 779:Fr, 921:Fr] + 947: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 921:Fr] + 948: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 921:Fr] + 949: [722:Fr, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 903:Fr, 921:Fr] + 950: [950:Se, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr] + 951: [950:Se, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr] + 952: [950:Se, 764:Fr, 786:Fr, 855:Fr, 779:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr] + 953: [764:Fr, 779:Fr, 786:Fr, 855:Fr, 903:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr] + 954: [764:Fr, 779:Fr, 786:Fr, 855:Fr, 903:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr] + 955: [764:Fr, 779:Fr, 786:Fr, 855:Fr, 903:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr] + 956: [764:Fr, 779:Fr, 786:Fr, 855:Fr, 903:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr] + 957: [764:Fr, 779:Fr, 786:Fr, 855:Fr, 903:Fr, 811:Fr, 837:Fr, 872:Fr, 884:Fr, 921:Fr] + 958: [779:Fr, 855:Fr, 786:Fr, 872:Fr, 903:Fr, 811:Fr, 837:Fr, 921:Fr, 884:Fr] + 959: [779:Fr, 855:Fr, 786:Fr, 872:Fr, 903:Fr, 811:Fr, 837:Fr, 921:Fr, 884:Fr] + 960: [779:Fr, 855:Fr, 786:Fr, 872:Fr, 903:Fr, 811:Fr, 837:Fr, 921:Fr, 884:Fr] + 961: [779:Fr, 855:Fr, 786:Fr, 872:Fr, 903:Fr, 811:Fr, 837:Fr, 921:Fr, 884:Fr] + 962: [779:Fr, 855:Fr, 786:Fr, 872:Fr, 903:Fr, 811:Fr, 837:Fr, 921:Fr, 884:Fr] + 963: [786:Fr, 855:Fr, 811:Fr, 872:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr] + 964: [964:Ju, 786:Fr, 811:Fr, 855:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 872:Fr] + 965: [964:Ju, 786:Fr, 811:Fr, 855:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 872:Fr] + 966: [964:Ju, 786:Fr, 811:Fr, 855:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 872:Fr, 966:Fr] + 967: [786:Fr, 855:Fr, 811:Fr, 872:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 966:Fr] + 968: [786:Fr, 855:Fr, 811:Fr, 872:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 966:Fr] + 969: [786:Fr, 855:Fr, 811:Fr, 872:Fr, 903:Fr, 884:Fr, 837:Fr, 921:Fr, 966:Fr] + 970: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr] + 971: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr] + 972: [972:Se, 811:Fr, 837:Fr, 855:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 872:Fr] + 973: [972:Se, 811:Fr, 837:Fr, 855:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 872:Fr] + 974: [972:Se, 811:Fr, 837:Fr, 855:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 872:Fr] + 975: [972:Se, 811:Fr, 837:Fr, 855:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 872:Fr] + 976: [972:Se, 811:Fr, 837:Fr, 855:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 872:Fr] + 977: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr] + 978: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr] + 979: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 979:Fr] + 980: [811:Fr, 855:Fr, 837:Fr, 872:Fr, 903:Fr, 884:Fr, 966:Fr, 921:Fr, 979:Fr] + 981: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr] + 982: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr] + 983: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr] + 984: [984:Se, 837:Fr, 884:Fr, 855:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr, 872:Fr] + 985: [984:Se, 837:Fr, 884:Fr, 855:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr, 872:Fr] + 986: [984:Se, 837:Fr, 884:Fr, 855:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr, 872:Fr] + 987: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr] + 988: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr] + 989: [989:Se, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr] + 990: [989:Se, 990:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 991: [989:Se, 990:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 992: [989:Se, 990:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 993: [990:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr] + 994: [990:So, 994:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 995: [990:So, 994:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 996: [990:So, 994:So, 884:Fr, 872:Fr, 837:Fr, 979:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr] + 997: [990:So, 994:So, 997:So, 872:Fr, 837:Fr, 884:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr, 979:Fr] + 998: [990:So, 994:So, 997:So, 872:Fr, 837:Fr, 884:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr, 979:Fr] + 999: [990:So, 994:So, 997:So, 872:Fr, 837:Fr, 884:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 855:Fr, 979:Fr] + 1000: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 884:Fr, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr] + 1001: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr] + 1002: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr] + 1003: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So] + 1004: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So] + 1005: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 966:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So] + 1006: [1006:Se, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr] + 1007: [1006:Se, 837:Fr, 1007:Ju, 872:Fr, 855:Fr, 1001:So, 994:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 997:So] + 1008: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1009: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1010: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1011: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1012: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1013: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1014: [1007:Ju, 837:Fr, 994:So, 872:Fr, 855:Fr, 1001:So, 997:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 966:Fr, 1008:Fr] + 1015: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1016: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1017: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1018: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1019: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1020: [994:So, 837:Fr, 997:So, 872:Fr, 855:Fr, 1001:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 1003:So, 1008:Fr, 966:Fr] + 1021: [997:So, 837:Fr, 1001:So, 872:Fr, 855:Fr, 1003:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 966:Fr, 1008:Fr] + 1022: [997:So, 837:Fr, 1001:So, 872:Fr, 855:Fr, 1003:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 966:Fr, 1008:Fr] + 1023: [997:So, 837:Fr, 1001:So, 872:Fr, 855:Fr, 1003:So, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 884:Fr, 966:Fr, 1008:Fr] + 1024: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1025: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1026: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1027: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1028: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1029: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1030: [1024:Se, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1031: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr] + 1032: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr] + 1033: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So] + 1034: [1034:Se, 837:Fr, 1033:Ju, 872:Fr, 855:Fr, 884:Fr, 1001:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1003:So] + 1035: [1034:Se, 837:Fr, 1033:Ju, 872:Fr, 855:Fr, 884:Fr, 1001:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1003:So] + 1036: [1034:Se, 837:Fr, 1033:Ju, 872:Fr, 855:Fr, 884:Fr, 1001:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1003:So] + 1037: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1037:Fr] + 1038: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1037:Fr, 1038:Fr] + 1039: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1037:Fr, 1038:Fr] + 1040: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1037:Fr, 1038:Fr] + 1041: [1033:Ju, 837:Fr, 1001:So, 872:Fr, 855:Fr, 884:Fr, 1003:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1015:So, 1037:Fr, 1038:Fr] + 1042: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr] + 1043: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1044: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1045: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1046: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1047: [1047:Ju, 1001:So, 1003:So, 837:Fr, 855:Fr, 884:Fr, 1015:So, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr, 921:Fr] + 1048: [1047:Ju, 1001:So, 1003:So, 837:Fr, 855:Fr, 884:Fr, 1015:So, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr, 921:Fr] + 1049: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1050: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1051: [1051:Se, 1001:So, 1003:So, 837:Fr, 855:Fr, 884:Fr, 1015:So, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr, 921:Fr] + 1052: [1051:Se, 1001:So, 1003:So, 837:Fr, 855:Fr, 884:Fr, 1015:So, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr, 921:Fr] + 1053: [1051:Se, 1001:So, 1003:So, 837:Fr, 855:Fr, 884:Fr, 1015:So, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr, 921:Fr] + 1054: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1055: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1056: [1001:So, 837:Fr, 1003:So, 872:Fr, 855:Fr, 884:Fr, 1015:So, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1037:Fr, 1043:Fr] + 1057: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1058: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1059: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1060: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1061: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1062: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1063: [1003:So, 837:Fr, 1015:So, 872:Fr, 855:Fr, 884:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 966:Fr, 1038:Fr, 1043:Fr] + 1064: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1065: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1066: [1066:Ju, 837:Fr, 1015:So, 872:Fr, 855:Fr, 966:Fr, 884:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1037:Fr] + 1067: [1066:Ju, 837:Fr, 1015:So, 872:Fr, 855:Fr, 966:Fr, 884:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1037:Fr, 1067:Fr] + 1068: [1066:Ju, 837:Fr, 1015:So, 872:Fr, 855:Fr, 966:Fr, 884:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1037:Fr, 1067:Fr] + 1069: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1070: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1071: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1072: [1015:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1073: [1015:So, 1073:So, 884:Fr, 837:Fr, 855:Fr, 966:Fr, 1037:Fr, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr, 921:Fr] + 1074: [1015:So, 1073:So, 884:Fr, 837:Fr, 855:Fr, 966:Fr, 1037:Fr, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr, 921:Fr] + 1075: [1015:So, 1073:So, 884:Fr, 837:Fr, 855:Fr, 966:Fr, 1037:Fr, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr, 921:Fr] + 1076: [1015:So, 1073:So, 884:Fr, 837:Fr, 855:Fr, 966:Fr, 1037:Fr, 872:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr, 921:Fr] + 1077: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1078: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1079: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1080: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1081: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1082: [1073:So, 837:Fr, 884:Fr, 872:Fr, 855:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 903:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1083: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1084: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1085: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1086: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1087: [837:Fr, 855:Fr, 884:Fr, 872:Fr, 903:Fr, 966:Fr, 1037:Fr, 921:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr, 1038:Fr] + 1088: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1089: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1090: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1091: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1092: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1093: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1094: [855:Fr, 872:Fr, 884:Fr, 921:Fr, 903:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 979:Fr, 1008:Fr, 1043:Fr] + 1095: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1096: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1097: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1098: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1099: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1100: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1101: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1102: [872:Fr, 903:Fr, 884:Fr, 921:Fr, 979:Fr, 966:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1008:Fr] + 1103: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1104: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1105: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1106: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1107: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1108: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1109: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1110: [884:Fr, 903:Fr, 966:Fr, 921:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 987:Fr, 1067:Fr, 1043:Fr] + 1111: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1112: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1113: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1114: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1115: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1116: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1117: [903:Fr, 921:Fr, 966:Fr, 987:Fr, 979:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1118: [921:Fr, 979:Fr, 966:Fr, 987:Fr, 1067:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr] + 1119: [921:Fr, 979:Fr, 966:Fr, 987:Fr, 1067:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr] + 1120: [921:Fr, 979:Fr, 966:Fr, 987:Fr, 1067:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr] + 1121: [921:Fr, 979:Fr, 966:Fr, 987:Fr, 1067:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr] + 1122: [921:Fr, 979:Fr, 966:Fr, 987:Fr, 1067:Fr, 1008:Fr, 1037:Fr, 1038:Fr, 1043:Fr] + 1123: [966:Fr, 979:Fr, 1008:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1037:Fr, 1038:Fr] + 1124: [966:Fr, 979:Fr, 1008:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1037:Fr, 1038:Fr] + 1125: [966:Fr, 979:Fr, 1008:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1037:Fr, 1038:Fr] + 1126: [966:Fr, 979:Fr, 1008:Fr, 987:Fr, 1067:Fr, 1043:Fr, 1037:Fr, 1038:Fr] + 1127: [979:Fr, 987:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr, 1037:Fr] + 1128: [979:Fr, 987:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr, 1037:Fr] + 1129: [979:Fr, 987:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr, 1037:Fr] + 1130: [979:Fr, 987:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr, 1037:Fr] + 1131: [987:Fr, 1037:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr] + 1132: [987:Fr, 1037:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr] + 1133: [987:Fr, 1037:Fr, 1008:Fr, 1038:Fr, 1067:Fr, 1043:Fr] + 1134: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1135: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1136: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1137: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1138: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1139: [1008:Fr, 1037:Fr, 1043:Fr, 1038:Fr, 1067:Fr] + 1140: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1141: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1142: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1143: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1144: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1145: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1146: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1147: [1037:Fr, 1038:Fr, 1043:Fr, 1067:Fr] + 1148: [1038:Fr, 1067:Fr, 1043:Fr] + 1149: [1038:Fr, 1067:Fr, 1043:Fr] + 1150: [1038:Fr, 1067:Fr, 1043:Fr] + 1151: [1038:Fr, 1067:Fr, 1043:Fr] + 1152: [1038:Fr, 1067:Fr, 1043:Fr] + 1153: [1038:Fr, 1067:Fr, 1043:Fr] + 1154: [1038:Fr, 1067:Fr, 1043:Fr] + 1155: [1043:Fr, 1067:Fr] + 1156: [1043:Fr, 1067:Fr] + 1157: [1043:Fr, 1067:Fr] + 1158: [1067:Fr] + 1159: [1067:Fr] + 1160: [1067:Fr] + 1161: [1067:Fr] + 1162: [1067:Fr] + 1163: [1067:Fr] + 1164: [1067:Fr] + Customer Total Longest Average Wait + Senior 47 12 3.4893617021276597 + Junior 56 22 5.0 + Sophomor 53 84 20.830188679245282 + Freshman 55 250 123.6 + + ******************************************/ \ No newline at end of file diff --git a/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.class b/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.class new file mode 100644 index 0000000..bba7203 Binary files /dev/null and b/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.class differ diff --git a/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.java b/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.java new file mode 100644 index 0000000..07c9213 --- /dev/null +++ b/06 Stacks _ Queues/09 LunchRoom/MyPriorityQueue.java @@ -0,0 +1,37 @@ +//Name: B6-24 +//Date: 1/23/20 +//extension to LunchRoom +//implements java.util.PriorityQueue +// uses an ArrayList in sorted order +//LunchRoom is the driver class + +import java.util.*; +public class MyPriorityQueue +{ + private List pq; + + public MyPriorityQueue() { + pq = new ArrayList(); + } + + public void add(E add) { + pq.add(add); + Collections.sort(pq); + } + + public E remove() { + return pq.remove(0); + } + + public E peek() { + return pq.get(0); + } + + public boolean isEmpty() { + return pq.isEmpty(); + } + + public String toString() { + return pq.toString(); + } +} \ No newline at end of file diff --git a/06 Stacks _ Queues/09 LunchRoom/Priority Queues.doc b/06 Stacks _ Queues/09 LunchRoom/Priority Queues.doc new file mode 100644 index 0000000..2812202 Binary files /dev/null and b/06 Stacks _ Queues/09 LunchRoom/Priority Queues.doc differ diff --git a/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.class b/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.class new file mode 100644 index 0000000..faaf2c8 Binary files /dev/null and b/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.class differ diff --git a/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.java b/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.java new file mode 100644 index 0000000..620ede1 --- /dev/null +++ b/06 Stacks _ Queues/09 LunchRoom/PriorityQueueDemo.java @@ -0,0 +1,25 @@ +import java.util.*; +public class PriorityQueueDemo +{ + public static void main(String [] args) + { + PriorityQueue pq = new PriorityQueue(); + //MyPriorityQueue pq = new MyPriorityQueue(); + pq.add(new Customer(0,0)); + pq.add(new Customer(5,3)); + pq.add(new Customer(1,0)); + pq.add(new Customer(5,2)); + pq.add(new Customer(2,0)); +// pq.add("b"); +// pq.add("a"); +// pq.add("d"); +// pq.add("b"); +// pq.add("a"); +// pq.add("d"); +// pq.add("b"); +// pq.add("a"); + while( !pq.isEmpty() ) + System.out.print( pq.remove() + " "); + } +} + diff --git a/06 Stacks _ Queues/10 S, Q, PQ/Implementing S, Q, PQ.doc b/06 Stacks _ Queues/10 S, Q, PQ/Implementing S, Q, PQ.doc new file mode 100644 index 0000000..81493d8 Binary files /dev/null and b/06 Stacks _ Queues/10 S, Q, PQ/Implementing S, Q, PQ.doc differ diff --git a/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.class b/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.class new file mode 100644 index 0000000..c194c75 Binary files /dev/null and b/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.class differ diff --git a/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.java b/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.java new file mode 100644 index 0000000..7b146dc --- /dev/null +++ b/06 Stacks _ Queues/11 MyPriorityQueue/MyPriorityQueue.java @@ -0,0 +1,33 @@ +//Name: +//Date: +//extension to LunchRoom +//implements java.util.PriorityQueue +// uses an ArrayList in sorted order +//LunchRoom is the driver class + +import java.util.*; +public class MyPriorityQueue +{ + private List pq; + + public MyPriorityQueue() { + pq = new ArrayList(); + } + + public void add(E add) { + pq.add(E); + Collections.sort(pq); + } + + public E remove() { + return pq.remove(0); + } + + public E peek() { + return pq[0]; + } + + public boolean isEmpty() { + return pq.isEmpty(); + } +} \ No newline at end of file diff --git a/06 Stacks _ Queues/12 Assembly Line/Assembly Line.doc b/06 Stacks _ Queues/12 Assembly Line/Assembly Line.doc new file mode 100644 index 0000000..5680964 Binary files /dev/null and b/06 Stacks _ Queues/12 Assembly Line/Assembly Line.doc differ diff --git a/06 Stacks _ Queues/12 Assembly Line/AssemblyLine.class b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine.class new file mode 100644 index 0000000..453bbad Binary files /dev/null and b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine.class differ diff --git a/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.class b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.class new file mode 100644 index 0000000..5223e2b Binary files /dev/null and b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.class differ diff --git a/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.java b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.java new file mode 100644 index 0000000..3348ce5 --- /dev/null +++ b/06 Stacks _ Queues/12 Assembly Line/AssemblyLine_Driver.java @@ -0,0 +1,110 @@ +//Name: B6-24 +//Date: 1/24/20 + import java.util.*; + + public class AssemblyLine_Driver + { + static int NDISKS = 50; + static int MAXRADIUS = 100; + public static void main(String[] args) + { + AssemblyLine a = new AssemblyLine(NDISKS, MAXRADIUS); + a.showInput(); + a.process(); + a.showOutput(); + } + } + + class AssemblyLine + { + private Queue assemblyLineIn; + private Queue assemblyLineOut; + private Pyramid robotArm; + /** + * initializes this object so the assemblyLineIn contains + * nDisks with random radii; assemblyLineOut is initialized to * an empty Queue; robotArm is initialized to an empty Pyramid. + **/ + //Part A + public AssemblyLine( int nDisks, int maxRadius ) + { + assemblyLineIn = new LinkedList(); + assemblyLineOut = new LinkedList(); + robotArm = new Pyramid(); + + for (int i = 0; i < nDisks; i++) + assemblyLineIn.add(new Disk((int) (Math.random() * maxRadius))); + + } + + /** + * "flips over" the pyramid in the robotArm and adds it to the + * assemblyLineOut queue. + * Precondition: robotArm is not empty and holds an inverted + * pyramid of disks + **/ + // Part B + private void unloadRobot() + { + Pyramid p = new Pyramid(); + while (!robotArm.isEmpty()) + p.add(robotArm.pop()); + assemblyLineOut.add(p); + + } + + /** + * processes all disks from assemblyLineIn; a disk is processed + * as follows: if robotArm is not empty and the next disk does + * not fit on top of robotArm (which must be an inverted + * pyramid) then robotArm is unloaded first; the disk from + * assemblyLineIn is added to robotArm; when all the disks + * have been retrieved from assemblyLineIn, robotArm is unloaded. + * Precondition: robotArm is empty; + * assemblyLineOut is empty + **/ + //Part C + public void process() + { + while (!assemblyLineIn.isEmpty()) { + Disk disk = assemblyLineIn.remove(); + if (!robotArm.isEmpty() && disk.compareTo(robotArm.peek()) < 0) + unloadRobot(); + robotArm.push(disk); + } + + + unloadRobot(); + } + + public void showInput() + { + System.out.println(assemblyLineIn); + } + public void showOutput() + { + System.out.println(assemblyLineOut); + } + } + //Disk is standard and straightforward. + class Disk implements Comparable + { + private int num; + public Disk (int i) { + num = i; + } + + public int compareTo (Disk other) { + return num - other.num; + } + + public String toString () { + return num + ""; + } + } + //Pyramid is sly. + class Pyramid extends Stack + { + public Pyramid() { + super(); + } + } \ No newline at end of file diff --git a/06 Stacks _ Queues/12 Assembly Line/Disk.class b/06 Stacks _ Queues/12 Assembly Line/Disk.class new file mode 100644 index 0000000..66d5298 Binary files /dev/null and b/06 Stacks _ Queues/12 Assembly Line/Disk.class differ diff --git a/06 Stacks _ Queues/12 Assembly Line/Pyramid.class b/06 Stacks _ Queues/12 Assembly Line/Pyramid.class new file mode 100644 index 0000000..054adc8 Binary files /dev/null and b/06 Stacks _ Queues/12 Assembly Line/Pyramid.class differ diff --git a/06 Stacks _ Queues/AP AB Quick Reference--2 col.doc b/06 Stacks _ Queues/AP AB Quick Reference--2 col.doc new file mode 100644 index 0000000..f532b82 Binary files /dev/null and b/06 Stacks _ Queues/AP AB Quick Reference--2 col.doc differ diff --git a/06 Stacks _ Queues/DS_Jan.pdf b/06 Stacks _ Queues/DS_Jan.pdf new file mode 100644 index 0000000..ce6a471 Binary files /dev/null and b/06 Stacks _ Queues/DS_Jan.pdf differ diff --git a/07 Trees/01 TreeLab/TreeLab.class b/07 Trees/01 TreeLab/TreeLab.class new file mode 100644 index 0000000..9794148 Binary files /dev/null and b/07 Trees/01 TreeLab/TreeLab.class differ diff --git a/07 Trees/01 TreeLab/TreeLab.java b/07 Trees/01 TreeLab/TreeLab.java new file mode 100644 index 0000000..edef523 --- /dev/null +++ b/07 Trees/01 TreeLab/TreeLab.java @@ -0,0 +1,281 @@ +// Name: B6-24 +// Date: 1/29/20 + +import java.util.*; + +public class TreeLab +{ + public static TreeNode root = null; + public static String s = "XCOMPUTERSCIENCE"; + //public static String s = "XThomasJeffersonHighSchool"; + //public static String s = "XAComputerScienceTreeHasItsRootAtTheTop"; + //public static String s = "XA"; //comment out lines 44-46 below + //public static String s = "XAF"; //comment out lines 44-46 below + //public static String s = "XAFP"; //comment out lines 44-46 below + //public static String s = "XDFZM"; //comment out lines 44-46 below + + public static void main(String[] args) + { + root = buildTree( root, s ); + System.out.print( display( root, 0) ); + + System.out.print("\nPreorder: " + preorderTraverse(root)); + System.out.print("\nInorder: " + inorderTraverse(root)); + System.out.print("\nPostorder: " + postorderTraverse(root)); + + System.out.println("\n\nNodes = " + countNodes(root)); + System.out.println("Leaves = " + countLeaves(root)); + System.out.println("Only children = " + countOnlys(root)); + System.out.println("Grandparents = " + countGrandParents(root)); + + System.out.println("\nHeight of tree = " + height(root)); + System.out.println("Longest path = " + longestPath(root)); + System.out.println("Min = " + min(root)); + System.out.println("Max = " + max(root)); + + System.out.println("\nBy Level: "); + System.out.println(displayLevelOrder(root)); + } + + public static TreeNode buildTree(TreeNode root, String s) + { + root = new TreeNode("" + s.charAt(1), null, null); + for(int pos = 2; pos < s.length(); pos++) + insert(root, "" + s.charAt(pos), pos, + (int)(1 + Math.log(pos) / Math.log(2))); + insert(root, "A", 17, 5); + insert(root, "B", 18, 5); + insert(root, "C", 37, 6); //B's right child + return root; + } + + public static void insert(TreeNode t, String s, int pos, int level) + { + TreeNode p = t; + for(int k = level - 2; k > 0; k--) + { + if((pos & (1 << k)) == 0) + p = p.getLeft(); + else + p = p.getRight(); + } + if((pos & 1) == 0) + p.setLeft(new TreeNode(s, null, null)); + else + p.setRight(new TreeNode(s, null, null)); + } + + private static String display(TreeNode t, int level) + { + // turn your head towards left shoulder visualize tree + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public static String preorderTraverse(TreeNode t) + { + String toReturn = ""; + if(t == null) + return ""; + toReturn += t.getValue() + " "; //preorder visit + toReturn += preorderTraverse(t.getLeft()); //recurse left + toReturn += preorderTraverse(t.getRight()); //recurse right + return toReturn; + } + + public static String inorderTraverse(TreeNode t) + { + String toReturn = ""; + if(t == null) + return ""; + toReturn += inorderTraverse(t.getLeft()); + toReturn += t.getValue() + " "; //preorder visit + toReturn += inorderTraverse(t.getRight()); //recurse right + return toReturn; + } + + public static String postorderTraverse(TreeNode t) + { + String toReturn = ""; + if(t == null) + return ""; + + toReturn += postorderTraverse(t.getLeft()); //recurse left + toReturn += postorderTraverse(t.getRight()); //recurse right + toReturn += t.getValue() + " "; //preorder visit + + return toReturn; + } + + public static int countNodes(TreeNode t) + { + return inorderTraverse(t).split(" ").length; + } + + public static int countLeaves(TreeNode t) + { + int toReturn = 0; + if (t == null) + return 0; + + if (t.getLeft() == null && t.getRight() == null) + return 1; + + toReturn += countLeaves(t.getLeft()) + countLeaves(t.getRight()); + return toReturn; + } + + /* there are clever ways and hard ways to count grandparents */ + public static int countGrandParents(TreeNode t) + { + if (t == null) return 0; + + int toReturn = 0; + if (height(t) >= 2) toReturn++; + if (height(t.getLeft()) >= 2) toReturn += countGrandParents(t.getLeft()); + if (height(t.getRight()) >= 2) toReturn += countGrandParents(t.getRight()); + + return toReturn; + } + + public static int countOnlys(TreeNode t) + { + if (t == null) + return 0; + + + if ((t.getRight() != null && t.getLeft() == null) || t.getRight() == null && t.getLeft() != null) + return 1 + countOnlys(t.getRight()) + countOnlys(t.getLeft()); + + + return countOnlys(t.getRight()) + countOnlys(t.getLeft()); + } + + /* returns the max of the heights to the left and the heights to the right + returns -1 in case the tree is null + */ + public static int height(TreeNode t) + { + if (t == null) + return -1; + + return Math.max(height(t.getLeft()), height(t.getRight())) + 1; + } + + /* return the max of the sum of the heights to the left and the heights to the right + */ + public static int longestPath(TreeNode t) + { + if (t == null) + return 0; + return Math.max(height(t.getRight()) + height(t.getLeft()) + 2, Math.max(longestPath(t.getRight()), longestPath(t.getLeft()))); + } + + /* Object must be cast to Comparable in order to call .compareTo + */ + @SuppressWarnings("unchecked") + public static Object min(TreeNode t) + { + if (t == null) return t; + + Comparable min = (Comparable) t.getValue(); + Comparable right = (Comparable) min(t.getRight()); + Comparable left = (Comparable) min(t.getLeft()); + + if (right != null && min.compareTo(right) > 0) + min = right; + + if (left != null && min.compareTo(left) > 0) + min = left; + + return min; + } + + /* Object must be cast to Comparable in order to call .compareTo + */ + @SuppressWarnings("unchecked") + public static Object max(TreeNode t) + { + if (t == null) return t; + + Comparable max = (Comparable) t.getValue(); + Comparable right = (Comparable) max(t.getRight()); + Comparable left = (Comparable) max(t.getLeft()); + + if (right != null && max.compareTo(right) < 0) + max = right; + + if (left != null && max.compareTo(left) < 0) + max = left; + + return max; + } + + /* This method is not recursive. Use a local queue + * to store the children of the current TreeNode. + */ + public static String displayLevelOrder(TreeNode t) + { + if (t == null) + return ""; + String out = ""; + Queue q = new LinkedList<>(); + q.add(t); + while (!q.isEmpty()) { + TreeNode temp = q.remove(); + if (temp.getLeft() != null) + q.add(temp.getLeft()); + if (temp.getRight() != null) + q.add(temp.getRight()); + out += temp.getValue().toString(); + } + + return out; + } +} + +/***************************** ********************** + ----jGRASP exec: java TreeLab + E + E + C + M + N + T + E + C + I + U + C + O + S + C + B + P + A + R + + Preorder: C O P R A S B C U C I M T E N E C E + Inorder: R A P B C S O C U I C E T N M C E E + Postorder: A R C B S P C I U O E N T C E E M C + + Nodes = 18 + Leaves = 8 + Only children = 3 + Grandparents = 5 + + Height of tree = 5 + Longest path = 8 + Min = A + Max = U + + By Level: + COMPUTERSCIENCEABC + *******************************************************/ diff --git a/07 Trees/01 TreeLab/TreeNode.class b/07 Trees/01 TreeLab/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/01 TreeLab/TreeNode.class differ diff --git a/07 Trees/01 TreeLab/TreeNode.java b/07 Trees/01 TreeLab/TreeNode.java new file mode 100644 index 0000000..c281380 --- /dev/null +++ b/07 Trees/01 TreeLab/TreeNode.java @@ -0,0 +1,51 @@ +/* TreeNode class for the AP Exams + */ +public class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/07 Trees/01 TreeLab/Trees Intro.doc b/07 Trees/01 TreeLab/Trees Intro.doc new file mode 100644 index 0000000..536b7e4 Binary files /dev/null and b/07 Trees/01 TreeLab/Trees Intro.doc differ diff --git a/07 Trees/01 TreeLab/Trees Worksheet.doc b/07 Trees/01 TreeLab/Trees Worksheet.doc new file mode 100644 index 0000000..7bde618 Binary files /dev/null and b/07 Trees/01 TreeLab/Trees Worksheet.doc differ diff --git a/07 Trees/01 TreeLab/Trees resource.ppt b/07 Trees/01 TreeLab/Trees resource.ppt new file mode 100644 index 0000000..0c3c108 Binary files /dev/null and b/07 Trees/01 TreeLab/Trees resource.ppt differ diff --git a/07 Trees/01a Practice_It/Practice_It _ Trees.doc b/07 Trees/01a Practice_It/Practice_It _ Trees.doc new file mode 100644 index 0000000..24fc3a4 Binary files /dev/null and b/07 Trees/01a Practice_It/Practice_It _ Trees.doc differ diff --git a/07 Trees/02 BXT/BXT.class b/07 Trees/02 BXT/BXT.class new file mode 100644 index 0000000..7b1f1b1 Binary files /dev/null and b/07 Trees/02 BXT/BXT.class differ diff --git a/07 Trees/02 BXT/BXT.docx b/07 Trees/02 BXT/BXT.docx new file mode 100644 index 0000000..d96b066 Binary files /dev/null and b/07 Trees/02 BXT/BXT.docx differ diff --git a/07 Trees/02 BXT/BXT.java b/07 Trees/02 BXT/BXT.java new file mode 100644 index 0000000..56be452 --- /dev/null +++ b/07 Trees/02 BXT/BXT.java @@ -0,0 +1,150 @@ +// Name: B6-24 +// Date: 2/6/20 + +/* Represents a binary expression tree. + * The BXT builds itself from postorder expressions. It can + * evaluate and print itself. Also prints inorder and postorder strings. + */ + +import java.util.*; + +class BXT +{ + private TreeNode root; + + public BXT() + { + root = null; + } + public TreeNode getRoot() //for Grade-It + { + return root; + } + + public void buildTree(String str) + { + Stack s = new Stack<>(); + TreeNode temp; + + for (String token : str.split(" ")) { + if (!isOperator(token)) + s.push(new TreeNode(token, null, null)); + else { + temp = s.pop(); + s.push(new TreeNode(token, s.pop(), temp)); + } + } + + root = s.pop(); + } + + public double evaluateTree() + { + return evaluateNode(root); + } + + private double evaluateNode(TreeNode t) //recursive + { + if (t == null) + return 0.0; + + String token = (String) t.getValue(); + + if (isOperator(token)) { + return computeTerm(token, evaluateNode(t.getLeft()), evaluateNode(t.getRight())); + } else + return Double.valueOf(token); + } + + private double computeTerm(String s, double a, double b) + { + switch(s) { + case "+": + return a+b; + case "-": + return a-b; + case "*": + return a*b; + case "/": + return a/b; + default: + return -1.0; + } + } + + private boolean isOperator(String s) + { + if ("+-/*".contains(s)) + return true; + return false; + } + + public String display() + { + return display(root, 0); + } + + private String display(TreeNode t, int level) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public String inorderTraverse() + { + return inorderTraverse(root); + } + + private String inorderTraverse(TreeNode t) + { + if (t == null) + return ""; + return inorderTraverse(t.getLeft()) + t.getValue() + " " + inorderTraverse(t.getRight()); + } + + public String preorderTraverse() + { + return preorderTraverse(root); + } + + private String preorderTraverse(TreeNode root) + { + if (root == null) + return ""; + return root.getValue() + " " + preorderTraverse(root.getLeft()) + preorderTraverse(root.getRight()); + } + + /* extension */ + public String inorderTraverseWithParentheses() + { + return inorderTraverseWithParentheses(root); + } + + private String inorderTraverseWithParentheses(TreeNode t) + { + if (t == null) + return ""; + + String toReturn = ""; + if (t.getLeft() != null && isOperator((String) t.getLeft().getValue())) + toReturn += " (" + inorderTraverseWithParentheses(t.getLeft()) + " )"; + else + toReturn += inorderTraverseWithParentheses(t.getLeft()); + + toReturn += " " + t.getValue(); + + if (t.getRight() != null && isOperator((String) t.getRight().getValue())) + toReturn += " (" + inorderTraverseWithParentheses(t.getRight()) + " )"; + else + toReturn += inorderTraverseWithParentheses(t.getRight()); + + return toReturn; + } +} \ No newline at end of file diff --git a/07 Trees/02 BXT/BXT_Driver.class b/07 Trees/02 BXT/BXT_Driver.class new file mode 100644 index 0000000..8ddf512 Binary files /dev/null and b/07 Trees/02 BXT/BXT_Driver.class differ diff --git a/07 Trees/02 BXT/BXT_Driver.java b/07 Trees/02 BXT/BXT_Driver.java new file mode 100644 index 0000000..7a727d1 --- /dev/null +++ b/07 Trees/02 BXT/BXT_Driver.java @@ -0,0 +1,76 @@ +import java.util.*; + +/* Driver for the BXT class. + * Input: a postfix string with space delimited tokens. + */ +public class BXT_Driver +{ + public static void main(String[] args) + { + ArrayList postExp = new ArrayList(); + postExp.add("2 3 + 5 / 4 5 - *"); + + for( String postfix : postExp ) + { + System.out.println("Postfix Exp: " + postfix); + BXT tree = new BXT(); + tree.buildTree( postfix ); + System.out.println("BXT: "); + System.out.println( tree.display() ); + System.out.print("Infix order: "); + System.out.println( tree.inorderTraverse() ); + System.out.print("Prefix order: "); + System.out.println( tree.preorderTraverse() ); + System.out.print("Evaluates to " + tree.evaluateTree()); + System.out.println( "\n------------------------"); + } + + /* extension: prints parentheses */ + BXT tree2 = new BXT(); + //tree2.buildTree("3 5 + 4 *"); // "( 3 + 5 ) * 4" + System.out.println(tree2.inorderTraverseWithParentheses()); + } +} + +/*************************************** + + Postfix Exp: 14 -5 / + -5 + / + 14 + Infix order: 14 / -5 + Prefix order: / 14 -5 + Evaluates to -2.8 + ------------------------ + Postfix Exp: 20.0 3.0 -4.0 + * + -4.0 + + + 3.0 + * + 20.0 + Infix order: 20.0 * 3.0 + -4.0 + Prefix order: * 20.0 + 3.0 -4.0 + Evaluates to -20.0 + ------------------------ + Postfix Exp: 2 3 + 5 / 4 5 - * + 5 + - + 4 + * + 5 + / + 3 + + + 2 + Infix order: 2 + 3 / 5 * 4 - 5 + Prefix order: * / + 2 3 5 - 4 5 + Evaluates to -1.0 + ------------------------ + Postfix Exp: 5.6 + 5.6 + Infix order: 5.6 + Prefix order: 5.6 + Evaluates to 5.6 + ------------------------ + + *******************************************/ \ No newline at end of file diff --git a/07 Trees/02 BXT/TreeNode.class b/07 Trees/02 BXT/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/02 BXT/TreeNode.class differ diff --git a/07 Trees/02 BXT/TreeNode.java b/07 Trees/02 BXT/TreeNode.java new file mode 100644 index 0000000..c281380 --- /dev/null +++ b/07 Trees/02 BXT/TreeNode.java @@ -0,0 +1,51 @@ +/* TreeNode class for the AP Exams + */ +public class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/07 Trees/03 BST/BST.class b/07 Trees/03 BST/BST.class new file mode 100644 index 0000000..a6c7b53 Binary files /dev/null and b/07 Trees/03 BST/BST.class differ diff --git a/07 Trees/03 BST/BST.java b/07 Trees/03 BST/BST.java new file mode 100644 index 0000000..30dde44 --- /dev/null +++ b/07 Trees/03 BST/BST.java @@ -0,0 +1,160 @@ +//Name: B6-24 +//Date: 2/6/20 + +interface BSTinterface +{ + public int size(); + public boolean contains(String obj); + public void add(String obj); + //public void addBalanced(String obj); + //public boolean remove(String obj); + public String min(); + public String max(); + public String toString(); +} + +/******************* +Represents a binary search tree holding Strings. +Implements (most of) BSTinterface, above. +The recursive methods all have a public method calling a private helper method. +Copy the display() method from TreeLab. +**********************/ +class BST implements BSTinterface +{ + private TreeNode root; + private int size; + public BST() + { + root = null; + size = 0; + } + public int size() + { + return size; + } + public TreeNode getRoot() //for Grade-It + { + return root; + } + /****** + @param s -- one string to be inserted + ********/ + public void add(String s) + { + root = add(root, s); + size++; + } + private TreeNode add(TreeNode t, String s) + { + if (t == null) + return new TreeNode(s, null, null); + + TreeNode p, q; + p = q = t; + String str; + + while(p != null) { + str = (String) p.getValue(); + if (str.compareTo(s) >= 0) + p = p.getLeft(); + else + p = p.getRight(); + + if (p != null) + q = p; + } + + str = (String) q.getValue(); + + if (str.compareTo(s) >= 0) + q.setLeft(new TreeNode(s, null, null)); + else + q.setRight(new TreeNode(s, null, null)); + + return t; + } + + public String display() + { + return display(root, 0); + } + private String display(TreeNode t, int level) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public boolean contains( String obj) + { + return contains(root, obj); + } + public boolean contains(TreeNode t, String x) + { + if (t == null) + return false; + + TreeNode temp = root; + String str = (String) root.getValue(); + + while (!str.equals(x)) { + + if (str.compareTo(x) >= 0) + temp = temp.getLeft(); + else + temp = temp.getRight(); + + if (temp == null) + return false; + + str = (String) temp.getValue(); + } + + return true; + } + + public String min() + { + return min(root); + } + private String min(TreeNode t) //use iteration + { + if (t == null) + return ""; + TreeNode temp = t; + while (temp.getLeft() != null) { + temp = temp.getLeft(); + } + return String.valueOf(temp.getValue()); + } + + public String max() + { + return max(root); + } + private String max(TreeNode t) //use recursion + { + if (t == null) return ""; + if (t.getRight() == null) + return String.valueOf(t.getValue()); + else + return max(t.getRight()); + } + + public String toString() + { + return toString(root); + } + private String toString(TreeNode t) //an in-order traversal + { + if (t == null) + return ""; + return toString(t.getLeft()) + " " + (String) t.getValue() + " " + toString(t.getRight()); + } +} diff --git a/07 Trees/03 BST/BST_Driver.class b/07 Trees/03 BST/BST_Driver.class new file mode 100644 index 0000000..e20dd9b Binary files /dev/null and b/07 Trees/03 BST/BST_Driver.class differ diff --git a/07 Trees/03 BST/BST_Driver.java b/07 Trees/03 BST/BST_Driver.java new file mode 100644 index 0000000..d202c86 --- /dev/null +++ b/07 Trees/03 BST/BST_Driver.java @@ -0,0 +1,173 @@ +// Name: B6-24 +// Date: 2/7/20 +import java.util.*; +/******************* +This driver provides an ArrayList of input strings. One by one, it adds +the letters to the tree. Display it as a sideways +tree (take the code from TreeLab). Prompt the user for a target and +search the BST for it. Display the tree's minimum and maximum values. +Print the letters in order from smallest to largest. +**********************/ +public class BST_Driver +{ + public static void main(String[] args) + { + Scanner keyboard = new Scanner(System.in); + ArrayList list = new ArrayList(); + list.add("M A E N I R A C"); + list.add("A M E R I C A N"); + list.add("A A C E I M N R"); + list.add("A"); + list.add("6 8 2 9 3 0 1"); + list.add("Florida Oklahoma Colorado Massachusetts Arizona Iowa New_Hampshire Washington West_Virginia Kazakhstan Arkansas"); + + for( String string : list ) + { + BST bst = new BST(); //we want to start anew + String[] str = string.split(" "); + for(String item : str) + bst.add( item ); + + System.out.println( bst.display() ); + System.out.println( "Size = " + bst.size() ); + System.out.println("Min = " + bst.min()); + System.out.println("Max = " + bst.max()); + System.out.print("Input target: "); + String target = keyboard.next(); + boolean itemFound = bst.contains(target); + if(itemFound) + System.out.println("found: " + target); + else + System.out.println(target +" not found."); + System.out.println("in-order traversal: " + bst.toString()); + System.out.println("--------------------------"); + } + } +} + +/*************************************** + ----jGRASP exec: java BST_Driver_Teacher + R + N + M + I + E + C + A + A + + Size = 8 + Min = A + Max = R + Input target: C + found: C + A A C E I M N R + -------------------------- + R + N + M + I + E + C + A + A + + Size = 8 + Min = A + Max = R + Input target: + ----jGRASP: process ended by user. + + ----jGRASP exec: java BST_Driver_Teacher + R + N + M + I + E + C + A + A + + Size = 8 + Min = A + Max = R + Input target: N + found: N + in-order traversal: A A C E I M N R + -------------------------- + R + N + M + I + E + C + A + A + + Size = 8 + Min = A + Max = R + Input target: C + found: C + in-order traversal: A A C E I M N R + -------------------------- + R + N + M + I + E + C + A + A + + Size = 8 + Min = A + Max = R + Input target: X + X not found. + in-order traversal: A A C E I M N R + -------------------------- + A + + Size = 1 + Min = A + Max = A + Input target: A + found: A + in-order traversal: A + -------------------------- + 9 + 8 + 6 + 3 + 2 + 1 + 0 + + Size = 7 + Min = 0 + Max = 9 + Input target: 0 + found: 0 + in-order traversal: 0 1 2 3 6 8 9 + -------------------------- + West_Virginia + Washington + Oklahoma + New_Hampshire + Massachusetts + Kazakhstan + Iowa + Florida + Colorado + Arkansas + Arizona + + Size = 11 + Min = Arizona + Max = West_Virginia + Input target: Iowa + found: Iowa + in-order traversal: Arizona Arkansas Colorado Florida Iowa Kazakhstan Massachusetts New_Hampshire Oklahoma Washington West_Virginia + -------------------------- + ************************************/ \ No newline at end of file diff --git a/07 Trees/03 BST/BSTinterface.class b/07 Trees/03 BST/BSTinterface.class new file mode 100644 index 0000000..92d2287 Binary files /dev/null and b/07 Trees/03 BST/BSTinterface.class differ diff --git a/07 Trees/03 BST/Binary Search Tree.doc b/07 Trees/03 BST/Binary Search Tree.doc new file mode 100644 index 0000000..f4bae2a Binary files /dev/null and b/07 Trees/03 BST/Binary Search Tree.doc differ diff --git a/07 Trees/03 BST/TreeNode.class b/07 Trees/03 BST/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/03 BST/TreeNode.class differ diff --git a/07 Trees/03 BST/TreeNode.java b/07 Trees/03 BST/TreeNode.java new file mode 100644 index 0000000..1aad2a8 --- /dev/null +++ b/07 Trees/03 BST/TreeNode.java @@ -0,0 +1,51 @@ + /* TreeNode class for the AP Exams */ + + public class TreeNode + { + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } + } diff --git a/07 Trees/04 BST Remove/BST Remove.doc b/07 Trees/04 BST Remove/BST Remove.doc new file mode 100644 index 0000000..7c00562 Binary files /dev/null and b/07 Trees/04 BST Remove/BST Remove.doc differ diff --git a/07 Trees/04 BST Remove/BST.class b/07 Trees/04 BST Remove/BST.class new file mode 100644 index 0000000..1bcb598 Binary files /dev/null and b/07 Trees/04 BST Remove/BST.class differ diff --git a/07 Trees/04 BST Remove/BST.java b/07 Trees/04 BST Remove/BST.java new file mode 100644 index 0000000..f3d5039 --- /dev/null +++ b/07 Trees/04 BST Remove/BST.java @@ -0,0 +1,193 @@ +// Name: B6-24 +// Date: 2/12/20 + +interface BSTinterface +{ + public int size(); + public boolean contains(String obj); + public void add(String obj); + //public void addBalanced(String obj); + public void remove(String obj); + public String min(); + public String max(); + public String display(); + public String toString(); +} + +/******************* +Copy your BST code. Implement the remove() method. +Test it with BST_Delete.java +**********************/ +public class BST implements BSTinterface +{ + private TreeNode root; + private int size; + public BST() + { + root = null; + size = 0; + } + public int size() + { + return size; + } + public TreeNode getRoot() //for Grade-It + { + return root; + } + /****** + @param s -- one string to be inserted + ********/ + public void add(String s) + { + root = add(root, s); + size++; + } + private TreeNode add(TreeNode t, String s) + { + if (t == null) + return new TreeNode(s, null, null); + + TreeNode p, q; + p = q = t; + String str; + + while(p != null) { + str = (String) p.getValue(); + if (str.compareTo(s) >= 0) + p = p.getLeft(); + else + p = p.getRight(); + + if (p != null) + q = p; + } + + str = (String) q.getValue(); + + if (str.compareTo(s) >= 0) + q.setLeft(new TreeNode(s, null, null)); + else + q.setRight(new TreeNode(s, null, null)); + + return t; + } + + public String display() + { + return display(root, 0); + } + private String display(TreeNode t, int level) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public boolean contains( String obj) + { + return contains(root, obj); + } + public boolean contains(TreeNode t, String x) + { + if (t == null) + return false; + + TreeNode temp = root; + String str = (String) root.getValue(); + + while (!str.equals(x)) { + + if (str.compareTo(x) >= 0) + temp = temp.getLeft(); + else + temp = temp.getRight(); + + if (temp == null) + return false; + + str = (String) temp.getValue(); + } + + return true; + } + + public String min() + { + return min(root); + } + private String min(TreeNode t) //use iteration + { + if (t == null) + return ""; + TreeNode temp = t; + while (temp.getLeft() != null) { + temp = temp.getLeft(); + } + return String.valueOf(temp.getValue()); + } + + public String max() + { + return max(root); + } + private String max(TreeNode t) //use recursion + { + if (t == null) return ""; + if (t.getRight() == null) + return String.valueOf(t.getValue()); + else + return max(t.getRight()); + } + + public String toString() + { + return toString(root); + } + private String toString(TreeNode t) //an in-order traversal + { + if (t == null) + return ""; + return toString(t.getLeft()) + " " + (String) t.getValue() + " " + toString(t.getRight()); + } + + + public void remove(String target) + { + root = remove(root, target); + size--; + } + private TreeNode remove(TreeNode current, String target) + { + if (current == null) + return null; + + String str = (String) current.getValue(); + if (str.equals(target)) { + if (current.getLeft() == null && current.getRight() == null) + return null; + else if (current.getLeft() == null) + return current.getRight(); + else if (current.getRight() == null) + return current.getLeft(); + + current.setValue(min(current.getRight())); + current.setRight(remove(current.getRight(), (String) current.getValue())); + return current; + + } else if (str.compareTo(target) > 0) { + current.setLeft(remove(current.getLeft(), target)); + } else if (str.compareTo(target) <= 0) { + current.setRight(remove(current.getRight(), target)); + } + + return current; + + } +} \ No newline at end of file diff --git a/07 Trees/04 BST Remove/BST_Remove_Driver.class b/07 Trees/04 BST Remove/BST_Remove_Driver.class new file mode 100644 index 0000000..b28f87f Binary files /dev/null and b/07 Trees/04 BST Remove/BST_Remove_Driver.class differ diff --git a/07 Trees/04 BST Remove/BST_Remove_Driver.java b/07 Trees/04 BST Remove/BST_Remove_Driver.java new file mode 100644 index 0000000..5cf9ef1 --- /dev/null +++ b/07 Trees/04 BST Remove/BST_Remove_Driver.java @@ -0,0 +1,68 @@ +import java.util.*; + +/******************* +Driver class for the BST Removelab. +The cases correspond to the cases on the handout. +When you finish coding the cases, try the stress test. +**********************/ +public class BST_Remove_Driver +{ + public static void main(String[] args) + { + //Case 1a: E C S B P W A N R + //Case 1b: N + //Case 2a: S N T P O R + //Case 2b: H B R N V J S Z I K + //Case 2c: N F A K G + //Case 2d: N S P Q X + //Case 3.a: D B N A C F S E J H M + //Case 3.b: D B N A C F S E J H + //on the handout: H D J A G K F E O L T M N S U + //on the PowerPoint: Florida Oklahoma Colorado Massachusetts Arizona Iowa New_Hampshire Washington West_Virginia Kazakhstan Arkansas + +// Scanner sc = new Scanner(System.in); +// System.out.print("Input one of the cases: "); +// String line = sc.nextLine(); +// BST bst = new BST(); +// String[] str = line.split(" "); +// for(String item : str) +// bst.add( item ); +// System.out.println( bst.display() ); +// System.out.print("Remove? "); +// String target = sc.next(); +// if( bst.contains( target ) ) +// { +// bst.remove( target ); +// System.out.println("\n" + target+" removed."); +// System.out.println( bst.display() ); +// System.out.println("Is the tree still a BST?"); +// } +// else +// System.out.println("\n" + target+" not found"); + + /* stress test + Add 26 letters at random to the BST, then remove 26 letters at random. + If it crashes, you have probably missed a case or a guard. + If the tree stores the letters of the alphabet, what should bst.toString() show? + */ + BST bst = new BST(); + String[] lettersArray = {"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"}; + List lettersList = new ArrayList(Arrays.asList(lettersArray)); + for(int i = 0; i < 26; i++) + { + int index = (int)(Math.random() * lettersList.size()); + String letter = lettersList.remove(index); + bst.add( letter ); + System.out.println(bst.toString()); //is the BST still in order? + } + System.out.println( bst.display() ); + lettersList = new ArrayList(Arrays.asList(lettersArray)); + for(int i = 0; i < 26; i++) + { + int index = (int)(Math.random() * lettersList.size()); + String letter = lettersList.remove(index); + bst.remove( letter ); + System.out.println(bst.toString()); //is each BST still in order? + } + } +} diff --git a/07 Trees/04 BST Remove/BSTinterface.class b/07 Trees/04 BST Remove/BSTinterface.class new file mode 100644 index 0000000..8d5fdf8 Binary files /dev/null and b/07 Trees/04 BST Remove/BSTinterface.class differ diff --git a/07 Trees/04 BST Remove/TreeNode.class b/07 Trees/04 BST Remove/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/04 BST Remove/TreeNode.class differ diff --git a/07 Trees/04 BST Remove/TreeNode.java b/07 Trees/04 BST Remove/TreeNode.java new file mode 100644 index 0000000..1aad2a8 --- /dev/null +++ b/07 Trees/04 BST Remove/TreeNode.java @@ -0,0 +1,51 @@ + /* TreeNode class for the AP Exams */ + + public class TreeNode + { + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } + } diff --git a/07 Trees/04 BST Remove/chapt10b.ppt b/07 Trees/04 BST Remove/chapt10b.ppt new file mode 100644 index 0000000..dfb6f34 Binary files /dev/null and b/07 Trees/04 BST Remove/chapt10b.ppt differ diff --git a/07 Trees/05 BST self-balancing/AVL tree visualization.docx b/07 Trees/05 BST self-balancing/AVL tree visualization.docx new file mode 100644 index 0000000..83043af Binary files /dev/null and b/07 Trees/05 BST self-balancing/AVL tree visualization.docx differ diff --git a/07 Trees/05 BST self-balancing/AVL-Tree-Rotations.pdf b/07 Trees/05 BST self-balancing/AVL-Tree-Rotations.pdf new file mode 100644 index 0000000..99c003b Binary files /dev/null and b/07 Trees/05 BST self-balancing/AVL-Tree-Rotations.pdf differ diff --git a/07 Trees/05 BST self-balancing/AVLTrees.pdf b/07 Trees/05 BST self-balancing/AVLTrees.pdf new file mode 100644 index 0000000..c184594 Binary files /dev/null and b/07 Trees/05 BST self-balancing/AVLTrees.pdf differ diff --git a/07 Trees/05 BST self-balancing/BST.class b/07 Trees/05 BST self-balancing/BST.class new file mode 100644 index 0000000..dccbc2d Binary files /dev/null and b/07 Trees/05 BST self-balancing/BST.class differ diff --git a/07 Trees/05 BST self-balancing/BST.java b/07 Trees/05 BST self-balancing/BST.java new file mode 100644 index 0000000..fd4be66 --- /dev/null +++ b/07 Trees/05 BST self-balancing/BST.java @@ -0,0 +1,266 @@ +// Name: B6-24 +// Date: 2/25/19 + +interface BSTinterface +{ + public int size(); + public boolean contains(String obj); + public void add(String obj); + public void addBalanced(String obj); + public void remove(String obj); + public String min(); + public String max(); + public String display(); + public String toString(); +} + +/******************* +Copy your BST code. Implement the addBalanced() method. +**********************/ +public class BST implements BSTinterface +{ + private TreeNode root; + private int size; + public BST() + { + root = null; + size = 0; + } + public int size() + { + return size; + } + public TreeNode getRoot() //for Grade-It + { + return root; + } + /****** + @param s -- one string to be inserted + ********/ + public void add(String s) + { + root = add(root, s); + size++; + } + private TreeNode add(TreeNode t, String s) + { + if (t == null) + return new TreeNode(s, null, null); + + TreeNode p, q; + p = q = t; + String str; + + while(p != null) { + str = (String) p.getValue(); + if (str.compareTo(s) >= 0) + p = p.getLeft(); + else + p = p.getRight(); + + if (p != null) + q = p; + } + + str = (String) q.getValue(); + + if (str.compareTo(s) >= 0) + q.setLeft(new TreeNode(s, null, null)); + else + q.setRight(new TreeNode(s, null, null)); + + return t; + } + + public String display() + { + return display(root, 0); + } + private String display(TreeNode t, int level) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public boolean contains( String obj) + { + return contains(root, obj); + } + public boolean contains(TreeNode t, String x) + { + if (t == null) + return false; + + TreeNode temp = root; + String str = (String) root.getValue(); + + while (!str.equals(x)) { + + if (str.compareTo(x) >= 0) + temp = temp.getLeft(); + else + temp = temp.getRight(); + + if (temp == null) + return false; + + str = (String) temp.getValue(); + } + + return true; + } + + public String min() + { + return min(root); + } + private String min(TreeNode t) //use iteration + { + if (t == null) + return ""; + TreeNode temp = t; + while (temp.getLeft() != null) { + temp = temp.getLeft(); + } + return String.valueOf(temp.getValue()); + } + + public String max() + { + return max(root); + } + private String max(TreeNode t) //use recursion + { + if (t == null) return ""; + if (t.getRight() == null) + return String.valueOf(t.getValue()); + else + return max(t.getRight()); + } + + public String toString() + { + return toString(root); + } + private String toString(TreeNode t) //an in-order traversal + { + if (t == null) + return ""; + return toString(t.getLeft()) + " " + (String) t.getValue() + " " + toString(t.getRight()); + } + + + public void remove(String target) + { + root = remove(root, target); + size--; + } + private TreeNode remove(TreeNode current, String target) + { + if (current == null) + return null; + + String str = (String) current.getValue(); + if (str.equals(target)) { + if (current.getLeft() == null && current.getRight() == null) + return null; + else if (current.getLeft() == null) + return current.getRight(); + else if (current.getRight() == null) + return current.getLeft(); + + current.setValue(min(current.getRight())); + current.setRight(remove(current.getRight(), (String) current.getValue())); + return current; + + } else if (str.compareTo(target) > 0) { + current.setLeft(remove(current.getLeft(), target)); + } else if (str.compareTo(target) <= 0) { + current.setRight(remove(current.getRight(), target)); + } + + return current; + + } + + public void addBalanced (String s) { + root = addBalanced(root, s); + size++; + } + + private TreeNode addBalanced (TreeNode current, String s) { + if (current == null) + return new TreeNode(s, null, null); + + String str = (String) current.getValue(); + + if (str.compareTo(s) > 0) { + current.setLeft(addBalanced(current.getLeft(), s)); + } else if (str.compareTo(s) < 0) { + current.setRight(addBalanced(current.getRight(), s)); + } + + int balance = height(current.getLeft()) - height(current.getRight()); + + if (balance > 1 && s.compareTo((String) current.getLeft().getValue()) < 0) + return rotateRight(current); + + + if (balance < -1 && s.compareTo((String) current.getRight().getValue()) > 0) + return rotateLeft(current); + + if (balance > 1 && s.compareTo((String) current.getLeft().getValue()) > 0) + return leftRight(current); + + if (balance < -1 && s.compareTo((String) current.getRight().getValue()) < 0) + return rightLeft(current); + + + return current; + } + + private int height(TreeNode t) + { + if (t == null) + return -1; + + return Math.max(height(t.getLeft()), height(t.getRight())) + 1; + } + + private TreeNode rotateRight (TreeNode t) { + TreeNode left = t.getLeft(); + TreeNode leftRight = left.getRight(); + + left.setRight(t); + t.setLeft(leftRight); + + return left; + } + + private TreeNode rotateLeft (TreeNode t) { + TreeNode right = t.getRight(); + TreeNode rightLeft = right.getLeft(); + + right.setLeft(t); + t.setRight(rightLeft); + + return right; + } + + private TreeNode leftRight (TreeNode t) { + t.setLeft(rotateLeft(t.getLeft())); + return rotateRight(t); + } + + private TreeNode rightLeft (TreeNode t) { + t.setRight(rotateRight(t.getRight())); + return rotateLeft(t); + } +} \ No newline at end of file diff --git a/07 Trees/05 BST self-balancing/BST_AVL_driver.class b/07 Trees/05 BST self-balancing/BST_AVL_driver.class new file mode 100644 index 0000000..f4ee676 Binary files /dev/null and b/07 Trees/05 BST self-balancing/BST_AVL_driver.class differ diff --git a/07 Trees/05 BST self-balancing/BST_AVL_driver.java b/07 Trees/05 BST self-balancing/BST_AVL_driver.java new file mode 100644 index 0000000..0cc5758 --- /dev/null +++ b/07 Trees/05 BST self-balancing/BST_AVL_driver.java @@ -0,0 +1,441 @@ +import java.util.*; +import java.io.*; +/* +Test your AVL tree with this driver. +*/ + +public class BST_AVL_driver +{ + public static void main( String[] args ) throws Exception + { + BST balancedTree = new BST(); + //Scanner in = new Scanner(System.in); + //System.out.print("Type in a line: "); + //String line = in.nextLine(); + + String line = "5 3 2"; //left-left case (right rotation) + //String line = "3 5 7"; //right-right case (left rotation) + //String line = "5 3 4"; //left-right case (left rotation then right rotation) + //String line = "3 5 4"; //right-left case (right rotation then left rotation) + //String line = "a b c d e f g"; + //String line = "g f e d c b a"; + //String line = "J E H B F G D"; //doubleright, doubleright, doubleright + //String line = "L P N U R O"; //doubleleft, doubleleft, doubleleft + //String line = "M H D F E J U L X I P K"; //left, doubleleft, doubleright + + String[] str = line.split(" "); + for(String item : str) + { + balancedTree.addBalanced( item ); //implement addBalanced() in your BST class + System.out.println(balancedTree.display()); + System.out.println("------------------------------"); + } + } +} + +/*************************************************** + ----jGRASP exec: java BST_self_balancing_Teacher + a + + ------------------------------ + b + a + + ------------------------------ + c + b + a + + ------------------------------ + d + c + b + a + + ------------------------------ + e + d + c + b + a + + ------------------------------ + f + e + d + c + b + a + + ------------------------------ + g + f + e + d + c + b + a + + ------------------------------ + h + g + f + e + d + c + b + a + + ------------------------------ + i + h + g + f + e + d + c + b + a + + ------------------------------ + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + y + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + z + y + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + ************************************/ \ No newline at end of file diff --git a/07 Trees/05 BST self-balancing/BST_self_balancing_driver.class b/07 Trees/05 BST self-balancing/BST_self_balancing_driver.class new file mode 100644 index 0000000..241b97b Binary files /dev/null and b/07 Trees/05 BST self-balancing/BST_self_balancing_driver.class differ diff --git a/07 Trees/05 BST self-balancing/BST_self_balancing_driver.java b/07 Trees/05 BST self-balancing/BST_self_balancing_driver.java new file mode 100644 index 0000000..d2aba7c --- /dev/null +++ b/07 Trees/05 BST self-balancing/BST_self_balancing_driver.java @@ -0,0 +1,432 @@ +import java.util.*; +import java.io.*; +/* Self-balancing BST's include AVL trees, red-black trees, and AA trees. +Look one up on the internet, and implement it in your BST class. +Test it with this driver. +*/ + +public class BST_self_balancing_driver +{ + public static void main( String[] args ) throws Exception + { + BST balancedTree = new BST(); + //Scanner in = new Scanner(System.in); + //System.out.print("Type in a line: "); + //String line = in.nextLine(); + String line = "a b c d e f g h i j k l m n o p q r s t u v w x y z"; + String[] str = line.split(" "); + for(String item : str) + { + balancedTree.addBalanced( item ); //implement addBalanced() in your BST class + System.out.println(balancedTree.display()); + System.out.println("------------------------------"); + } + } +} + +/*************************************************** + ----jGRASP exec: java BST_self_balancing_Teacher + a + + ------------------------------ + b + a + + ------------------------------ + c + b + a + + ------------------------------ + d + c + b + a + + ------------------------------ + e + d + c + b + a + + ------------------------------ + f + e + d + c + b + a + + ------------------------------ + g + f + e + d + c + b + a + + ------------------------------ + h + g + f + e + d + c + b + a + + ------------------------------ + i + h + g + f + e + d + c + b + a + + ------------------------------ + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + y + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + z + y + x + w + v + u + t + s + r + q + p + o + n + m + l + k + j + i + h + g + f + e + d + c + b + a + + ------------------------------ + ************************************/ \ No newline at end of file diff --git a/07 Trees/05 BST self-balancing/BSTinterface.class b/07 Trees/05 BST self-balancing/BSTinterface.class new file mode 100644 index 0000000..5739556 Binary files /dev/null and b/07 Trees/05 BST self-balancing/BSTinterface.class differ diff --git a/07 Trees/05 BST self-balancing/Self-Balancing BST.doc b/07 Trees/05 BST self-balancing/Self-Balancing BST.doc new file mode 100644 index 0000000..fb6ea26 Binary files /dev/null and b/07 Trees/05 BST self-balancing/Self-Balancing BST.doc differ diff --git a/07 Trees/05 BST self-balancing/TreeNode.class b/07 Trees/05 BST self-balancing/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/05 BST self-balancing/TreeNode.class differ diff --git a/07 Trees/05 BST self-balancing/TreeNode.java b/07 Trees/05 BST self-balancing/TreeNode.java new file mode 100644 index 0000000..1aad2a8 --- /dev/null +++ b/07 Trees/05 BST self-balancing/TreeNode.java @@ -0,0 +1,51 @@ + /* TreeNode class for the AP Exams */ + + public class TreeNode + { + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } + } diff --git a/07 Trees/05 BST self-balancing/balancing_search_trees.pdf b/07 Trees/05 BST self-balancing/balancing_search_trees.pdf new file mode 100644 index 0000000..1bb9e5f --- /dev/null +++ b/07 Trees/05 BST self-balancing/balancing_search_trees.pdf @@ -0,0 +1,11613 @@ +%PDF-1.3 +%âãÏÓ +2 0 obj +<< +/Length 4437 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +64.933 209.528 m +64.933 212.998 62.15 215.78 58.68 215.78 c +55.21 215.78 52.427 212.998 52.427 209.528 c +52.427 206.058 55.21 203.275 58.68 203.275 c +62.15 203.275 64.933 206.058 64.933 209.528 c +h +58.68 209.528 m +f +BT +9.9626 0 0 9.9626 55.9104 205.62 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 205.62 Tm +0.2 0.2 0.7 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +0 -1.232 TD +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.2 0.2 0.7 rg +64.933 141.368 m +64.933 144.838 62.15 147.62 58.68 147.62 c +55.21 147.62 52.427 144.838 52.427 141.368 c +52.427 137.898 55.21 135.115 58.68 135.115 c +62.15 135.115 64.933 137.898 64.933 141.368 c +h +58.68 141.368 m +f +BT +9.9626 0 0 9.9626 55.9104 137.46 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 137.46 Tm +0.2 0.2 0.7 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +0 -1.232 TD +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +0 -1.243 TD +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +14.828 -3.74 TD +[(MCS)-264(360)-264(Lecture)-275(33)]TJ +-4.411 -1.243 TD +[(Introduction)-275(to)-275(Data)-264(Str)-11(uctures)]TJ +-1.661 -1.243 TD +[(J)22(a)0(n)-275(V)77(erschelde)11(,)-264(8)-275(No)11(v)22(ember)-253(2010)]TJ +ET +endstream +endobj +3 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +9 0 obj +<< +/Length 4199 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0 g +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.2 0.2 0.7 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +0.8 g +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.84 0.84 0.94 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.84 0.84 0.94 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0.8 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +10 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +12 0 obj +<< +/Length 5383 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0 g +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 176.64 242.22 Tm +0.2 0.2 0.7 rg +[(Binar)-33.5(y)-276(Search)-284.4(T)117.1(rees)]TJ +10.9091 0 0 10.9091 59.04 220.98 Tm +0 g +[(Consider)-264(4,)-275(5,)-275(2,)-275(3,)-275(8,)-275(1,)-275(7)-275(\(recall)-286(lecture)-275(24\).)]TJ +0 -1.518 TD +[(Inser)-44(t)-275(the)-275(n)11(umbers)-264(in)-275(a)-264(tree:)]TJ +13.277 -1.925 TD +(4)Tj +/F1 1 Tf +9.9626 0 0 9.9626 207.84 177.06 Tm +()Tj +0.9997 -0.3252 TD +()Tj +0.9997 -0.3373 TD +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 238.68 161.46 Tm +(5)Tj +/F1 1 Tf +9.9626 0 0 9.9626 195.84 177.06 Tm +()Tj +-0.9997 -0.3252 TD +()Tj +-0.9997 -0.3373 TD +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 168.96 161.46 Tm +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 172.92 153.54 Tm +()Tj +0.9997 -0.5059 TD +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 193.92 136.62 Tm +(3)Tj +/F1 1 Tf +9.9626 0 0 9.9626 242.64 153.54 Tm +()Tj +0.9997 -0.5059 TD +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 263.64 136.62 Tm +(8)Tj +/F1 1 Tf +9.9626 0 0 9.9626 161.04 153.54 Tm +()Tj +-0.9997 -0.5059 TD +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 146.04 136.62 Tm +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 255.6 123.66 Tm +()Tj +/TT2 1 Tf +10.9091 0 0 10.9091 250.68 111.66 Tm +(7)Tj +-17.567 -2.332 TD +[(Rules)-264(to)-275(inser)-44(t)]TJ +/TT4 1 Tf +6.7049 0 TD +(x)Tj +/TT2 1 Tf +0.874 0 TD +[(at)-275(node)]TJ +/TT4 1 Tf +3.5866 0 TD +(N)Tj +/TT2 1 Tf +0.7992 0 TD +(:)Tj +/F2 1 Tf +9.9626 0 0 9.9626 70.44 70.14 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 69.66 Tm +0 g +(if)Tj +/TT4 1 Tf +0.775 0 TD +(N)Tj +/TT2 1 Tf +1.0742 0 TD +[(is)-286(empty)99(,)-275(then)-264(put)]TJ +/TT4 1 Tf +8.0606 0 TD +(x)Tj +/TT2 1 Tf +0.874 0 TD +(in)Tj +/TT4 1 Tf +1.0533 0 TD +(N)Tj +/F2 1 Tf +9.9626 0 0 9.9626 70.44 53.58 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 53.1 Tm +0 g +(if)Tj +/TT4 1 Tf +0.775 0 TD +(x)Tj +/F3 1 Tf +0.885 0 TD +(<)Tj +/TT4 1 Tf +1.056 0 TD +(N)Tj +/TT2 1 Tf +0.7992 0 TD +[(,)-275(inser)-44(t)]TJ +/TT4 1 Tf +3.3171 0 TD +(x)Tj +/TT2 1 Tf +0.874 0 TD +[(to)-275(the)-275(left)-275(of)]TJ +/TT4 1 Tf +5.5031 0 TD +(N)Tj +/F2 1 Tf +9.9626 0 0 9.9626 70.44 37.02 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 36.54 Tm +0 g +(if)Tj +/TT4 1 Tf +0.775 0 TD +(x)Tj +/F2 1 Tf +0.885 0 TD +()Tj +/TT4 1 Tf +1.056 0 TD +(N)Tj +/TT2 1 Tf +0.7992 0 TD +[(,)-275(inser)-44(t)]TJ +/TT4 1 Tf +3.3171 0 TD +(x)Tj +/TT2 1 Tf +0.874 0 TD +[(to)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT4 1 Tf +6.1144 0 TD +(N)Tj +/TT2 1 Tf +-15.8228 -1.793 TD +[(Recursiv)22(e)-275(p)0(r)-11(inting:)-341(left,)-286(node)11(,)-253(r)-11(ight)-275(sor)-44(ts)-286(the)-275(sequence)11(.)]TJ +ET +endstream +endobj +13 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/F3 16 0 R +/TT2 4 0 R +/TT4 17 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +19 0 obj +<< +/Length 3514 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0 g +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 183.36 242.22 Tm +0.2 0.2 0.7 rg +[(an)-284.4(unbalanced)-301.1(tree)]TJ +10.9091 0 0 10.9091 59.04 207.66 Tm +0 g +[(Inser)-44(ting)-264(0)]TJ +/F3 1 Tf +4.6996 0 TD +(,)Tj +/TT2 1 Tf +0.44 0 TD +(1)Tj +/F3 1 Tf +0.5562 0 TD +(,)Tj +/TT2 1 Tf +0.44 0 TD +(2)Tj +/F3 1 Tf +0.5562 0 TD +0.1622 Tc +[(,...)-11(,)]TJ +/TT2 1 Tf +2.211 0 TD +0 Tc +(9.)Tj +/TT6 1 Tf +-8.903 -2.332 TD +[(depth)-572(of)-594(tree)-572(:)-594(9)]TJ +0 -1.243 TD +(0)Tj +1.199 -1.243 TD +(1)Tj +1.199 -1.243 TD +(2)Tj +1.199 -1.243 TD +(3)Tj +1.199 -1.243 TD +(4)Tj +1.199 -1.243 TD +(5)Tj +1.199 -1.243 TD +(6)Tj +1.199 -1.243 TD +(7)Tj +1.199 -1.232 TD +(8)Tj +1.21 -1.243 TD +(9)Tj +ET +endstream +endobj +20 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F3 16 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +23 0 obj +<< +/Length 4160 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0 g +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 129.48 242.22 Tm +0.2 0.2 0.7 rg +[(shaping)-292.8(binar)-33.5(y)-276(search)-284.4(trees)]TJ +10.9091 0 0 10.9091 59.04 196.86 Tm +0 g +[(T)121(o)-264(mak)22(e)-275(a)-275(binar)-33(y)-264(search)-275(tree)-275(with)-275(giv)22(en)-264(shape:)]TJ +/TT6 1 Tf +8.437 -1.496 TD +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 145.08 167.58 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 135.12 157.62 Tm +0 Tc +[(10)-1892(40)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 129.12 144.66 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 122.16 134.7 Tm +2.134 Tc +[(51)2134(5)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 113.16 121.74 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 107.28 111.78 Tm +2.134 Tc +(17)Tj +10.956 5.478 TD +0 Tc +(20)Tj +1.199 -0.913 TD +(10)Tj +1.199 -0.913 TD +(5)Tj +1.199 -0.913 TD +(1)Tj +T* +(7)Tj +-1.199 -0.913 TD +(15)Tj +-1.199 -0.913 TD +(40)Tj +/TT2 1 Tf +-16.577 -2.343 TD +[(Inser)-44(t)-275(n)11(umbers)-264(in)-275(a)-275(par)-44(ticular)-275(order)-33(:)-330(20,)-275(40,)-264(10,)-275(5,)-275(15,)-275(1,)-275(7.)]TJ +0 -1.782 TD +[(The)-264(tree)-275(is)-275(unbalanced)-253(because)-264(the)-264(depth)-264(of)-275(the)-275(left)-275(tree)-275(is)]TJ +0 -1.243 TD +[(tw)11(o)44(,)-275(while)-275(the)-264(depth)-264(of)-275(the)-275(r)-11(ight)-275(three)-264(is)-286(z)11(ero)44(.)]TJ +ET +endstream +endobj +24 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +26 0 obj +<< +/Length 4226 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 g +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.2 0.2 0.7 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0.8 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +0 g +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +0.8 g +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.84 0.84 0.94 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.84 0.84 0.94 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0.8 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +27 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +29 0 obj +<< +/Length 4932 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 g +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 215.28 242.22 Tm +0.2 0.2 0.7 rg +[(Right)-284.4(Rotation)]TJ +10.9091 0 0 10.9091 59.04 214.62 Tm +0 g +[(T)121(o)-264(balance)-264(the)-264(binar)-33(y)-275(search)-275(tree)-275(tree)11(,)]TJ +0 -1.243 TD +[(w)11(e)-264(do)-275(a)-264(r)-11(ight)-286(rotate)-275(around)-253(the)-275(root:)]TJ +/TT6 1 Tf +6.611 -1.496 TD +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 125.16 171.78 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 115.2 161.82 Tm +0 Tc +[(10)-1892(40)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 109.2 148.86 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 102.24 138.9 Tm +2.134 Tc +[(51)2134(5)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 93.24 125.94 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 87.36 115.98 Tm +2.134 Tc +(17)Tj +14.696 6.303 TD +0 Tc +(10)Tj +/F1 1 Tf +9.9626 0 0 9.9626 242.76 176.7 Tm +()Tj +-0.9997 -0.4938 TD +()Tj +2.397 0.4938 TD +()Tj +0.9997 -0.4938 TD +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 221.76 161.82 Tm +(5)Tj +/F1 1 Tf +9.9626 0 0 9.9626 212.88 148.86 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 206.88 138.9 Tm +2.134 Tc +(17)Tj +6.853 2.101 TD +0 Tc +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 274.56 148.86 Tm +0.602 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 266.64 138.9 Tm +0 Tc +[(15)-1991(40)]TJ +/TT2 1 Tf +-19.03 -4.444 TD +[(Obser)-33(v)22(e)-264(the)-275(eff)33(ects)-286(of)-275(a)-275(r)-11(ight)-275(rotation:)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 74.34 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 73.86 Tm +0 g +[(left)-275(tree)-275(has)-275(become)-253(the)-275(ne)22(w)-264(root;)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 57.9 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 57.42 Tm +0 g +[(old)-264(root)-275(is)-286(no)11(w)-264(a)0(t)-275(the)-264(r)-11(ight)-286(of)-275(ne)22(w)-264(root;)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 41.34 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 40.86 Tm +0 g +[(left)-275(tree)-275(of)-275(old)-275(root)-275(is)-275(no)11(w)-264(the)-275(r)-11(ight)-275(tree)]TJ +0 -1.243 TD +[(of)-275(the)-264(left)-286(tree)-275(of)-275(old)-264(root.)]TJ +ET +endstream +endobj +30 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +32 0 obj +<< +/Length 6621 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 g +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 147.48 242.22 Tm +0.2 0.2 0.7 rg +[(Right)-284.4(Rotation)-301.1(in)-276(3)-276(Steps)]TJ +10.9091 0 0 10.9091 59.04 214.62 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-6.0943 -2.013 TD +(T)Tj +ET +q +20.04 0 0 -0.48 104.268 194.928 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 114.36 194.7 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 131.16 190.62 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 125.16 177.66 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 78.36 169.74 Tm +0 Tc +(L)Tj +ET +q +20.04 0 0 -0.48 88.308 172.008 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 98.4 171.78 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 115.2 167.7 Tm +[(10)-1892(40)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 109.2 154.74 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 102.24 144.78 Tm +2.134 Tc +[(51)2134(5)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 93.24 131.82 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 87.36 121.86 Tm +2.134 Tc +(17)Tj +0.85 g +9.768 8.316 TD +0 Tc +(N)Tj +ET +q +20.04 0 0 -0.48 203.868 214.848 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 213.96 214.62 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 230.76 210.54 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 224.76 197.58 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 214.8 187.62 Tm +0 Tc +[(15)-1903(40)]TJ +-0.363 -2.101 TD +(R)Tj +ET +q +20.04 0 0 -0.48 220.788 166.968 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 230.88 166.74 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 247.68 162.78 Tm +(10)Tj +/F1 1 Tf +9.9626 0 0 9.9626 242.76 154.74 Tm +()Tj +-0.9997 -0.4938 TD +()Tj +2.397 0.4938 TD +()Tj +0.9997 -0.4938 TD +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 221.76 139.86 Tm +(5)Tj +/F1 1 Tf +9.9626 0 0 9.9626 212.88 126.9 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 206.88 116.94 Tm +2.134 Tc +(17)Tj +6.853 2.101 TD +0 Tc +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 274.56 126.9 Tm +0.602 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 266.64 116.94 Tm +0 Tc +[(15)-1991(40)]TJ +ET +0.88 0.88 0.955 rg +76.162 93.546 m +76.162 96.322 73.936 98.548 71.16 98.548 c +68.384 98.548 66.158 96.322 66.158 93.546 c +66.158 90.77 68.384 88.544 71.16 88.544 c +73.936 88.544 76.162 90.77 76.162 93.546 c +h +71.16 93.546 m +f +BT +/TT2 1 Tf +7.9701 0 0 7.9701 68.9443 90.42 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 90.42 Tm +0.85 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 76.986 m +76.162 79.762 73.936 81.988 71.16 81.988 c +68.384 81.988 66.158 79.762 66.158 76.986 c +66.158 74.21 68.384 71.984 71.16 71.984 c +73.936 71.984 76.162 74.21 76.162 76.986 c +h +71.16 76.986 m +f +BT +7.9701 0 0 7.9701 68.9443 73.86 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 73.86 Tm +0.85 g +[(Ne)22(w)-264(tree)]TJ +/TT6 1 Tf +4.2406 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2276 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight)]TJ +-11.2184 -1.243 TD +[(and)-253(as)-286(left)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +9.878 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 46.866 m +76.162 49.642 73.936 51.868 71.16 51.868 c +68.384 51.868 66.158 49.642 66.158 46.866 c +66.158 44.09 68.384 41.864 71.16 41.864 c +73.936 41.864 76.162 44.09 76.162 46.866 c +h +71.16 46.866 m +f +BT +7.9701 0 0 7.9701 68.9443 43.74 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 43.74 Tm +0.85 g +(Result)Tj +/TT6 1 Tf +3.0985 0 TD +(R)Tj +/TT2 1 Tf +0.8751 0 TD +(has)Tj +/TT6 1 Tf +1.8873 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(root,)-275(the)-275(tree)]TJ +/TT6 1 Tf +7.2704 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight,)]TJ +-14.8815 -1.243 TD +[(and)-253(the)-275(left)-286(of)]TJ +/TT6 1 Tf +6.3156 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(left.)]TJ +ET +endstream +endobj +33 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +35 0 obj +<< +/Length 6621 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 g +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 147.48 242.22 Tm +0.2 0.2 0.7 rg +[(Right)-284.4(Rotation)-301.1(in)-276(3)-276(Steps)]TJ +10.9091 0 0 10.9091 59.04 214.62 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-6.0943 -2.013 TD +(T)Tj +ET +q +20.04 0 0 -0.48 104.268 194.928 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 114.36 194.7 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 131.16 190.62 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 125.16 177.66 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 78.36 169.74 Tm +0 Tc +(L)Tj +ET +q +20.04 0 0 -0.48 88.308 172.008 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 98.4 171.78 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 115.2 167.7 Tm +[(10)-1892(40)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 109.2 154.74 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 102.24 144.78 Tm +2.134 Tc +[(51)2134(5)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 93.24 131.82 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 87.36 121.86 Tm +2.134 Tc +(17)Tj +9.768 8.316 TD +0 Tc +(N)Tj +ET +q +20.04 0 0 -0.48 203.868 214.848 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 213.96 214.62 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 230.76 210.54 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 224.76 197.58 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 214.8 187.62 Tm +0 Tc +[(15)-1903(40)]TJ +0.85 g +-0.363 -2.101 TD +(R)Tj +ET +q +20.04 0 0 -0.48 220.788 166.968 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 230.88 166.74 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 247.68 162.78 Tm +(10)Tj +/F1 1 Tf +9.9626 0 0 9.9626 242.76 154.74 Tm +()Tj +-0.9997 -0.4938 TD +()Tj +2.397 0.4938 TD +()Tj +0.9997 -0.4938 TD +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 221.76 139.86 Tm +(5)Tj +/F1 1 Tf +9.9626 0 0 9.9626 212.88 126.9 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 206.88 116.94 Tm +2.134 Tc +(17)Tj +6.853 2.101 TD +0 Tc +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 274.56 126.9 Tm +0.602 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 266.64 116.94 Tm +0 Tc +[(15)-1991(40)]TJ +ET +0.88 0.88 0.955 rg +76.162 93.546 m +76.162 96.322 73.936 98.548 71.16 98.548 c +68.384 98.548 66.158 96.322 66.158 93.546 c +66.158 90.77 68.384 88.544 71.16 88.544 c +73.936 88.544 76.162 90.77 76.162 93.546 c +h +71.16 93.546 m +f +BT +/TT2 1 Tf +7.9701 0 0 7.9701 68.9443 90.42 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 90.42 Tm +0.85 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 76.986 m +76.162 79.762 73.936 81.988 71.16 81.988 c +68.384 81.988 66.158 79.762 66.158 76.986 c +66.158 74.21 68.384 71.984 71.16 71.984 c +73.936 71.984 76.162 74.21 76.162 76.986 c +h +71.16 76.986 m +f +BT +7.9701 0 0 7.9701 68.9443 73.86 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 73.86 Tm +0.85 g +[(Ne)22(w)-264(tree)]TJ +/TT6 1 Tf +4.2406 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2276 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight)]TJ +-11.2184 -1.243 TD +[(and)-253(as)-286(left)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +9.878 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 46.866 m +76.162 49.642 73.936 51.868 71.16 51.868 c +68.384 51.868 66.158 49.642 66.158 46.866 c +66.158 44.09 68.384 41.864 71.16 41.864 c +73.936 41.864 76.162 44.09 76.162 46.866 c +h +71.16 46.866 m +f +BT +7.9701 0 0 7.9701 68.9443 43.74 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 43.74 Tm +0.85 g +(Result)Tj +/TT6 1 Tf +3.0985 0 TD +(R)Tj +/TT2 1 Tf +0.8751 0 TD +(has)Tj +/TT6 1 Tf +1.8873 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(root,)-275(the)-275(tree)]TJ +/TT6 1 Tf +7.2704 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight,)]TJ +-14.8815 -1.243 TD +[(and)-253(the)-275(left)-286(of)]TJ +/TT6 1 Tf +6.3156 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(left.)]TJ +ET +endstream +endobj +36 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +38 0 obj +<< +/Length 6593 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 g +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 147.48 242.22 Tm +0.2 0.2 0.7 rg +[(Right)-284.4(Rotation)-301.1(in)-276(3)-276(Steps)]TJ +10.9091 0 0 10.9091 59.04 214.62 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-6.0943 -2.013 TD +(T)Tj +ET +q +20.04 0 0 -0.48 104.268 194.928 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 114.36 194.7 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 131.16 190.62 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 125.16 177.66 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 78.36 169.74 Tm +0 Tc +(L)Tj +ET +q +20.04 0 0 -0.48 88.308 172.008 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 98.4 171.78 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 115.2 167.7 Tm +[(10)-1892(40)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 109.2 154.74 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 102.24 144.78 Tm +2.134 Tc +[(51)2134(5)]TJ +/F1 1 Tf +9.9626 0 0 9.9626 93.24 131.82 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 87.36 121.86 Tm +2.134 Tc +(17)Tj +9.768 8.316 TD +0 Tc +(N)Tj +ET +q +20.04 0 0 -0.48 203.868 214.848 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 213.96 214.62 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 230.76 210.54 Tm +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 224.76 197.58 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 214.8 187.62 Tm +0 Tc +[(15)-1903(40)]TJ +-0.363 -2.101 TD +(R)Tj +ET +q +20.04 0 0 -0.48 220.788 166.968 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 230.88 166.74 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 247.68 162.78 Tm +(10)Tj +/F1 1 Tf +9.9626 0 0 9.9626 242.76 154.74 Tm +()Tj +-0.9997 -0.4938 TD +()Tj +2.397 0.4938 TD +()Tj +0.9997 -0.4938 TD +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 221.76 139.86 Tm +(5)Tj +/F1 1 Tf +9.9626 0 0 9.9626 212.88 126.9 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 206.88 116.94 Tm +2.134 Tc +(17)Tj +6.853 2.101 TD +0 Tc +(20)Tj +/F1 1 Tf +9.9626 0 0 9.9626 274.56 126.9 Tm +0.602 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 266.64 116.94 Tm +0 Tc +[(15)-1991(40)]TJ +ET +0.2 0.2 0.7 rg +76.162 93.546 m +76.162 96.322 73.936 98.548 71.16 98.548 c +68.384 98.548 66.158 96.322 66.158 93.546 c +66.158 90.77 68.384 88.544 71.16 88.544 c +73.936 88.544 76.162 90.77 76.162 93.546 c +h +71.16 93.546 m +f +BT +/TT2 1 Tf +7.9701 0 0 7.9701 68.9443 90.42 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 90.42 Tm +0 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.2 0.2 0.7 rg +76.162 76.986 m +76.162 79.762 73.936 81.988 71.16 81.988 c +68.384 81.988 66.158 79.762 66.158 76.986 c +66.158 74.21 68.384 71.984 71.16 71.984 c +73.936 71.984 76.162 74.21 76.162 76.986 c +h +71.16 76.986 m +f +BT +7.9701 0 0 7.9701 68.9443 73.86 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 73.86 Tm +0 g +[(Ne)22(w)-264(tree)]TJ +/TT6 1 Tf +4.2406 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2276 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight)]TJ +-11.2184 -1.243 TD +[(and)-253(as)-286(left)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +9.878 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.2 0.2 0.7 rg +76.162 46.866 m +76.162 49.642 73.936 51.868 71.16 51.868 c +68.384 51.868 66.158 49.642 66.158 46.866 c +66.158 44.09 68.384 41.864 71.16 41.864 c +73.936 41.864 76.162 44.09 76.162 46.866 c +h +71.16 46.866 m +f +BT +7.9701 0 0 7.9701 68.9443 43.74 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 43.74 Tm +0 g +(Result)Tj +/TT6 1 Tf +3.0985 0 TD +(R)Tj +/TT2 1 Tf +0.8751 0 TD +(has)Tj +/TT6 1 Tf +1.8873 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(root,)-275(the)-275(tree)]TJ +/TT6 1 Tf +7.2704 0 TD +(N)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(r)-11(ight,)]TJ +-14.8815 -1.243 TD +[(and)-253(the)-275(left)-286(of)]TJ +/TT6 1 Tf +6.3156 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +[(as)-275(left.)]TJ +ET +endstream +endobj +39 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +41 0 obj +<< +/Length 4199 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.2 0.2 0.7 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0.8 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +0 g +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.84 0.84 0.94 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.84 0.84 0.94 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0.8 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +42 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +46 0 obj +<< +/Length 5217 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 222.96 242.22 Tm +0.2 0.2 0.7 rg +[(a)-284.4(node)-292.8(str)-16.7(uct)]TJ +ET +0 g +q +122.64 0 0 -0.48 154.068 218.928 cm +/Im1 Do +Q +BT +10.9091 0 0 10.9091 203.88 203.82 Tm +(Node)Tj +ET +q +122.64 0 0 -0.48 154.068 199.008 cm +/Im1 Do +Q +BT +/TT6 1 Tf +10.9091 0 0 10.9091 193.92 183.9 Tm +(data)Tj +ET +q +15.96 0 0 -0.48 229.668 184.128 cm +/Im1 Do +Q +q +15.96 0 0 -0.48 229.668 192.048 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 229.548 191.928 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 245.508 191.928 cm +/Im1 Do +Q +BT +10.9091 0 0 10.9091 178.92 168.9 Tm +(left)Tj +ET +q +8.04 0 0 -0.48 164.028 169.128 cm +/Im1 Do +Q +q +8.04 0 0 -0.48 164.028 177.168 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 163.788 176.928 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 171.708 176.928 cm +/Im1 Do +Q +BT +/F4 1 Tf +9.9626 0 0 9.9626 168 172.86 Tm +()Tj +ET +q +24.96 0 0 -0.48 143.028 173.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 143.04 172.98 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 218.76 168.9 Tm +(right)Tj +ET +q +8.04 0 0 -0.48 258.588 169.128 cm +/Im1 Do +Q +q +8.04 0 0 -0.48 258.588 177.168 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 258.468 176.928 cm +/Im1 Do +Q +q +0.48 0 0 -8.04 266.388 176.928 cm +/Im1 Do +Q +BT +/F4 1 Tf +9.9626 0 0 9.9626 262.56 172.86 Tm +()Tj +ET +q +24.96 0 0 -0.48 262.548 173.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 277.56 172.98 Tm +()Tj +ET +q +122.64 0 0 -0.48 154.068 164.208 cm +/Im1 Do +Q +q +0.48 0 0 -54.84 153.828 218.808 cm +/Im1 Do +Q +q +0.48 0 0 -54.84 276.348 218.808 cm +/Im1 Do +Q +BT +/TT6 1 Tf +9.9626 0 0 9.9626 59.04 139.98 Tm +[(struct)-578.2(Node)]TJ +0 -1.1925 TD +({)Tj +1.7947 -1.2045 TD +[(int)-590.2(data;)-2397(//)-590.2(numbers)-590.2(stored)-578.2(at)-602.2(node)-590.2(in)-590.2(tree)]TJ +T* +(Node)Tj +2.9992 -0.1807 TD +(*)Tj +0.6023 0.1807 TD +[(left;)-1192.5(//)-590.2(pointer)-590.2(to)-590.2(left)-590.2(branch)-590.2(of)-590.2(tree)]TJ +-3.6015 -1.1925 TD +(Node)Tj +2.9992 -0.1807 TD +(*)Tj +0.6023 0.1807 TD +[(right;)-590.2(//)-590.2(pointer)-590.2(to)-590.2(right)-590.2(branch)-590.2(of)-590.2(tree)]TJ +-3.6015 -2.409 TD +[(Node\(const)-578.2(int&)-590.2(item,)-590.2(Node)]TJ +15.6103 -0.1807 TD +(*)Tj +1.1925 0.1807 TD +[(left_ptr)-578.2(=)-602.3(NULL,)]TJ +-3.6015 -1.1925 TD +(Node)Tj +2.409 -0.1807 TD +(*)Tj +1.1925 0.1807 TD +[(right_ptr)-578.2(=)-602.2(NULL\))-590.2(:)]TJ +-13.8036 -1.2045 TD +(data\(item\),)Tj +0 -1.1925 TD +[(left\(left_ptr\),)-566.1(right\(right_ptr\))-566.1({})]TJ +ET +endstream +endobj +47 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F4 48 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +50 0 obj +<< +/Length 3866 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 229.68 242.22 Tm +0.2 0.2 0.7 rg +[(a)-284.4(class)-276(T)117.1(ree)]TJ +/TT6 1 Tf +9.9626 0 0 9.9626 59.04 213.9 Tm +0 g +[(#include)-578.2("mcs360_integer_tree_node.h")]TJ +0 -2.397 TD +[(namespace)-578.2(mcs360_integer_tree)]TJ +0 -1.1925 TD +({)Tj +1.1925 -1.2045 TD +[(class)-590.2(Tree)]TJ +T* +({)Tj +1.8067 -1.1925 TD +(private:)Tj +1.1925 -1.2045 TD +(Node)Tj +2.9992 -0.1807 TD +(*)Tj +0.6023 0.1807 TD +[(root;)-1192.5(//)-590.2(data)-590.2(member)]TJ +-4.7939 -2.397 TD +(public:)Tj +1.1925 -1.2045 TD +[(Tree\(const)-578.2(int&)-590.2(item,)]TJ +2.9992 -1.1925 TD +[(const)-590.2(Tree&)-590.2(left)-590.2(=)-602.2(Tree\(\),)]TJ +0 -1.2045 TD +[(const)-590.2(Tree&)-590.2(right)-590.2(=)-602.2(Tree\(\))-578.2(\))-602.2(:)]TJ +-4.1917 -1.2045 TD +[(root\(new)-578.2(Node\(item,left.root,right.root\)\))-530({})]TJ +1.1925 -1.1925 TD +[(Tree)-590.2(get_left\(\))-578.2(const;)]TJ +0 -1.2045 TD +[(Tree)-590.2(get_right\(\))-578.2(const;)]TJ +T* +[(void)-590.2(insert\(int)-578.2(item\);)]TJ +ET +endstream +endobj +51 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +53 0 obj +<< +/Length 3459 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 148.68 242.22 Tm +0.2 0.2 0.7 rg +(function)Tj +/TT6 1 Tf +3.7868 0 TD +(rotate_right)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 59.04 180.9 Tm +0 g +[(Prototype)-264(of)-275(function)-275(in)-275(client)-275(of)-275(class)-297(T)121(ree:)]TJ +/TT6 1 Tf +0 -2.343 TD +[(Tree)-572(rotate_right)-550(\()-594(Tree)-572(t)-594(\))0(;)]TJ +0 -2.486 TD +[(//)-583(Returns)-572(the)-583(tree)-583(rotated)-561(to)-594(the)-583(right)]TJ +0 -1.243 TD +[(//)-583(around)-572(its)-583(root.)]TJ +0 -2.475 TD +[(//)-583(Precondition:)-539(left)-583(of)-583(t)-594(i)0(s)-594(not)-583(null.)]TJ +ET +endstream +endobj +54 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +56 0 obj +<< +/Length 3609 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 125.52 242.22 Tm +0.2 0.2 0.7 rg +(de)Tj +/TT7 1 Tf +1.1123 0 TD +(Þ)Tj +/TT2 1 Tf +0.5 0 TD +[(nition)-284.4(of)]TJ +/TT6 1 Tf +3.7934 0 TD +(rotate_right)Tj +10.9091 0 0 10.9091 59.04 196.14 Tm +0 g +[(Tree)-572(rotate_right)-550(\()-594(Tree)-572(t)-594(\))]TJ +0 -1.243 TD +({)Tj +1.793 -1.243 TD +[(Tree)-583(left)-583(=)-594(t.get_left\(\);)]TJ +0 -2.486 TD +[(Tree)-583(new_t)-572(=)-594(Tree\(t.get_data\()11(\),)]TJ +1.804 -1.232 TD +[(left.get_right\()11(\),)11(t.)11(ge)11(t_r)11(ig)11(ht)11(\(\))11(\);)]TJ +-1.804 -2.486 TD +[(Tree)-583(R)-594(=)-594(Tree\(left.get_d)11(ata)11(\(\))11(,)]TJ +8.404 -1.243 TD +[(left.get_left\(\))11(,n)11(ew)11(_t)11(\);)]TJ +-8.404 -2.486 TD +[(return)-572(R;)]TJ +-1.793 -1.243 TD +(})Tj +ET +endstream +endobj +57 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +/TT6 21 0 R +/TT7 58 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +60 0 obj +<< +/Length 4214 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0 g +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0.504 0.504 0.564 rg +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +0.84 0.84 0.94 rg +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.84 0.84 0.94 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0.8 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.2 0.2 0.7 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.2 0.2 0.7 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +0.8 g +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +61 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +63 0 obj +<< +/Length 4136 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0 g +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0.504 0.504 0.564 rg +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 241.08 242.22 Tm +0.2 0.2 0.7 rg +[(A)66.9(V)0(L)-276(T)117.1(rees)]TJ +10.9091 0 0 10.9091 59.04 193.98 Tm +0 g +(De)Tj +/TT7 1 Tf +1.2783 0 TD +(Þ)Tj +/TT2 1 Tf +0.5 0 TD +[(ne)-264(the)-264(balance)-264(of)-275(a)-275(tree)-275(as)]TJ +1.5547 -2.057 TD +[(balance)-253(=)-286(depth\(r)-11(ight)-264(tree\))]TJ +/F2 1 Tf +12.0128 0 TD +(Š)Tj +/TT2 1 Tf +1.056 0 TD +[(depth\(left)-264(tree\).)]TJ +-16.4019 -2.618 TD +[(Note:)-330(depth)-264(\(chapter)-275(8\))-275(=)-275(height)-264(\(chapter)-275(11\).)]TJ +0 -1.782 TD +[(G.M.)-275(Adel’)55(son-V)77(el’)55(skiî)-286(and)-264(E.M)-275(Landis)-264(pub)22(lished)-253(an)]TJ +0 -1.243 TD +[(algor)-11(ithm)-264(to)-275(maintain)-264(the)-275(balance)-253(of)-275(a)-275(binar)-33(y)-275(search)-275(tree)11(.)]TJ +0 -1.793 TD +[(If)-286(balance)-253(gets)-275(out)-275(of)-275(r)11(ange)]TJ +/F2 1 Tf +12.3475 0 TD +(Š)Tj +/TT2 1 Tf +0.781 0 TD +(1)Tj +/F3 1 Tf +0.7212 0 TD +0.1622 Tc +(...)Tj +/F5 1 Tf +1.375 0 TD +0 Tc +(+)Tj +/TT2 1 Tf +1.001 0 TD +(1,)Tj +-16.2257 -1.243 TD +[(the)-264(subtree)-275(is)-286(rotated)-264(to)-275(br)-11(ing)-275(into)-275(balance)11(.)]TJ +0 -1.793 TD +[(Their)-264(approach)-253(is)-286(kno)11(wn)-264(as)]TJ +/TT4 1 Tf +12.4482 0 TD +[(A)66(V)0(L)-264(trees)]TJ +/TT2 1 Tf +4.3113 0 TD +(.)Tj +ET +endstream +endobj +64 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F2 15 0 R +/F3 16 0 R +/F5 65 0 R +/TT2 4 0 R +/TT4 17 0 R +/TT7 58 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +67 0 obj +<< +/Length 4436 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0 g +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0.504 0.504 0.564 rg +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 193.56 242.22 Tm +0.2 0.2 0.7 rg +[(a)-276(Class)-284.4(Hier)8.4(arch)33.5(y)]TJ +ET +0 g +q +150.24 0 0 -0.48 128.748 217.728 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 128.748 217.368 cm +/Im1 Do +Q +BT +10.9091 0 0 10.9091 161.64 204.66 Tm +[(Binar)-33(y)-264(T)121(ree)-264(Node)]TJ +ET +q +0.48 0 0 -20.04 278.508 217.368 cm +/Im1 Do +Q +q +150.24 0 0 -0.48 128.748 197.448 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 203.628 192.528 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 203.88 182.46 Tm +( )Tj +ET +q +150.24 0 0 -0.48 128.748 167.928 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 128.748 167.568 cm +/Im1 Do +Q +BT +/TT2 1 Tf +10.9091 0 0 10.9091 157.32 154.62 Tm +[(Binar)-33(y)-275(Search)-264(T)121(ree)]TJ +ET +q +0.48 0 0 -20.04 278.508 167.568 cm +/Im1 Do +Q +q +150.24 0 0 -0.48 128.748 147.648 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 203.628 142.728 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 203.88 132.66 Tm +( )Tj +ET +q +200.16 0 0 -0.48 103.788 118.128 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 103.788 117.768 cm +/Im1 Do +Q +BT +/TT2 1 Tf +10.9091 0 0 10.9091 124.32 104.82 Tm +[(Binar)-33(y)-264(Search)-275(T)121(ree)-264(with)-275(Rotation)]TJ +ET +q +0.48 0 0 -20.04 303.468 117.768 cm +/Im1 Do +Q +q +200.16 0 0 -0.48 103.788 97.848 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 203.628 92.928 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 203.88 82.86 Tm +( )Tj +ET +q +100.44 0 0 -0.48 153.588 68.328 cm +/Im1 Do +Q +q +0.48 0 0 -20.04 153.588 67.968 cm +/Im1 Do +Q +BT +/TT2 1 Tf +10.9091 0 0 10.9091 181.8 54.06 Tm +[(A)66(V)0(L)-264(T)121(ree)]TJ +ET +q +0.48 0 0 -20.04 253.668 67.968 cm +/Im1 Do +Q +q +100.44 0 0 -0.48 153.588 48.048 cm +/Im1 Do +Q +endstream +endobj +68 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +70 0 obj +<< +/Length 4387 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0 g +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0.504 0.504 0.564 rg +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 161.76 242.22 Tm +0.2 0.2 0.7 rg +[(computing)-292.8(the)-292.8(balance)]TJ +10.9091 0 0 10.9091 59.04 207.06 Tm +0 g +[(Recall)-275(the)-264(de)]TJ +/TT7 1 Tf +5.8203 0 TD +(Þ)Tj +/TT2 1 Tf +0.5 0 TD +(nition:)Tj +-2.9873 -2.068 TD +[(balance)-253(=)-286(depth\(r)-11(ight)-264(tree\))]TJ +/F2 1 Tf +12.0128 0 TD +(Š)Tj +/TT2 1 Tf +1.056 0 TD +[(depth\(left)-264(tree\).)]TJ +-16.4019 -2.607 TD +[(At)-275(e)33(v)22(er)-33(y)-275(node)-264(w)11(e)-264(compute)-264(the)-275(balance)11(,)]TJ +0 -1.243 TD +[(displa)33(y)22(e)0(d)-264(a)0(s)-286(subscr)-11(ipt:)]TJ +/TT6 1 Tf +14.091 -2.409 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 225.84 114.3 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 206.88 103.26 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 196.8 93.3 Tm +0 Tc +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 210 91.38 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 230.76 93.3 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 243.84 91.38 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 190.92 80.34 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 183.96 70.38 Tm +0 Tc +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 190.56 68.46 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 213.84 70.38 Tm +(15)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 226.92 68.46 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 174.96 57.54 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 168.96 47.46 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 175.56 45.54 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 198.84 47.46 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 205.44 45.54 Tm +(0)Tj +ET +endstream +endobj +71 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/F6 72 0 R +/TT2 4 0 R +/TT6 21 0 R +/TT7 58 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +74 0 obj +<< +/Length 4354 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0 g +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0.504 0.504 0.564 rg +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 157.08 242.22 Tm +0.2 0.2 0.7 rg +[(balancing)-284.4(a)-284.4(left-left)-284.4(tree)]TJ +10.9091 0 0 10.9091 59.04 187.38 Tm +0 g +[(The)-264(tree)-275(belo)11(w)-253(i)0(s)]TJ +/TT4 1 Tf +7.8482 0 TD +[(left)-275(hea)22(vy)]TJ +/TT2 1 Tf +4.5304 0 TD +[(as)-286(the)-264(balance)-264(is)]TJ +/F2 1 Tf +7.7714 0 TD +(Š)Tj +/TT2 1 Tf +0.781 0 TD +(2.)Tj +-20.9311 -1.782 TD +[(W)33(e)-275(also)-275(sa)33(y)-286(that)-275(this)-275(is)-286(a)]TJ +/TT4 1 Tf +11.2741 0 TD +[(left-left)-286(tree)]TJ +/TT2 1 Tf +5.0101 0 TD +(.)Tj +/TT6 1 Tf +-7.8472 -2.684 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 164.16 136.74 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 145.08 125.7 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 135.12 115.74 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 148.2 113.82 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 129.12 102.9 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 122.16 92.94 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 128.76 91.02 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 218.88 115.74 Tm +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 231.96 113.82 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 212.88 102.9 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 206.88 92.94 Tm +0 Tc +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 213.48 91.02 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 236.76 92.94 Tm +(20)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 249.84 91.02 Tm +(0)Tj +10.9091 0 0 10.9091 59.04 67.38 Tm +[(Ex)33(ecuting)-264(a)-275(r)-11(ight)-286(rotation)-264(balances)-264(the)-275(tree)11(.)]TJ +ET +endstream +endobj +75 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/F6 72 0 R +/TT2 4 0 R +/TT4 17 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +77 0 obj +<< +/Length 4241 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +0.84 0.84 0.94 rg +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.84 0.84 0.94 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0.8 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.2 0.2 0.7 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.2 0.2 0.7 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0.8 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +0 g +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +0.8 g +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +78 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +81 0 obj +<< +/Length 5441 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 140.88 242.22 Tm +0.2 0.2 0.7 rg +[(cr)-16.7(itically)-259.3(unbalanced)-301.1(trees)]TJ +10.9091 0 0 10.9091 59.04 209.1 Tm +0 g +[(A)-275(tree)-275(is)]TJ +/TT4 1 Tf +3.9373 0 TD +[(cr)-11(itically)-308(unbalanced)]TJ +/TT2 1 Tf +9.2991 0 TD +[(if)-275(its)-286(balance)-264(is)]TJ +/F2 1 Tf +6.8361 0 TD +(Š)Tj +/TT2 1 Tf +0.781 0 TD +0.264 Tc +[(2o)264(r)]TJ +/F5 1 Tf +1.9953 0 TD +0 Tc +(+)Tj +/TT2 1 Tf +0.781 0 TD +(2.)Tj +/TT6 1 Tf +-15.1928 -1.76 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 164.16 187.98 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 145.08 176.94 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 135.12 166.98 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 148.2 165.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 129.12 154.02 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 122.16 144.06 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 128.76 142.14 Tm +(0)Tj +/TT4 1 Tf +10.9091 0 0 10.9091 107.28 129.06 Tm +[(a)-264(left-left)-297(tree)]TJ +/TT6 1 Tf +13.145 5.577 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 263.76 187.98 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 244.68 176.94 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 236.76 166.98 Tm +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 243.36 165.06 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 238.8 154.02 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 251.64 144.06 Tm +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 264.84 142.14 Tm +(0)Tj +/TT4 1 Tf +10.9091 0 0 10.9091 226.8 129.06 Tm +[(a)-275(left-r)-11(ight)-286(tree)]TJ +/TT6 1 Tf +-9.592 -3.564 TD +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 128.76 88.26 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 127.2 77.34 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 137.16 67.38 Tm +(10)Tj +/F7 1 Tf +7.9701 0 0 7.9701 150.24 65.46 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 143.16 54.42 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 155.04 44.46 Tm +(20)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 168.12 42.54 Tm +(0)Tj +/TT4 1 Tf +10.9091 0 0 10.9091 107.28 29.46 Tm +[(a)-264(r)-11(ight-r)-11(ight)-286(tree)]TJ +/TT6 1 Tf +12.32 5.566 TD +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 248.28 88.26 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 246.72 77.34 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 256.68 67.38 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 269.76 65.46 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 252.72 54.42 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 241.68 44.46 Tm +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 254.88 42.54 Tm +(0)Tj +/TT4 1 Tf +10.9091 0 0 10.9091 226.8 29.46 Tm +[(a)-275(r)-11(ight-left)-286(tree)]TJ +ET +endstream +endobj +82 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/F5 65 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT4 17 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +85 0 obj +<< +/Length 5881 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 120.84 242.22 Tm +0.2 0.2 0.7 rg +[(balancing)-292.8(trees)-276(of)-284.4(mix)33.5(ed)-284.4(kind)]TJ +10.9091 0 0 10.9091 59.04 221.1 Tm +0 g +[(A)-275(r)-11(ight)-275(rotation)-275(balances)-264(a)-264(left-left)-297(tree)]TJ +0 -1.243 TD +[(and)-264(a)-264(left)-286(rotation)-264(balances)-275(a)-264(r)-11(ight-r)-11(ight)-286(tree)11(.)]TJ +0 -1.793 TD +[(Balancing)-253(a)-275(left-r)-11(ight)-286(tree)-275(happens)-253(in)-275(tw)11(o)-275(stages:)]TJ +ET +0.2 0.2 0.7 rg +76.162 171.546 m +76.162 174.322 73.936 176.548 71.16 176.548 c +68.384 176.548 66.158 174.322 66.158 171.546 c +66.158 168.77 68.384 166.544 71.16 166.544 c +73.936 166.544 76.162 168.77 76.162 171.546 c +h +71.16 171.546 m +f +BT +7.9701 0 0 7.9701 68.9443 168.42 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 168.42 Tm +0 g +[(rotate)-264(left-r)-11(ight)-286(tree)-275(to)-275(left-left)-286(tree:)]TJ +/TT6 1 Tf +7.436 -1.683 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 175.08 148.14 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 156 137.1 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 148.08 127.14 Tm +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 154.68 125.22 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 150 114.18 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 162.96 104.22 Tm +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 176.04 102.3 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 261.6 150.06 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 274.68 148.14 Tm +()Tj +/TT2 1 Tf +0.8282 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 255.6 137.1 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 247.68 127.14 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 260.76 125.22 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 239.64 114.18 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 232.68 104.22 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 239.28 102.3 Tm +(0)Tj +ET +0.2 0.2 0.7 rg +76.162 87.786 m +76.162 90.562 73.936 92.788 71.16 92.788 c +68.384 92.788 66.158 90.562 66.158 87.786 c +66.158 85.01 68.384 82.784 71.16 82.784 c +73.936 82.784 76.162 85.01 76.162 87.786 c +h +71.16 87.786 m +f +BT +7.9701 0 0 7.9701 68.9443 84.66 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 84.66 Tm +0 g +[(apply)-264(r)-11(ight)-286(rotation)-264(to)-275(left-left)-286(tree:)]TJ +/TT6 1 Tf +7.436 -1.683 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 175.08 64.38 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 156 53.34 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 148.08 43.38 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 161.16 41.46 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 140.04 30.54 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 133.08 20.46 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 139.68 18.54 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 259.56 66.3 Tm +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 272.76 64.38 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 253.68 53.34 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 244.68 43.38 Tm +0 Tc +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 251.28 41.46 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 280.56 43.38 Tm +(20)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 293.64 41.46 Tm +(0)Tj +ET +endstream +endobj +86 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +88 0 obj +<< +/Length 6295 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 161.64 242.22 Tm +0.2 0.2 0.7 rg +[(rotating)-292.8(a)-276(left-r)-16.7(ight)-284.4(tree)]TJ +10.9091 0 0 10.9091 59.04 222.9 Tm +0 g +[(W)33(e)-275(rotate)-264(the)-275(left-r)-11(ight)-286(tree)-275(to)-275(a)-275(left-left)-286(tree:)]TJ +/TT6 1 Tf +7.062 -1.958 TD +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 149.28 199.62 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 130.2 188.7 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 122.16 178.74 Tm +0 Tc +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 128.76 176.82 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 155.04 178.74 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 168.12 176.82 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 114.24 165.78 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 137.16 155.82 Tm +0 Tc +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 150.24 153.9 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 107.28 155.82 Tm +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 113.88 153.9 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 130.2 142.86 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 122.16 132.9 Tm +0 Tc +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 128.76 130.98 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 156 132.9 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 169.2 130.98 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 255.72 201.54 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 268.8 199.62 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 249.72 188.7 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 241.68 178.74 Tm +0 Tc +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 254.88 176.82 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 274.56 178.74 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 287.76 176.82 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 233.76 165.78 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.8 155.82 Tm +0 Tc +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 233.4 153.9 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 256.68 155.82 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 269.76 153.9 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.84 142.86 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.8 132.9 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.4 130.98 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 241.68 132.9 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 248.28 130.98 Tm +(0)Tj +10.9091 0 0 10.9091 59.04 107.34 Tm +[(Obser)-33(v)22(e)-264(the)-275(eff)33(ects)-286(of)-275(the)-275(rotation:)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 91.26 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 90.78 Tm +0 g +[(the)-264(data)-264(at)-275(the)-275(left)-286(node)-253(of)-275(the)-275(ne)22(w)-264(tree)-275(\(10\))]TJ +0 -1.243 TD +[(is)-275(s)33(w)11(apped)-253(with)-275(the)-275(data)-264(of)-275(the)-275(left)-275(of)-286(the)-264(old)-275(tree)-275(\(5\);)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 61.26 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 60.78 Tm +0 g +[(the)-264(r)-11(ight)-286(of)-275(the)-264(left)-286(of)-275(the)-275(ne)22(w)-264(tree)-275(\(12\))]TJ +T* +[(is)-275(the)-275(r)-11(ight)-286(of)-275(the)-264(r)-11(ight)-286(of)-275(the)-264(left)-286(of)-275(the)-275(old)-264(tree;)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 31.14 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 30.66 Tm +0 g +[(the)-264(r)-11(ight)-286(of)-275(the)-264(left)-286(of)-275(the)-275(left)-275(of)-275(the)-275(ne)22(w)-264(tree)-275(\(7\))]TJ +T* +[(is)-275(the)-275(left)-286(of)-275(the)-264(r)-11(ight)-286(of)-275(the)-275(left)-275(of)-275(the)-275(old)-264(tree)11(.)]TJ +ET +endstream +endobj +89 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F2 15 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +91 0 obj +<< +/Length 8630 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 101.52 242.22 Tm +0.2 0.2 0.7 rg +[(rotating)-292.8(to)-276(left-left)-284.4(tree)-276(in)-276(4)-276(steps)]TJ +10.9091 0 0 10.9091 59.04 212.34 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-8.4153 -2.519 TD +(T)Tj +ET +q +20.04 0 0 -0.48 78.948 187.128 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 89.04 186.9 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 53.16 161.94 Tm +(L)Tj +ET +q +20.04 0 0 -0.48 62.988 164.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 73.08 163.98 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 105.84 182.82 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 118.92 180.9 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 169.86 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 159.9 Tm +0 Tc +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 98.52 157.98 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 124.8 159.9 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 137.88 157.98 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 84 146.94 Tm +0.3972 Tc +()Tj +ET +q +20.04 0 0 -0.48 131.748 141.288 cm +/Im1 Do +Q +BT +9.9626 0 0 9.9626 131.76 141.06 Tm +0 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 156.72 139.02 Tm +(R)Tj +-4.565 -0.187 TD +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 120 135.06 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 77.04 136.98 Tm +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 83.64 135.06 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 124.02 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 114.06 Tm +0 Tc +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 98.52 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 125.76 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 138.84 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 188.82 Tm +0.85 g +(N)Tj +ET +q +20.04 0 0 -0.48 198.468 191.088 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 190.86 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 186.78 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 233.04 184.86 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 173.94 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 163.86 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 163.86 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 252 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 139.02 Tm +(M)Tj +ET +q +20.04 0 0 -0.48 198.468 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 136.98 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 239.52 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 114.06 Tm +0 Tc +(N)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 258.48 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 278.28 139.02 Tm +(T)Tj +ET +q +20.04 0 0 -0.48 288.228 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 298.32 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 316.08 136.98 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 329.16 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 309.12 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 301.2 114.06 Tm +0 Tc +(M)Tj +/F6 1 Tf +7.9701 0 0 7.9701 307.8 112.14 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 335.04 114.06 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 348.12 112.14 Tm +(0)Tj +ET +0.88 0.88 0.955 rg +76.162 88.746 m +76.162 91.522 73.936 93.748 71.16 93.748 c +68.384 93.748 66.158 91.522 66.158 88.746 c +66.158 85.97 68.384 83.744 71.16 83.744 c +73.936 83.744 76.162 85.97 76.162 88.746 c +h +71.16 88.746 m +f +BT +7.9701 0 0 7.9701 68.9443 85.62 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 85.62 Tm +0.85 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.8641 0 TD +[(and)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2838 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0423 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 72.186 m +76.162 74.962 73.936 77.188 71.16 77.188 c +68.384 77.188 66.158 74.962 66.158 72.186 c +66.158 69.41 68.384 67.184 71.16 67.184 c +73.936 67.184 76.162 69.41 76.162 72.186 c +h +71.16 72.186 m +f +BT +7.9701 0 0 7.9701 68.9443 69.06 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 69.06 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1772 0 TD +(N)Tj +/TT2 1 Tf +0.8531 0 TD +[(has)-253(as)-253(its)-275(left)-253(the)-253(left)-264(of)]TJ +/TT6 1 Tf +10.3645 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-253(a)0(s)-264(its)-264(r)-11(ight)-264(the)-253(left)-253(of)]TJ +/TT6 1 Tf +9.6634 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 55.626 m +76.162 58.402 73.936 60.628 71.16 60.628 c +68.384 60.628 66.158 58.402 66.158 55.626 c +66.158 52.85 68.384 50.624 71.16 50.624 c +73.936 50.624 76.162 52.85 76.162 55.626 c +h +71.16 55.626 m +f +BT +7.9701 0 0 7.9701 68.9443 52.5 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 52.5 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1992 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(as)-286(its)-286(left)]TJ +/TT6 1 Tf +6.1134 0 TD +(N)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-286(a)0(s)-275(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4287 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 39.066 m +76.162 41.842 73.936 44.068 71.16 44.068 c +68.384 44.068 66.158 41.842 66.158 39.066 c +66.158 36.29 68.384 34.064 71.16 34.064 c +73.936 34.064 76.162 36.29 76.162 39.066 c +h +71.16 39.066 m +f +BT +7.9701 0 0 7.9701 68.9443 35.94 Tm +1 g +(4)Tj +10.9091 0 0 10.9091 80.88 35.94 Tm +0.85 g +[(Retur)-22(n)-264(the)-275(tree)-264(with)-275(its)-297(left)]TJ +/TT6 1 Tf +11.8991 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(and)-264(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4662 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +endstream +endobj +92 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +94 0 obj +<< +/Length 8630 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 101.52 242.22 Tm +0.2 0.2 0.7 rg +[(rotating)-292.8(to)-276(left-left)-284.4(tree)-276(in)-276(4)-276(steps)]TJ +10.9091 0 0 10.9091 59.04 212.34 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-8.4153 -2.519 TD +(T)Tj +ET +q +20.04 0 0 -0.48 78.948 187.128 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 89.04 186.9 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 53.16 161.94 Tm +(L)Tj +ET +q +20.04 0 0 -0.48 62.988 164.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 73.08 163.98 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 105.84 182.82 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 118.92 180.9 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 169.86 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 159.9 Tm +0 Tc +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 98.52 157.98 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 124.8 159.9 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 137.88 157.98 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 84 146.94 Tm +0.3972 Tc +()Tj +ET +q +20.04 0 0 -0.48 131.748 141.288 cm +/Im1 Do +Q +BT +9.9626 0 0 9.9626 131.76 141.06 Tm +0 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 156.72 139.02 Tm +(R)Tj +-4.565 -0.187 TD +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 120 135.06 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 77.04 136.98 Tm +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 83.64 135.06 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 124.02 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 114.06 Tm +0 Tc +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 98.52 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 125.76 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 138.84 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 188.82 Tm +(N)Tj +ET +q +20.04 0 0 -0.48 198.468 191.088 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 190.86 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 186.78 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 233.04 184.86 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 173.94 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 163.86 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 163.86 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 252 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 139.02 Tm +0.85 g +(M)Tj +ET +q +20.04 0 0 -0.48 198.468 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 136.98 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 239.52 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 114.06 Tm +0 Tc +(N)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 258.48 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 278.28 139.02 Tm +(T)Tj +ET +q +20.04 0 0 -0.48 288.228 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 298.32 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 316.08 136.98 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 329.16 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 309.12 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 301.2 114.06 Tm +0 Tc +(M)Tj +/F6 1 Tf +7.9701 0 0 7.9701 307.8 112.14 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 335.04 114.06 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 348.12 112.14 Tm +(0)Tj +ET +0.88 0.88 0.955 rg +76.162 88.746 m +76.162 91.522 73.936 93.748 71.16 93.748 c +68.384 93.748 66.158 91.522 66.158 88.746 c +66.158 85.97 68.384 83.744 71.16 83.744 c +73.936 83.744 76.162 85.97 76.162 88.746 c +h +71.16 88.746 m +f +BT +7.9701 0 0 7.9701 68.9443 85.62 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 85.62 Tm +0.85 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.8641 0 TD +[(and)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2838 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0423 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 72.186 m +76.162 74.962 73.936 77.188 71.16 77.188 c +68.384 77.188 66.158 74.962 66.158 72.186 c +66.158 69.41 68.384 67.184 71.16 67.184 c +73.936 67.184 76.162 69.41 76.162 72.186 c +h +71.16 72.186 m +f +BT +7.9701 0 0 7.9701 68.9443 69.06 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 69.06 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1772 0 TD +(N)Tj +/TT2 1 Tf +0.8531 0 TD +[(has)-253(as)-253(its)-275(left)-253(the)-253(left)-264(of)]TJ +/TT6 1 Tf +10.3645 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-253(a)0(s)-264(its)-264(r)-11(ight)-264(the)-253(left)-253(of)]TJ +/TT6 1 Tf +9.6634 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 55.626 m +76.162 58.402 73.936 60.628 71.16 60.628 c +68.384 60.628 66.158 58.402 66.158 55.626 c +66.158 52.85 68.384 50.624 71.16 50.624 c +73.936 50.624 76.162 52.85 76.162 55.626 c +h +71.16 55.626 m +f +BT +7.9701 0 0 7.9701 68.9443 52.5 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 52.5 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1992 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(as)-286(its)-286(left)]TJ +/TT6 1 Tf +6.1134 0 TD +(N)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-286(a)0(s)-275(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4287 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 39.066 m +76.162 41.842 73.936 44.068 71.16 44.068 c +68.384 44.068 66.158 41.842 66.158 39.066 c +66.158 36.29 68.384 34.064 71.16 34.064 c +73.936 34.064 76.162 36.29 76.162 39.066 c +h +71.16 39.066 m +f +BT +7.9701 0 0 7.9701 68.9443 35.94 Tm +1 g +(4)Tj +10.9091 0 0 10.9091 80.88 35.94 Tm +0.85 g +[(Retur)-22(n)-264(the)-275(tree)-264(with)-275(its)-297(left)]TJ +/TT6 1 Tf +11.8991 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(and)-264(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4662 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +endstream +endobj +95 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +97 0 obj +<< +/Length 8630 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 101.52 242.22 Tm +0.2 0.2 0.7 rg +[(rotating)-292.8(to)-276(left-left)-284.4(tree)-276(in)-276(4)-276(steps)]TJ +10.9091 0 0 10.9091 59.04 212.34 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-8.4153 -2.519 TD +(T)Tj +ET +q +20.04 0 0 -0.48 78.948 187.128 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 89.04 186.9 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 53.16 161.94 Tm +(L)Tj +ET +q +20.04 0 0 -0.48 62.988 164.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 73.08 163.98 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 105.84 182.82 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 118.92 180.9 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 169.86 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 159.9 Tm +0 Tc +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 98.52 157.98 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 124.8 159.9 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 137.88 157.98 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 84 146.94 Tm +0.3972 Tc +()Tj +ET +q +20.04 0 0 -0.48 131.748 141.288 cm +/Im1 Do +Q +BT +9.9626 0 0 9.9626 131.76 141.06 Tm +0 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 156.72 139.02 Tm +(R)Tj +-4.565 -0.187 TD +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 120 135.06 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 77.04 136.98 Tm +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 83.64 135.06 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 124.02 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 114.06 Tm +0 Tc +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 98.52 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 125.76 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 138.84 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 188.82 Tm +(N)Tj +ET +q +20.04 0 0 -0.48 198.468 191.088 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 190.86 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 186.78 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 233.04 184.86 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 173.94 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 163.86 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 163.86 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 252 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 139.02 Tm +(M)Tj +ET +q +20.04 0 0 -0.48 198.468 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 136.98 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 239.52 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 114.06 Tm +0 Tc +(N)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 258.48 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 278.28 139.02 Tm +0.85 g +(T)Tj +ET +q +20.04 0 0 -0.48 288.228 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 298.32 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 316.08 136.98 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 329.16 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 309.12 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 301.2 114.06 Tm +0 Tc +(M)Tj +/F6 1 Tf +7.9701 0 0 7.9701 307.8 112.14 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 335.04 114.06 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 348.12 112.14 Tm +(0)Tj +ET +0.88 0.88 0.955 rg +76.162 88.746 m +76.162 91.522 73.936 93.748 71.16 93.748 c +68.384 93.748 66.158 91.522 66.158 88.746 c +66.158 85.97 68.384 83.744 71.16 83.744 c +73.936 83.744 76.162 85.97 76.162 88.746 c +h +71.16 88.746 m +f +BT +7.9701 0 0 7.9701 68.9443 85.62 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 85.62 Tm +0.85 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.8641 0 TD +[(and)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2838 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0423 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 72.186 m +76.162 74.962 73.936 77.188 71.16 77.188 c +68.384 77.188 66.158 74.962 66.158 72.186 c +66.158 69.41 68.384 67.184 71.16 67.184 c +73.936 67.184 76.162 69.41 76.162 72.186 c +h +71.16 72.186 m +f +BT +7.9701 0 0 7.9701 68.9443 69.06 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 69.06 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1772 0 TD +(N)Tj +/TT2 1 Tf +0.8531 0 TD +[(has)-253(as)-253(its)-275(left)-253(the)-253(left)-264(of)]TJ +/TT6 1 Tf +10.3645 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-253(a)0(s)-264(its)-264(r)-11(ight)-264(the)-253(left)-253(of)]TJ +/TT6 1 Tf +9.6634 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 55.626 m +76.162 58.402 73.936 60.628 71.16 60.628 c +68.384 60.628 66.158 58.402 66.158 55.626 c +66.158 52.85 68.384 50.624 71.16 50.624 c +73.936 50.624 76.162 52.85 76.162 55.626 c +h +71.16 55.626 m +f +BT +7.9701 0 0 7.9701 68.9443 52.5 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 52.5 Tm +0.85 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1992 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(as)-286(its)-286(left)]TJ +/TT6 1 Tf +6.1134 0 TD +(N)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-286(a)0(s)-275(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4287 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.88 0.88 0.955 rg +76.162 39.066 m +76.162 41.842 73.936 44.068 71.16 44.068 c +68.384 44.068 66.158 41.842 66.158 39.066 c +66.158 36.29 68.384 34.064 71.16 34.064 c +73.936 34.064 76.162 36.29 76.162 39.066 c +h +71.16 39.066 m +f +BT +7.9701 0 0 7.9701 68.9443 35.94 Tm +1 g +(4)Tj +10.9091 0 0 10.9091 80.88 35.94 Tm +0.85 g +[(Retur)-22(n)-264(the)-275(tree)-264(with)-275(its)-297(left)]TJ +/TT6 1 Tf +11.8991 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(and)-264(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4662 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +endstream +endobj +98 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +100 0 obj +<< +/Length 8595 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 g +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0.504 0.504 0.564 rg +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 101.52 242.22 Tm +0.2 0.2 0.7 rg +[(rotating)-292.8(to)-276(left-left)-284.4(tree)-276(in)-276(4)-276(steps)]TJ +10.9091 0 0 10.9091 59.04 212.34 Tm +0 g +[(T)121(ree)-264(with)-275(root)-275(node)]TJ +/TT6 1 Tf +8.7282 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(:)Tj +/TT6 1 Tf +-8.4153 -2.519 TD +(T)Tj +ET +q +20.04 0 0 -0.48 78.948 187.128 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 89.04 186.9 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 53.16 161.94 Tm +(L)Tj +ET +q +20.04 0 0 -0.48 62.988 164.208 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 73.08 163.98 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 105.84 182.82 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 118.92 180.9 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 169.86 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 159.9 Tm +0 Tc +(5)Tj +/F7 1 Tf +7.9701 0 0 7.9701 98.52 157.98 Tm +(+)Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 124.8 159.9 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 137.88 157.98 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 84 146.94 Tm +0.3972 Tc +()Tj +ET +q +20.04 0 0 -0.48 131.748 141.288 cm +/Im1 Do +Q +BT +9.9626 0 0 9.9626 131.76 141.06 Tm +0 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 156.72 139.02 Tm +(R)Tj +-4.565 -0.187 TD +(10)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 120 135.06 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 77.04 136.98 Tm +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 83.64 135.06 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 99.84 124.02 Tm +0.4093 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 91.92 114.06 Tm +0 Tc +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 98.52 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 125.76 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 138.84 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 188.82 Tm +(N)Tj +ET +q +20.04 0 0 -0.48 198.468 191.088 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 190.86 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 186.78 Tm +(5)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 233.04 184.86 Tm +(0)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 173.94 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 163.86 Tm +0 Tc +(1)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 163.86 Tm +(7)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 252 161.94 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 188.52 139.02 Tm +(M)Tj +ET +q +20.04 0 0 -0.48 198.468 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 208.56 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 226.44 136.98 Tm +(10)Tj +/F6 1 Tf +7.9701 0 0 7.9701 239.52 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/F1 1 Tf +9.9626 0 0 9.9626 219.48 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 211.44 114.06 Tm +0 Tc +(N)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 218.04 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 245.4 114.06 Tm +(12)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 258.48 112.14 Tm +(0)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 278.28 139.02 Tm +(T)Tj +ET +q +20.04 0 0 -0.48 288.228 141.288 cm +/Im1 Do +Q +BT +/F1 1 Tf +9.9626 0 0 9.9626 298.32 141.06 Tm +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 316.08 136.98 Tm +(20)Tj +/F6 1 Tf +7.9701 0 0 7.9701 329.16 135.06 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(2)Tj +/F1 1 Tf +9.9626 0 0 9.9626 309.12 124.02 Tm +0.3972 Tc +()Tj +/TT6 1 Tf +10.9091 0 0 10.9091 301.2 114.06 Tm +0 Tc +(M)Tj +/F6 1 Tf +7.9701 0 0 7.9701 307.8 112.14 Tm +()Tj +/TT2 1 Tf +0.8281 0 TD +(1)Tj +/TT6 1 Tf +10.9091 0 0 10.9091 335.04 114.06 Tm +(40)Tj +/TT2 1 Tf +7.9701 0 0 7.9701 348.12 112.14 Tm +(0)Tj +ET +0.2 0.2 0.7 rg +76.162 88.746 m +76.162 91.522 73.936 93.748 71.16 93.748 c +68.384 93.748 66.158 91.522 66.158 88.746 c +66.158 85.97 68.384 83.744 71.16 83.744 c +73.936 83.744 76.162 85.97 76.162 88.746 c +h +71.16 88.746 m +f +BT +7.9701 0 0 7.9701 68.9443 85.62 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 85.62 Tm +0 g +[(Label)-253(left)-286(of)]TJ +/TT6 1 Tf +5.4287 0 TD +(T)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0533 0 TD +(L)Tj +/TT2 1 Tf +0.8641 0 TD +[(and)-264(r)-11(ight)-286(of)]TJ +/TT6 1 Tf +5.2838 0 TD +(L)Tj +/TT2 1 Tf +0.8751 0 TD +(with)Tj +/TT6 1 Tf +2.0423 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.2 0.2 0.7 rg +76.162 72.186 m +76.162 74.962 73.936 77.188 71.16 77.188 c +68.384 77.188 66.158 74.962 66.158 72.186 c +66.158 69.41 68.384 67.184 71.16 67.184 c +73.936 67.184 76.162 69.41 76.162 72.186 c +h +71.16 72.186 m +f +BT +7.9701 0 0 7.9701 68.9443 69.06 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 69.06 Tm +0 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1772 0 TD +(N)Tj +/TT2 1 Tf +0.8531 0 TD +[(has)-253(as)-253(its)-275(left)-253(the)-253(left)-264(of)]TJ +/TT6 1 Tf +10.3645 0 TD +(L)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-253(a)0(s)-264(its)-264(r)-11(ight)-264(the)-253(left)-253(of)]TJ +/TT6 1 Tf +9.6634 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.2 0.2 0.7 rg +76.162 55.626 m +76.162 58.402 73.936 60.628 71.16 60.628 c +68.384 60.628 66.158 58.402 66.158 55.626 c +66.158 52.85 68.384 50.624 71.16 50.624 c +73.936 50.624 76.162 52.85 76.162 55.626 c +h +71.16 55.626 m +f +BT +7.9701 0 0 7.9701 68.9443 52.5 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 52.5 Tm +0 g +[(T)121(ree)]TJ +/TT6 1 Tf +2.1992 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(has)-264(as)-286(its)-286(left)]TJ +/TT6 1 Tf +6.1134 0 TD +(N)Tj +/TT2 1 Tf +0.6001 0 TD +[(,)-286(a)0(s)-275(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4287 0 TD +(R)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +0.2 0.2 0.7 rg +76.162 39.066 m +76.162 41.842 73.936 44.068 71.16 44.068 c +68.384 44.068 66.158 41.842 66.158 39.066 c +66.158 36.29 68.384 34.064 71.16 34.064 c +73.936 34.064 76.162 36.29 76.162 39.066 c +h +71.16 39.066 m +f +BT +7.9701 0 0 7.9701 68.9443 35.94 Tm +1 g +(4)Tj +10.9091 0 0 10.9091 80.88 35.94 Tm +0 g +[(Retur)-22(n)-264(the)-275(tree)-264(with)-275(its)-297(left)]TJ +/TT6 1 Tf +11.8991 0 TD +(M)Tj +/TT2 1 Tf +0.8751 0 TD +[(and)-264(its)-286(r)-11(ight)-275(the)-275(r)-11(ight)-275(of)]TJ +/TT6 1 Tf +10.4662 0 TD +(T)Tj +/TT2 1 Tf +0.6001 0 TD +(.)Tj +ET +endstream +endobj +101 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F1 14 0 R +/F6 72 0 R +/F7 83 0 R +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +103 0 obj +<< +/Length 4214 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.8 242.22 Tm +0.2 0.2 0.7 rg +[(Balancing)-284.4(Search)-284.4(T)117.1(rees)]TJ +ET +0.84 0.84 0.94 rg +64.933 189.368 m +64.933 192.838 62.15 195.62 58.68 195.62 c +55.21 195.62 52.427 192.838 52.427 189.368 c +52.427 185.898 55.21 183.115 58.68 183.115 c +62.15 183.115 64.933 185.898 64.933 189.368 c +h +58.68 189.368 m +f +BT +9.9626 0 0 9.9626 55.9104 185.46 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 70.44 185.46 Tm +0.84 0.84 0.94 rg +[(T)121(ree)-264(Balance)-264(and)-264(Rotation)]TJ +0.8 g +0.957 -1.243 TD +[(binar)-33(y)-264(search)-275(trees)]TJ +T* +[(r)-11(ight)-275(rotation)-264(of)-286(a)-264(tree)-275(around)-264(a)-264(node)]TJ +T* +[(code)-264(f)33(o)0(r)-286(r)-11(ight)-275(rotation)]TJ +ET +0.2 0.2 0.7 rg +64.933 111.128 m +64.933 114.598 62.15 117.38 58.68 117.38 c +55.21 117.38 52.427 114.598 52.427 111.128 c +52.427 107.658 55.21 104.875 58.68 104.875 c +62.15 104.875 64.933 107.658 64.933 111.128 c +h +58.68 111.128 m +f +BT +9.9626 0 0 9.9626 55.9104 107.22 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 70.44 107.22 Tm +0.2 0.2 0.7 rg +[(A)66(V)0(L)-264(T)121(rees)]TJ +0.8 g +0.957 -1.243 TD +[(self-balancing)-264(search)-275(trees)]TJ +T* +[(f)33(our)-275(kinds)-275(of)-275(cr)-11(itically)-308(unbalanced)-242(trees)]TJ +0 g +T* +[(code)-264(f)33(o)0(r)-286(rotation)-264(of)-275(left-r)-11(ight)-286(to)-275(left-left)-286(tree)]TJ +ET +endstream +endobj +104 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +106 0 obj +<< +/Length 3688 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 152.28 242.22 Tm +0.2 0.2 0.7 rg +[(prototype)-292.8(of)-284.4(the)-292.8(function)]TJ +/TT6 1 Tf +9.9626 0 0 9.9626 59.04 172.02 Tm +0 g +[(Tree)-590.2(rotate_to_left_left)-554.1(\()-602.2(Tree)-590.2(t)-590.2(\))0(;)]TJ +0 -2.397 TD +[(//)-590.2(Returns)-590.2(the)-590.2(tree)-590.2(rotated)-578.2(to)-602.3(a)-602.3(left-left)-578.2(tree.)]TJ +T* +[(//)-590.2(Preconditions:)]TJ +0 -1.2045 TD +[(//)-1794.7(\(1\))-590.2(left)-590.2(of)-602.2(t)-590.2(i)0(s)-602.2(not)-590.2(null;)-590.2(and)]TJ +T* +[(//)-1794.7(\(2\))-590.2(right)-590.2(of)-590.2(left)-590.2(of)-602.3(t)-590.2(i)0(s)-602.3(not)-590.2(null.)]TJ +/TT2 1 Tf +10.9091 0 0 10.9091 59.04 74.82 Tm +[(T)121(est:)-341(inser)-44(t)-275(20,)-275(5,)-275(1,)-275(10,)-275(7,)-275(12)-264(to)-275(binar)-33(y)-275(search)-275(tree)11(.)]TJ +ET +endstream +endobj +107 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +/TT6 21 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +109 0 obj +<< +/Length 3813 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 154.56 242.22 Tm +0.2 0.2 0.7 rg +(de)Tj +/TT7 1 Tf +1.1123 0 TD +(Þ)Tj +/TT2 1 Tf +0.5 0 TD +[(nition)-292.8(of)-284.4(the)-292.8(function)]TJ +/TT6 1 Tf +9.9626 0 0 9.9626 59.04 209.22 Tm +0 g +[(Tree)-590.2(rotate_to_left_left)-554.1(\()-602.2(Tree)-590.2(t)-590.2(\))]TJ +0 -1.2045 TD +({)Tj +1.7947 -1.2045 TD +[(Tree)-590.2(left)-590.2(=)-602.2(t.get_left\(\);)]TJ +0 -1.1925 TD +[(Tree)-590.2(right)-590.2(=)-602.3(left.get_right\(\);)]TJ +0 -2.409 TD +[(Tree)-590.2(new_left)-590.2(=)-590.2(Tree\(left.get_data\(\),)]TJ +1.8067 -1.1925 TD +[(left.get_left\(\),right.get_left\(\)\))12(;)]TJ +-1.8067 -2.397 TD +[(Tree)-590.2(new_right)-578.2(=)-602.2(Tree\(right.get_data\(\),)]TJ +1.8067 -1.2045 TD +(new_left,right.get_right\(\)\);)Tj +-1.8067 -2.397 TD +[(Tree)-590.2(R)-602.3(=)-590.2(Tree\(t.get_data\(\),)]TJ +1.8067 -1.2045 TD +(new_right,t.get_right\(\)\);)Tj +-1.8067 -2.397 TD +[(return)-590.2(R;)]TJ +-1.7947 -1.2045 TD +(})Tj +ET +endstream +endobj +110 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +/TT6 21 0 R +/TT7 58 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +113 0 obj +<< +/Length 4563 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 149.04 242.22 Tm +0.2 0.2 0.7 rg +[(rebalancing)-292.8(search)-284.4(trees)]TJ +10.9091 0 0 10.9091 59.04 195.78 Tm +0 g +[(After)-275(each)-264(inser)-44(t)-286(\(or)-275(remo)11(v)22(al\):)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 170.82 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 170.34 Tm +0 g +[(chec)22(k)-275(the)-275(balance)-264(of)-275(the)-264(tree)11(,)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 148.26 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 147.78 Tm +0 g +[(and)-253(if)-286(cr)-11(itically)-308(unbalanced,)-253(rebalance)11(.)]TJ +-2.002 -2.343 TD +[(P)55(erf)33(or)-22(mance)-264(of)-275(the)-275(A)66(V)0(L)-264(tree:)]TJ +/F2 1 Tf +9.9626 0 0 9.9626 70.44 100.26 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 99.78 Tm +0 g +[(w)11(orst)-275(case:)-352(1)]TJ +/F3 1 Tf +5.9515 0 TD +(.)Tj +/TT2 1 Tf +0.275 0 TD +(44)Tj +/F2 1 Tf +1.3213 0 TD +(×)Tj +/TT2 1 Tf +1.001 0 TD +(log)Tj +7.9701 0 0 7.9701 188.76 96.78 Tm +(2)Tj +/F5 1 Tf +10.9091 0 0 10.9091 193.68 99.78 Tm +(\()Tj +/TT4 1 Tf +0.385 0 TD +(n)Tj +/F5 1 Tf +0.5672 0 TD +(\))Tj +/TT2 1 Tf +0.385 0 TD +(,)Tj +/F2 1 Tf +9.9626 0 0 9.9626 70.44 77.7 Tm +0.2 0.2 0.7 rg +(€)Tj +/TT2 1 Tf +10.9091 0 0 10.9091 80.88 77.22 Tm +0 g +[(on)-264(a)22(v)22(e)0(r)11(age:)-330(log)]TJ +7.9701 0 0 7.9701 156.12 74.34 Tm +(2)Tj +/F5 1 Tf +10.9091 0 0 10.9091 161.04 77.22 Tm +(\()Tj +/TT4 1 Tf +0.385 0 TD +(n)Tj +/F5 1 Tf +0.5672 0 TD +0.2271 Tc +(\)+)Tj +/TT2 1 Tf +1.617 0 TD +0 Tc +(0)Tj +/F3 1 Tf +0.5562 0 TD +(.)Tj +/TT2 1 Tf +0.275 0 TD +[(25)-264(compar)-11(isons)-275(needed.)]TJ +/F2 1 Tf +-12.7504 -2.068 TD +()Tj +/TT2 1 Tf +1.276 0 TD +[(close)-275(to)-275(complete)-275(binar)-33(y)-264(search)-275(tree)11(.)]TJ +ET +endstream +endobj +114 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/F2 15 0 R +/F3 16 0 R +/F5 65 0 R +/TT2 4 0 R +/TT4 17 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +116 0 obj +<< +/Length 5810 +>> +stream +1 g +/GS1 gs +q +362.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +0.84 0.84 0.94 rg +q +44.88 0 0 -272.16 -0.012 272.088 cm +/Im1 Do +Q +BT +/TT2 1 Tf +5.9776 0 0 5.9776 3.12 258.78 Tm +0.2 0.2 0.7 rg +0 Tc +0 Tw +[(MCS)-301.1(360)-261(L-33)]TJ +0 g +0.6826 -2.4291 TD +[(8)-261(N)0(o)20.1(v)-281.1(2010)]TJ +0.584 0.584 0.844 rg +-0.7026 -2.951 TD +[(T)120.5(ree)-261(Balance)]TJ +0 -1.1643 TD +[(and)-261(Rotation)]TJ +3.9851 0 0 3.9851 5.04 212.34 Tm +0.504 0.504 0.564 rg +[(binar)-30.1(y)-301.1(search)-301.1(trees)]TJ +0 -1.7164 TD +[(right)-301.1(rotation)-361.3(of)-301.1(a)-271(tree)]TJ +0 -1.2346 TD +[(around)-331.2(a)-301.1(node)]TJ +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(right)-331.2(rotation)]TJ +5.9776 0 0 5.9776 3 181.74 Tm +0.584 0.584 0.844 rg +[(A)60.2(V)0(L)-261(T)120.5(rees)]TJ +3.9851 0 0 3.9851 5.04 174.54 Tm +0.504 0.504 0.564 rg +[(self-balancing)-391.5(search)]TJ +0 -1.2647 TD +(trees)Tj +0 -1.7164 TD +[(f)30.1(our)-301.1(kinds)-301.1(of)-301.1(critically)]TJ +0 -1.2346 TD +[(unbalanced)-361.3(trees)]TJ +0 g +0 -1.7164 TD +[(code)-301.1(f)30.1(o)0(r)-301.1(rotation)-361.3(of)]TJ +0 -1.2647 TD +[(left-right)-361.3(to)-301.1(left-left)]TJ +0 -1.2346 TD +(tree)Tj +ET +0.68 0.68 0.88 RG +0 J 0 j 0.398 w 10 M []0 d +1 i +243.229 4.217 3.387 2.391 re +S +0.84 0.84 0.94 rg +238.96 3.92 m +236.96 5.42 l +238.96 6.92 l +f +250.96 3.92 m +252.96 5.42 l +250.96 6.92 l +f +262.934 3.42 3.387 2.391 re +263.76 5.82 m +263.76 6.62 l +267.16 6.62 l +267.16 4.22 l +266.36 4.22 l +264.56 6.62 m +264.56 7.42 l +267.96 7.42 l +267.96 5.02 l +267.16 5.02 l +S +259.96 3.92 m +257.96 5.42 l +259.96 6.92 l +271.96 3.92 m +273.96 5.42 l +271.96 6.92 l +f +0.598 w +285.96 6.42 m +288.96 6.42 l +S +280.96 3.92 m +278.96 5.42 l +280.96 6.92 l +292.96 3.92 m +294.96 5.42 l +292.96 6.92 l +f +0.84 0.84 0.94 RG +284.96 7.42 m +287.96 7.42 l +285.96 5.42 m +288.96 5.42 l +284.96 4.42 m +287.96 4.42 l +285.96 3.42 m +288.96 3.42 l +S +0.68 0.68 0.88 RG +305.96 7.42 m +308.96 7.42 l +306.96 6.42 m +309.96 6.42 l +306.96 5.42 m +309.96 5.42 l +S +301.96 3.92 m +299.96 5.42 l +301.96 6.92 l +313.96 3.92 m +315.96 5.42 l +313.96 6.92 l +f +0.84 0.84 0.94 RG +305.96 4.42 m +308.96 4.42 l +306.96 3.42 m +309.96 3.42 l +S +0.68 0.68 0.88 RG +327.08 7.42 m +330.08 7.42 l +328.08 6.42 m +331.08 6.42 l +328.08 5.42 m +331.08 5.42 l +327.08 4.42 m +330.08 4.42 l +328.08 3.42 m +331.08 3.42 l +350.48 5.02 m +352.08 3.42 l +S +0.398 w +350.74 5.911 m +350.74 6.574 350.208 7.106 349.545 7.106 c +348.881 7.106 348.349 6.574 348.349 5.911 c +348.349 5.247 348.881 4.715 349.545 4.715 c +350.208 4.715 350.74 5.247 350.74 5.911 c +h +349.545 5.911 m +S +1 J +344.08 3.42 m +345.161 3.42 346.08 4.32 346.08 5.42 c +346.08 6.52 345.18 7.42 344.08 7.42 c +342.98 7.42 342.08 6.52 342.08 5.42 c +343.28 6.02 m +342.08 5.02 l +340.88 6.02 l +356.08 3.42 m +354.98 3.42 354.08 4.32 354.08 5.42 c +354.08 6.52 354.98 7.42 356.08 7.42 c +357.18 7.42 358.08 6.52 358.08 5.42 c +359.28 6.02 m +358.08 5.02 l +356.88 6.02 l +S +BT +14.3462 0 0 14.3462 145.92 242.22 Tm +0.2 0.2 0.7 rg +[(Summar)-33.5(y)-267.7(+)-276(Assignments)]TJ +10.9091 0 0 10.9091 59.04 214.86 Tm +0 g +[(Star)-44(ted)-264(chapter)-264(11)-275(on)-264(balancing)-253(binar)-33(y)-275(search)-275(trees)11(.)]TJ +1 0 0 rg +0 -1.793 TD +(Assignments:)Tj +ET +0.2 0.2 0.7 rg +76.162 178.986 m +76.162 181.762 73.936 183.988 71.16 183.988 c +68.384 183.988 66.158 181.762 66.158 178.986 c +66.158 176.21 68.384 173.984 71.16 173.984 c +73.936 173.984 76.162 176.21 76.162 178.986 c +h +71.16 178.986 m +f +BT +7.9701 0 0 7.9701 68.9443 175.86 Tm +1 g +(1)Tj +10.9091 0 0 10.9091 80.88 175.86 Tm +0 g +[(F)33(o)0(r)-22(m)11(ulate)-264(the)-264(algor)-11(ithm)-275(f)33(o)0(r)-275(left)-286(rotation)-264(and)-264(illustr)11(ate)]TJ +0 -1.243 TD +[(with)-264(an)-275(e)33(xample)11(.)]TJ +ET +0.2 0.2 0.7 rg +76.162 148.866 m +76.162 151.642 73.936 153.868 71.16 153.868 c +68.384 153.868 66.158 151.642 66.158 148.866 c +66.158 146.09 68.384 143.864 71.16 143.864 c +73.936 143.864 76.162 146.09 76.162 148.866 c +h +71.16 148.866 m +f +BT +7.9701 0 0 7.9701 68.9443 145.74 Tm +1 g +(2)Tj +10.9091 0 0 10.9091 80.88 145.74 Tm +0 g +[(Wr)-11(ite)-275(code)-275(f)33(o)0(r)-275(left)-286(rotation)-264(around)-264(the)-264(root)-275(and)-264(giv)22(e)-275(the)]TJ +T* +[(output)-264(of)-275(a)-264(test)-286(to)-275(sho)11(w)-264(that)-275(it)-286(w)11(o)0(r)-11(k)0(s)11(.)]TJ +ET +0.2 0.2 0.7 rg +76.162 118.746 m +76.162 121.522 73.936 123.748 71.16 123.748 c +68.384 123.748 66.158 121.522 66.158 118.746 c +66.158 115.97 68.384 113.744 71.16 113.744 c +73.936 113.744 76.162 115.97 76.162 118.746 c +h +71.16 118.746 m +f +BT +7.9701 0 0 7.9701 68.9443 115.62 Tm +1 g +(3)Tj +10.9091 0 0 10.9091 80.88 115.62 Tm +0 g +[(F)33(o)0(r)-22(m)11(ulate)-264(the)-264(algor)-11(ithm)-275(to)-275(rotate)-275(a)-264(r)-11(ight-left)-286(tree)-275(to)-275(a)]TJ +T* +[(r)-11(ight-r)-11(ight)-275(tree)-275(and)-264(illustr)11(ate)-286(with)-275(an)-264(e)33(xample)11(.)]TJ +ET +0.2 0.2 0.7 rg +76.162 88.746 m +76.162 91.522 73.936 93.748 71.16 93.748 c +68.384 93.748 66.158 91.522 66.158 88.746 c +66.158 85.97 68.384 83.744 71.16 83.744 c +73.936 83.744 76.162 85.97 76.162 88.746 c +h +71.16 88.746 m +f +BT +7.9701 0 0 7.9701 68.9443 85.62 Tm +1 g +(4)Tj +10.9091 0 0 10.9091 80.88 85.62 Tm +0 g +[(Wr)-11(ite)-275(code)-275(f)33(o)0(r)-275(the)-275(rotation)-264(of)-275(the)-275(pre)33(vious)-275(e)33(x)33(ercise)-286(and)]TJ +T* +[(giv)22(e)-264(the)-275(output)-264(of)-275(a)-275(test)-286(to)-275(sho)11(w)-264(that)-275(it)-275(w)11(o)0(r)-11(k)0(s)11(.)]TJ +1 0 0 rg +-2.002 -1.793 TD +[(Home)22(w)11(o)0(r)-11(k)-264(due)-264(Monda)33(y)-264(1)0(5)-264(N)0(o)11(v)22(ember)55(,)-264(a)0(t)-275(noon:)]TJ +0 g +0 -1.243 TD +[(#2,)-264(3)-275(o)0(f)-275(L-27;)-275(#1,)-264(2)-275(o)0(f)-275(L-28;)-275(and)-264(#2)-264(of)-275(L-29.)]TJ +1 0 0 rg +T* +[(Lab)-264(session)-275(of)-275(tomorro)11(w)55(,)-264(T)121(u)0(e)-264(9)-275(No)11(v)77(,)-264(in)-275(EP)121(ASWL270!)]TJ +ET +endstream +endobj +117 0 obj +<< +/ProcSet [/PDF /Text /ImageB ] +/Font << +/TT2 4 0 R +>> +/XObject << +/Im1 5 0 R +>> +/ExtGState << +/GS1 6 0 R +>> +>> +endobj +5 0 obj +<< +/Type /XObject +/Subtype /Image +/Width 1 +/Height 1 +/BitsPerComponent 1 +/ImageMask true +/Length 2 +>> +stream + +endstream +endobj +6 0 obj +<< +/Type /ExtGState +/SA false +/SM 0.02 +/OP false +/op false +/OPM 1 +/BG2 /Default +/UCR2 /Default +/HT /Default +/TR2 /Default +>> +endobj +118 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 32 +/FontBBox [-65 -250 1062 761] +/FontName /ILBPOP+CMSS8 +/ItalicAngle 0 +/StemV 87 +/StemH 66 +/CharSet (/plus) +/FontFile3 119 0 R +>> +endobj +119 0 obj +<< +/Length 267 +/Subtype /Type1C +>> +stream + ILBPOP+CMSS8øøø JûŽúºù÷÷°÷yFKCopyright (C) 1997 American Mathematical Society. All Rights ReservedCMSS8 Uÿb*ªÿ:fh# ÷ʹ÷ËŸø¹øH÷w÷º™¡‹¢¢u‹}ûº÷»™‹¡tt‹u}û»û»}u‹tt¡‹™÷»û»}‹u¢¢‹¡™v ùJ û£š÷Y ûa– Cyÿ Í +â Æ’ â™ +endstream +endobj +120 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 96 +/FontBBox [-30 -955 1185 779] +/FontName /ILBPNG+CMSY8 +/ItalicAngle -14.035 +/StemV 89 +/StemH 46 +/CharSet (/minus) +/FontFile3 121 0 R +>> +endobj +121 0 obj +<< +/Length 213 +/Subtype /Type1C +>> +stream + ILBPNG+CMSY8%øøáJ_ ø mþO¡ùŸ÷$÷'÷VFKCopyright (C) 1997 American Mathematical Society. All Rights ReservedCMSY8¦*ÿ:fh÷w¹äùùP÷w™¡‹¢¢u‹}üÓ}u‹tt¡‹™s£ù? û“¹ +ä ¹š +endstream +endobj +122 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 32 +/FontBBox [-61 -250 999 759] +/FontName /ILBPMF+CMSS10 +/ItalicAngle 0 +/StemV 78 +/StemH 61 +/CharSet (/plus/parenleft/parenright) +/FontFile3 123 0 R +>> +endobj +123 0 obj +<< +/Length 418 +/Subtype /Type1C +>> +stream +ILBPMF+CMSS10øøø NûŽú{ù‹÷÷%¾øFLCopyright (C) 1997 American Mathematical Society. All Rights ReservedCMSS10  EˆÖ ûŽ úSŸÚÙ÷£ù‚kmHN]ûc „!Bû×÷$û»_È[»û÷÷×ÃŽ÷ ´÷ +´÷ÄǬ¬ûŽ úSŸ÷{Ù÷ ûŽ«©Îȹ÷³ö’õÔ÷×û$÷[·N»[÷ûû×Sˆû bû +bûROjjÿQqÆ8 ÷¸³÷¹Ÿø³ø-÷z÷«™ž‹ŸŸx‹}û«÷¬™‹žww‹x}û¬û¬}x‹wwž‹™÷¬û¬}‹xŸŸ‹ž™u¡ùJ¡û¤œ÷W¡ûb— Cyÿ È +Ù ÈŽ Ù– 8ŠˆˆŸD +33O +endstream +endobj +124 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 4 +/FontBBox [-200 -200 200 200] +/FontName /ILBPJF+LCIRCLE10 +/ItalicAngle 0 +/StemV 40 +/StemH 40 +/CharSet (/a115) +/FontFile3 125 0 R +>> +endobj +125 0 obj +<< +/Filter /FlateDecode +/Length 219 +/Subtype /Type1C +>> +stream +H‰bd`ad`ddôôq +ðrÓöqö röq54 ªþaü!ÎòC–GL懱ÿ"Öïæüß­¾Û +ö/b`fdd ˆL444uÎ/¨,ÊLÏ(QÐpÖT0´´4×Q0200TpÌM-ÊLNÌSðM,ÉHÍM,rr‚ó“3SK*õsr‚@úŠ‚R‹S‹ÊRSî```lg`,f`bdd7øÏèÆ÷CåwÌFÁü=Fì;“áÓßL¿™ AäSÃïLß™ž>ýÎ$Ç·™k37@€r +Gø +endstream +endobj +126 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 68 +/FontBBox [-29 -960 1116 775] +/FontName /ILBPEC+CMSY10 +/ItalicAngle -14.035 +/StemV 85 +/StemH 40 +/CharSet (/bullet/greaterequal/minus/multiply/arrowright) +/FontFile3 127 0 R +>> +endobj +127 0 obj +<< +/Filter /FlateDecode +/Length 610 +/Subtype /Type1C +>> +stream +H‰4PKOQžK™ŠZ +IfFbDbBD •`ãÂQ¦5¦à0…êPÚð˜ÞÚÌÔaèk:Œ´%ƘøNãÆ7ü‰‰1øH܉ ½eêcªr¾Í9çË9ßw *+€õÔÙçO:9»{/µ.wq=Àu•Ô§Ó¦+– +LYöŽþêÛüQ¼C¢Îjt¦õÔ>Åv•ìªs÷r¬ÇÏrìq×Ãq>žò;}×æ ³‰iéèhcºFXnxÀ3Êt{üCìˆÇo^¦×70ÌúÍL—×Ëô”'ƘvŒån²Wÿ{2â>ñ€ðHITTÛöfÃ> +endobj +129 0 obj +<< +/Length 381 +/Subtype /Type1C +>> +stream +ILBPEE+CMMI10$øøáJÿ ø kûŽú¬ù‚÷%÷,¹÷âFLCopyright (C) 1997 American Mathematical Society. All Rights ReservedCMMI10 Eb¯ ûU ÷@õ÷I¡÷_ŒÍr²djwropŸq¬—˜”•ŽŒŒŒŒŒŠ}AhOjj€€‹‰ˆ„‡–ÛØ÷  ‹õáõ÷TÀ¨s£nnssnn£s¨¨££¨ød ø­ŸÞø÷ù7ø†—‘’––‚”€ˆ‰‹„~ü¾û™€†ƒ†“†–†ø¾û™„˜‹Ž–””––„‘ü¡÷Œu¡ù?¡û¦––˜ûa– Cyÿ ª +Ó ¤‘ 3:33O8Jww +endstream +endobj +130 0 obj +<< +/Type /FontDescriptor +/Ascent 0 +/CapHeight 0 +/Descent 0 +/Flags 4 +/FontBBox [-150 -150 1020 1020] +/FontName /ILBPDL+LINE10 +/ItalicAngle 0 +/StemV 40 +/StemH 40 +/CharSet (/a80/a16/a72/a8/a0/a64/a45/a27/a54) +/FontFile3 131 0 R +>> +endobj +131 0 obj +<< +/Filter /FlateDecode +/Length 584 +/Subtype /Type1C +>> +stream +H‰LÐÏKÛ`ð¼«Ù²vtZÒšl8غ´ZµÞæteŠsâN=fY;‡ÅUFiÓäMÖ¼M›ÒÑSËØÅãð,xÚqø'ÈβÓàÍòJYžËóð|ày¾€ºFüË«ÏÖ—V®.¯=Çú“;Ö$°&†¬{·ÆI”DmÃ6h¼r¯ ãôHûïÝåÀC3>ÿÈØDH|'Ä„¤Ÿ¦æ„ÄŒ0“fÂÜ”Œ-n8ØɼÝÊó÷ðñùù¹GüT,çrâNfSxÏ¿ò[bNÈ;M–½½™óOø…l–ßè»]~CÜwöÄ7W×9ç) u“b†ÃgŸ¾X§¼Î”‡JR9ê+õƒú ÆÁ +ø¾óþý®]è€}û›ÇÖì‹jȨ‡Z¥f±"C¨Dz…Þ! (Ë¡b³Ô2 „jYÊ’¬=¶Œ†é"jªê KHKP–$!TÕõ>ÂçW¨„²&ª7š.Š@USýùE—ÕJ¹ì"]¯VD¢]ü¥>[“kGY2š"Á4‰d±SÁ4M1ÿw¬ gÉþXe wD‚'$pÆÓ8p†ƒ'˜;büÖE“ Q|êÁQë‚Má@s˜cÔë9Â¥I0EÌ@$m[c‘"#9\,•Š$#…³ ½ k¬‡[ÍfË€¬q‰˜V›ÕUX…®)R:æR¡Ui5×4䆄¸@êø«ªUÕ%¥ºdö 9§5]×KÌŠYÖ9ÿ±÷ØgŽE–¼ÓÓ¯Ø é\ +endstream +endobj +132 0 obj +<< +/Type /FontDescriptor +/Ascent 770 +/CapHeight 718 +/Descent -229 +/Flags 32 +/FontBBox [-166 -225 1000 931] +/FontName /Helvetica +/ItalicAngle 0 +/StemV 88 +/XHeight 523 +/StemH 88 +>> +endobj +133 0 obj +<< +/Type /FontDescriptor +/Ascent 770 +/CapHeight 718 +/Descent -229 +/Flags 96 +/FontBBox [-170 -225 1116 931] +/FontName /Helvetica-Oblique +/ItalicAngle -15 +/StemV 88 +/XHeight 523 +/StemH 88 +>> +endobj +134 0 obj +<< +/Type /FontDescriptor +/Ascent 753 +/CapHeight 562 +/Descent -246 +/Flags 35 +/FontBBox [-28 -250 628 805] +/FontName /Courier +/ItalicAngle 0 +/StemV 51 +/XHeight 426 +/StemH 51 +>> +endobj +135 0 obj +<< +/Type /FontDescriptor +/Ascent 770 +/CapHeight 718 +/Descent -229 +/Flags 32 +/FontBBox [-166 -225 1000 931] +/FontName /Helvetica +/ItalicAngle 0 +/StemV 88 +/XHeight 523 +/StemH 88 +>> +endobj +14 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 1 +/LastChar 9 +/Widths [1000 1000 1000 1000 1000 1000 1000 1000 1000 ] +/Encoding 136 0 R +/BaseFont /ILBPDL+LINE10 +/FontDescriptor 130 0 R +>> +endobj +15 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 1 +/LastChar 215 +/Widths [778 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 500 +0 0 0 0 0 0 0 0 0 778 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 778 ] +/Encoding 137 0 R +/BaseFont /ILBPEC+CMSY10 +/FontDescriptor 126 0 R +/ToUnicode 138 0 R +>> +endobj +16 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 44 +/LastChar 60 +/Widths [278 0 278 0 0 0 0 0 0 0 0 0 0 0 0 0 +778 ] +/Encoding /WinAnsiEncoding +/BaseFont /ILBPEE+CMMI10 +/FontDescriptor 128 0 R +>> +endobj +48 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 1 +/LastChar 1 +/Widths [400 ] +/Encoding 139 0 R +/BaseFont /ILBPJF+LCIRCLE10 +/FontDescriptor 124 0 R +>> +endobj +65 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 40 +/LastChar 43 +/Widths [389 389 0 778 ] +/Encoding /WinAnsiEncoding +/BaseFont /ILBPMF+CMSS10 +/FontDescriptor 122 0 R +>> +endobj +72 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 21 +/LastChar 21 +/Widths [826 ] +/Encoding 140 0 R +/BaseFont /ILBPNG+CMSY8 +/FontDescriptor 120 0 R +>> +endobj +83 0 obj +<< +/Type /Font +/Subtype /Type1 +/FirstChar 43 +/LastChar 43 +/Widths [826 ] +/Encoding /WinAnsiEncoding +/BaseFont /ILBPOP+CMSS8 +/FontDescriptor 118 0 R +>> +endobj +4 0 obj +<< +/Type /Font +/Subtype /TrueType +/FirstChar 33 +/LastChar 238 +/Widths [278 0 556 0 0 0 0 333 333 0 584 278 333 278 0 556 +556 556 556 556 556 556 556 556 556 278 278 0 584 0 0 0 +667 667 722 722 667 611 778 722 278 500 0 556 833 722 778 667 +0 722 667 611 0 667 944 0 0 0 0 0 0 0 0 0 +556 556 500 556 556 278 556 556 222 0 500 222 833 556 556 556 +556 333 500 278 556 500 722 500 500 500 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 222 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 0 0 0 278 ] +/Encoding /WinAnsiEncoding +/BaseFont /Helvetica +/FontDescriptor 132 0 R +>> +endobj +17 0 obj +<< +/Type /Font +/Subtype /TrueType +/FirstChar 45 +/LastChar 121 +/Widths [333 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 +0 0 0 0 667 0 0 0 0 0 0 0 0 0 0 556 +0 722 0 0 0 0 0 0 0 667 0 0 0 0 0 0 +0 0 0 0 556 556 500 556 556 278 556 556 222 0 0 222 +0 556 0 0 0 333 500 278 556 500 0 500 500 ] +/Encoding /WinAnsiEncoding +/BaseFont /Helvetica-Oblique +/FontDescriptor 133 0 R +>> +endobj +21 0 obj +<< +/Type /Font +/Subtype /TrueType +/FirstChar 34 +/LastChar 125 +/Widths [600 600 0 0 600 0 600 600 600 0 600 600 600 600 600 600 +600 600 600 600 600 600 600 600 600 600 0 600 0 0 0 0 +0 0 0 0 0 0 0 0 0 0 600 600 600 0 600 0 +600 0 600 600 0 0 0 0 0 0 0 0 0 600 0 600 +600 600 600 600 600 600 600 600 0 0 600 600 600 600 600 0 +600 600 600 600 600 600 0 0 0 600 0 600 ] +/Encoding /WinAnsiEncoding +/BaseFont /Courier +/FontDescriptor 134 0 R +>> +endobj +58 0 obj +<< +/Type /Font +/Subtype /TrueType +/FirstChar 222 +/LastChar 222 +/Widths [500 ] +/Encoding /MacRomanEncoding +/BaseFont /Helvetica +/FontDescriptor 135 0 R +>> +endobj +140 0 obj +<< +/Type /Encoding +/BaseEncoding /WinAnsiEncoding +/Differences [ 19/Lslash/lslash/minus/fraction/breve/caron/dotlessi/dotaccent +/hungarumlaut/ogonek/ring/fi/fl +] +>> +endobj +136 0 obj +<< +/Type /Encoding +/Differences [ 1/a80/a16/a72/a8/a0/a64/a45/a27 +/a54 +] +>> +endobj +137 0 obj +<< +/Type /Encoding +/Differences [ 1/greaterequal/arrowright 128/bullet 138/minus 215/multiply +] +>> +endobj +139 0 obj +<< +/Type /Encoding +/Differences [ 1/a115 +] +>> +endobj +138 0 obj +<< +/Filter /FlateDecode +/Length 244 +>> +stream +H‰TPËnà ¼ó{LÕ)M+!.‰*ùЇê´wk©„ñÁ_ Vª@³™]zìNwè{ +¦Ç ƒó6á–d.8:\€u&oQûͤ#ÐBî×9ãÔù!€”„~”âœÓ +»gqÏ%‹ÉùvgþùUýãNè30P +,„_t|Õ­´¿Üy¢Å|,ÎQLÚ’qÒ ·ÿkde\ó­¹v +ñ°W‹Šù“(ø‘UÌDúõðŠ«¨dìtP¤ho*uJ]ýfØ,)•]Ú}šåjÖy¼0†X½ÕG~úRr: +endstream +endobj +1 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 3 0 R +/Contents 2 0 R +>> +endobj +8 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 10 0 R +/Contents 9 0 R +>> +endobj +11 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 13 0 R +/Contents 12 0 R +>> +endobj +18 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 20 0 R +/Contents 19 0 R +>> +endobj +22 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 24 0 R +/Contents 23 0 R +>> +endobj +25 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 27 0 R +/Contents 26 0 R +>> +endobj +28 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 30 0 R +/Contents 29 0 R +>> +endobj +31 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 33 0 R +/Contents 32 0 R +>> +endobj +34 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 36 0 R +/Contents 35 0 R +>> +endobj +37 0 obj +<< +/Type /Page +/Parent 7 0 R +/Resources 39 0 R +/Contents 38 0 R +>> +endobj +40 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 42 0 R +/Contents 41 0 R +>> +endobj +45 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 47 0 R +/Contents 46 0 R +>> +endobj +49 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 51 0 R +/Contents 50 0 R +>> +endobj +52 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 54 0 R +/Contents 53 0 R +>> +endobj +55 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 57 0 R +/Contents 56 0 R +>> +endobj +59 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 61 0 R +/Contents 60 0 R +>> +endobj +62 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 64 0 R +/Contents 63 0 R +>> +endobj +66 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 68 0 R +/Contents 67 0 R +>> +endobj +69 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 71 0 R +/Contents 70 0 R +>> +endobj +73 0 obj +<< +/Type /Page +/Parent 44 0 R +/Resources 75 0 R +/Contents 74 0 R +>> +endobj +76 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 78 0 R +/Contents 77 0 R +>> +endobj +80 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 82 0 R +/Contents 81 0 R +>> +endobj +84 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 86 0 R +/Contents 85 0 R +>> +endobj +87 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 89 0 R +/Contents 88 0 R +>> +endobj +90 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 92 0 R +/Contents 91 0 R +>> +endobj +93 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 95 0 R +/Contents 94 0 R +>> +endobj +96 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 98 0 R +/Contents 97 0 R +>> +endobj +99 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 101 0 R +/Contents 100 0 R +>> +endobj +102 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 104 0 R +/Contents 103 0 R +>> +endobj +105 0 obj +<< +/Type /Page +/Parent 79 0 R +/Resources 107 0 R +/Contents 106 0 R +>> +endobj +108 0 obj +<< +/Type /Page +/Parent 111 0 R +/Resources 110 0 R +/Contents 109 0 R +>> +endobj +112 0 obj +<< +/Type /Page +/Parent 111 0 R +/Resources 114 0 R +/Contents 113 0 R +>> +endobj +115 0 obj +<< +/Type /Page +/Parent 111 0 R +/Resources 117 0 R +/Contents 116 0 R +>> +endobj +141 0 obj +<< +/S /D +>> +endobj +142 0 obj +<< +/Nums [0 141 0 R ] +>> +endobj +7 0 obj +<< +/Type /Pages +/Kids [1 0 R 8 0 R 11 0 R 18 0 R 22 0 R 25 0 R 28 0 R 31 0 R 34 0 R 37 0 R] +/Count 10 +/Parent 43 0 R +>> +endobj +44 0 obj +<< +/Type /Pages +/Kids [40 0 R 45 0 R 49 0 R 52 0 R 55 0 R 59 0 R 62 0 R 66 0 R 69 0 R 73 0 R] +/Count 10 +/Parent 43 0 R +>> +endobj +79 0 obj +<< +/Type /Pages +/Kids [76 0 R 80 0 R 84 0 R 87 0 R 90 0 R 93 0 R 96 0 R 99 0 R 102 0 R 105 0 R] +/Count 10 +/Parent 43 0 R +>> +endobj +111 0 obj +<< +/Type /Pages +/Kids [108 0 R 112 0 R 115 0 R] +/Count 3 +/Parent 43 0 R +>> +endobj +43 0 obj +<< +/Type /Pages +/Kids [7 0 R 44 0 R 79 0 R 111 0 R ] +/Count 33 +/MediaBox [0 0 363 272] +>> +endobj +143 0 obj +<< +/CreationDate (D:20101108113143-06'00') +/ModDate (D:20101108113143-06'00') +/Producer (Apple pstopdf) +>> +endobj +144 0 obj +<< +/Type /Catalog +/Pages 43 0 R +/PageLabels 142 0 R +>> +endobj +xref +0 145 +0000000000 65535 f +0000188088 00000 n +0000000016 00000 n +0000004505 00000 n +0000185590 00000 n +0000177957 00000 n +0000178094 00000 n +0000190936 00000 n +0000188168 00000 n +0000004634 00000 n +0000008885 00000 n +0000188249 00000 n +0000009015 00000 n +0000014451 00000 n +0000183896 00000 n +0000184094 00000 n +0000184722 00000 n +0000186313 00000 n +0000188332 00000 n +0000014626 00000 n +0000018193 00000 n +0000186689 00000 n +0000188415 00000 n +0000018346 00000 n +0000022559 00000 n +0000188498 00000 n +0000022712 00000 n +0000026991 00000 n +0000188581 00000 n +0000027121 00000 n +0000032106 00000 n +0000188664 00000 n +0000032270 00000 n +0000038944 00000 n +0000188747 00000 n +0000039097 00000 n +0000045771 00000 n +0000188830 00000 n +0000045924 00000 n +0000052570 00000 n +0000188913 00000 n +0000052723 00000 n +0000056975 00000 n +0000191441 00000 n +0000191071 00000 n +0000188997 00000 n +0000057105 00000 n +0000062375 00000 n +0000184927 00000 n +0000189081 00000 n +0000062539 00000 n +0000066458 00000 n +0000189165 00000 n +0000066600 00000 n +0000070112 00000 n +0000189249 00000 n +0000070254 00000 n +0000073916 00000 n +0000187146 00000 n +0000189333 00000 n +0000074070 00000 n +0000078337 00000 n +0000189417 00000 n +0000078467 00000 n +0000082656 00000 n +0000185087 00000 n +0000189501 00000 n +0000082843 00000 n +0000087332 00000 n +0000189585 00000 n +0000087473 00000 n +0000091913 00000 n +0000185265 00000 n +0000189669 00000 n +0000092100 00000 n +0000096507 00000 n +0000189753 00000 n +0000096694 00000 n +0000100988 00000 n +0000191209 00000 n +0000189837 00000 n +0000101118 00000 n +0000106612 00000 n +0000185423 00000 n +0000189921 00000 n +0000106821 00000 n +0000112755 00000 n +0000190005 00000 n +0000112930 00000 n +0000119278 00000 n +0000190089 00000 n +0000119464 00000 n +0000128147 00000 n +0000190173 00000 n +0000128322 00000 n +0000137005 00000 n +0000190257 00000 n +0000137180 00000 n +0000145863 00000 n +0000190341 00000 n +0000146038 00000 n +0000154687 00000 n +0000190427 00000 n +0000154863 00000 n +0000159131 00000 n +0000190514 00000 n +0000159262 00000 n +0000163004 00000 n +0000190601 00000 n +0000163147 00000 n +0000167014 00000 n +0000191349 00000 n +0000190689 00000 n +0000167169 00000 n +0000171786 00000 n +0000190777 00000 n +0000171962 00000 n +0000177826 00000 n +0000178234 00000 n +0000178448 00000 n +0000178785 00000 n +0000179006 00000 n +0000179289 00000 n +0000179524 00000 n +0000180012 00000 n +0000180229 00000 n +0000180539 00000 n +0000180801 00000 n +0000181502 00000 n +0000181735 00000 n +0000182186 00000 n +0000182431 00000 n +0000183106 00000 n +0000183302 00000 n +0000183508 00000 n +0000183700 00000 n +0000187498 00000 n +0000187591 00000 n +0000187770 00000 n +0000187707 00000 n +0000187316 00000 n +0000190865 00000 n +0000190894 00000 n +0000191547 00000 n +0000191671 00000 n +trailer +<< +/Size 145 +/Root 144 0 R +/Info 143 0 R +/ID [] +>> +startxref +191743 +%%EOF diff --git a/07 Trees/06 BST generic/BST_Generic.class b/07 Trees/06 BST generic/BST_Generic.class new file mode 100644 index 0000000..f855350 Binary files /dev/null and b/07 Trees/06 BST generic/BST_Generic.class differ diff --git a/07 Trees/06 BST generic/BST_Generic.java b/07 Trees/06 BST generic/BST_Generic.java new file mode 100644 index 0000000..75a8a63 --- /dev/null +++ b/07 Trees/06 BST generic/BST_Generic.java @@ -0,0 +1,266 @@ +// Name: B6-24 +// Date: 2/26/2020 +import java.util.*; + +interface BSTinterface +{ + public int size(); + public boolean contains(E element); + public E add(E element); + //public E addBalanced(E element); + public E remove(E element); + public E min(); + public E max(); + public String display(); + public String toString(); + public ArrayList toList(); //returns an in-order list of E +} + +/******************* + Copy your BST code. Implement generics. +**********************/ +public class BST_Generic> implements BSTinterface +{ + private TreeNode root; + private int size; + public BST_Generic() + { + root = null; + size = 0; + } + public int size() + { + return size; + } + public TreeNode getRoot() //for Grade-It + { + return root; + } + /****** + @param s -- one string to be inserted + ********/ + public E add(E s) + { + root = add(root, s); + size++; + return s; + } + private TreeNode add(TreeNode t, E s) + { + if (t == null) + return new TreeNode(s, null, null); + + TreeNode p, q; + p = q = t; + E str; + + while(p != null) { + str = p.getValue(); + if (str.compareTo(s) >= 0) + p = p.getLeft(); + else + p = p.getRight(); + + if (p != null) + q = p; + } + + str = q.getValue(); + + if (str.compareTo(s) >= 0) + q.setLeft(new TreeNode(s, null, null)); + else + q.setRight(new TreeNode(s, null, null)); + + return t; + } + + public String display() + { + return display(root, 0); + } + private String display(TreeNode t, int level) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + } + + public boolean contains(E obj) + { + return contains(root, obj); + } + public boolean contains(TreeNode t, E x) + { + if (t == null) + return false; + + TreeNode temp = root; + E str = root.getValue(); + + while (!str.equals(x)) { + + if (str.compareTo(x) >= 0) + temp = temp.getLeft(); + else + temp = temp.getRight(); + + if (temp == null) + return false; + + str = temp.getValue(); + } + + return true; + } + + public E min() + { + return min(root); + } + private E min(TreeNode t) //use iteration + { + if (t == null) + return null; + TreeNode temp = t; + while (temp.getLeft() != null) { + temp = temp.getLeft(); + } + return temp.getValue(); + } + + public E max() + { + return max(root); + } + private E max(TreeNode t) //use recursion + { + if (t == null) return null; + if (t.getRight() == null) + return t.getValue(); + else + return max(t.getRight()); + } + + public String toString() + { + return toString(root); + } + private String toString(TreeNode t) //an in-order traversal + { + if (t == null) + return ""; + return toString(t.getLeft()) + " " + t.getValue().toString() + " " + toString(t.getRight()); + } + + public E remove(E target) + { + root = remove(root, target); + size--; + return target; + } + private TreeNode remove(TreeNode current, E target) + { + if (current == null) + return null; + + E str = current.getValue(); + if (str.equals(target)) { + if (current.getLeft() == null && current.getRight() == null) + return null; + else if (current.getLeft() == null) + return current.getRight(); + else if (current.getRight() == null) + return current.getLeft(); + + current.setValue(min(current.getRight())); + current.setRight(remove(current.getRight(), current.getValue())); + return current; + + } else if (str.compareTo(target) > 0) { + current.setLeft(remove(current.getLeft(), target)); + } else if (str.compareTo(target) <= 0) { + current.setRight(remove(current.getRight(), target)); + } + + return current; + + } + + public ArrayList toList () { + return toList(root); + } + + private ArrayList toList(TreeNode t) { + ArrayList toReturn = new ArrayList<>(); + if(t == null) + return null; + if (t.getLeft() != null) + toReturn.addAll(toList(t.getLeft())); + + toReturn.add(t.getValue()); //preorder visit + + if (t.getRight() != null) + toReturn.addAll(toList(t.getRight())); //recurse right + return toReturn; + } +} + +/******************* + Copy your TreeNode code. Implement generics. +**********************/ +class TreeNode +{ + private E value; + private TreeNode left, right; + + public TreeNode(E initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode (E initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public E getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(E theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} \ No newline at end of file diff --git a/07 Trees/06 BST generic/BST_Generic_Driver.class b/07 Trees/06 BST generic/BST_Generic_Driver.class new file mode 100644 index 0000000..b8fc1f2 Binary files /dev/null and b/07 Trees/06 BST generic/BST_Generic_Driver.class differ diff --git a/07 Trees/06 BST generic/BST_Generic_Driver.java b/07 Trees/06 BST generic/BST_Generic_Driver.java new file mode 100644 index 0000000..b80738d --- /dev/null +++ b/07 Trees/06 BST generic/BST_Generic_Driver.java @@ -0,0 +1,112 @@ +import java.util.*; +import java.io.*; + +/******************* +Driver class for a generic BST. +**********************/ +public class BST_Generic_Driver +{ + public static int numberWidgets = 10; + public static void main(String[] args) + { + /* + Put some Widget objects into your BST. Display the tree. + Print it using toString(). Are the objects in BST order? + */ + BST_Generic treeOfWidgets = new BST_Generic(); + treeOfWidgets.add( new Widget( 3, 5 )); + treeOfWidgets.add( new Widget( 4, 0 )); + treeOfWidgets.add( new Widget( 4, 6 )); + treeOfWidgets.add( new Widget( 2, 0 )); + treeOfWidgets.add( new Widget( 3, 3 )); + System.out.println(treeOfWidgets.display()); + System.out.println(treeOfWidgets.toString()); + System.out.println("Size: " + treeOfWidgets.size()); + System.out.println("Min: " + treeOfWidgets.min()); + System.out.println("Mas: " + treeOfWidgets.max()); + + /* + Prompt the user to enter cubits and hands. If the tree contains that + Widget, remove it, of course restoring the BST order. Display the new tree + and its size. If the tree does not contain that Widget, print "Not found". + */ +// Scanner kb = new Scanner( System.in ); +// do{ +// System.out.print("Remove which Widget? "); +// int stop = kb.nextInt(); +// if(stop == -1) +// System.exit(0); +// Widget toRemove = new Widget( stop, kb.nextInt() ); +// if( treeOfWidgets.contains( toRemove ) ) +// { +// treeOfWidgets.remove( toRemove ); +// System.out.println(treeOfWidgets.display()); +// System.out.println(treeOfWidgets.toString()); +// System.out.println("Size: " + treeOfWidgets.size()); +// } +// else +// System.out.println( "Not found."); +// }while( treeOfWidgets.size() != 0 ); + + /* + Stress test. Put some random Widgets in an ArrayList. Make a copy of the + ArrayList. Add the Widgets, at random, to your generic BST. + Remove the Widgets, at random, from your generic BST. Is the + BST in order at every step? + */ + int N = 10; + ArrayList listOfWidgets = new ArrayList<>(); + ArrayList widgetsToRemove = new ArrayList<>(); + for( int x = 0; x < N; x++ ) + { + int cubits = (int)(Math.random() * 10); + int hands = (int)(Math.random() * 10); + listOfWidgets.add(new Widget( cubits, hands )); + widgetsToRemove.add(new Widget( cubits, hands )); + } + for( int x = 0; x < N; x++ ) + { + int index = (int)(Math.random() * listOfWidgets.size()); + Widget randomWidget = listOfWidgets.remove(index); + treeOfWidgets.add( randomWidget); + } + System.out.println( treeOfWidgets.display() ); + System.out.println("In order? " + checkInOrder( treeOfWidgets )); + System.out.println(); + + for( int x = 0; x < N-1; x++ ) + { + int index = (int)(Math.random() * widgetsToRemove.size()); + Widget randomWidget = widgetsToRemove.remove(index); + System.out.println(">>> Now removing " + randomWidget +"\n"); + treeOfWidgets.remove( randomWidget); + System.out.println( treeOfWidgets.display() ); + + System.out.println("In order? " + checkInOrder( treeOfWidgets )); + System.out.println(); + } + } + + /* how can you get the computer to test if the objects are "in order"? */ + public static boolean checkInOrder(BST_Generic bst) { + return checkInOrder(bst.getRoot()); + } + + private static boolean checkInOrder (TreeNode t) { + + if (t == null) + return true; + + if (t.getLeft() != null && t.getValue().compareTo(t.getLeft().getValue()) < 0) + return false; + + if (t.getRight() != null && t.getValue().compareTo(t.getRight().getValue()) > 0) + return false; + + if (!checkInOrder(t.getLeft()) || !checkInOrder(t.getRight())) + return false; + + return true; + + } +} \ No newline at end of file diff --git a/07 Trees/06 BST generic/BSTinterface.class b/07 Trees/06 BST generic/BSTinterface.class new file mode 100644 index 0000000..bc92861 Binary files /dev/null and b/07 Trees/06 BST generic/BSTinterface.class differ diff --git a/07 Trees/06 BST generic/Generic BST.docx b/07 Trees/06 BST generic/Generic BST.docx new file mode 100644 index 0000000..4b368b0 Binary files /dev/null and b/07 Trees/06 BST generic/Generic BST.docx differ diff --git a/07 Trees/06 BST generic/TreeNode.class b/07 Trees/06 BST generic/TreeNode.class new file mode 100644 index 0000000..0f0b174 Binary files /dev/null and b/07 Trees/06 BST generic/TreeNode.class differ diff --git a/07 Trees/06 BST generic/Widget.class b/07 Trees/06 BST generic/Widget.class new file mode 100644 index 0000000..fb2a286 Binary files /dev/null and b/07 Trees/06 BST generic/Widget.class differ diff --git a/07 Trees/06 BST generic/Widget.java b/07 Trees/06 BST generic/Widget.java new file mode 100644 index 0000000..44f0caa --- /dev/null +++ b/07 Trees/06 BST generic/Widget.java @@ -0,0 +1,86 @@ +//Torbert, e-mail: mr@torbert.com, website: www.mr.torbert.com +//version 7.22.2003 +//mlbillington@fcps.edu version 10/14/05, 10/09/2006, 4/25/2007 + +/*************************************** +Modify the Widget class so that it hashes on its +values, not on its address. Be sure that compareTo(), +equals(Object) and hashCode() agree with each other. +****************************************/ +public class Widget implements Comparable +{ + // fields + private int myCubits, myHands; + + // constructors + public Widget() + { + myCubits = myHands = 0; + } + public Widget(int x) + { + myCubits = x; + myHands = 0; + } + public Widget(int x, int y) + { + myCubits = x; + myHands = y; + } + public Widget(Widget arg) + { + myCubits = arg.getCubits(); + myHands = arg.getHands(); + } + + //accessors and modifiers + public int getCubits() + { + return myCubits; + } + public int getHands() + { + return myHands; + } + public void setCubits(int x) + { + myCubits = x; + } + public void setHands(int x) + { + myHands = x; + } + + //other methods + public int compareTo(Widget other) + { + // Widget w = (Widget)arg; no need to cast + if(myCubits < other.getCubits()) + return -1; + if(myCubits > other.myCubits) + return 1; + if(myHands < other.myHands) //"private" is at the class level + return -1; + if(myHands > other.getHands()) + return 1; + return 0; + } + public boolean equals(Widget other) //not equals(Object arg) + { + return compareTo(other) == 0; + } + public String toString() + { + return myCubits + " cubits " + myHands + " hands"; + } + + /* 2 new methods for this lab */ + public boolean equals(Object arg) + { + return equals((Widget)arg ); + } + public int hashCode() + { + return toString().hashCode(); + } +} \ No newline at end of file diff --git a/07 Trees/06 BST generic/widgets.txt b/07 Trees/06 BST generic/widgets.txt new file mode 100644 index 0000000..ba757e9 --- /dev/null +++ b/07 Trees/06 BST generic/widgets.txt @@ -0,0 +1,113 @@ +13 +15 +12 +67 +3 +10 +4 +32 +1 +5 +16 +39 +2 +29 +14 +12 +0 +12 +7 +70 +0 +19 +13 +63 +0 +24 +15 +0 +14 +31 +0 +43 +5 +18 +13 +74 +7 +43 +2 +32 +12 +55 +8 +73 +5 +96 +1 +75 +9 +98 +8 +81 +5 +57 +12 +51 +2 +24 +15 +85 +14 +13 +9 +32 +11 +43 +6 +19 +13 +2 +14 +92 +8 +62 +15 +86 +3 +39 +5 +91 +3 +35 +3 +28 +12 +90 +13 +17 +5 +92 +1 +23 +7 +11 +11 +1 +3 +54 +14 +32 +11 +41 +10 +99 +5 +56 +3 +22 +6 +26 +2 +28 +5 diff --git a/07 Trees/07 TreePriorityQueue/Item.class b/07 Trees/07 TreePriorityQueue/Item.class new file mode 100644 index 0000000..d10124c Binary files /dev/null and b/07 Trees/07 TreePriorityQueue/Item.class differ diff --git a/07 Trees/07 TreePriorityQueue/TreeNode.class b/07 Trees/07 TreePriorityQueue/TreeNode.class new file mode 100644 index 0000000..903fd0e Binary files /dev/null and b/07 Trees/07 TreePriorityQueue/TreeNode.class differ diff --git a/07 Trees/07 TreePriorityQueue/TreeNode.java b/07 Trees/07 TreePriorityQueue/TreeNode.java new file mode 100644 index 0000000..c281380 --- /dev/null +++ b/07 Trees/07 TreePriorityQueue/TreeNode.java @@ -0,0 +1,51 @@ +/* TreeNode class for the AP Exams + */ +public class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/07 Trees/07 TreePriorityQueue/TreePriorityQueue.class b/07 Trees/07 TreePriorityQueue/TreePriorityQueue.class new file mode 100644 index 0000000..d42f55f Binary files /dev/null and b/07 Trees/07 TreePriorityQueue/TreePriorityQueue.class differ diff --git a/07 Trees/07 TreePriorityQueue/TreePriorityQueue.doc b/07 Trees/07 TreePriorityQueue/TreePriorityQueue.doc new file mode 100644 index 0000000..dcc18ef Binary files /dev/null and b/07 Trees/07 TreePriorityQueue/TreePriorityQueue.doc differ diff --git a/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.class b/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.class new file mode 100644 index 0000000..1b89647 Binary files /dev/null and b/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.class differ diff --git a/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.java b/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.java new file mode 100644 index 0000000..73351fa --- /dev/null +++ b/07 Trees/07 TreePriorityQueue/TreePriorityQueue_Driver.java @@ -0,0 +1,158 @@ +// Name: +// Date: +public class TreePriorityQueue_Driver +{ + private static TreePriorityQueue tpq = null; + public static void main(String[] args) + { + tpq = new TreePriorityQueue(); + int[] array = {13, 11, 14, 11, 15, 14, 14}; + // int[] array = {4, 6, 5, 7}; + // int[] array = {7, 6, 4, 5}; + //int[] array = {7, 6, 4, 5, 4, 4}; + // int[] array = {4, 5, 4, 4, 7, 6, 7, 7}; + + tpq = build( tpq, array ); + System.out.println( tpq.display() ); + System.out.println("Peek min: " + tpq.peekMin()); + System.out.println("Removing"); + while( !tpq.isEmpty() ) + System.out.println( " " + tpq.removeMin() ); + } + public static TreePriorityQueue build( TreePriorityQueue tpq, int[] array ) + { + for( int x : array ) + tpq.add(x); + return tpq; + } +} + +class TreePriorityQueue +{ + private TreeNode root; + + public TreePriorityQueue() + { root = null; } + + //postcondition: returns true if the priority queue is empty; + // otherwise, returns false + public boolean isEmpty() + { + return root == null; + } + + //postcondition: obj has been added to the priority queue + public void add(Object obj) + { + root = addHelper((Comparable) obj, root); + } + + //postcondition: obj has been added to the subtree rooted at t; + // the updated subtree is returned + private TreeNode addHelper(Comparable obj, TreeNode t) + { + if (t == null) + return new TreeNode(new Item(obj)); + + if (obj.compareTo(((Item) t.getValue()).getData()) > 0) + t.setRight(addHelper(obj, t.getRight())); + else if (obj.compareTo(((Item) t.getValue()).getData()) < 0) + t.setLeft(addHelper(obj, t.getLeft())); + else + ((Item) t.getValue()).incrementCount(); + + return t; + } + + + //precondition: the priority queue is not empty + //postcondition: a data value of highest priority (smallest value) has been + // removed and returned + public Object removeMin() + { + + if (root == null) + return null; + + if (root.getLeft() == null) { + Object temp = root.getValue(); + root.setLeft(null); + return temp; + } + + TreeNode pointer = root; + while (pointer.getLeft().getLeft() != null) + pointer = pointer.getLeft(); + + Object temp = root.getValue(); + root.setLeft(null); + return temp; + + + } + + //precondition: the priority queue is not empty + //postcondition: a data value of highest priority (smallest value) if returned; + // the priority queue is unchanged + public Object peekMin() + { + if (root == null) + return null; + + TreeNode pointer = root; + while (pointer.getLeft() != null) + pointer = pointer.getLeft(); + + return ((Item)pointer.getValue()).getData(); + } + public String display() + { + return display( root, 0 ); + } + private String display( TreeNode t, int level ) + { + String toRet = ""; + if(t == null) + return ""; + toRet += display(t.getRight(), level + 1); //recurse right + for(int k = 0; k < level; k++) + toRet += "\t"; + toRet += t.getValue() + "\n"; + toRet += display(t.getLeft(), level + 1); //recurse left + return toRet; + + } +} + +class Item +{ + private Comparable data; + private int count; + public Item(Comparable d) + { + data = d; + count = 1; + + } + public void incrementCount() + { + count++; + } + //precondition: the count of this item is greater than 0; + public void decrementCount() + { + count--; + } + public int getCount() + { + return count; + } + public Comparable getData() + { + return data; + } + public String toString() + { + return data.toString() + "[" + count + "]"; + } +} \ No newline at end of file diff --git a/07 Trees/07 TreePriorityQueue/widgets.txt b/07 Trees/07 TreePriorityQueue/widgets.txt new file mode 100644 index 0000000..ba757e9 --- /dev/null +++ b/07 Trees/07 TreePriorityQueue/widgets.txt @@ -0,0 +1,113 @@ +13 +15 +12 +67 +3 +10 +4 +32 +1 +5 +16 +39 +2 +29 +14 +12 +0 +12 +7 +70 +0 +19 +13 +63 +0 +24 +15 +0 +14 +31 +0 +43 +5 +18 +13 +74 +7 +43 +2 +32 +12 +55 +8 +73 +5 +96 +1 +75 +9 +98 +8 +81 +5 +57 +12 +51 +2 +24 +15 +85 +14 +13 +9 +32 +11 +43 +6 +19 +13 +2 +14 +92 +8 +62 +15 +86 +3 +39 +5 +91 +3 +35 +3 +28 +12 +90 +13 +17 +5 +92 +1 +23 +7 +11 +11 +1 +3 +54 +14 +32 +11 +41 +10 +99 +5 +56 +3 +22 +6 +26 +2 +28 +5 diff --git a/07 Trees/08 SpellCheckTree/SpellCheckTree.doc b/07 Trees/08 SpellCheckTree/SpellCheckTree.doc new file mode 100644 index 0000000..f9d5798 Binary files /dev/null and b/07 Trees/08 SpellCheckTree/SpellCheckTree.doc differ diff --git a/07 Trees/08 SpellCheckTree/declaration.txt b/07 Trees/08 SpellCheckTree/declaration.txt new file mode 100644 index 0000000..c2b5a73 --- /dev/null +++ b/07 Trees/08 SpellCheckTree/declaration.txt @@ -0,0 +1,63 @@ +When in the Course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume among the powers of the earth, the separate and equal station to which the Laws of Nature and of Nature's God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation. + +We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. --That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, --That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. Prudence, indeed, will dictate that Governments long established should not be changed for light and transient causes; and accordingly all experience hath shewn, that mankind are more disposed to suffer, while evils are sufferable, than to right themselves by abolishing the forms to which they are accustomed. But when a long train of abuses and usurpations, pursuing invariably the same Object evinces a design to reduce them under absolute Despotism, it is their right, it is their duty, to throw off such Government, and to provide new Guards for their future security. --Such has been the patient sufferance of these Colonies; and such is now the necessity which constrains them to alter their former Systems of Government. The history of the present King of Great Britain [George III] is a history of repeated injuries and usurpations, all having in direct object the establishment of an absolute Tyranny over these States. To prove this, let Facts be submitted to a candid world. + +He has refused his Assent to Laws, the most wholesome and necessary for the public good. + +He has forbidden his Governors to pass Laws of immediate and pressing importance, unless suspended in their operation till his Assent should be obtained; and when so suspended, he has utterly neglected to attend to them. + +He has refused to pass other Laws for the accommodation of large districts of people, unless those people would relinquish the right of Representation in the Legislature, a right inestimable to them and formidable to tyrants only. + +He has called together legislative bodies at places unusual, uncomfortable, and distant from the depository of their public Records, for the sole purpose of fatiguing them into compliance with his measures. + +He has dissolved Representative Houses repeatedly, for opposing with manly firmness his invasions on the rights of the people. + +He has refused for a long time, after such dissolutions, to cause others to be elected; whereby the Legislative powers, incapable of Annihilation, have returned to the People at large for their exercise; the State remaining in the mean time exposed to all the dangers of invasion from without, and convulsions within. + +He has endeavoured to prevent the population of these States; for that purpose obstructing the Laws for Naturalization of Foreigners; refusing to pass others to encourage their migrations hither, and raising the conditions of new Appropriations of Lands. + +He has obstructed the Administration of Justice, by refusing his Assent to Laws for establishing Judiciary powers. + +He has made Judges dependent on his Will alone, for the tenure of their offices, and the amount and payment of their salaries. + +He has erected a multitude of New Offices, and sent hither swarms of Officers to harass our people, and eat out their substance. + +He has kept among us, in times of peace, Standing Armies without the consent of our legislatures. + +He has affected to render the Military independent of and superior to the Civil power. + +He has combined with others to subject us to a jurisdiction foreign to our constitution and unacknowledged by our laws; giving his Assent to their Acts of pretended Legislation: + +For Quartering large bodies of armed troops among us: + +For protecting them, by a mock Trial, from punishment for any Murders which they should commit on the Inhabitants of these States: + +For cutting off our Trade with all parts of the world: + +For imposing Taxes on us without our Consent: + +For depriving us, in many cases, of the benefits of Trial by Jury: + +For transporting us beyond Seas to be tried for pretended offences: + +For abolishing the free System of English Laws in a neighbouring Province, establishing therein an Arbitrary government, and enlarging its Boundaries so as to render it at once an example and fit instrument for introducing the same absolute rule into these Colonies: + +For taking away our Charters, abolishing our most valuable Laws, and altering fundamentally the Forms of our Governments: + +For suspending our own Legislatures, and declaring themselves invested with power to legislate for us in all cases whatsoever. + +He has abdicated Government here, by declaring us out of his Protection and waging War against us. + +He has plundered our seas, ravaged our Coasts, burnt our towns, and destroyed the lives of our people. + +He is at this time transporting large Armies of foreign Mercenaries to compleat the works of death, desolation and tyranny, already begun with circumstances of Cruelty and perfidy scarcely paralleled in the most barbarous ages, and totally unworthy the Head of a civilized nation. + +He has constrained our fellow Citizens taken Captive on the high Seas to bear Arms against their Country, to become the executioners of their friends and Brethren, or to fall themselves by their Hands. + +He has excited domestic insurrections amongst us, and has endeavoured to bring on the inhabitants of our frontiers, the merciless Indian Savages, whose known rule of warfare, is an undistinguished destruction of all ages, sexes and conditions. + +In every stage of these Oppressions We have Petitioned for Redress in the most humble terms: Our repeated Petitions have been answered only by repeated injury. A Prince whose character is thus marked by every act which may define a Tyrant, is unfit to be the ruler of a free people. + +Nor have We been wanting in attentions to our British brethren. We have warned them from time to time of attempts by their legislature to extend an unwarrantable jurisdiction over us. We have reminded them of the circumstances of our emigration and settlement here. We have appealed to their native justice and magnanimity, and we have conjured them by the ties of our common kindred to disavow these usurpations, which, would inevitably interrupt our connections and correspondence. They too have been deaf to the voice of justice and of consanguinity. We must, therefore, acquiesce in the necessity, which denounces our Separation, and hold them, as we hold the rest of mankind, Enemies in War, in Peace Friends. + +We, therefore, the Representatives of the united States of America, in General Congress, Assembled, appealing to the Supreme Judge of the world for the rectitude of our intentions, do, in the Name, and by the Authority of the good People of these Colonies, solemnly publish and declare, That these United Colonies are, and of Right ought to be Free and Independent States; that they are Absolved from all Allegiance to the British Crown, and that all political connection between them and the State of Great Britain, is and ought to be totally dissolved; and that as Free and Independent States, they have full Power to levy War, conclude Peace, contract Alliances, establish Commerce, and to do all other Acts and Things which Independent States may of right do. And for the support of this Declaration, with a firm reliance on the protection of divine Providence, we mutually pledge to each other our Lives, our Fortunes and our sacred Honor. diff --git a/07 Trees/09 Stern-Brocot Tree/Stern Brocot.doc b/07 Trees/09 Stern-Brocot Tree/Stern Brocot.doc new file mode 100644 index 0000000..712651e Binary files /dev/null and b/07 Trees/09 Stern-Brocot Tree/Stern Brocot.doc differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/Hashing.class b/08 Hashing Sets _ Maps/01 Hashing/Hashing.class new file mode 100644 index 0000000..16a7b60 Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/Hashing.class differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/Hashing.doc b/08 Hashing Sets _ Maps/01 Hashing/Hashing.doc new file mode 100644 index 0000000..afa021f Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/Hashing.doc differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/Hashing.java b/08 Hashing Sets _ Maps/01 Hashing/Hashing.java new file mode 100644 index 0000000..c18868f --- /dev/null +++ b/08 Hashing Sets _ Maps/01 Hashing/Hashing.java @@ -0,0 +1,270 @@ + // Name: B6-24 + // Date: 3/4/2020 + +/* + Assignment: This hashing program results in collisions. + You are to implement three different collision schemes: linear + probing, rehashing, and chaining. Then implement a search + algorithm that is appropriate for each collision scheme. + */ +import java.util.*; +import javax.swing.*; +public class Hashing +{ + public static void main(String[] args) + { + int arrayLength = Integer.parseInt(JOptionPane.showInputDialog( + "Hashing!\n"+ + "Enter the size of the array: "));//20 + + int numItems = Integer.parseInt(JOptionPane.showInputDialog( + "Add n items: ")); //15 + + int scheme = Integer.parseInt(JOptionPane.showInputDialog( + "The Load Factor is " + (double)numItems/arrayLength + + "\nWhich collision scheme?\n"+ + "1. Linear Probing\n" + + "2. Rehashing\n"+ + "3. Chaining")); + Hashtable table = null; + switch( scheme ) + { + case 1: + table = new HashtableLinearProbe(arrayLength); + break; + case 2: + table = new HashtableRehash(arrayLength); + break; + case 3: + table = new HashtableChaining(arrayLength); + break; + default: System.exit(0); + } + for(int i = 0; i < numItems; i++) + table.add("Item" + i); + int itemNumber = Integer.parseInt(JOptionPane.showInputDialog( + "Search for: Item0" + " to "+ "Item"+(numItems-1))); + while( itemNumber != -1 ) + { + String key = "Item" + itemNumber; + int index = table.indexOf(key); + if( index >= 0) //found it + System.out.println(key + " found at index " + index); + else + System.out.println(key + " not found!"); + itemNumber = Integer.parseInt(JOptionPane.showInputDialog( + "Search for: Item0" + " to "+ "Item"+(numItems-1))); + } + System.exit(0); + } +} + +/*********************************************/ +interface Hashtable +{ + void add(Object obj); + int indexOf(Object obj); +} +/***************************************************/ + +class HashtableLinearProbe implements Hashtable +{ + private Object[] array; + + public HashtableLinearProbe(int size)//constructor + { + array = new Object[size]; + } + + public void add(Object obj) + { + int code = obj.hashCode(); + int index = Math.abs(code % array.length); + if(array[index] == null) //empty + { + //insert it + array[index] = obj; + System.out.println(obj + "\t" + code + "\t" + index); + } + else //collision + { + System.out.println(obj + "\t" + code + "\tCollision at "+ index); + index = linearProbe(index); + array[index] = obj; + System.out.println(obj + "\t" + code + "\t" + index); + } + } + + public int linearProbe(int index) + { + while (array[index] != null) + index++; + + return index; + } + + public int indexOf(Object obj) + { + + int index = Math.abs(obj.hashCode() % array.length); + + if (index < 0 || index >= array.length) + return -1; + + while(array[index] != null) + { + if(array[index].equals(obj)) //found it + { + return index; + } + else //search for it in a linear probe manner + { + if (index < array.length - 1) + index++; + else + break; + + System.out.println("Looking at index " + index); + } + } + //not found + + return -1; + } +} + +/*****************************************************/ +class HashtableRehash implements Hashtable +{ + private Object[] array; + private int constant; + + public HashtableRehash(int size) //constructor + { + array = new Object[size]; + + constant = 2; + while (array.length % constant != 0 && !isPrime(constant)) + constant++; + } + + public void add(Object obj) + { + int code = obj.hashCode(); + int index = Math.abs(code % array.length); + if(array[index] == null) //empty + { + //insert it + array[index] = obj; + System.out.println(obj + "\t" + code + "\t" + index); + } + else //collision + { + System.out.println(obj + "\t" + code + "\tCollision at "+ index); + index = rehash(index); + array[index] = obj; + System.out.println(obj + "\t" + code + "\t" + index); + } + } + + public int rehash(int index) + { + while (index < array.length - constant && array[index] != null) { + index += constant; + } + + if (array[index] != null) { + index = (index - array.length) + constant; + } + + while (index < array.length - constant && array[index] != null) { + + index += constant; + } + + if (array[index] == null) + return index; + + return -1; + + } + + private boolean isPrime (int n) { + if (n <= 1) + return false; + + for (int i = 2; i < n; i++) + if (n % i == 0) + return false; + return true; + } + + public int indexOf(Object obj) + { + int index = Math.abs(obj.hashCode() % array.length); + + if (index < 0 || index >= array.length) + return -1; + + while(array[index] != null) + { + if(array[index].equals(obj)) //found it + { + return index; + } + else //search for it in a rehashing manner + { + if (index < array.length - constant) + index += constant; + else + break; + + System.out.println("Looking at index " + index); + } + } + //not found + return -1; + } +} + +/********************************************************/ +class HashtableChaining implements Hashtable +{ + private LinkedList[] array; + + public HashtableChaining(int size) + { + //instantiate the array + array = new LinkedList[size]; + + //instantiate the LinkedLists + for (int i = 0; i < size; i++) + array[i] = new LinkedList(); + } + public void add(Object obj) + { + int code = obj.hashCode(); + int index = Math.abs(code % array.length); + array[index].addFirst(obj); + System.out.println(obj + "\t" + code + " " + " at " +index + ": "+ array[index]); + } + + public int indexOf(Object obj) + { + int index = Math.abs(obj.hashCode() % array.length); + if( !array[index].isEmpty() ) + { + if(array[index].contains(obj)) //found it + { + return index; + } + else //search for it in a chaining manner + { + return -1; + } + } + + //not found + return -1; + } +} \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/01 Hashing/Hashtable.class b/08 Hashing Sets _ Maps/01 Hashing/Hashtable.class new file mode 100644 index 0000000..d76af90 Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/Hashtable.class differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/HashtableChaining.class b/08 Hashing Sets _ Maps/01 Hashing/HashtableChaining.class new file mode 100644 index 0000000..5bf0833 Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/HashtableChaining.class differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/HashtableLinearProbe.class b/08 Hashing Sets _ Maps/01 Hashing/HashtableLinearProbe.class new file mode 100644 index 0000000..480972a Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/HashtableLinearProbe.class differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/HashtableRehash.class b/08 Hashing Sets _ Maps/01 Hashing/HashtableRehash.class new file mode 100644 index 0000000..f645cd1 Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/HashtableRehash.class differ diff --git a/08 Hashing Sets _ Maps/01 Hashing/Video on Hashing.docx b/08 Hashing Sets _ Maps/01 Hashing/Video on Hashing.docx new file mode 100644 index 0000000..2a164ac Binary files /dev/null and b/08 Hashing Sets _ Maps/01 Hashing/Video on Hashing.docx differ diff --git a/08 Hashing Sets _ Maps/02 Sets/SetPractice.class b/08 Hashing Sets _ Maps/02 Sets/SetPractice.class new file mode 100644 index 0000000..027afce Binary files /dev/null and b/08 Hashing Sets _ Maps/02 Sets/SetPractice.class differ diff --git a/08 Hashing Sets _ Maps/02 Sets/SetPractice.java b/08 Hashing Sets _ Maps/02 Sets/SetPractice.java new file mode 100644 index 0000000..dadefc6 --- /dev/null +++ b/08 Hashing Sets _ Maps/02 Sets/SetPractice.java @@ -0,0 +1,36 @@ + import java.util.*; + public class SetPractice + { + public static void main(String[] args) + { + Set s = new HashSet(); + s.add("Mary"); + s.add("Joan"); + s.add("Mary"); //duplicate! + s.add("Dennis"); + s.add("Bob"); + s.add("MaryAnn"); + s.add("Zoe"); + System.out.println("Size: " + s.size()); + Iterator it = s.iterator(); //iterator + while(it.hasNext()) + System.out.print(it.next() + " "); + System.out.println(); + + Set t = new TreeSet(s);//from HashSet to TreeSet + for( String str : t ) //for-each + System.out.print( str + " " ); + System.out.println(); //<-----place breakpoint here + System.out.println(s); //print any Collection--wow! + System.out.println(t); + } + } + /****************** + + Size: 3 + Joan Mary Dennis + Dennis Joan Mary + [Joan, Mary, Dennis] + [Dennis, Joan, Mary] + + ************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/02 Sets/Sets of Letters.doc b/08 Hashing Sets _ Maps/02 Sets/Sets of Letters.doc new file mode 100644 index 0000000..37892fa Binary files /dev/null and b/08 Hashing Sets _ Maps/02 Sets/Sets of Letters.doc differ diff --git a/08 Hashing Sets _ Maps/02 Sets/Sets.doc b/08 Hashing Sets _ Maps/02 Sets/Sets.doc new file mode 100644 index 0000000..83dda46 Binary files /dev/null and b/08 Hashing Sets _ Maps/02 Sets/Sets.doc differ diff --git a/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.class b/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.class new file mode 100644 index 0000000..fbaef94 Binary files /dev/null and b/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.class differ diff --git a/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.java b/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.java new file mode 100644 index 0000000..a61c60e --- /dev/null +++ b/08 Hashing Sets _ Maps/02 Sets/SetsOfLetters.java @@ -0,0 +1,131 @@ +// Name: B6-24 +// Date: 3/8/2020 + +import java.util.*; +import java.io.*; + +public class SetsOfLetters +{ + public static void main(String[] args) throws FileNotFoundException + { + String fileName = "declarationLast.txt"; + fillTheSets(fileName); + } + + public static void fillTheSets(String fn) throws FileNotFoundException + { + Scanner infile = new Scanner(new File(fn)); + /* enter your code here */ + while (infile.hasNextLine()) { + String line = infile.nextLine(); + char[] chars = line.toCharArray(); + Set lower, upper, other; + lower = new TreeSet<>(); + upper = new TreeSet<>(); + other = new TreeSet<>(); + for (char c : chars) { + if (Character.isLowerCase(c)) + lower.add(c); + else if (Character.isUpperCase(c)) + upper.add(c); + else + other.add(c); + } + + System.out.println(); + System.out.println(line); + System.out.println("Lower Case: " + lower); + System.out.println("Upper Case: " + upper); + System.out.println("Other: " + other); + } + } +} + +/*********************************** + ----jGRASP exec: java SetsOfLetters_teacher + + We, therefore, the Representatives of the united States of + Lower Case: [a, d, e, f, h, i, n, o, p, r, s, t, u, v] + Upper Case: [R, S, W] + Other: [ , ,] + + America, in General Congress, Assembled, appealing to the + Lower Case: [a, b, c, d, e, g, h, i, l, m, n, o, p, r, s, t] + Upper Case: [A, C, G] + Other: [ , ,] + + Supreme Judge of the world for the rectitude of our intentions, + Lower Case: [c, d, e, f, g, h, i, l, m, n, o, p, r, s, t, u, w] + Upper Case: [J, S] + Other: [ , ,] + + do, in the Name, and by the Authority of the good People of + Lower Case: [a, b, d, e, f, g, h, i, l, m, n, o, p, r, t, u, y] + Upper Case: [A, N, P] + Other: [ , ,] + + these Colonies, solemnly publish and declare, That these United + Lower Case: [a, b, c, d, e, h, i, l, m, n, o, p, r, s, t, u, y] + Upper Case: [C, T, U] + Other: [ , ,] + + Colonies are, and of Right ought to be Free and Independent + Lower Case: [a, b, d, e, f, g, h, i, l, n, o, p, r, s, t, u] + Upper Case: [C, F, I, R] + Other: [ , ,] + + States; that they are Absolved from all Allegiance to the + Lower Case: [a, b, c, d, e, f, g, h, i, l, m, n, o, r, s, t, v, y] + Upper Case: [A, S] + Other: [ , ;] + + British Crown, and that all political connection between them + Lower Case: [a, b, c, d, e, h, i, l, m, n, o, p, r, s, t, w] + Upper Case: [B, C] + Other: [ , ,] + + and the State of Great Britain, is and ought to be totally + Lower Case: [a, b, d, e, f, g, h, i, l, n, o, r, s, t, u, y] + Upper Case: [B, G, S] + Other: [ , ,] + + dissolved; and that as Free and Independent States, they have + Lower Case: [a, d, e, h, i, l, n, o, p, r, s, t, v, y] + Upper Case: [F, I, S] + Other: [ , ,, ;] + + full Power to levy War, conclude Peace, contract Alliances, + Lower Case: [a, c, d, e, f, i, l, n, o, r, s, t, u, v, w, y] + Upper Case: [A, P, W] + Other: [ , ,] + + establish Commerce, and to do all other Acts and Things which + Lower Case: [a, b, c, d, e, g, h, i, l, m, n, o, r, s, t, w] + Upper Case: [A, C, T] + Other: [ , ,] + + Independent States may of right do. And for the support of this + Lower Case: [a, d, e, f, g, h, i, m, n, o, p, r, s, t, u, y] + Upper Case: [A, I, S] + Other: [ , .] + + Declaration, with a firm reliance on the protection of divine + Lower Case: [a, c, d, e, f, h, i, l, m, n, o, p, r, t, v, w] + Upper Case: [D] + Other: [ , ,] + + Providence, we mutually pledge to each other our Lives, our + Lower Case: [a, c, d, e, g, h, i, l, m, n, o, p, r, s, t, u, v, w, y] + Upper Case: [L, P] + Other: [ , ,] + + Fortunes and our sacred Honor. + Lower Case: [a, c, d, e, n, o, r, s, t, u] + Upper Case: [F, H] + Other: [ , .] + + Common Lower Case: [d, e, n, o, r, t] + Common Upper Case: [] + Common Other: [ ] + ----jGRASP: operation complete. + ************************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/02 Sets/declarationLast.txt b/08 Hashing Sets _ Maps/02 Sets/declarationLast.txt new file mode 100644 index 0000000..719858b --- /dev/null +++ b/08 Hashing Sets _ Maps/02 Sets/declarationLast.txt @@ -0,0 +1,16 @@ +We, therefore, the Representatives of the united States of +America, in General Congress, Assembled, appealing to the +Supreme Judge of the world for the rectitude of our intentions, +do, in the Name, and by the Authority of the good People of +these Colonies, solemnly publish and declare, That these United +Colonies are, and of Right ought to be Free and Independent +States; that they are Absolved from all Allegiance to the +British Crown, and that all political connection between them +and the State of Great Britain, is and ought to be totally +dissolved; and that as Free and Independent States, they have +full Power to levy War, conclude Peace, contract Alliances, +establish Commerce, and to do all other Acts and Things which +Independent States may of right do. And for the support of this +Declaration, with a firm reliance on the protection of divine +Providence, we mutually pledge to each other our Lives, our +Fortunes and our sacred Honor. \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/03 Maps/DocumentIndex.class b/08 Hashing Sets _ Maps/03 Maps/DocumentIndex.class new file mode 100644 index 0000000..e4bc31c Binary files /dev/null and b/08 Hashing Sets _ Maps/03 Maps/DocumentIndex.class differ diff --git a/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.class b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.class new file mode 100644 index 0000000..308c37d Binary files /dev/null and b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.class differ diff --git a/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.doc b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.doc new file mode 100644 index 0000000..7d46bd6 Binary files /dev/null and b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.doc differ diff --git a/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.java b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.java new file mode 100644 index 0000000..ae360ba --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/IndexMakerMap.java @@ -0,0 +1,121 @@ +// Name: B6-24 +// Date: 3/8/2020 + +import java.io.*; +import java.util.*; + +/* This program takes a text file, creates an index (by line numbers) + * for all the words in the file and writes the index + * into the output file. The program prompts the user for the file names. + */ +public class IndexMakerMap +{ + public static void main(String[] args) throws IOException + { + Scanner keyboard = new Scanner(System.in); + System.out.print("\nEnter input file name: "); + String infileName = keyboard.nextLine().trim(); + Scanner inputFile = new Scanner(new File(infileName)); + + DocumentIndex index = makeIndex(inputFile); + + //System.out.println( index.toString() ); + PrintWriter outputFile = new PrintWriter(new FileWriter("fishIndex.txt")); + outputFile.println(index.toString()); + inputFile.close(); + outputFile.close(); + System.out.println("Done."); + } + + public static DocumentIndex makeIndex(Scanner inputFile) + { + DocumentIndex index = new DocumentIndex(); + int lineNum = 0; + while(inputFile.hasNextLine()) + { + lineNum++; + index.addAllWords(inputFile.nextLine(), lineNum); + } + return index; + } +} + +class DocumentIndex extends TreeMap> +{ + + /** Extracts all the words from str, skipping punctuation and whitespace + * and for each word calls addWord(word, num). A good way to skip punctuation + * and whitespace is to use String's split method, e.g., split("[., \"!?]") + */ + public void addAllWords(String str, int lineNum) + { + String[] words = str.split("[., \"!?]"); + for (String word : words) + if (!word.equals("")) + addWord(word, lineNum); + } + + /** Makes the word uppercase. If the word is already in the map, updates the lineNum. + * Otherwise, adds word and ArrayList to the map, and updates the lineNum + */ + public void addWord(String word, int lineNum) + { + word = word.toUpperCase(); + if (containsKey(word)) { + TreeSet temp = get(word); + temp.add(lineNum); + put (word, temp); + } else { + TreeSet temp = new TreeSet<>(); + temp.add(lineNum); + put (word, temp); + } + + + } + + public String toString() + { + String out = ""; + + for (String word : keySet()) { + out += word + " "; + String lineNums = get(word).toString(); + out += lineNums.substring(1, lineNums.length() - 1) + "\n"; + } + + return out.substring(0, out.length() - 1); + } +} + +/********************************************** + ----jGRASP exec: java -ea IndexMakerMap + + Enter input file name: fish.txt + Done. + + ----jGRASP: operation complete. + +************************************************/ +/****************** fishIndex.txt ************** +A 12, 14, 15 +ARE 16 +BLACK 6 +BLUE 4, 7 +CAR 14 +FISH 1, 2, 3, 4, 6, 7, 8, 9, 16 +HAS 11, 14 +LITTLE 12, 14 +LOT 15 +NEW 9 +OF 16 +OLD 8 +ONE 1, 11, 14 +RED 3 +SAY 15 +STAR 12 +THERE 16 +THIS 11, 14 +TWO 2 +WHAT 15 + ************************/ diff --git a/08 Hashing Sets _ Maps/03 Maps/MapPractice.java b/08 Hashing Sets _ Maps/03 Maps/MapPractice.java new file mode 100644 index 0000000..bd7d3f0 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/MapPractice.java @@ -0,0 +1,36 @@ +import java.util.*; +public class MapPractice +{ + public static void main(String[] args) + { + Map h = new HashMap(); + h.put("Othello", "green"); + h.put("MacBeth", "XXX"); + h.put("MacBeth", "red"); //what happens if two keys are the same? + h.put("Hamlet", "blue"); + if(!h.containsKey("Lear")) + h.put("Lear", "black"); + System.out.println( h.containsKey("Othello") ); + System.out.println( h.keySet() ); //print the __________ + + Iterator it = h.keySet().iterator(); //using an iterator + while(it.hasNext()) + System.out.print( h.get(it.next()) ); //print the __________ + System.out.println(); + + Map t = new TreeMap(h); //from HashMap to TreeMap + for( String str : t.keySet() ) //must use a for-each + System.out.print( t.get( str ) ); //print the __________ + System.out.println(); + System.out.println(t); //print any Collection—wow! + } +} + +/****************** + + true + [Othello, Lear, MacBeth, Hamlet] + greenblackredblue + blueblackredgreen + + ************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/03 Maps/Maps.doc b/08 Hashing Sets _ Maps/03 Maps/Maps.doc new file mode 100644 index 0000000..531c1b0 Binary files /dev/null and b/08 Hashing Sets _ Maps/03 Maps/Maps.doc differ diff --git a/08 Hashing Sets _ Maps/03 Maps/fish.txt b/08 Hashing Sets _ Maps/03 Maps/fish.txt new file mode 100644 index 0000000..c5165d8 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/fish.txt @@ -0,0 +1,18 @@ +One fish +two fish +Red fish +Blue fish. + +Black fish +Blue fish +Old fish +New fish. + +This one has +a little star. + +This one has a little car. +Say! What a lot +of fish there are. + + diff --git a/08 Hashing Sets _ Maps/03 Maps/fish1.txt b/08 Hashing Sets _ Maps/03 Maps/fish1.txt new file mode 100644 index 0000000..e69de29 diff --git a/08 Hashing Sets _ Maps/03 Maps/fish2.txt b/08 Hashing Sets _ Maps/03 Maps/fish2.txt new file mode 100644 index 0000000..a02e234 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/fish2.txt @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + diff --git a/08 Hashing Sets _ Maps/03 Maps/fish3.txt b/08 Hashing Sets _ Maps/03 Maps/fish3.txt new file mode 100644 index 0000000..3e5aa14 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/fish3.txt @@ -0,0 +1,17 @@ +"One fish +two fish + Red fish +,,,,Blue fish." + +"Black fish" + Blue fish +. . . . Old fish +New fish. + +?????This one has +? a little star. + +This one" has a little car? +!Say! What a lot +!!!!!of fish there are. + diff --git a/08 Hashing Sets _ Maps/03 Maps/fish4.txt b/08 Hashing Sets _ Maps/03 Maps/fish4.txt new file mode 100644 index 0000000..dedf751 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/fish4.txt @@ -0,0 +1,8 @@ +One fish two fish +Red fish Blue fish. + +Black fish Blue fish +Old fish New fish. + + + diff --git a/08 Hashing Sets _ Maps/03 Maps/fishIndex.txt b/08 Hashing Sets _ Maps/03 Maps/fishIndex.txt new file mode 100644 index 0000000..bbf3238 --- /dev/null +++ b/08 Hashing Sets _ Maps/03 Maps/fishIndex.txt @@ -0,0 +1,20 @@ +A 12, 14, 15 +ARE 16 +BLACK 6 +BLUE 4, 7 +CAR 14 +FISH 1, 2, 3, 4, 6, 7, 8, 9, 16 +HAS 11, 14 +LITTLE 12, 14 +LOT 15 +NEW 9 +OF 16 +OLD 8 +ONE 1, 11, 14 +RED 3 +SAY 15 +STAR 12 +THERE 16 +THIS 11, 14 +TWO 2 +WHAT 15 diff --git a/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.class b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.class new file mode 100644 index 0000000..8176ad4 Binary files /dev/null and b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.class differ diff --git a/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.doc b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.doc new file mode 100644 index 0000000..9d4b4c4 Binary files /dev/null and b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.doc differ diff --git a/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.java b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.java new file mode 100644 index 0000000..dd8fa03 --- /dev/null +++ b/08 Hashing Sets _ Maps/04 Dictionary/Dictionary.java @@ -0,0 +1,328 @@ +// Name: B6-24 +// Date: 3/8/2020 + +import java.io.*; +import java.util.*; + +public class Dictionary +{ + public static void main(String[] args) + { + Scanner infile = null; + try + { + infile = new Scanner(new File("spanglish.txt")); + System.setOut(new PrintStream(new FileOutputStream("dictionaryOutput.txt"))); + } + catch(Exception e) + { + } + + Map> eng2spn = makeDictionary( infile ); + System.out.println("ENGLISH TO SPANISH"); + display(eng2spn); + System.out.println(); + Map> spn2eng = reverse(eng2spn); + System.out.println("SPANISH TO ENGLISH"); + display(spn2eng); + + while (true) { + try + { + System.setOut(new PrintStream(new FileOutputStream("dictionaryOutput.txt"))); + } + catch(Exception e) + { + } + + System.out.println("ENGLISH TO SPANISH"); + display(eng2spn); + System.out.println(); + System.out.println("SPANISH TO ENGLISH"); + display(spn2eng); + + System.setOut(new PrintStream(new FileOutputStream(FileDescriptor.out))); + System.out.println("Welcome to the Spanish/English APCS Dictionary!\n\n\tType 1 if you'd like to translate a word from English to Spanish\n\tType 2 if you'd like to translate a word from Spanish to English\n\tType 3 if you'd like to update the dictionary (PASSWORD REQUIRED)\n\tType exit to exit"); + Scanner keyboard = new Scanner(System.in); + System.out.print("\nOption: "); + String option = keyboard.nextLine().trim(); + + if (option.equals("exit")) { + System.out.println("Bye!"); + break; + } + switch (option) { + case "1": + clear(); + System.out.println("What would you like to translate to Spanish?"); + String english = keyboard.nextLine().trim().toLowerCase(); + if (eng2spn.containsKey(english)) { + String translation = eng2spn.get(english).toString(); + System.out.println(); + System.out.print(english + " tranlsates to " + translation.substring(1, translation.length() - 1)); + } else { + System.out.println("Sorry '" + english + "' was not found"); + } + + System.out.println("\nPress enter to continue"); + keyboard.nextLine(); + + break; + case "2": + clear(); + System.out.println("What would you like to translate to English?"); + String spanish = keyboard.nextLine().trim().toLowerCase(); + if (spn2eng.containsKey(spanish)) { + String translation = spn2eng.get(spanish).toString(); + System.out.println(); + System.out.print(spanish + " tranlsates to " + translation.substring(1, translation.length() - 1)); + } else { + System.out.println("Sorry '" + spanish + "' was not found"); + } + + System.out.println("\nPress enter to continue"); + keyboard.nextLine(); + break; + case "3": + clear(); + System.out.println("What's the administrative password?"); + String pass = keyboard.nextLine().trim(); + if (pass.equals("admin")) { + clear(); + while (true){ + try + { + System.setOut(new PrintStream(new FileOutputStream("dictionaryOutput.txt"))); + } + catch(Exception e) + { + } + + System.out.println("ENGLISH TO SPANISH"); + display(eng2spn); + System.out.println(); + System.out.println("SPANISH TO ENGLISH"); + display(spn2eng); + + System.setOut(new PrintStream(new FileOutputStream(FileDescriptor.out))); + System.out.println("Welcome Admin!\n\tType add to add an entry\n\tType remove to remove an entry\n\tType modify to change an entry\n\tType exit to exit"); + keyboard = new Scanner(System.in); + System.out.print("\nOption: "); + option = keyboard.nextLine().trim(); + + if (option.equals("exit")) { + System.out.println("Bye!"); + break; + } + switch(option) { + case "add": + clear(); + System.out.println("What are the english word/words you would like to add (Seperate by commas)"); + String[] engWords = keyboard.nextLine().trim().split(","); + clear(); + System.out.println("What are the spanish word/words you would like to add (Seperate by commas)"); + String[] spnWords = keyboard.nextLine().trim().split(","); + for (String eng : engWords) { + for (String spn : spnWords) { + add(eng2spn, eng, spn); + } + } + + for (String spn : spnWords) { + for (String eng : engWords) { + add(spn2eng, spn, eng); + } + } + clear(); + System.out.println ("Done!"); + keyboard.nextLine(); + break; + case "remove": + clear(); + System.out.println("Type english for an english word and spanish for a spanish word"); + option = keyboard.nextLine().trim(); + if (option.equals("english")) { + clear(); + System.out.println("What is your english word to remove?"); + String word = keyboard.nextLine().trim(); + if (eng2spn.containsKey(word)) { + eng2spn.remove(word); + } else { + break; + } + } else { + clear(); + System.out.println("What is your spanish word to remove?"); + String word = keyboard.nextLine().trim(); + if (eng2spn.containsKey(word)) { + eng2spn.remove(word); + } else { + break; + } + } + + clear(); + System.out.println("Done!"); + keyboard.nextLine(); + break; + case "modify": + clear(); + System.out.println("Type english for an english word and spanish for a spanish word"); + option = keyboard.nextLine().trim(); + if (option.equals("english")) { + clear(); + System.out.println("What is your english word to change?"); + String word = keyboard.nextLine().trim(); + System.out.println("\nWhat is the new word?"); + String newWord = keyboard.nextLine().trim(); + if (eng2spn.containsKey(word)) { + Set temp = eng2spn.remove(word); + eng2spn.put(newWord, temp); + } else { + break; + } + } else { + clear(); + System.out.println("What is your spanish word to change?"); + String word = keyboard.nextLine().trim(); + System.out.println("\nWhat is the new word?"); + String newWord = keyboard.nextLine().trim(); + if (spn2eng.containsKey(word)) { + Set temp = spn2eng.remove(word); + spn2eng.put(newWord, temp); + } else { + + break; + } + } + + clear(); + System.out.println("Done!"); + keyboard.nextLine(); + break; + + default: + break; + } + + } + } else { + System.out.println("Incorrect Password."); + } + + break; + default: + System.out.println("Sorry, that option was not recognized"); + } + + clear(); + } + } + + public static void clear () { + for (int i = 0; i < 30; i++) + System.out.println(); + } + + public static Map> makeDictionary(Scanner infile) + { + Map> dictionary = new TreeMap>(); + + while(infile.hasNext()) { + String word = infile.next(); + String translation = infile.next(); + add(dictionary, word, translation); + } + + return dictionary; + } + + public static void add(Map> dictionary, String word, String translation) + { + if (dictionary.containsKey(word)) { + Set temp = dictionary.get(word); + temp.add(translation); + dictionary.put(word, temp); + } else { + Set temp = new TreeSet<>(); + temp.add(translation); + dictionary.put(word, temp); + } + } + + public static void display(Map> m) + { + for (String word : m.keySet()) { + System.out.println("\t" + word + m.get(word)); + } + } + + public static Map> reverse(Map> dictionary) + { + Map> reverse = new TreeMap<>(); + for (String translation : dictionary.keySet()) { + Set words = dictionary.get(translation); + for (String word : words) { + add(reverse, word, translation); + } + } + + return reverse; + } +} + + + /******************** + INPUT: + holiday + fiesta + holiday + vacaciones + party + fiesta + celebration + fiesta + + *********************************** + OUTPUT: + ENGLISH TO SPANISH + banana [banana] + celebration [fiesta] + computer [computadora, ordenador] + double [doblar, doble, duplicar] + father [padre] + feast [fiesta] + good [bueno] + hand [mano] + hello [hola] + holiday [fiesta, vacaciones] + party [fiesta] + plaza [plaza] + priest [padre] + program [programa, programar] + sleep [dormir] + son [hijo] + sun [sol] + vacation [vacaciones] + + SPANISH TO ENGLISH + banana [banana] + bueno [good] + computadora [computer] + doblar [double] + doble [double] + dormir [sleep] + duplicar [double] + fiesta [celebration, feast, holiday, party] + hijo [son] + hola [hello] + mano [hand] + ordenador [computer] + padre [father, priest] + plaza [plaza] + programa [program] + programar [program] + sol [sun] + vacaciones [holiday, vacation] + +**********************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/04 Dictionary/dictionaryOutput.txt b/08 Hashing Sets _ Maps/04 Dictionary/dictionaryOutput.txt new file mode 100644 index 0000000..a0b3056 --- /dev/null +++ b/08 Hashing Sets _ Maps/04 Dictionary/dictionaryOutput.txt @@ -0,0 +1,40 @@ +ENGLISH TO SPANISH + banana[banana] + celebration[fiesta] + computer[computadora, ordenador] + double[doblar, doble, duplicar] + excellent[bueno] + father[padre] + feast[fiesta] + good[bueno] + hand[mano] + hello[hola] + holiday[fiesta, vacaciones] + party[fiesta] + plaza[plaza] + priest[padre] + program[programa, programar] + sleep[dormir] + son[hijo] + sun[sol] + vacation[vacaciones] + +SPANISH TO ENGLISH + banana[banana] + bueno[excellent, good] + computadora[computer] + doblar[double] + doble[double] + dormir[sleep] + duplicar[double] + fiesta[celebration, feast, holiday, party] + hijo[son] + hola[hello] + mano[hand] + ordenador[computer] + padre[father, priest] + plaza[plaza] + programa[program] + programar[program] + sol[sun] + vacaciones[holiday, vacation] diff --git a/08 Hashing Sets _ Maps/04 Dictionary/spanglish.txt b/08 Hashing Sets _ Maps/04 Dictionary/spanglish.txt new file mode 100644 index 0000000..3456968 --- /dev/null +++ b/08 Hashing Sets _ Maps/04 Dictionary/spanglish.txt @@ -0,0 +1,46 @@ +holiday +fiesta +holiday +vacaciones +party +fiesta +celebration +fiesta +feast +fiesta +hand +mano +father +padre +priest +padre +sun +sol +son +hijo +sleep +dormir +vacation +vacaciones +plaza +plaza +banana +banana +hello +hola +good +bueno +double +doble +double +doblar +double +duplicar +computer +ordenador +computer +computadora +program +programa +program +programar diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib.class b/08 Hashing Sets _ Maps/05 Fib/Fib.class new file mode 100644 index 0000000..6a9f826 Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fib.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib.java b/08 Hashing Sets _ Maps/05 Fib/Fib.java new file mode 100644 index 0000000..e0463b0 --- /dev/null +++ b/08 Hashing Sets _ Maps/05 Fib/Fib.java @@ -0,0 +1,207 @@ +// Name: B6-24 +// Date: 3/11/2020 + +import java.util.*; + +interface Fibber +{ + public abstract int fib(int n); +} + +public class Fib +{ + public static final int FIBsubN = 40; + public static void main(String[] args) + { + System.out.println("******************************"); + Fib1 f1= new Fib1(); + System.out.println("Fib1, Recursive, no storing"); + calculate(f1, FIBsubN); + System.out.println("Fib1 again with the same Fib1 object"); + calculate(f1, FIBsubN); + System.out.println("Fib1 with a new Fib1 object"); + calculate(new Fib1(), FIBsubN); + + System.out.println("******************************"); + Fib2 f2 = new Fib2(FIBsubN + 1); + System.out.println("Fib2, Iterative, stored in an array"); + calculate(f2, FIBsubN); + System.out.println("Fib2 again with the same Fib2 object"); + calculate(f2, FIBsubN); + System.out.println("Fib2 with a new Fib2 object"); + calculate(new Fib2(FIBsubN + 1), FIBsubN); + + System.out.println("******************************"); + Fib3 f3 = new Fib3(); + System.out.println("Fib3, Recursive, stored in a static arrayList"); + calculate(f3, FIBsubN); + System.out.println("Fib3 again with the same Fib3 object"); + calculate(f3, FIBsubN); + System.out.println("Fib3 with a new Fib3 object"); + calculate(new Fib3(), FIBsubN); + + System.out.println("******************************"); + Fib4 f4 = new Fib4(); + System.out.println("Fib4, Recursive, stored in a static hashMap"); + calculate(f4, FIBsubN); + System.out.println("Fib4 again with the same Fib4 object"); + calculate(f4, FIBsubN); + System.out.println("Fib4 with a new Fib4 object"); + calculate(new Fib4(), FIBsubN); + } + + public static void calculate(Fibber fibber, int n) + { + long start = System.nanoTime(); + int f = fibber.fib(n); + long finish = System.nanoTime(); + long time = finish - start; + + System.out.print("fib(" + n + ") = " + f); + System.out.println(" (" + time + "nanoseconds)"); + System.out.println(); + } +} + +class Fib1 implements Fibber +{ + public Fib1() + { + } + + public int fib(int n) + { + if(n == 1 || n == 2) + return 1; + else + return fib(n - 1) + fib(n - 2); + } +} + +class Fib2 implements Fibber +{ + private int[] array; + + public Fib2(int n) + { + array = new int[n]; + array[1] = 1; + array[2] = 1; + } + + public int fib(int n) + { + if (n <= 2) + return 1; + + for (int i = 3; i <= n; i++) { + array[i] = array[i-1] + array[i-2]; + } + + return array[n]; + } + + public int[] getArray() //nice to have + { + return array; + } +} + +class Fib3 implements Fibber +{ + private static ArrayList myFibList; + + public Fib3() + { + myFibList = new ArrayList<>(); + myFibList.add(1); + myFibList.add(1); + } + + public int fib(int n) + { + if(myFibList.size() >= n){ + return myFibList.get(n-1); + } + + myFibList.add(fib(n-1) + fib(n-2)); + return myFibList.get(n-1); + } + + public static ArrayList getArrayList() //nice to have + { + return myFibList; + } +} + +class Fib4 implements Fibber +{ + private static Map myFibMap; + + public Fib4() + { + myFibMap = new HashMap<>(); + myFibMap.put(1,1); + myFibMap.put(2,1); + } + + public int fib(int n) + { + if(myFibMap.containsKey(n)){ + return myFibMap.get(n); + } + + myFibMap.put(n, fib(n-1) + fib(n-2)); + return myFibMap.get(n); + } + + public static Map getMap() //nice to have + { + return myFibMap; + } +} + +/********************************************** + + ----jGRASP exec: java Fib_teacher + ****************************** + Fib1, Recursive, no storing + fib(40) = 102334155 (344219300 nanoseconds) + + Fib1 again with the same Fib1 object + fib(40) = 102334155 (343141500 nanoseconds) + + Fib1 with a new Fib1 object + fib(40) = 102334155 (350600600 nanoseconds) + + ****************************** + Fib2, Iterative, stored in an array + fib(40) = 102334155 (3200 nanoseconds) + + Fib2 again with the same Fib2 object + fib(40) = 102334155 (1600 nanoseconds) + + Fib2 with a new Fib2 object + fib(40) = 102334155 (1600 nanoseconds) + + ****************************** + Fib3, Recursive, stored in a static arrayList + fib(40) = 102334155 (59600 nanoseconds) + + Fib3 again with the same Fib3 object + fib(40) = 102334155 (1200 nanoseconds) + + Fib3 with a new Fib3 object + fib(40) = 102334155 (1100 nanoseconds) + + ****************************** + Fib4, Recursive, stored in a static hashMap + fib(40) = 102334155 (97000 nanoseconds) + + Fib4 again with the same Fib4 object + fib(40) = 102334155 (1900 nanoseconds) + + Fib4 with a new Fib4 object + fib(40) = 102334155 (1900 nanoseconds) + + ***********************************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib1.class b/08 Hashing Sets _ Maps/05 Fib/Fib1.class new file mode 100644 index 0000000..1ce6eac Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fib1.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib2.class b/08 Hashing Sets _ Maps/05 Fib/Fib2.class new file mode 100644 index 0000000..d714e8f Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fib2.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib3.class b/08 Hashing Sets _ Maps/05 Fib/Fib3.class new file mode 100644 index 0000000..ba9a581 Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fib3.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fib4.class b/08 Hashing Sets _ Maps/05 Fib/Fib4.class new file mode 100644 index 0000000..e4fc0cf Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fib4.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fibber.class b/08 Hashing Sets _ Maps/05 Fib/Fibber.class new file mode 100644 index 0000000..4f4ca82 Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fibber.class differ diff --git a/08 Hashing Sets _ Maps/05 Fib/Fibonacci HashMap.doc b/08 Hashing Sets _ Maps/05 Fib/Fibonacci HashMap.doc new file mode 100644 index 0000000..115fce0 Binary files /dev/null and b/08 Hashing Sets _ Maps/05 Fib/Fibonacci HashMap.doc differ diff --git a/08 Hashing Sets _ Maps/06 HailstoneMap/Hailstone HashMaps.doc b/08 Hashing Sets _ Maps/06 HailstoneMap/Hailstone HashMaps.doc new file mode 100644 index 0000000..f024a11 Binary files /dev/null and b/08 Hashing Sets _ Maps/06 HailstoneMap/Hailstone HashMaps.doc differ diff --git a/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap.class b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap.class new file mode 100644 index 0000000..cb7b650 Binary files /dev/null and b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap.class differ diff --git a/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.class b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.class new file mode 100644 index 0000000..7d83b95 Binary files /dev/null and b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.class differ diff --git a/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.java b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.java new file mode 100644 index 0000000..07c8073 --- /dev/null +++ b/08 Hashing Sets _ Maps/06 HailstoneMap/HailstoneMap_Driver.java @@ -0,0 +1,190 @@ +// Name: B6-24 +// Date: 3/11/2020 + +import java.util.*; +public class HailstoneMap_Driver +{ + public static void main(String[] args) + { + HailstoneMap hs = new HailstoneMap(); + long startTime, time; + + HailstoneMap hm1 = new HailstoneMap(), + hm2 = new HailstoneMap(); + int startNum = 5; + + System.out.println("Generate " + startNum + " first time on object hm1"); + startTime = System.nanoTime(); + hm1.hailstoneMaps(startNum); + time = System.nanoTime() - startTime; + System.out.println(HailstoneMap.steps.get(startNum) +" steps."); + System.out.println(HailstoneMap.sequence.get(startNum)); + System.out.println("Nanoseconds: "+ time); + System.out.println(); + + System.out.println("Generate " + startNum + " second time on object hm1"); + startTime = System.nanoTime(); + hm1.hailstoneMaps(startNum); + time = System.nanoTime() - startTime; + System.out.println(HailstoneMap.steps.get(startNum) +" steps."); + System.out.println(HailstoneMap.sequence.get(startNum)); + System.out.println("Nanoseconds: "+ time); + System.out.println(); + + System.out.println("Generate " + startNum + " third time on a different object hm2"); + startTime = System.nanoTime(); + hm2.hailstoneMaps(startNum); + time = System.nanoTime() - startTime; + System.out.println(HailstoneMap.steps.get(startNum) +" steps."); + System.out.println(HailstoneMap.sequence.get(startNum)); + System.out.println("Nanoseconds: "+ time); + System.out.println(); + + + //now test with other numbers + Scanner keyboard = new Scanner(System.in); + System.out.print("Enter Hailstone starting number: "); + startNum = keyboard.nextInt(); + do{ + startTime = System.nanoTime(); + hs.hailstoneMaps(startNum); + time = System.nanoTime() - startTime; + System.out.println(HailstoneMap.steps.get(startNum) +" steps."); + System.out.println(HailstoneMap.sequence.get(startNum)); + System.out.println("Nanoseconds: "+ time); + System.out.println(); + + System.out.print("Enter Hailstone starting number: "); + startNum = keyboard.nextInt(); + } while( startNum != -1); + System.out.println("Goodbye."); + } +} + +class HailstoneMap +{ + public static HashMap steps = new HashMap(); + public static HashMap sequence = new HashMap(); + + //setup the static fields in case they are null + public HailstoneMap() + { + steps = new HashMap<>(); + sequence = new HashMap(); + } + + public int hailstoneMaps(int k) + { + int startNum = k; + int stepCount = 0; + String seq = ""; + + if (sequence.containsKey(k)) { + stepCount += steps.get(k); + seq += sequence.get(k); + k = 1; + } else { + + seq = k + ", "; + + while (k != 1) { + if (sequence.containsKey(k)) { + stepCount += steps.get(k); + seq += sequence.get(k); + k = 1; + } else { + + if (k % 2 == 0) { + k /= 2; + } else { + k = 3*k + 1; + } + + stepCount++; + seq += k + ", "; + + } + } + } + steps.put(startNum, stepCount); + sequence.put(startNum, seq.substring(0, seq.length() - 2)); + + return stepCount; + + } + + public static HashMap getSteps() //implement for gradeIt + { + return steps; + } + + public static HashMap getSequece() //implement for gradeIt + { + return sequence; + } + +} + +/********************************* + + - ----jGRASP exec: java HailstoneMap_Driver_teacher + Generate 5 first time on object hm1 + 5 steps. + 5, 16, 8, 4, 2, 1 + Nanoseconds: 7686900 + + Generate 5 second time on object hm1 + 5 steps. + 5, 16, 8, 4, 2, 1 + Nanoseconds: 5500 + + Generate 5 third time on a different object hm2 + 5 steps. + 5, 16, 8, 4, 2, 1 + Nanoseconds: 3000 + + Enter Hailstone starting number: 37 + 21 steps. + 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 147600 + + Enter Hailstone starting number: 37 + 21 steps. + 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 9300 + + Enter Hailstone starting number: 37 + 21 steps. + 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 6400 + + Enter Hailstone starting number: 37 + 21 steps. + 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 7200 + + Enter Hailstone starting number: 112 + 20 steps. + 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 6700 + + Enter Hailstone starting number: 56 + 19 steps. + 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 6700 + + Enter Hailstone starting number: 14 + 17 steps. + 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 + Nanoseconds: 6700 + + Enter Hailstone starting number: 4 + 2 steps. + 4, 2, 1 + Nanoseconds: 6200 + + Enter Hailstone starting number: -1 + Goodbye. + + ----jGRASP: operation complete. + **********************************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/07 Polynomial/Polynomial extensions.doc b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial extensions.doc new file mode 100644 index 0000000..86bb149 Binary files /dev/null and b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial extensions.doc differ diff --git a/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.class b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.class new file mode 100644 index 0000000..d63bb7a Binary files /dev/null and b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.class differ diff --git a/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.doc b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.doc new file mode 100644 index 0000000..a995068 Binary files /dev/null and b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial.doc differ diff --git a/08 Hashing Sets _ Maps/07 Polynomial/PolynomialInterface.class b/08 Hashing Sets _ Maps/07 Polynomial/PolynomialInterface.class new file mode 100644 index 0000000..69031bc Binary files /dev/null and b/08 Hashing Sets _ Maps/07 Polynomial/PolynomialInterface.class differ diff --git a/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.class b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.class new file mode 100644 index 0000000..d5bd8f4 Binary files /dev/null and b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.class differ diff --git a/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.java b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.java new file mode 100644 index 0000000..9135fe6 --- /dev/null +++ b/08 Hashing Sets _ Maps/07 Polynomial/Polynomial_Driver.java @@ -0,0 +1,189 @@ + // Name: B6-24 + // Date: 3/12/2020 + +import java.util.*; +import java.text.DecimalFormat; + +public class Polynomial_Driver +{ + public static void main(String[] args) + { + Polynomial poly = new Polynomial(); // 2x^3 + -4x + 2 + poly.makeTerm(1, -4); + poly.makeTerm(3, 2); + poly.makeTerm(0, 2); + System.out.println("Map: " + poly.getMap()); + System.out.println("String: " + poly.toString()); + double evaluateAt = 2.0; + System.out.println("Evaluated at "+ evaluateAt +": " +poly.evaluateAt(evaluateAt)); + + System.out.println("-----------"); + Polynomial poly2 = new Polynomial(); // 2x^4 + x^2 + -5x + -3 + poly2.makeTerm(1, -5); + poly2.makeTerm(4, 2); + poly2.makeTerm(0, -3); + poly2.makeTerm(2, 1); + System.out.println("Map: " + poly2.getMap()); + System.out.println("String: " +poly2.toString()); + evaluateAt = -10.5; + System.out.println("Evaluated at "+ evaluateAt +": " +poly.evaluateAt(evaluateAt)); + + + System.out.println("-----------"); + System.out.println("Sum: " + poly.add(poly2)); + System.out.println("Product: " + poly.multiply(poly2)); + + /* Another case: (x+1)(x-1) --> x^2 + -1 */ + System.out.println("==========================="); + Polynomial poly3 = new Polynomial(); // (x+1) + poly3.makeTerm(1, 1); + poly3.makeTerm(0, 1); + System.out.println("Map: " + poly3.getMap()); + System.out.println("String: " + poly3.toString()); + + Polynomial poly4 = new Polynomial(); // (x-1) + poly4.makeTerm(1, 1); + poly4.makeTerm(0, -1); + System.out.println("Map: " + poly4.getMap()); + System.out.println("String: " + poly4.toString()); + System.out.println("Product: " + poly4.multiply(poly3)); // x^2 + -1 + // + // /* testing the one-arg constructor */ + System.out.println("==========================="); + Polynomial poly5 = new Polynomial("2x^3 + 4x^2 + 6x^1 + -3"); + System.out.println("Map: " + poly5.getMap()); + System.out.println(poly5); + + } +} +interface PolynomialInterface +{ + public void makeTerm(Double exp, Double coef); + public Map getMap(); + public double evaluateAt(double x); + public Polynomial add(Polynomial other); + public Polynomial multiply(Polynomial other); + public String toString(); +} + +class Polynomial implements PolynomialInterface +{ + private Map map; + + public Polynomial () { + map = new TreeMap<>(); + } + + public Polynomial (Polynomial other) { + map = new TreeMap(other.getMap()); + } + + public Polynomial (String arg) { + map = new TreeMap<>(); + + String[] terms = arg.split(" "); + for (String term : terms) { + if (term.equals("+")) + continue; + if (term.contains("x^")) + makeTerm(Double.parseDouble(term.charAt(term.length() - 1) + ""), Double.parseDouble(term.substring(0, term.length() - 3))); + else if (term.contains("x")) + makeTerm(1.0, Double.parseDouble(term.substring(0, term.length() - 1))); + else + makeTerm(0.0, Double.parseDouble(term)); + } + + } + + public void makeTerm(Integer intExp, Integer intCoef) { + double exp = intExp + 0.0; + double coef = intCoef + 0.0; + if (map.containsKey(exp)) { + map.put(exp, coef + map.get(exp)); + } else { + map.put(exp, coef); + } + + } + + + public void makeTerm(Double exp, Double coef) { + if (map.containsKey(exp)) { + map.put(exp, coef + map.get(exp)); + } else { + map.put(exp, coef); + } + + } + + public double evaluateAt(double x) { + double val = 0.0; + for (double exp : map.keySet()) + val += map.get(exp) * Math.pow(x, exp); + + return val; + } + + public Polynomial add(Polynomial other) { + Polynomial sum = new Polynomial(other); + for (double exp : map.keySet()) + sum.makeTerm(exp, map.get(exp)); + + return sum; + } + + public Polynomial multiply(Polynomial other) { + Polynomial product = new Polynomial(); + + for (double exp : map.keySet()) + for (double otherExp : other.map.keySet()) + product.makeTerm(exp + otherExp, map.get(exp) * other.map.get(otherExp)); + + return product; + } + + public Map getMap() { + return map; + } + + public String toString() { + String toRet = ""; + DecimalFormat df = new DecimalFormat("#.#"); + + ArrayList keys = new ArrayList(map.keySet()); + + for (int i = keys.size() - 1; i >= 0; i--) { + double exp = keys.get(i) + 0.0; + if (map.get(exp) != 0 && map.get(exp) != 1) + toRet += df.format(map.get(exp)); + + if (exp > 1) + toRet += "x^" + df.format(exp); + else if (exp == 1) + toRet += "x"; + + + toRet += " + "; + } + + return toRet.substring(0, toRet.length() - 2); + + } +} + + +/*************************************** + ----jGRASP exec: java Polynomial_teacher + Map: {0=2, 1=-4, 3=2} + String: 2x^3 + -4x + 2 + Evaluated at 2.0: 10.0 + ----------- + Map: {0=-3, 1=-5, 2=1, 4=2} + String: 2x^4 + x^2 + -5x + -3 + Evaluated at -10.5: -2271.25 + ----------- + Sum: 2x^4 + 2x^3 + x^2 + -9x + -1 + Product: 4x^7 + -6x^5 + -6x^4 + -10x^3 + 22x^2 + 2x + -6 + + ----jGRASP: operation complete. + ********************************************/ \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.class b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.class new file mode 100644 index 0000000..7a29550 Binary files /dev/null and b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.class differ diff --git a/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.doc b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.doc new file mode 100644 index 0000000..ad4877a Binary files /dev/null and b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.doc differ diff --git a/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.java b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.java new file mode 100644 index 0000000..db5c5cf --- /dev/null +++ b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingAWidget.java @@ -0,0 +1,119 @@ +// Name: B6-24 +// Date: 3/14/2020 + +import java.util.*; + +public class HashingAWidget +{ + public static void main(String[] args) + { + Set tSet = new TreeSet(); + Set hSet = new HashSet(); + + Widget a = new Widget(2,3); //same or different? + Widget b = new Widget(2,3); + Widget c = new Widget(2,3); + // c = b; + + tSet.add(a); + tSet.add(b); + tSet.add(c); + + hSet.add(a); + hSet.add(b); + hSet.add(c); + + System.out.println(a.hashCode()+ " "+b.hashCode() + " " + c.hashCode()); + + System.out.println("TreeSet: " + tSet); + System.out.println("HashSet: " + hSet); + } +} + +/** + * Modify the Widget class so that it hashes on its + * values, not on its address. Be sure that compareTo(), + * equals(Object) and hashCode() agree with each other. + */ +class Widget implements Comparable +{ + private int myCubits, myHands; + + public Widget() + { + myCubits = myHands = 0; + } + + public Widget(int x) + { + myCubits = x; + myHands = 0; + } + + public Widget(int x, int y) + { + myCubits = x; + myHands = y; + } + + public Widget(Widget arg) + { + myCubits = arg.getCubits(); + myHands = arg.getHands(); + } + + public int getCubits() + { + return myCubits; + } + + public int getHands() + { + return myHands; + } + + public void setCubits(int x) + { + myCubits = x; + } + + public void setHands(int x) + { + myHands = x; + } + + //other methods + public int compareTo(Widget other) + { + // Widget w = (Widget)other; no need to cast + if(myCubits < other.getCubits()) + return -1; + if(myCubits > other.myCubits) + return 1; + if(myHands < other.myHands) //"private" is at the class level + return -1; + if(myHands > other.getHands()) + return 1; + return 0; + } + + public boolean equals(Widget other) + { + return compareTo(other) == 0; + } + public String toString() + { + return myCubits + " cubits " + myHands + " hands"; + } + + /* 2 new methods for this lab */ + public boolean equals(Object arg) { + Widget w = (Widget)arg; + return myCubits == w.getCubits() && myHands == w.getHands(); + } + + public int hashCode() { + return toString().hashCode(); + } + +} \ No newline at end of file diff --git a/08 Hashing Sets _ Maps/08 HashingAWidget/HashingQuestions.doc b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingQuestions.doc new file mode 100644 index 0000000..edc6919 Binary files /dev/null and b/08 Hashing Sets _ Maps/08 HashingAWidget/HashingQuestions.doc differ diff --git a/08 Hashing Sets _ Maps/08 HashingAWidget/Widget.class b/08 Hashing Sets _ Maps/08 HashingAWidget/Widget.class new file mode 100644 index 0000000..d743aba Binary files /dev/null and b/08 Hashing Sets _ Maps/08 HashingAWidget/Widget.class differ diff --git a/08 Hashing Sets _ Maps/09a Cities and Postal Codes/Cities and Postal Codes.doc b/08 Hashing Sets _ Maps/09a Cities and Postal Codes/Cities and Postal Codes.doc new file mode 100644 index 0000000..2263220 Binary files /dev/null and b/08 Hashing Sets _ Maps/09a Cities and Postal Codes/Cities and Postal Codes.doc differ diff --git a/08 Hashing Sets _ Maps/Practice_It Sets_Maps.docx b/08 Hashing Sets _ Maps/Practice_It Sets_Maps.docx new file mode 100644 index 0000000..794ab67 Binary files /dev/null and b/08 Hashing Sets _ Maps/Practice_It Sets_Maps.docx differ diff --git a/09 Heaps/01 Heaps, HeapSort/HeapSort.doc b/09 Heaps/01 Heaps, HeapSort/HeapSort.doc new file mode 100644 index 0000000..00bd26e Binary files /dev/null and b/09 Heaps/01 Heaps, HeapSort/HeapSort.doc differ diff --git a/09 Heaps/01 Heaps, HeapSort/HeapSort.java b/09 Heaps/01 Heaps, HeapSort/HeapSort.java new file mode 100644 index 0000000..63e00be --- /dev/null +++ b/09 Heaps/01 Heaps, HeapSort/HeapSort.java @@ -0,0 +1,81 @@ +// Name: +// Date: + +public class HeapSort +{ + public static int SIZE; //9 or 100 + + public static void main(String[] args) + { + //Part 1: Given a heap, sort it. Do this part first. + SIZE = 9; + double heap[] = {-1,99,80,85,17,30,84,2,16,1}; + + display(heap); + sort(heap); + display(heap); + System.out.println(isSorted(heap)); + + //Part 2: Generate 100 random numbers, make a heap, sort it. + // SIZE = 100; + // double[] heap = new double[SIZE + 1]; + // heap = createRandom(heap); + // display(heap); + // makeHeap(heap, SIZE); + // display(heap); + // sort(heap); + // display(heap); + // System.out.println(isSorted(heap)); + } + + //******* Part 1 ****************************************** + public static void display(double[] array) + { + for(int k = 1; k < array.length; k++) + System.out.print(array[k] + " "); + System.out.println("\n"); + } + + public static void sort(double[] array) + { + /* enter your code here */ + + + + if(array[1] > array[2]) //just an extra swap, if needed. + swap(array, 1, 2); + } + + public static void swap(double[] array, int a, int b) + { + + } + + public static void heapDown(double[] array, int k, int size) + { + + } + + public static boolean isSorted(double[] arr) + { + + } + + //****** Part 2 ******************************************* + + //Generate 100 random numbers (between 1 and 100, formatted to 2 decimal places) + public static double[] createRandom(double[] array) + { + array[0] = -1; //because it will become a heap + + + return array; + } + + //turn the random array into a heap + public static void makeHeap(double[] array, int size) + { + + } +} + diff --git a/09 Heaps/01 Heaps, HeapSort/Heaps.doc b/09 Heaps/01 Heaps, HeapSort/Heaps.doc new file mode 100644 index 0000000..5d17f11 Binary files /dev/null and b/09 Heaps/01 Heaps, HeapSort/Heaps.doc differ diff --git a/09 Heaps/01 Heaps, HeapSort/chapt11.ppt b/09 Heaps/01 Heaps, HeapSort/chapt11.ppt new file mode 100644 index 0000000..e7dfda9 Binary files /dev/null and b/09 Heaps/01 Heaps, HeapSort/chapt11.ppt differ diff --git a/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.doc b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.doc new file mode 100644 index 0000000..c51fd0a Binary files /dev/null and b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.doc differ diff --git a/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.java b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.java new file mode 100644 index 0000000..e9650a3 --- /dev/null +++ b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue.java @@ -0,0 +1,61 @@ + //Name: + //Date: + +import java.util.*; + + +/* implement the API for java.util.PriorityQueue + * test this class with HeapPriorityQueue_Driver.java. + * test this class with LunchRoom.java. + * add(E) and remove() must work in O(log n) time + */ +public class HeapPriorityQueue> +{ + private ArrayList myHeap; + + public HeapPriorityQueue() + { + myHeap = new ArrayList(); + myHeap.add(null); + } + + public boolean add(E obj) + { + + } + + public E remove() + { + + } + + public E peek() + { + + } + + public boolean isEmpty() + { + + } + + private void heapUp(int k) + { + + } + + private void swap(int a, int b) + { + + } + + private void heapDown(int k, int size) + { + + } + + public String toString() + { + return myHeap.toString(); + } +} diff --git a/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue_Driver.java b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue_Driver.java new file mode 100644 index 0000000..c77230c --- /dev/null +++ b/09 Heaps/02 HeapPriorityQueue/HeapPriorityQueue_Driver.java @@ -0,0 +1,45 @@ +//Driver class to test the student's HeapPriorityQueue. +import java.util.*; + +public class HeapPriorityQueue_Driver +{ + public static void main(String[] args) + { + //PriorityQueue heap = new PriorityQueue<>(); // java's PQ + HeapPriorityQueue heap = new HeapPriorityQueue(); //your implementation + + System.out.println( heap.peek() ); + boolean added = heap.add(5); + System.out.println( "Peek: " + heap.peek() ); + heap.add(1); + heap.add(3); + heap.add(5); + heap.add(4); + heap.add(2); + System.out.println(heap.toString()); + // set the debugger here. Make sure it acts like a min-heap. + for(int x=1; x<=6; x++) + System.out.println( heap.remove() ); + System.out.println( heap.isEmpty() ); + + //add a lot, then remove half of them + for(int x = 0; x < 100; x++) + heap.add((int)(Math.random() * 50)); + for(int x = 0; x < 50; x++) + heap.remove(); + System.out.println(heap.toString()); //is it a heap? + } +} +/* sample run + null + Peek: 5 + [null, 1, 4, 2, 5, 5, 3] + 1 + 2 + 3 + 4 + 5 + 5 + true + [null, 26, 28, 27, 29, 29, 28, 28, 29, 32, 30, 31, 29, 28, 35, 29, 34, 41, 33, 42, 40, 40, 31, 38, 33, 36, 36, 31, 39, 40, 38, 36, 37, 39, 43, 44, 41, 44, 49, 47, 47, 48, 49, 47, 32, 42, 49, 44, 47, 41, 43] + */ \ No newline at end of file diff --git a/09 Heaps/02 HeapPriorityQueue/LunchRoom.java b/09 Heaps/02 HeapPriorityQueue/LunchRoom.java new file mode 100644 index 0000000..dc8c258 --- /dev/null +++ b/09 Heaps/02 HeapPriorityQueue/LunchRoom.java @@ -0,0 +1,174 @@ +//Driver class, to use with the student's HeapPriorityQueue. +import java.util.*; +import java.lang.*; + +public class LunchRoom +{ + public static void main(String[] args) + { + int MINUTES_OPEN = 1080; + int SERVICE_AREAS = 3; + // PriorityQueue heap = new PriorityQueue<>(); // java's PQ + HeapPriorityQueue heap = new HeapPriorityQueue<>(); // your heap implementation + + /*--implement the PriorityQueue API in your HeapPriorityQueue so that these all work ----------*/ + System.out.println( heap.peek() ); //null + boolean added = heap.add(new Student(1, "2018")); //add a Freshman + added = heap.add(new Student(4, "2015")); //add a Senior after the Freshman + System.out.println( heap.peek() ); //4 2015 + System.out.println( heap.remove() ); //4 2015 + System.out.println( heap.isEmpty() ); //false + System.out.println( heap.remove() ); //1 2018 + System.out.println( heap.isEmpty() ); //true + System.out.println( "------------------"); + /*-----now begin the LunchRoom lab -----------------------------------------*/ + int[] totalCustomers = new int[4]; + int[] longestWait = new int[4]; + int[] totalWait = new int[4]; + int[] timeServing = new int[SERVICE_AREAS]; + Student[] customers = new Student[SERVICE_AREAS]; + for(int m=0;m<=MINUTES_OPEN || !heap.isEmpty() || customers[0]!=null || customers[1] !=null || customers[2] != null;m++) + { + String s = "["; + boolean b = false; + for(int i=0;i=0;i--) + { + double averageWait = (double) totalWait[i]/totalCustomers[i]; + if(i==3) + System.out.print("Senior\t\t"); + if(i==2) + System.out.print("Junior\t\t"); + if(i==1) + System.out.print("Sophomore\t"); + if(i==0) + System.out.print("Freshman\t"); + System.out.println(totalCustomers[i] + "\t\t" + longestWait[i] + "\t\t" + averageWait); + } + } +} +class Student implements Comparable +{ + private String myGradYear; + private int arrivalTime; + private int serviceTime; + public Student(int arrTime, String year) + { + arrivalTime=arrTime; + serviceTime = (int) (Math.random() * 6 + 2); + myGradYear = year; + } + + public int compareTo(Student obj) + { + return Integer.parseInt(myGradYear) - Integer.parseInt(obj.myGradYear); + } + public int getService() + { + return serviceTime; + } + public int getArrival() + { + return arrivalTime; + } + public String toString() + { + return arrivalTime + " " + myGradYear; + } +} +class Senior extends Student +{ + public Senior(int arrTime) + { + super(arrTime, "2015"); + } +} +class Junior extends Student +{ + public Junior(int arrTime) + { + super(arrTime, "2016"); + } +} +class Sophomore extends Student +{ + public Sophomore(int arrTime) + { + super(arrTime, "2017"); + } +} +class Freshman extends Student +{ + public Freshman(int arrTime) + { + super(arrTime, "2018"); + } +} \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/Huffman Coding.doc b/11 Huffman/01_02 Huffman Coding/Huffman Coding.doc new file mode 100644 index 0000000..47c589f Binary files /dev/null and b/11 Huffman/01_02 Huffman Coding/Huffman Coding.doc differ diff --git a/11 Huffman/01_02 Huffman Coding/Huffman.java b/11 Huffman/01_02 Huffman Coding/Huffman.java new file mode 100644 index 0000000..92f2053 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/Huffman.java @@ -0,0 +1,43 @@ +// name: date: +import java.util.*; +import java.io.*; +public class Huffman +{ + public static Scanner keyboard = new Scanner(System.in); + public static void main(String[] args) throws IOException + { + //Prompt for two strings + System.out.print("Encoding using Huffman codes"); + System.out.print("\nWhat message? "); + String message = keyboard.nextLine(); + + System.out.print("\nEnter middle part of filename: "); + String middlePart = keyboard.next(); + + huffmanize( message, middlePart ); + } + public static void huffmanize(String message, String middlePart) throws IOException + { + //Make a frequency table of the letters + //Put each letter-frequency pair into a HuffmanTreeNode. Put each + // node into a priority queue (or a min-heap). + //Use the priority queue of nodes to build the Huffman tree + //Process the string letter-by-letter and search the tree for the + // letter. It's recursive. As you recur, build the path through the tree, + // where going left is 0 and going right is 1. + //System.out.println the binary message + //Write the binary message to the hard drive using the file name ("message." + middlePart + ".txt") + //System.out.println the scheme from the tree--needs a recursive helper method + //Write the scheme to the hard drive using the file name ("scheme." + middlePart + ".txt") + + + } +} + /* + * This tree node stores two values. Look at TreeNode's API for some help. + * The compareTo method must ensure that the lowest frequency has the highest priority. + */ +class HuffmanTreeNode implements Comparable +{ + +} diff --git a/11 Huffman/01_02 Huffman Coding/TreeNode.class b/11 Huffman/01_02 Huffman Coding/TreeNode.class new file mode 100644 index 0000000..14f9ff6 Binary files /dev/null and b/11 Huffman/01_02 Huffman Coding/TreeNode.class differ diff --git a/11 Huffman/01_02 Huffman Coding/TreeNode.java b/11 Huffman/01_02 Huffman Coding/TreeNode.java new file mode 100644 index 0000000..c281380 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/TreeNode.java @@ -0,0 +1,51 @@ +/* TreeNode class for the AP Exams + */ +public class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/11 Huffman/01_02 Huffman Coding/deHuffman.doc b/11 Huffman/01_02 Huffman Coding/deHuffman.doc new file mode 100644 index 0000000..1e35ad9 Binary files /dev/null and b/11 Huffman/01_02 Huffman Coding/deHuffman.doc differ diff --git a/11 Huffman/01_02 Huffman Coding/deHuffman.java b/11 Huffman/01_02 Huffman Coding/deHuffman.java new file mode 100644 index 0000000..5675a92 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/deHuffman.java @@ -0,0 +1,79 @@ +// Name: Date: +import java.util.*; +import java.io.*; +public class deHuffman +{ + public static void main(String[] args) throws IOException + { + Scanner keyboard = new Scanner(System.in); + System.out.print("\nWhat binary message (middle part)? "); + String middlePart = keyboard.next(); + Scanner sc = new Scanner(new File("message."+middlePart+".txt")); + String binaryCode = sc.next(); + Scanner huffLines = new Scanner(new File("scheme."+middlePart+".txt")); + + TreeNode root = huffmanTree(huffLines); + String message = dehuff(binaryCode, root); + System.out.println(message); + + sc.close(); + huffLines.close(); + } + public static TreeNode huffmanTree(Scanner huffLines) + { + } + public static String dehuff(String text, TreeNode root) + { + } +} + + /* TreeNode class for the AP Exams */ +class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/11 Huffman/01_02 Huffman Coding/message.fault.txt b/11 Huffman/01_02 Huffman Coding/message.fault.txt new file mode 100644 index 0000000..9e2ff3a --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.fault.txt @@ -0,0 +1 @@ +01000010101011010001110100011101001000000111110001100000010110010110010010000010011001110100111011001000011100101000110000111110001010100110100011101011011000101001011100010101010100000010111100010101000001000110011101100011011010000111000101010000010100110000101110110000101101011011000101010100101101010110010010011101001010001000110100001100010001100100101100111111100111011100000001111101000011011000001111001111000001010000100111001100110000101110110001000011100000000010111101110110000111101110000101010011000011111 diff --git a/11 Huffman/01_02 Huffman Coding/message.laughter.txt b/11 Huffman/01_02 Huffman Coding/message.laughter.txt new file mode 100644 index 0000000..ff2fdb9 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.laughter.txt @@ -0,0 +1 @@ +01001111010011100101110011100010110111100001110001001110100101111000110100011011011011010010101101011010000011111100011000010100011000111000011100011001010010111001010001100010001110000101011101101101100101100100000111111010011010100111011101010001010010110001101110111101100000011011010000011110000010101110010011000100111010000110011011101010111010011000110011111000110010111100100110001010010010101110101010110001101011111100011010011000110101011010010010010100011111001000010000111111000110100110001010010010101110101001011001010110000111111000110111011110100000111101011010010100110010000101100011000111111011000000010001000000100010011001011001000110010101010000110000010111110111001110100011011010000111011110101001010111010011110011111000000100010011000111100000000100001011110111101110111010100011101000101010110001111100000010001001100011110000000010000101100110001100100101011000001011011101110000101000111100001100100101011000001011011101110011010110001010001101100000011100011010001110000110000001101101000001111000001010111000110010000101100010100011000110011011100111110000001000011000010111000010100001010001000101101101010001000100001100100111101000100010000001000100101000110000001101000000100110001001110101110100000001111101101010000000100000111101010010001101010100001101110000000001110011011000110000001101101000001111000001010111000101101100000001111111101100100000011001000010110001101000000001011011010100100110001001 diff --git a/11 Huffman/01_02 Huffman Coding/message.maips.txt b/11 Huffman/01_02 Huffman Coding/message.maips.txt new file mode 100644 index 0000000..a977fcd --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.maips.txt @@ -0,0 +1 @@ +01010111110111110000010011001001110011 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/message.money.txt b/11 Huffman/01_02 Huffman Coding/message.money.txt new file mode 100644 index 0000000..cc74902 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.money.txt @@ -0,0 +1 @@ +00101110000100011100001010010000000001100100000011100110010111010001011101000000011100101100101100111000101011010100100001011100100001101111001110100000001111001010011100100100100010001011011001101011010111001011000010011101000000011001101011010111000010000000000111000110011010110101100010101101000101010110011101010010001110011110101001101100010101011000011101100000100110110110111011011001001011110001000111000001110010110110110000011011001000010100010001000011100111100100100001010010000001111000011100000100010110011110111000010010110111011100000111010101000110110011100110111100001101011011001001110000001010110101110111001000101000100000010111111111 diff --git a/11 Huffman/01_02 Huffman Coding/message.tj.txt b/11 Huffman/01_02 Huffman Coding/message.tj.txt new file mode 100644 index 0000000..cc25075 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.tj.txt @@ -0,0 +1 @@ +1011111000100 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/message.vegetables.txt b/11 Huffman/01_02 Huffman Coding/message.vegetables.txt new file mode 100644 index 0000000..548bd29 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/message.vegetables.txt @@ -0,0 +1 @@ +0000110010000011111100111010110011010001111011001011110010111011010000110000001110001101011110010010110010101100010001011000110100111101110111000011001000001111110011101011001101000111100110010011011101101001111000001101101001011011100011010111100100101100101011000100010110001101001111011101110000111100111101001001011110101110110100011100011101011111100011111011011101111000001100111011111111100111010101111101110100000101101100101101111011000010111001001011001010100111111000100010110001101001110 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.fault.txt b/11 Huffman/01_02 Huffman Coding/scheme.fault.txt new file mode 100644 index 0000000..bef3815 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.fault.txt @@ -0,0 +1,23 @@ +O0000 +T0001 +D001000 +G001001 +L00101 +N00110 +U00111 +A0100 +H01010 +W01011 +I0110 +Y01110 +P011110 +K0111110 +V0111111 +C100000 +.100001 +S10001 +E1001 +R1010 +F10110 +M10111 + 11 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.laughter.txt b/11 Huffman/01_02 Huffman Coding/scheme.laughter.txt new file mode 100644 index 0000000..f3d27a7 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.laughter.txt @@ -0,0 +1,33 @@ +t0000 +a0001 + 001 +g010000 +b010001 +p010010 +.0100110 +H010011100 +]010011101 +[01001111 +e0101 +n0110 +r01110 +h01111 +l1000 +c10010 +,100110 +m100111 +s1010 +u1011 +o1100 +P11010000 +k11010001 +q11010010 +v11010011 +d1101010 +;11010110 +A11010111 +f110110 +w110111 +y11100 +-11101 +i1111 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.maips.txt b/11 Huffman/01_02 Huffman Coding/scheme.maips.txt new file mode 100644 index 0000000..3375c52 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.maips.txt @@ -0,0 +1,6 @@ +p00 +M010 + 0110 +a0111 +i10 +s11 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.money.txt b/11 Huffman/01_02 Huffman Coding/scheme.money.txt new file mode 100644 index 0000000..fd67309 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.money.txt @@ -0,0 +1,24 @@ +y000000 +f000001 +h00001 +e0001 +p0010000 +g0010001 +w001001 +u001010 +F00101100 +,00101101 +T0010111 +a0011 +o0100 +n0101 +t0110 +i0111 +l1000 +s1001 +d1010 +r10110 +m101110 +k1011110 +.1011111 + 11 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.tj.txt b/11 Huffman/01_02 Huffman Coding/scheme.tj.txt new file mode 100644 index 0000000..988506f --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.tj.txt @@ -0,0 +1,4 @@ +S0 +T10 +H110 +J111 \ No newline at end of file diff --git a/11 Huffman/01_02 Huffman Coding/scheme.vegetables.txt b/11 Huffman/01_02 Huffman Coding/scheme.vegetables.txt new file mode 100644 index 0000000..76de924 --- /dev/null +++ b/11 Huffman/01_02 Huffman Coding/scheme.vegetables.txt @@ -0,0 +1,27 @@ +d00000 +I00001 +m0001 +v0010 +l0011 +e010 +n0110 +.01110 +s01111 +a1000 +'100100 +r100101 +c1001100 +h1001101 +M1001110 +-1001111 +u101000 +w101001 +y10101 +b10110 +f101110 +i1011110 +,1011111 +t11000 +g11001 +o1101 + 111 \ No newline at end of file diff --git a/11 Huffman/03_04 HuffmanPix--student/Huffman Coding with Images.doc b/11 Huffman/03_04 HuffmanPix--student/Huffman Coding with Images.doc new file mode 100644 index 0000000..903abb9 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/Huffman Coding with Images.doc differ diff --git a/11 Huffman/03_04 HuffmanPix--student/HuffmanPix.java b/11 Huffman/03_04 HuffmanPix--student/HuffmanPix.java new file mode 100644 index 0000000..fe64763 --- /dev/null +++ b/11 Huffman/03_04 HuffmanPix--student/HuffmanPix.java @@ -0,0 +1,103 @@ +// Name: +// Date: +import java.util.*; +import java.io.*; +import java.awt.*; +import java.awt.image.BufferedImage; +import java.io.File; +import javax.swing.*; +public class HuffmanPix +{ + public static int WIDTH = 5; // 500 x 500 is too big + public static int HEIGHT = 5; + + public static void main(String[] args) throws IOException + { + Scanner keyboard = new Scanner(System.in); + System.out.print("Encoding using Huffman codes"); + System.out.print("\nWhat image (including extension)? "); + String pixName = keyboard.nextLine(); + ImageIcon i = new ImageIcon(pixName); + BufferedImage bufImg = new BufferedImage(WIDTH, HEIGHT, BufferedImage.TYPE_INT_RGB); + + JFrame f = new JFrame("HuffmanPix"); + f.setSize(500,500); // width, height + f.setLocation(100,50); + f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); + f.setContentPane(new DisplayPix(bufImg, i)); + f.setVisible(true); + + System.out.print("\nEnter middle part of filename: "); + String middlePart = keyboard.nextLine(); + + huffmanize( bufImg, middlePart ); + + System.exit(0); + } + + + public static void huffmanize(BufferedImage bufImg, String middlePart) throws IOException + { + /* your Huffman code goes here */ + + + + + + + + + String binaryFileName = "pix." + middlePart + ".txt"; + PrintWriter outfile = new PrintWriter(new FileWriter(binaryFileName)); + outfile.print(code); + System.out.println("Pix done"); + + Map huffmanScheme = new HashMap(); + String schemeFile = "schemePix."+ middlePart + ".txt"; + PrintWriter outfile2 = new PrintWriter(new FileWriter(schemeFile)); + outfile2.println(""+ WIDTH +" " + HEIGHT); //outputs the width x height + outfile2.println( /*the scheme */ ); + System.out.println("Scheme done"); + + outfile.close(); + outfile2.close(); + } + + /* several Huffman methods go here */ + + +} + + + /* + * This node stores two values. + * The compareTo method must ensure that the lowest frequency has the highest priority. + */ +class HuffmanNode implements Comparable +{ + +} + /* + * Minimum code necessary to display a BufferedImage. + */ +class DisplayPix extends JPanel +{ + private BufferedImage img; + private Graphics g; + public DisplayPix(BufferedImage bufImg, ImageIcon i) //for Huffman + { + int w = bufImg.getWidth(); + int h = bufImg.getHeight(); + img = bufImg; + g = bufImg.getGraphics(); + g.drawImage( i.getImage() , 0 , 0 , w , h, null ); + } + public DisplayPix(BufferedImage bufImg) //for deHuffman + { + img = bufImg; + } + public void paintComponent(Graphics g) + { + g.drawImage( img , 0 , 0 , getWidth() , getHeight() , null ); + } +} \ No newline at end of file diff --git a/11 Huffman/03_04 HuffmanPix--student/TreeNode.java b/11 Huffman/03_04 HuffmanPix--student/TreeNode.java new file mode 100644 index 0000000..c281380 --- /dev/null +++ b/11 Huffman/03_04 HuffmanPix--student/TreeNode.java @@ -0,0 +1,51 @@ +/* TreeNode class for the AP Exams + */ +public class TreeNode +{ + private Object value; + private TreeNode left, right; + + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + + public Object getValue() + { + return value; + } + + public TreeNode getLeft() + { + return left; + } + + public TreeNode getRight() + { + return right; + } + + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} diff --git a/11 Huffman/03_04 HuffmanPix--student/caterpillar.gif b/11 Huffman/03_04 HuffmanPix--student/caterpillar.gif new file mode 100644 index 0000000..a225d60 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/caterpillar.gif differ diff --git a/11 Huffman/03_04 HuffmanPix--student/caterpillar.jpg b/11 Huffman/03_04 HuffmanPix--student/caterpillar.jpg new file mode 100644 index 0000000..2530710 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/caterpillar.jpg differ diff --git a/11 Huffman/03_04 HuffmanPix--student/caterpillar.png b/11 Huffman/03_04 HuffmanPix--student/caterpillar.png new file mode 100644 index 0000000..4626cc3 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/caterpillar.png differ diff --git a/11 Huffman/03_04 HuffmanPix--student/deHuffmanPix.java b/11 Huffman/03_04 HuffmanPix--student/deHuffmanPix.java new file mode 100644 index 0000000..4896aaa --- /dev/null +++ b/11 Huffman/03_04 HuffmanPix--student/deHuffmanPix.java @@ -0,0 +1,126 @@ +// Name: +// Date: +import java.util.Scanner; +import java.io.*; +import java.util.*; +import java.awt.*; +import java.awt.image.BufferedImage; +import javax.swing.*; +public class deHuffmanPix +{ + public static void main(String[] args) throws IOException + { + Scanner keyboard = new Scanner(System.in); + System.out.print("\nWhat binary picture file (middle part) ? "); + String middlePart = keyboard.next(); + Scanner sc = new Scanner(new File("pix."+middlePart+".txt")); + String binaryCode = sc.next(); + Scanner huffScheme = new Scanner(new File("schemePix."+middlePart+".txt")); + int width = huffScheme.nextInt(); // read the size of the image + int height = huffScheme.nextInt(); + + TreeNode root = huffmanTree(huffScheme); + BufferedImage bufImg = dehuff(binaryCode, root, height, width); + + JFrame f = new JFrame("HuffmanPix"); + f.setSize(500,500); // width, height + f.setLocation(100,50); + f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); + f.setContentPane(new DisplayPix(bufImg)); + f.setVisible(true); + + sc.close(); + huffScheme.close(); + keyboard.nextLine(); //press 'enter' + keyboard.nextLine(); + System.exit(0); + } + + public static TreeNode huffmanTree(Scanner huffScheme) + { + /* your code goes here */ + } + + public static BufferedImage dehuff(String text, TreeNode root, int height, int width) + { + BufferedImage bufImg = new BufferedImage( width, height, BufferedImage.TYPE_INT_RGB); + /* your code goes here */ + + + + return bufImg; + } +} + + + /* normal AP-style TreeNode class */ +class TreeNode +{ + private Object value; + private TreeNode left, right; + public TreeNode(Object initValue) + { + value = initValue; + left = null; + right = null; + } + public TreeNode(Object initValue, TreeNode initLeft, TreeNode initRight) + { + value = initValue; + left = initLeft; + right = initRight; + } + public Object getValue() + { + return value; + } + public TreeNode getLeft() + { + return left; + } + public TreeNode getRight() + { + return right; + } + public void setValue(Object theNewValue) + { + value = theNewValue; + } + + public void setLeft(TreeNode theNewLeft) + { + left = theNewLeft; + } + + public void setRight(TreeNode theNewRight) + { + right = theNewRight; + } +} + + /* + * Minimum code necessary to show a BufferedImage. + * + */ +class DisplayPix extends JPanel +{ + private BufferedImage img; + private Graphics g; + + public DisplayPix(BufferedImage bufImg, ImageIcon i) //for Huffman Coding + { + int w = bufImg.getWidth(); + int h = bufImg.getHeight(); + img = bufImg; + g = bufImg.getGraphics(); + g.drawImage( i.getImage() , 0 , 0 , w , h, null ); + } + public DisplayPix(BufferedImage bufImg) //for deHuffman + { + img = bufImg; + } + public void paintComponent(Graphics g) + { + g.drawImage( img , 0 , 0 , getWidth() , getHeight() , null ); + } +} \ No newline at end of file diff --git a/11 Huffman/03_04 HuffmanPix--student/smiley.bmp b/11 Huffman/03_04 HuffmanPix--student/smiley.bmp new file mode 100644 index 0000000..ef394c9 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/smiley.bmp differ diff --git a/11 Huffman/03_04 HuffmanPix--student/smiley.gif b/11 Huffman/03_04 HuffmanPix--student/smiley.gif new file mode 100644 index 0000000..32468d2 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/smiley.gif differ diff --git a/11 Huffman/03_04 HuffmanPix--student/smiley.jpg b/11 Huffman/03_04 HuffmanPix--student/smiley.jpg new file mode 100644 index 0000000..64b8ee3 Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/smiley.jpg differ diff --git a/11 Huffman/03_04 HuffmanPix--student/smiley.png b/11 Huffman/03_04 HuffmanPix--student/smiley.png new file mode 100644 index 0000000..a01f19b Binary files /dev/null and b/11 Huffman/03_04 HuffmanPix--student/smiley.png differ diff --git a/12 Graphs/00-02 AdjMat/AdjMat.class b/12 Graphs/00-02 AdjMat/AdjMat.class new file mode 100644 index 0000000..761d06d Binary files /dev/null and b/12 Graphs/00-02 AdjMat/AdjMat.class differ diff --git a/12 Graphs/00-02 AdjMat/AdjMat.java b/12 Graphs/00-02 AdjMat/AdjMat.java new file mode 100644 index 0000000..4b35b70 --- /dev/null +++ b/12 Graphs/00-02 AdjMat/AdjMat.java @@ -0,0 +1,78 @@ +// Name: B6-24 +// Date: 4/23/20 + +import java.util.*; +import java.io.*; + +/* Resource classes and interfaces + * for use with Graph0 AdjMat_0_Driver, + * Graph1 WarshallDriver, + * and Graph2 FloydDriver + */ + +interface AdjacencyMatrix +{ + void addEdge(int source, int target); + void removeEdge(int source, int target); + boolean isEdge(int from, int to); + String toString(); //returns the grid as a String + int edgeCount(); + List getNeighbors(int source); + //public List getReachables(String from); //Warshall extension +} + +interface Warshall //User-friendly functionality +{ + boolean isEdge(String from, String to); + Map getVertices(); + void readNames(String fileName) throws FileNotFoundException; + void readGrid(String fileName) throws FileNotFoundException; + void displayVertices(); + void allPairsReachability(); // Warshall's Algorithm +} + +interface Floyd +{ + int getCost(int from, int to); + int getCost(String from, String to); + void allPairsWeighted(); +} + +public class AdjMat implements AdjacencyMatrix//,Warshall//,Floyd +{ + private int[][] grid = null; //adjacency matrix representation + private Map vertices = null; // name maps to index (for Warshall & Floyd) + /*for Warshall's Extension*/ ArrayList nameList = null; //reverses the map, index-->name + + /* enter your code here */ + public void addEdge(int source, int target) { + + } + + public void removeEdge(int source, int target) { + + } + + public boolean isEdge(int from, int to) { + return false; + } + + public String toString() { + String str = ""; + for (int i = 0; i < grid.length; i++) { + for (int j = 0; j < grid[i].length; j++) { + str += grid[i][j]; + } + str += "\n"; + } + return str; + } + + public int edgeCount() { + return -1; + } + + public List getNeighbors(int source) { + return null; + } +} diff --git a/12 Graphs/00-02 AdjMat/AdjMat_0_Driver.java b/12 Graphs/00-02 AdjMat/AdjMat_0_Driver.java new file mode 100644 index 0000000..f0e3a7f --- /dev/null +++ b/12 Graphs/00-02 AdjMat/AdjMat_0_Driver.java @@ -0,0 +1,101 @@ +//mlbillington@fcps.edu, May 2014 +//graph manipulation, lesson #0 + +import java.util.*; +import java.io.*; +public class AdjMat_0_Driver +{ + public static void main(String[] args)throws FileNotFoundException + { + Scanner kb = new Scanner(System.in); + System.out.print("Enter size of adjacency matrix: "); + int size = kb.nextInt(); + AdjMat g = new AdjMat(size); + System.out.println("Adjacency Matrix"); + System.out.println(g.toString()); + System.out.println("Add edges, sourcetarget. Enter -1 to stop."); + while(true) + { + int source = kb.nextInt(); + if( source == -1 ) + break; + int target = kb.nextInt(); + if( !g.isEdge(source, target) ) + g.addEdge(source, target); + System.out.println(g.toString()); + } + System.out.println(g.toString()); + System.out.print("Remove an edge? Y/N"); + if( kb.next().equalsIgnoreCase("Y")) + { + while(true) + { + System.out.print("Remove which edge? "); + int source = kb.nextInt(); + if( source == -1 ) + break; + int target = kb.nextInt(); + if( g.isEdge(source, target) ) + g.removeEdge( source, target ); + else + System.out.println("That's not an edge"); + System.out.println(g.toString()); + } + } + + System.out.println("Number of edges: " + g.edgeCount()); + System.out.println("The neighbors of each vertex: "); + for(int i=0; itarget. Enter -1 to end. + 1 3 + 0 0 0 0 + 0 0 0 1 + 0 0 0 0 + 0 0 0 0 + 0 2 + 0 0 1 0 + 0 0 0 1 + 0 0 0 0 + 0 0 0 0 + 2 2 + 0 0 1 0 + 0 0 0 1 + 0 0 1 0 + 0 0 0 0 + -1 + 0 0 1 0 + 0 0 0 1 + 0 0 1 0 + 0 0 0 0 + Remove an edge? Y/N y + Remove which edge? 0 2 + 0 0 0 0 + 0 0 0 1 + 0 0 1 0 + 0 0 0 0 + Remove which edge? 0 0 + That's not an edge + 0 0 0 0 + 0 0 0 1 + 0 0 1 0 + 0 0 0 0 + Remove which edge? -1 + Number of edges: 2 + The neighbors of each vertex: + 0: [] + 1: [3] + 2: [2] + 3: [] + ************************************/ \ No newline at end of file diff --git a/12 Graphs/00-02 AdjMat/AdjacencyMatrix.class b/12 Graphs/00-02 AdjMat/AdjacencyMatrix.class new file mode 100644 index 0000000..0146a21 Binary files /dev/null and b/12 Graphs/00-02 AdjMat/AdjacencyMatrix.class differ diff --git a/12 Graphs/00-02 AdjMat/Floyd.class b/12 Graphs/00-02 AdjMat/Floyd.class new file mode 100644 index 0000000..c92c08f Binary files /dev/null and b/12 Graphs/00-02 AdjMat/Floyd.class differ diff --git a/12 Graphs/00-02 AdjMat/FloydDriver.java b/12 Graphs/00-02 AdjMat/FloydDriver.java new file mode 100644 index 0000000..6c61c62 --- /dev/null +++ b/12 Graphs/00-02 AdjMat/FloydDriver.java @@ -0,0 +1,89 @@ +//mlbillington@fcps.edu, May 2012, June 2014 +// Graphs 2, uses AdjMat + +import java.util.*; +import java.io.*; +public class FloydDriver +{ + public static void main( String[] args)throws FileNotFoundException + { + Scanner kb = new Scanner(System.in); + System.out.print("Floyd's Algorithm! Enter file of names: "); + //cities + String fileNames = kb.next()+".txt"; + Scanner sc = new Scanner(new File(fileNames)); + int size = sc.nextInt(); + AdjMat g = new AdjMat(size); + g.readNames(fileNames); + System.out.print("Enter file of the matrix: ");//citymatrixweighted + String fileGrid = kb.next()+".txt"; + g.readGrid(fileGrid); + System.out.println("\nAdjacency Matrix"); + System.out.println( g.toString() ); + System.out.println("\nNumber of Edges: " + g.edgeCount()); + g.allPairsWeighted(); //call Floyd's + System.out.println(); + g.displayVertices(); + System.out.println("Cost Matrix"); + System.out.println( g.toString() ); + System.out.println("\nNumber of Edges: " + g.edgeCount()); + while(true) + { + System.out.print("\nWhat is the cost? Enter start city (-1 to exit): "); + String from = kb.next(); + if(from.equals("-1")) + break; + System.out.print(" Enter end city: "); + String to = kb.next(); + System.out.println( g.getCost(from, to) ); + } + } +} +/******************************* +Floyd's Algorithm! Enter file of names: cities +Enter file of the matrix: citymatrixweighted + +Adjacency Matrix + 0 9999 9999 9999 9999 9999 9999 8 + 9999 0 9999 5 9999 9999 9999 9999 + 9999 9999 0 9999 9999 5 9999 3 + 9999 9999 9999 0 9999 10 9999 3 + 2 9999 9999 9999 0 9999 9999 9999 + 9999 4 9999 10 9999 0 9999 9999 + 9999 9999 9999 9999 9999 2 0 9999 + 8 9999 9999 9999 3 9999 9999 0 + +Number of Edges: 12 + +0-Pendleton +1-Pensacola +2-Peoria +3-Phoenix +4-Pierre +5-Pittsburgh +6-Princeton +7-Pueblo + +Cost Matrix + 0 9999 9999 9999 11 9999 9999 8 + 13 0 9999 5 11 15 9999 8 + 8 9 0 14 6 5 9999 3 + 8 14 9999 0 6 10 9999 3 + 2 9999 9999 9999 0 9999 9999 10 + 17 4 9999 9 15 0 9999 12 + 19 6 9999 11 17 2 0 14 + 5 9999 9999 9999 3 9999 9999 0 + +Number of Edges: 33 + +What is the cost? Enter start city (-1 to exit): Pittsburgh + Enter end city: Phoenix +9 + +What is the cost? Enter start city (-1 to exit): Pendleton + Enter end city: Phoenix +9999 + +What is the cost? Enter start city (-1 to exit): -1 + +*************************************************************/ diff --git a/12 Graphs/00-02 AdjMat/Graphs0--AdjMat.doc b/12 Graphs/00-02 AdjMat/Graphs0--AdjMat.doc new file mode 100644 index 0000000..ce36253 Binary files /dev/null and b/12 Graphs/00-02 AdjMat/Graphs0--AdjMat.doc differ diff --git a/12 Graphs/00-02 AdjMat/Graphs1--Warshall.doc b/12 Graphs/00-02 AdjMat/Graphs1--Warshall.doc new file mode 100644 index 0000000..c0b89ab Binary files /dev/null and b/12 Graphs/00-02 AdjMat/Graphs1--Warshall.doc differ diff --git a/12 Graphs/00-02 AdjMat/Graphs2--Floyd.doc b/12 Graphs/00-02 AdjMat/Graphs2--Floyd.doc new file mode 100644 index 0000000..e85deac Binary files /dev/null and b/12 Graphs/00-02 AdjMat/Graphs2--Floyd.doc differ diff --git a/12 Graphs/00-02 AdjMat/Warshall.class b/12 Graphs/00-02 AdjMat/Warshall.class new file mode 100644 index 0000000..7036b10 Binary files /dev/null and b/12 Graphs/00-02 AdjMat/Warshall.class differ diff --git a/12 Graphs/00-02 AdjMat/WarshallDriver.java b/12 Graphs/00-02 AdjMat/WarshallDriver.java new file mode 100644 index 0000000..6b97bc5 --- /dev/null +++ b/12 Graphs/00-02 AdjMat/WarshallDriver.java @@ -0,0 +1,105 @@ +//mlbillington@fcps.edu, May 2012, June 2014 +//uses AdjMat +import java.util.*; +import java.io.*; +public class WarshallDriver +{ + public static void main(String[] args)throws FileNotFoundException + { + Scanner kb = new Scanner(System.in); + System.out.print("Warshall's Algorithm! Enter file of names: "); + //cities + String fileNames = kb.next()+".txt"; + Scanner sc = new Scanner(new File(fileNames)); + int size = sc.nextInt(); + AdjMat g = new AdjMat(size); + g.readNames(fileNames); + System.out.print("Enter file of the matrix: "); //citymatrix + String fileGrid = kb.next()+".txt"; + g.readGrid(fileGrid); + System.out.println("Adjacency Matrix"); + System.out.println(g.toString()); + System.out.println("Number of Edges: " + g.edgeCount()); + System.out.println(); + + g.allPairsReachability(); //runs Warshall's algorithm + g.displayVertices(); + System.out.println("Reachability Matrix"); + System.out.println(g.toString()); + System.out.println("Number of Edges: " + g.edgeCount()); + + while(true) + { + System.out.print("\nIs it reachable? Enter name of start city (-1 to exit): "); + String from = kb.next().trim(); + if(from.equals("-1")) + break; + System.out.print(" Enter name of end city: "); + String to = kb.next().trim(); + System.out.println( g.isEdge(from, to) ); + } + + //Extension + System.out.println("\n================== EXTENSION =================="); + System.out.println("List of every city's reachable cities: "); + for(String city : g.getVertices().keySet() ) + System.out.println(city + "--> " + g.getReachables(city) ); + + while(true) + { + System.out.print("\nList the reachable cities from: "); + String from = kb.next(); + if(from.equals("-1")) + break; + System.out.println(g.getReachables(from)); + } + } +} + +/****************************************** + Warshall's Algorithm! Enter file of names: cities + Enter file of the matrix: citymatrix + Adjacency Matrix + 0 0 0 0 0 0 0 1 + 0 0 0 1 0 0 0 0 + 0 0 0 0 0 1 0 1 + 0 0 0 0 0 1 0 1 + 1 0 0 0 0 0 0 0 + 0 1 0 1 0 0 0 0 + 0 0 0 0 0 1 1 0 + 1 0 0 0 1 0 0 0 + + Number of Edges: 13 + + 0-Pendleton + 1-Pensacola + 2-Peoria + 3-Phoenix + 4-Pierre + 5-Pittsburgh + 6-Princeton + 7-Pueblo + + Reachability Matrix + 1 0 0 0 1 0 0 1 + 1 1 0 1 1 1 0 1 + 1 1 0 1 1 1 0 1 + 1 1 0 1 1 1 0 1 + 1 0 0 0 1 0 0 1 + 1 1 0 1 1 1 0 1 + 1 1 0 1 1 1 1 1 + 1 0 0 0 1 0 0 1 + + Number of Edges: 40 + + Is it reachable? Enter name of start city (-1 to exit): Pittsburgh + Enter name of end city: Peoria + false + + Is it reachable? Enter name of start city (-1 to exit): Pittsburgh + Enter name of end city: Phoenix + true + + Is it reachable? Enter name of start city (-1 to exit): -1 + + **************************************************/ \ No newline at end of file diff --git a/12 Graphs/00-02 AdjMat/cities.txt b/12 Graphs/00-02 AdjMat/cities.txt new file mode 100644 index 0000000..10c383b --- /dev/null +++ b/12 Graphs/00-02 AdjMat/cities.txt @@ -0,0 +1,9 @@ +8 +Pendleton +Pensacola +Peoria +Phoenix +Pierre +Pittsburgh +Princeton +Pueblo \ No newline at end of file diff --git a/12 Graphs/00-02 AdjMat/citymatrix.txt b/12 Graphs/00-02 AdjMat/citymatrix.txt new file mode 100644 index 0000000..f0c9dba --- /dev/null +++ b/12 Graphs/00-02 AdjMat/citymatrix.txt @@ -0,0 +1,9 @@ +8 +0 0 0 0 0 0 0 1 +0 0 0 1 0 0 0 0 +0 0 0 0 0 1 0 1 +0 0 0 0 0 1 0 1 +1 0 0 0 0 0 0 0 +0 1 0 1 0 0 0 0 +0 0 0 0 0 1 1 0 +1 0 0 0 1 0 0 0 \ No newline at end of file diff --git a/12 Graphs/00-02 AdjMat/citymatrixweighted.txt b/12 Graphs/00-02 AdjMat/citymatrixweighted.txt new file mode 100644 index 0000000..99cbf4b --- /dev/null +++ b/12 Graphs/00-02 AdjMat/citymatrixweighted.txt @@ -0,0 +1,9 @@ +8 +0 9999 9999 9999 9999 9999 9999 8 +9999 0 9999 5 9999 9999 9999 9999 +9999 9999 0 9999 9999 5 9999 3 +9999 9999 9999 0 9999 10 9999 3 +2 9999 9999 9999 0 9999 9999 9999 +9999 4 9999 10 9999 0 9999 9999 +9999 9999 9999 9999 9999 2 0 9999 +8 9999 9999 9999 3 9999 9999 0 \ No newline at end of file diff --git a/12 Graphs/03-05 AdjList/AdjList.java b/12 Graphs/03-05 AdjList/AdjList.java new file mode 100644 index 0000000..66d327e --- /dev/null +++ b/12 Graphs/03-05 AdjList/AdjList.java @@ -0,0 +1,99 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +/* Resource classes and interfaces + * for use with Graphs3: EdgeList, + * Graphs4: DFS-BFS + * and Graphs5: EdgeListCities + */ + +/* Graphs 3: EdgeList + */ +interface VertexInterface +{ + String toString(); // Don't use commas in the list. Example: "C [C D]" + String getName(); + ArrayList getAdjacencies(); + void addEdge(Vertex v); +} + +class Vertex implements VertexInterface +{ + private final String name; + private ArrayList adjacencies; + + /* enter your code here */ + +} + +interface AdjListInterface +{ + List getVertices(); + Vertex getVertex(int i) ; + Vertex getVertex(String vertexName); + Map getVertexMap(); + void addVertex(String v); + void addEdge(String source, String target); + String toString(); //returns all vertices with their edges (omit commas) +} + + +/* Graphs 4: DFS and BFS + */ +interface DFS_BFS +{ + List depthFirstSearch(String name); + List depthFirstSearch(Vertex v); + List breadthFirstSearch(String name); + List breadthFirstSearch(Vertex v); + /* three extra credit methods */ + List depthFirstRecur(String name); + List depthFirstRecur(Vertex v); + void depthFirstRecurHelper(Vertex v, ArrayList reachable); +} + +/* Graphs 5: Edgelist with Cities + */ +interface EdgeListWithCities +{ + void graphFromEdgeListData(String fileName) throws FileNotFoundException; + int edgeCount(); + int vertexCount(); //count the vertices in the object + boolean isReachable(String source, String target); + boolean isConnected(); +} + + +public class AdjList implements AdjListInterface //,DFS_BFS //,EdgeListWithCities +{ + private ArrayList vertices = new ArrayList(); + private Map nameToIndex = new TreeMap(); + + /* enter your code here */ + + + + + + + /* three extra credit methods, recursive version */ + List depthFirstRecur(String name) + { + return null; + } + + List depthFirstRecur(Vertex v) + { + return null; + } + + void depthFirstRecurHelper(Vertex v, ArrayList reachable) + { + + } +} + + diff --git a/12 Graphs/03-05 AdjList/AdjList_3_Driver.java b/12 Graphs/03-05 AdjList/AdjList_3_Driver.java new file mode 100644 index 0000000..8812407 --- /dev/null +++ b/12 Graphs/03-05 AdjList/AdjList_3_Driver.java @@ -0,0 +1,40 @@ +//mlbillington@fcps.edu July 2014 +//lesson: Graphs3: EdgeList +//uses AdjList + +import java.util.*; +import java.io.*; + +public class AdjList_3_Driver +{ + public static void main(String[] args)throws FileNotFoundException + { + System.out.println("Edge List Representation! "); + AdjList g = new AdjList(); + g.addVertex("A"); //if it's not there, add it. + g.addVertex("B"); + g.addEdge("A", "C"); // <-- warning! Be sure to add all the Vertices first; + // or else deal with it. + g.addVertex("C"); + g.addVertex("D"); + g.addEdge("B", "A"); + g.addEdge("C", "C"); + g.addEdge("C", "D"); + g.addEdge("D", "C"); + g.addEdge("D", "A"); + Map m = g.getVertexMap(); //look at the map in the debugger + System.out.println(g.getVertex("C").toString()); //print one vertex + System.out.println("-----------------"); + System.out.println(g.toString()); //print the whole graph + } +} +/*************************** + Edge List Representation! + C [C D] + ----------------- + A [C] + B [A] + C [C D] + D [C A] + + ************************/ \ No newline at end of file diff --git a/12 Graphs/03-05 AdjList/AdjList_5_Driver.java b/12 Graphs/03-05 AdjList/AdjList_5_Driver.java new file mode 100644 index 0000000..b50e399 --- /dev/null +++ b/12 Graphs/03-05 AdjList/AdjList_5_Driver.java @@ -0,0 +1,70 @@ +//mlbillington@fcps.edu May 2014 +//lesson: Graphs5: EdgeListCities +//uses AdjList + +import java.util.*; +import java.io.*; + +public class AdjList_5_Driver +{ + public static void main(String[] args)throws FileNotFoundException + { + System.out.println("Edge List with Cities! "); + Scanner kb = new Scanner(System.in); + System.out.print("Enter file of cities and edges: "); + //cityEdgeList + String fileOfCities = kb.next()+".txt"; + AdjList g = new AdjList(); + g.graphFromEdgeListData(fileOfCities); + + System.out.println("\nThe cities with their edges:"); + System.out.println(g.toString()); //print the graph + + System.out.println("Number of edges: " + g.edgeCount()); + + System.out.print("\nIs this graph connected? " + g.isConnected() ); + + while(true) + { + System.out.print("\nCan you get there from here? \n\tEnter start city (-1 to exit): "); + String from = kb.next(); + if(from.equals("-1")) + break; + System.out.print("\tEnter end city: "); + String to = kb.next(); + System.out.println( "\t\t" + g.isReachable(from, to) ); + } + } +} +/********************************** +Edge List with Cities! +Enter file of cities and edges: cityEdgeList + +The cities with their edges: +Pendleton [Pueblo] +Pueblo [Pendleton Pierre] +Pensacola [Phoenix] +Phoenix [Pittsburgh Pueblo] +Peoria [Pittsburgh Pueblo] +Pittsburgh [Pensacola Phoenix] +Pierre [Pendleton] +Princeton [Pittsburgh Princeton] + +Number of edges: 13 + +Is this graph connected? false + +Can you get there from here? +Enter start city (-1 to exit): Peoria +Enter end city: Pittsburgh + true + +Can you get there from here? +Enter start city (-1 to exit): Pittsburgh +Enter end city: Peoria + false + +Can you get there from here? +Enter start city (-1 to exit): -1 + +****************************/ \ No newline at end of file diff --git a/12 Graphs/03-05 AdjList/DFS_BFS_Driver.java b/12 Graphs/03-05 AdjList/DFS_BFS_Driver.java new file mode 100644 index 0000000..345a2b2 --- /dev/null +++ b/12 Graphs/03-05 AdjList/DFS_BFS_Driver.java @@ -0,0 +1,65 @@ +//mlbillington@fcps.edu June 2014 +//lesson: Graphs4: DFS_BFS +//uses AdjList + +import java.util.*; +import java.io.*; + +public class DFS_BFS_Driver +{ + public static void main(String[] args)throws FileNotFoundException + { + System.out.println("Edge List Representation! "); + AdjList g = new AdjList(); + g.addVertex("A"); //if it's not there, add it. + g.addVertex("B"); + g.addEdge("A", "C"); // <-- warning! Be sure to add all the Vertices first, + // or else deal with it. + g.addVertex("C"); + g.addVertex("D"); + g.addEdge("B", "A"); + g.addEdge("C", "C"); + g.addEdge("C", "D"); + g.addEdge("D", "C"); + g.addEdge("D", "A"); + System.out.println(g.toString()); //let's look at it first + + System.out.println("\nDepth First Search"); + for (String name : g.getVertexMap().keySet() ) + System.out.println( name + " ---> " + g.depthFirstSearch(name) ); + + System.out.println("\nBreadth First Search"); + for (String name : g.getVertexMap().keySet() ) + System.out.println( name + " ---> " + g.breadthFirstSearch(name) ); + + //use the debugger to see the difference: + //System.out.println(); + //System.out.println( "D" + " ---> " + g.depthFirstSearch("D") ); + ///System.out.println( "D" + " ---> " + g.breadthFirstSearch("D") ); + + /* Extension */ + // System.out.println("\nDepth First Search (Recursive)"); + // for (String name : g.getVertexMap().keySet() ) + // System.out.println ( name + " ---> " + g.depthFirstRecur(name) ); + } +} +/******************************** + Edge List Representation! + A [C] + B [A] + C [C D] + D [C A] + + Depth First Search + A ---> [A [C], C [C D], D [C A]] + B ---> [B [A], A [C], C [C D], D [C A]] + C ---> [C [C D], D [C A], A [C]] + D ---> [D [C A], A [C], C [C D]] + + Breadth First Search + A ---> [A [C], C [C D], D [C A]] + B ---> [B [A], A [C], C [C D], D [C A]] + C ---> [C [C D], D [C A], A [C]] + D ---> [D [C A], C [C D], A [C]] + +******************************/ \ No newline at end of file diff --git a/12 Graphs/03-05 AdjList/Graph Exercises.doc b/12 Graphs/03-05 AdjList/Graph Exercises.doc new file mode 100644 index 0000000..051798b Binary files /dev/null and b/12 Graphs/03-05 AdjList/Graph Exercises.doc differ diff --git a/12 Graphs/03-05 AdjList/Graphs3--EdgeList.doc b/12 Graphs/03-05 AdjList/Graphs3--EdgeList.doc new file mode 100644 index 0000000..ff40a9a Binary files /dev/null and b/12 Graphs/03-05 AdjList/Graphs3--EdgeList.doc differ diff --git a/12 Graphs/03-05 AdjList/Graphs4--DFS-BFS.doc b/12 Graphs/03-05 AdjList/Graphs4--DFS-BFS.doc new file mode 100644 index 0000000..5c58a91 Binary files /dev/null and b/12 Graphs/03-05 AdjList/Graphs4--DFS-BFS.doc differ diff --git a/12 Graphs/03-05 AdjList/Graphs5--EdgeListCities.doc b/12 Graphs/03-05 AdjList/Graphs5--EdgeListCities.doc new file mode 100644 index 0000000..e46cd26 Binary files /dev/null and b/12 Graphs/03-05 AdjList/Graphs5--EdgeListCities.doc differ diff --git a/12 Graphs/03-05 AdjList/cityEdgeList.txt b/12 Graphs/03-05 AdjList/cityEdgeList.txt new file mode 100644 index 0000000..df291b2 --- /dev/null +++ b/12 Graphs/03-05 AdjList/cityEdgeList.txt @@ -0,0 +1,13 @@ +Pendleton Pueblo +Pensacola Phoenix +Peoria Pittsburgh +Peoria Pueblo +Phoenix Pittsburgh +Phoenix Pueblo +Pierre Pendleton +Pittsburgh Pensacola +Pittsburgh Phoenix +Princeton Pittsburgh +Princeton Princeton +Pueblo Pendleton +Pueblo Pierre \ No newline at end of file diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/AdjListWeighted.java b/12 Graphs/06-07 Dijkstra_s Algorithm/AdjListWeighted.java new file mode 100644 index 0000000..98a3a9e --- /dev/null +++ b/12 Graphs/06-07 Dijkstra_s Algorithm/AdjListWeighted.java @@ -0,0 +1,84 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +/* Resource classes and interfaces + * for use with Graphs6: Dijkstra + * Graphs7: Dijkstra with Cities + */ + +class Edge +{ + public final wVertex target; //if it's public, you don't need accessor methods + public final double weight; //if it's public, you don't need accessor methods + + public Edge(wVertex argTarget, double argWeight) + { + target = argTarget; + weight = argWeight; + } +} + +interface wVertexInterface +{ + String getName(); + double getMinDistance(); + void setMinDistance(double m); + //wVertex getPrevious(); //for Dijkstra 7 + //void setPrevious(wVertex v); //for Dijkstra 7 + ArrayList getAdjacencies(); + void addEdge(wVertex v, double weight); + int compareTo(wVertex other); +} + +class wVertex implements Comparable, wVertexInterface +{ + private final String name; + private ArrayList adjacencies; + private double minDistance = Double.POSITIVE_INFINITY; + //private wVertex previous; //for building the actual path in Dijkstra 7 + + /* enter your code for this class here */ + +} + +interface AdjListWeightedInterface +{ + List getVertices(); + Map getNameToIndex(); + wVertex getVertex(int i); + wVertex getVertex(String vertexName); + void addVertex(String v); + void addEdge(String source, String target, double weight); + void minimumWeightPath(String vertexName); //Dijkstra's +} + +/* Interface for Graphs 7: Dijkstra with Cities + */ + +interface AdjListWeightedInterfaceWithCities +{ + List getShortestPathTo(wVertex v); + AdjListWeighted graphFromEdgeListData(File vertexNames, File edgeListData) throws FileNotFoundException ; +} + + +public class AdjListWeighted implements AdjListWeightedInterface //,AdjListWeightedInterfaceWithCities +{ + private List vertices = new ArrayList(); + private Map nameToIndex = new HashMap(); + //the constructor is a no-arg constructor + + /* enter your code for Graphs 6 */ + + + + + /* enter your code for two new methods in Graphs 7 */ + + +} + + diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_6_Driver.java b/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_6_Driver.java new file mode 100644 index 0000000..5da4c75 --- /dev/null +++ b/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_6_Driver.java @@ -0,0 +1,52 @@ +//driver for Graph 6, using AdjListWeighted +import java.util.*; +import java.io.*; +public class Dijkstra_6_Driver +{ + public static void main(String[] args) throws FileNotFoundException + { + /* Graphs 6 Dijkstra: hard-coded A-B-C-D */ + + AdjListWeighted graph = new AdjListWeighted(); + graph.addVertex("A"); + graph.addVertex("B"); + graph.addVertex("C"); + graph.addVertex("D"); + graph.addEdge("A","B", 9); + graph.addEdge("A","C", 3); + graph.addEdge("C","B", 5); + graph.addEdge("C","D", 2); + graph.addEdge("D","B", 1); + Scanner key = new Scanner(System.in); + System.out.print("Enter start: " ); + String source = key.next(); + graph.minimumWeightPath(source); //runs Dijkstra's Algorithm + for (wVertex v : graph.getVertices()) //prints all the distances from the source + { + System.out.println("Distance to " + v.getName() + ": " + v.getMinDistance()); + } + while(true) + { + System.out.print("Enter end: " ); + String end = key.next(); + if(end.equals("-1")) + break; + System.out.println( "From " + source + " to "+ end+ ": "+graph.getVertex(end).getMinDistance() ); + } + } +} + +/*********************************** + + Enter start: A + Distance to A: 0.0 + Distance to B: 6.0 + Distance to C: 3.0 + Distance to D: 5.0 + Enter end: B + From A to B: 6.0 + Enter end: D + From A to D: 5.0 + Enter end: -1 + + ******************************/ \ No newline at end of file diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_7_Driver.java b/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_7_Driver.java new file mode 100644 index 0000000..7530b5b --- /dev/null +++ b/12 Graphs/06-07 Dijkstra_s Algorithm/Dijkstra_7_Driver.java @@ -0,0 +1,61 @@ +//driver for Graph 7 using AdjListWeighted +// read from the given data file +// prints cities and paths +import java.util.*; +import java.io.*; +public class Dijkstra_7_Driver +{ + public static void main(String[] args) throws FileNotFoundException + { + AdjListWeighted g = new AdjListWeighted(); + g = g.graphFromEdgeListData(new File("cities.txt"), new File("cityEdgeListWeighted.txt")); + Scanner key = new Scanner(System.in); + System.out.print("Enter start: " ); + String source = key.next(); + g.minimumWeightPath(source); //runs Dijkstra's Algorithm + for (wVertex v : g.getVertices()) //prints the distances and path from source + { + System.out.println("Distance to " + v.getName() + ": " + v.getMinDistance()); + List path = g.getShortestPathTo(v); + System.out.println(" Path: " + path); + } + + while(true) + { + System.out.print("Enter end: " ); + String end = key.next(); + if(end.equals("-1")) + break; + System.out.println( "From " + source + " to "+ end+ ": "+ g.getVertex(end).getMinDistance() ); + System.out.println( " Shortest path is "+ g.getShortestPathTo( g.getVertex(end)) ); + } + + } +} +/************************************************** + Enter start: Peoria + Distance to Pendleton: 8.0 + Path: [Peoria, Pueblo, Pierre, Pendleton] + Distance to Pensacola: 9.0 + Path: [Peoria, Pittsburgh, Pensacola] + Distance to Peoria: 0.0 + Path: [Peoria] + Distance to Phoenix: 14.0 + Path: [Peoria, Pittsburgh, Pensacola, Phoenix] + Distance to Pierre: 6.0 + Path: [Peoria, Pueblo, Pierre] + Distance to Pittsburgh: 5.0 + Path: [Peoria, Pittsburgh] + Distance to Princeton: Infinity + Path: [Princeton] + Distance to Pueblo: 3.0 + Path: [Peoria, Pueblo] + Enter end: Pittsburgh + From Peoria to Pittsburgh: 5.0 + Shortest path is [Peoria, Pittsburgh] +Enter end: Pueblo +From Peoria to Pueblo: 3.0 + Shortest path is [Peoria, Pueblo] +Enter end: -1 + +********************************************/ \ No newline at end of file diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs6--Dijkstra.doc b/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs6--Dijkstra.doc new file mode 100644 index 0000000..ec3af0c Binary files /dev/null and b/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs6--Dijkstra.doc differ diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs7--Dijkstra and Cities.doc b/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs7--Dijkstra and Cities.doc new file mode 100644 index 0000000..a4236fa Binary files /dev/null and b/12 Graphs/06-07 Dijkstra_s Algorithm/Graphs7--Dijkstra and Cities.doc differ diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/cities.txt b/12 Graphs/06-07 Dijkstra_s Algorithm/cities.txt new file mode 100644 index 0000000..10c383b --- /dev/null +++ b/12 Graphs/06-07 Dijkstra_s Algorithm/cities.txt @@ -0,0 +1,9 @@ +8 +Pendleton +Pensacola +Peoria +Phoenix +Pierre +Pittsburgh +Princeton +Pueblo \ No newline at end of file diff --git a/12 Graphs/06-07 Dijkstra_s Algorithm/cityEdgeListWeighted.txt b/12 Graphs/06-07 Dijkstra_s Algorithm/cityEdgeListWeighted.txt new file mode 100644 index 0000000..7b75409 --- /dev/null +++ b/12 Graphs/06-07 Dijkstra_s Algorithm/cityEdgeListWeighted.txt @@ -0,0 +1,13 @@ +Pendleton Pueblo 8 +Pensacola Phoenix 5 +Peoria Pittsburgh 5 +Peoria Pueblo 3 +Phoenix Pittsburgh 10 +Phoenix Pueblo 3 +Pierre Pendleton 2 +Pittsburgh Pensacola 4 +Pittsburgh Phoenix 10 +Princeton Pittsburgh 2 +Princeton Princeton 0 +Pueblo Pendleton 8 +Pueblo Pierre 3 \ No newline at end of file diff --git a/12 Graphs/11 HTH State Graphs/Graphs11--HTH.doc b/12 Graphs/11 HTH State Graphs/Graphs11--HTH.doc new file mode 100644 index 0000000..52b9395 Binary files /dev/null and b/12 Graphs/11 HTH State Graphs/Graphs11--HTH.doc differ diff --git a/12 Graphs/11 HTH State Graphs/HTH_Driver.java b/12 Graphs/11 HTH State Graphs/HTH_Driver.java new file mode 100644 index 0000000..742e252 --- /dev/null +++ b/12 Graphs/11 HTH State Graphs/HTH_Driver.java @@ -0,0 +1,79 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +/* For use with Graphs11: State Graphs, + Heads-Tails-Heads + */ + +class HTH_Driver +{ + public static void main(String[] args) throws FileNotFoundException + { + System.out.print("Enter the initial state, three H and/or T: "); + Scanner in = new Scanner(System.in); + String initial = in.next().toUpperCase(); + Vertex v = makeGraph(initial); + System.out.println("The state graph has been made."); + + while(true) + { + System.out.print("Enter the final state, three H and/or T: "); + String finalState = in.next().toUpperCase();; + if( finalState.equals("-1") ) + break; + v = findBreadth(v, finalState); + System.out.println("The shortest path from "+initial+" to "+ finalState+ " is: "); + System.out.println(initial); + String s = ""; + while(v.previous != null) + { + s = v+"\n"+s; + v = v.previous; + } + System.out.println(s); + } + } + + public static Vertex makeGraph(String s) + { + + } + + public static Vertex findBreadth(Vertex v, String goal) + { + + } +} + +class Vertex +{ + private final boolean[] state; + private List edges = new ArrayList(); + public Vertex previous; + +} + +/************************ + Enter the initial state, three H and/or T: HTH + The state graph has been made. + Enter the final state, three H and/or T: THT + The shortest path from HTH to THT is: + HTH + HHH + HHT + HTT + TTT + THT + + Enter the final state, three H and/or T: HHH + The shortest path from HTH to HHH is: + HTH + HHH + + Enter the final state, three H and/or T: -1 + + + *************************************/ \ No newline at end of file diff --git a/12 Graphs/25 TeamBuilder/TeamBuilder.doc b/12 Graphs/25 TeamBuilder/TeamBuilder.doc new file mode 100644 index 0000000..8cdd1de Binary files /dev/null and b/12 Graphs/25 TeamBuilder/TeamBuilder.doc differ diff --git a/12 Graphs/25 TeamBuilder/TeamBuilder.java b/12 Graphs/25 TeamBuilder/TeamBuilder.java new file mode 100644 index 0000000..ee01fa7 --- /dev/null +++ b/12 Graphs/25 TeamBuilder/TeamBuilder.java @@ -0,0 +1,25 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +public class TeamBuilder +{ + public static void main(String[] args) + { + String[] path = {"010", "000", "110"}; + //String[] path = {"0010", "1000", "1100", "1000"}; + //String[] path = {"01000", "00100", "00010", "00001", "10000"}; + //String[] path = {"0110000", "1000100", "0000001", "0010000", "0110000", "1000010", "0001000"}; + + int[] ret = specialLocations(path); + System.out.println("{" + ret[0] + ", " + ret[1] + "}"); + } + + public static int[] specialLocations(String[] paths) + { + + } + +} \ No newline at end of file diff --git a/12 Graphs/25 TeamBuilder/tb0.txt b/12 Graphs/25 TeamBuilder/tb0.txt new file mode 100644 index 0000000..46d3902 --- /dev/null +++ b/12 Graphs/25 TeamBuilder/tb0.txt @@ -0,0 +1 @@ +010,000,110 \ No newline at end of file diff --git a/12 Graphs/25 TeamBuilder/tb1.txt b/12 Graphs/25 TeamBuilder/tb1.txt new file mode 100644 index 0000000..aaa7e8a --- /dev/null +++ b/12 Graphs/25 TeamBuilder/tb1.txt @@ -0,0 +1 @@ +0010,1000,1100,1000 \ No newline at end of file diff --git a/12 Graphs/25 TeamBuilder/tb2.txt b/12 Graphs/25 TeamBuilder/tb2.txt new file mode 100644 index 0000000..a9f10a6 --- /dev/null +++ b/12 Graphs/25 TeamBuilder/tb2.txt @@ -0,0 +1 @@ +01000,00100,00010,00001,10000 \ No newline at end of file diff --git a/12 Graphs/25 TeamBuilder/tb3.txt b/12 Graphs/25 TeamBuilder/tb3.txt new file mode 100644 index 0000000..80cbd04 --- /dev/null +++ b/12 Graphs/25 TeamBuilder/tb3.txt @@ -0,0 +1 @@ +0110000,1000100,0000001,0010000,0110000,1000010,0001000 \ No newline at end of file diff --git a/12 Graphs/45 Jugs/Jugs.doc b/12 Graphs/45 Jugs/Jugs.doc new file mode 100644 index 0000000..c2417da Binary files /dev/null and b/12 Graphs/45 Jugs/Jugs.doc differ diff --git a/12 Graphs/45 Jugs/Jugs.java b/12 Graphs/45 Jugs/Jugs.java new file mode 100644 index 0000000..a24647b --- /dev/null +++ b/12 Graphs/45 Jugs/Jugs.java @@ -0,0 +1,61 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +public class Jugs +{ + public static void main(String[] args) throws Exception + { + solve(3, 5, 4); //replace this line + } + + public static void solve(int a, int b, int n) + { + //Build a graph of the possible Jug pair states, + //given a as the capacity of the first jug, b as the capacity of the second jug, + Jug startJug = createGraph(a, b); + + //Given n as the desired measurement of liquid, + //print the solution to the given Jug problem using breadth-first search + findReachableBreadth(startJug, a, b, n); + } + + //Breadth-first search from EdgeList + public static void findReachableBreadth(Jug v, int ac, int bc, int n) + { + + } + + public static Jug createGraph(int a, int b) + { + /* Use a HashMap mapping a string representing the state of the jugs + (e.g. "1 2") to its analagous Jug object (e.g. Jug(1, 2)) */ + HashMap map = new HashMap(); + + /*It's easier if you first add every possible Jug combination to the map, ignoring whether the Jug can be reached. + Use nested for-loops. */ + + + + /* For each Jug object in the map, add an edge to every other Jug that can be reached from the present state. + In other words, add an edge for the filling of either jug, the emptying of either jug, or the pouring of + one jug into the other. */ + + + + return map.get("0 0"); //Return starting point of the graph (empty jugs) + } +} + +/* The Jug object is a representation of the state of the pair of jugs. + * Jug is a slight modification of the Vertex class from EdgeList. + */ +class Jug +{ + private final int a, b; //a is the volume of the liquid in the first jug, b is the second jug + private HashSet edges = new HashSet(); //Adjacency List + + +} diff --git a/12 Graphs/45 Jugs/jugs1.txt b/12 Graphs/45 Jugs/jugs1.txt new file mode 100644 index 0000000..f713945 --- /dev/null +++ b/12 Graphs/45 Jugs/jugs1.txt @@ -0,0 +1 @@ +3 5 4 diff --git a/12 Graphs/45 Jugs/jugs2.txt b/12 Graphs/45 Jugs/jugs2.txt new file mode 100644 index 0000000..93d9589 --- /dev/null +++ b/12 Graphs/45 Jugs/jugs2.txt @@ -0,0 +1,7 @@ +3 5 4 +5 7 3 +11 13 9 +27 59 17 +19 37 1 +67 91 19 +1 1 1 diff --git a/12 Graphs/65 Island Ferries/IslandFerries.doc b/12 Graphs/65 Island Ferries/IslandFerries.doc new file mode 100644 index 0000000..6227c60 Binary files /dev/null and b/12 Graphs/65 Island Ferries/IslandFerries.doc differ diff --git a/12 Graphs/65 Island Ferries/IslandFerries.java b/12 Graphs/65 Island Ferries/IslandFerries.java new file mode 100644 index 0000000..0f949b5 --- /dev/null +++ b/12 Graphs/65 Island Ferries/IslandFerries.java @@ -0,0 +1,84 @@ +// Name: +// Date: + +import java.awt.Point; +import java.util.HashMap; +import java.util.Set; + +class Island implements Comparable +{ + private int minDistance; + private final Point loc; + private HashMap adj; + private int dists[]; + + /* student code goes here */ + +} + +public class IslandFerries +{ + public static void main(String[] args) + { + /* Example 0 */ + String[] legs ={ "0-1 0-3", "0-2" }; + String[] costs ={ "5 7", "1000 1000", "1000 1000", "1000 1000" }; + /* Returns: { 5, 7, 5 } */ + + /* Example 1 */ + //String[] legs = { "0-1 1-2 2-3", "0-1 2-3" }; + //String[] costs = { "1 10", "20 25", "50 50", "1000 1000", "1000 1000" }; + /*Returns: { 1, 11, 31, -1 } */ + + /* Example 2 */ + //String[] legs = { "0-1", "1-0", "0-2", "2-3" }; + //String[] costs = { "1 1 1000 1000", "1000 1000 10 100", "1000 1000 1000 1000", "1000 1000 1000 1000" }; + /*Returns: { 1, 12, 112 }*/ + + /* Example 3 */ + // String[] legs = { "1-0" }; + // String[] costs = { "793", "350" }; + /*Returns: { -1 } */ + + /*Example 4 */ + // String[] legs = {"8-18 4-11 15-5 7-12 11-8 0-15 15-2 3-11 4-18 2-3", + // "16-2 18-3 15-18 11-19 18-2 18-7 19-17 3-15 12-19", + // "2-17 0-12 1-2 14-12 6-2 4-2 11-5 4-11 11-6 17-16", + // "0-18 13-18 16-0 3-7 14-12 3-1 19-18 3-19 10-3 8-15", + // "18-19 3-16 13-6 0-19 12-14 5-17 1-12 7-13 9-14 1-2", + // "14-5 17-9 2-10 16-13 11-15 10-17 14-10 0-14 2-13", + // "4-5 0-17 6-9 17-7 12-6 5-6 6-18 10-18 0-2 13-0 8-4", + // "3-12 4-11 10-17 13-12 3-0 3-7 13-0 9-15 10-9 0-10" }; + // String[] costs = {"592 219 88 529 324 86 503 610", + // "2 94 8 600 34 95 6 494", + // "638 301 10 246 290 97 85 74", + // "118 8 939 393 450 79 317 99", + // "99 806 698 740 2 26 525 818", + // "95 9 615 972 23 23 5 666", + // "6 448 440 710 83 4 419 496", + // "4 47 182 4 185 70 718 770", + // "3 321 6 855 968 65 10 6", + // "173 224 300 3 79 2 707 49", + // "21 10 7 10 4 9 5 8", + // "6 600 4 724 7 1 960 247", + // "83 16 901 50 437 780 658 2", + // "763 923 125 576 45 423 3 1", + // "7 324 391 898 8 59 281 973", + // "9 44 49 364 78 744 43 5", + // "10 62 75 418 216 90 32 919", + // "764 534 778 605 80 647 821 74", + // "65 449 102 867 421 94 6 7", + // "67 155 362 789 189 316 107 595" }; + /*Returns: { 170, 160, 155, 173, 145, 150, 158, 168, 153, 145, 162, 88, 162, 86, 163, 159, 153, 150, 104 } + */ + } + + public static int[] costs(String[] legs, String[] costs) + { + int[] toReturn = null; + + /* student code goes here */ + + return toReturn; + } +} \ No newline at end of file diff --git a/12 Graphs/85 RoboCourier/RoboCourier.doc b/12 Graphs/85 RoboCourier/RoboCourier.doc new file mode 100644 index 0000000..5bce6bd Binary files /dev/null and b/12 Graphs/85 RoboCourier/RoboCourier.doc differ diff --git a/12 Graphs/85 RoboCourier/RoboCourier_Driver.java b/12 Graphs/85 RoboCourier/RoboCourier_Driver.java new file mode 100644 index 0000000..6735b63 --- /dev/null +++ b/12 Graphs/85 RoboCourier/RoboCourier_Driver.java @@ -0,0 +1,33 @@ +// Name: +// Date: + +import java.util.*; +import java.io.*; + +public class RoboCourier_Driver +{ + public static void main(String[] args) throws Exception + { + System.out.println("RoboCourier"); + System.out.print("Enter rc number: "); + Scanner sc = new Scanner(System.in); + String rcnumber = sc.next(); + Scanner file = new Scanner(new File("rc" + rcnumber + ".txt")); + ArrayList movesArray = new ArrayList(); + while(file.hasNextLine()) + movesArray.add(file.nextLine()); + String[] moves = new String[movesArray.size()]; + moves = movesArray.toArray(moves); + RoboCourier rc = new RoboCourier(); //student writes this resource class + int totalTime = rc.timeToDeliver(moves); + System.out.println("Returns: " + totalTime); + } +} + +class RoboCourier +{ + public int timeToDeliver(String[] path) + { + /* enter your code here */ + } +} \ No newline at end of file diff --git a/12 Graphs/85 RoboCourier/rc0.txt b/12 Graphs/85 RoboCourier/rc0.txt new file mode 100644 index 0000000..2408a7a --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc0.txt @@ -0,0 +1 @@ +FRRFLLFLLFRRFLF diff --git a/12 Graphs/85 RoboCourier/rc1.txt b/12 Graphs/85 RoboCourier/rc1.txt new file mode 100644 index 0000000..af0d4bc --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc1.txt @@ -0,0 +1,2 @@ +RFLLF + diff --git a/12 Graphs/85 RoboCourier/rc2.txt b/12 Graphs/85 RoboCourier/rc2.txt new file mode 100644 index 0000000..0e27be7 --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc2.txt @@ -0,0 +1,3 @@ +FLFRRFRFRRFLLFRRF + + diff --git a/12 Graphs/85 RoboCourier/rc3.txt b/12 Graphs/85 RoboCourier/rc3.txt new file mode 100644 index 0000000..a881817 --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc3.txt @@ -0,0 +1,2 @@ +FFFFFFFFFRRFFFFFFRRFFFFF +FLLFFFFFFLLFFFFFFRRFFFF \ No newline at end of file diff --git a/12 Graphs/85 RoboCourier/rc4.txt b/12 Graphs/85 RoboCourier/rc4.txt new file mode 100644 index 0000000..5240601 --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc4.txt @@ -0,0 +1,6 @@ +RFLLFLFLFRFRRFFFRFFRFFRRFLFFRLRRFFLFFLFLLFRFLFLRFF +RFFLFLFFRFFLLFLLFRFRFLRLFLRRFLRFLFFLFFFLFLFFRLFRLF +LLFLFLRLRRFLFLFRLFRF + + + diff --git a/12 Graphs/85 RoboCourier/rc5.txt b/12 Graphs/85 RoboCourier/rc5.txt new file mode 100644 index 0000000..869f6e8 --- /dev/null +++ b/12 Graphs/85 RoboCourier/rc5.txt @@ -0,0 +1,12 @@ +LLFLFRLRRLRFFLRRRRFFFLRFFRRRLLFLFLLRLRFFLFRRFFFLFL +RLFFRRLRLRRFFFLLLRFRLLRFFLFRLFRRFRRRFRLRLRLFFLLFLF +FRFLRFRRLLLRFFRRRLRFLFRRFLFFRLFLFLFRLLLLFRLLRFLLLF +FFLFRFRRFLLFFLLLFFRLLFLRRFRLFFFRRFFFLLRFFLRFRRRLLR +FFFRRLLFLLRLFRRLRLLFFFLFLRFFRLRLLFLRLFFLLFFLLFFFRR +LRFRRFLRRLRRLRFFFLLLLRRLRFFLFRFFRLLRFLFRRFLFLFFLFR +RFRRLRRFLFFFLLRFLFRRFRFLRLRLLLLFLFFFLFRLLRFRLFRLFR +LLFLFRLFFFFFFFRRLRLRLLRFLRLRRRRRRRRLFLFLFLRFLFRLFF +RLFRRLLRRRRFFFRRRLLLLRRLFFLLLLLRFFFFRFRRLRRRFFFLLF +FFFFLRRLRFLLRRLRLRFRRRRLFLLRFLRRFFFRFRLFFRLLFFRRLL + +