Skip to content

Commit

Permalink
releasing project 1ec
Browse files Browse the repository at this point in the history
  • Loading branch information
@omarnabikhan
omarnabikhan committed Jan 31, 2021
1 parent 309a6a3 commit a35ad57
Show file tree
Hide file tree
Showing 6 changed files with 439 additions and 0 deletions.
45 changes: 45 additions & 0 deletions proj1ec/pom.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
<?xml version="1.0" encoding="UTF-8"?>
<project xmlns="http://maven.apache.org/POM/4.0.0"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion>

<parent>
<groupId>CS61B</groupId>
<artifactId>61BMasterPom</artifactId>
<version>1.0-SNAPSHOT</version>
<relativePath>../library-sp21/javalib/masterpom.xml</relativePath>
</parent>

<groupId>CS61B</groupId>
<artifactId>proj1ec</artifactId>
<version>1.0-SNAPSHOT</version>

<build>
<sourceDirectory>${project.basedir}</sourceDirectory>
<testSourceDirectory>${project.basedir}</testSourceDirectory>
<plugins>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-compiler-plugin</artifactId>
<version>3.1</version>
<configuration>
<source>1.14</source>
<target>1.14</target>
</configuration>
</plugin>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-compiler-plugin</artifactId>
<version>3.8.1</version>
<configuration>
<compilerArgs>
<arg>-J-XX:+ShowCodeDetailsInExceptionMessages</arg>
</compilerArgs>
</configuration>
</plugin>
</plugins>
</build>

</project>

20 changes: 20 additions & 0 deletions proj1ec/student/Deque.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
package student;

/**
* Created by hug on 2/4/2017.
* Added isEmpty() default implementation on 2/3/2019.
*/
public interface Deque<Item> {
void addFirst(Item x);
void addLast(Item x);

default boolean isEmpty() {
return size() == 0;
}

int size();
void printDeque();
Item removeFirst();
Item removeLast();
Item get(int index);
}
294 changes: 294 additions & 0 deletions proj1ec/student/StudentArrayDeque.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,294 @@
package student;

public class StudentArrayDeque<T> {
private T[] a = (T[]) (new Object[8]);
private int b = 8;
private int c = 0;
private int d = 4;
private int e = 4;
private int f = 5;
private boolean g = false;
private boolean h = false;
private T z = null;

public StudentArrayDeque() {
}

public void addFirst(T var1) {
try {
z = var1;
this.a();
if (this.e >= 0) {
this.a[this.e] = var1;
--this.e;
} else {
this.a[this.a.length - 1] = var1;
this.e = this.a.length - 1 - 1;
this.h = true;
}

++this.c;
} catch (RuntimeException rte) {
return;
}
}

public void addLast(T var1) {
try {
z = var1;
this.a();
if (this.f < this.a.length) {
this.a[this.f] = var1;
++this.f;
} else {
this.a[0] = var1;
this.f = 1;
this.g = true;
}

++this.c;
} catch (RuntimeException rte) {
return;
}
}

public T removeFirst() {
try {
this.a();
if (this.c == 0) {
return null;
} else {
--this.c;
T var1;
if (this.e != this.d) {
if (this.e == this.a.length - 1) {
var1 = this.a[0];
this.e = 0;
this.h = false;
return (T) var1;
} else {
var1 = this.a[this.e + 1];
++this.e;
return (T) var1;
}
} else if (this.h) {
var1 = this.a[this.e + 1];
++this.e;
if (this.e == this.a.length) {
this.h = false;
this.e = 0;
}

return (T) var1;
} else if (this.e == this.a.length - 1) {
var1 = this.a[0];
this.e = 0;
this.d = 0;
this.g = false;
return (T) var1;
} else {
var1 = this.a[this.d + 1];
this.e = this.d + 1;
++this.d;
this.h = false;
return (T) var1;
}
}
} catch (RuntimeException rte) {
return z;
}
}

public T removeLast() {
try {
this.a();
if (this.c == 0) {
return null;
} else {
--this.c;
T var1;
if (this.f != 1 + this.d) {
if (this.f == 0) {
var1 = this.a[this.a.length - 1];
this.f = this.a.length;
this.g = false;
return (T) var1;
} else {
var1 = this.a[this.f - 1];
--this.f;
if (this.f == 0) {
this.g = false;
this.f = this.a.length;
}

return (T) var1;
}
} else if (this.g) {
var1 = this.a[this.f - 1];
--this.f;
if (this.f <= 0) {
this.g = false;
this.f = this.a.length - 1;
}

return (T) var1;
} else if (this.f == 0) {
var1 = this.a[this.a.length - 1];
this.a[this.a.length - 1] = null;
this.f = this.a.length - 1;
return (T) var1;
} else {
var1 = this.a[this.d];
this.f = this.d--;
this.g = false;
return (T) var1;
}
}
} catch (RuntimeException rte) {
return z;
}
}

public void printDeque() {
if (this.c != 0) {
int var1;
if (this.e <= this.d + 1) {
for (var1 = this.e + 1; var1 < this.d + 1; ++var1) {
System.out.print(this.a[var1] + " ");
}
} else {
for (var1 = this.e; var1 < this.a.length; ++var1) {
System.out.print(this.a[var1] + " ");
}

for (var1 = 0; var1 < this.d + 1; ++var1) {
System.out.print(this.a[var1] + " ");
}
}

if (this.f < this.d) {
for (var1 = this.f; var1 >= 0; --var1) {
System.out.print(this.a[var1] + " ");
}

for (var1 = this.a.length - 1; var1 >= this.d + 1; --var1) {
System.out.print(this.a[var1] + " ");
}
} else {
for (var1 = this.d + 1; var1 < this.f; ++var1) {
System.out.print(this.a[var1] + " ");
}
}
}

System.out.println();
}

public boolean isEmpty() {
return this.c == 0;
}

public int size() {
return this.c;
}

private void a() {
T[] var1;
if (((double) (this.c / this.b) <= 0.5D || this.b < 16) && this.c + 1 != this.b) {
if (this.c == 0) {
var1 = (T[]) (new Object[8]);
this.e = 4;
this.f = 5;
this.a = var1;
this.b = 8;
this.c = 0;
this.d = 4;
} else {
if ((double) this.c / (double) this.b < 0.25D && this.b > 16) {
int var6;
T[] var7 = (T[]) (new Object[var6 = this.b / 2]);
System.arraycopy(this.a, this.e + 1, var7,
var6 / 2 - (this.d - this.e) + 1, this.d - this.e);
this.e = var6 / 2 - (this.d - this.e);
System.arraycopy(this.a, this.d + 1, var7, var6 / 2 + 1, this.f - this.d - 1);
int var8 = 1;
int var9 = 2;
this.f = (var6 / 2 + (this.f - this.d - 1) + 1) ^ (var8 << var9);
this.a = var7;
this.b = var6;
this.d = var6 / 2;
}

}
} else {
var1 = (T[]) (new Object[this.b << 2]);
int var2;
int var3;
int var4 = (var3 = (var2 = 4 * this.b) / 2) + 1;
this.h = false;
this.g = false;
int var5;
if (this.e > this.d) {
for (var5 = this.d; var5 >= 0; --var5) {
var1[var3] = this.a[var5];
--var3;
}

for (var5 = this.a.length - 1; var5 > this.e; --var5) {
var1[var3] = this.a[var5];
--var3;
}
} else {
for (var5 = this.d; var5 > this.e; --var5) {
var1[var3] = this.a[var5];
--var3;
}
}

if (this.f < this.d + 1) {
for (var5 = this.d + 1; var5 < this.a.length; ++var5) {
var1[var4] = this.a[var5];
++var4;
}

for (var5 = 0; var5 < this.f; ++var5) {
var1[var4] = this.a[var5];
++var4;
}
} else {
for (var5 = this.d + 1; var5 < this.f; ++var5) {
var1[var4] = this.a[var5];
++var4;
}
}

this.a = var1;
this.e = var3;
this.f = var4;
this.b = var2;
this.d = this.b / 2;
}
}

public T get(int var1) {
try {
if (var1 + 1 > this.c) {
return null;
} else if (this.h) {
if (this.e + var1 + 1 < this.a.length) {
return (T) this.a[this.e + var1 + 1];
} else {
var1 -= this.a.length - this.e - 1;
return (T) this.a[var1];
}
} else if (this.g && this.e + var1 + 1 >= this.a.length) {
var1 -= this.a.length - this.e - 1;
return (T) this.a[var1];
} else {
return (T) this.a[this.e + var1 + 1];
}
} catch (RuntimeException rte) {
return z;
}
}
}
34 changes: 34 additions & 0 deletions proj1ec/tester/ArrayDequeSolution.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
package tester;

import java.util.LinkedList;

/**
* Isn't this solution kinda... cheating? Yes.
* The aesthete will be especially alarmed by the fact that this
* supposed ArrayDeque is actually using a LinkedList. SAD!
*/
public class ArrayDequeSolution<Item> extends LinkedList<Item> {
public void printDeque() {
System.out.println("dummy");
}

public Item getRecursive(int i) {
return get(i);
}

public Item removeFirst() {
try {
return super.removeFirst();
} catch (NullPointerException e) {
return null;
}
}

public Item removeLast() {
try {
return super.removeLast();
} catch (NullPointerException e) {
return null;
}
}
}
Loading

0 comments on commit a35ad57

Please sign in to comment.