Skip to content

Commit 9d06afe

Browse files
author
Colin Yang
authored
Upgrade to Version 2 & fixed code style
1 parent 42803ad commit 9d06afe

File tree

1 file changed

+87
-87
lines changed

1 file changed

+87
-87
lines changed

‎ColinTreeMath.java‎

Lines changed: 87 additions & 87 deletions
Original file line numberDiff line numberDiff line change
@@ -16,178 +16,178 @@
1616
@SimpleObject(external = true)
1717

1818
public class ColinTreeMath extends AndroidNonvisibleComponent implements Component {
19-
public static final int VERSION = 1;
19+
public static final int VERSION = 2;
2020
private ComponentContainer container;
2121
private Context context;
2222
private static final String LOG_TAG = "ColinTreeMath";
2323
public ColinTreeMath(ComponentContainer container) {
2424
super(container.$form());
2525
this.container = container;
2626
context = (Context) container.$context();
27-
Log.d(LOG_TAG, "ColinTreeMath Created" );
27+
Log.d(LOG_TAG, "ColinTreeMath Created");
2828
}
2929

3030
// Max - Zui Da Shu
3131
@SimpleFunction(description = "Find the max number in the list, return min double if the list is empty. Also, please make sure there are all number in the list")
32-
public double Max(YailList list){
33-
Object[] lst=list.toArray();
34-
double tmp,max=Double.MIN_VALUE;
35-
for (int i=0;i<list.size();i++){
36-
tmp=new Double(lst[i].toString());
37-
if (max<tmp) max=tmp;
32+
public double Max(YailList list) {
33+
Object[] lst = list.toArray();
34+
double tmp, max = Double.MIN_VALUE;
35+
for (int i = 0; i < list.size(); i++) {
36+
tmp = new Double(lst[i].toString());
37+
if (max < tmp) max = tmp;
3838
}
3939
return max;
4040
}
4141
// Min - Zui Xiao Shu
4242
@SimpleFunction(description = "Find the min number in the list, return max double if the list is empty. Also, please make sure there are all number in the list")
43-
public double Min(YailList list){
44-
Object[] lst=list.toArray();
45-
double tmp,min=Double.MAX_VALUE;
46-
for (int i=0;i<list.size();i++){
47-
tmp=new Double(lst[i].toString());
48-
if (min>tmp) min=tmp;
43+
public double Min(YailList list) {
44+
Object[] lst = list.toArray();
45+
double tmp, min = Double.MAX_VALUE;
46+
for (int i = 0; i < list.size(); i++) {
47+
tmp = new Double(lst[i].toString());
48+
if (min > tmp) min = tmp;
4949
}
5050
return min;
5151
}
5252
// Average - Ping Jun
5353
@SimpleFunction(description = "Return the average of the numbers in the list. Please make sure there are all number in the list")
54-
public double Average(YailList list){
55-
Object[] lst=list.toArray();
56-
double tmp,tot=0;
57-
for (int i=0;i<list.size();i++){
58-
tmp=new Double(lst[i].toString());
59-
tot+=tmp;
54+
public double Average(YailList list) {
55+
Object[] lst = list.toArray();
56+
double tmp, tot = 0;
57+
for (int i = 0; i < list.size(); i++) {
58+
tmp = new Double(lst[i].toString());
59+
tot += tmp;
6060
}
61-
return tot/list.size();
61+
return tot / list.size();
6262
}
6363
// Bubble Sort in ascending order - Sheng Xu Mao Pao
6464
@SimpleFunction(description = "(Sheng Xu Pai Xu - Mao Pao Pai Xu) Sort the number in the list in ascending order. Please make sure there are all number in the list")
65-
public YailList SortAscend(YailList list){
66-
Object[] rst=new Object[list.size()],lst=list.toArray();
67-
double[] forSort=new double[list.size()];
65+
public YailList SortAscend(YailList list) {
66+
Object[] rst = new Object[list.size()], lst=list.toArray();
67+
double[] forSort = new double[list.size()];
6868
double tmp;
69-
for (int i=0;i<list.size();i++){
70-
forSort[i]=new Double(lst[i].toString());
69+
for (int i = 0; i < list.size(); i++) {
70+
forSort[i] = new Double(lst[i].toString());
7171
}
72-
for (int i=0;i<(list.size()-1);i++){
73-
for (int j=i+1;j<list.size();j++){
74-
if (forSort[i]>forSort[j]){
75-
tmp=forSort[i];
76-
forSort[i]=forSort[j];
77-
forSort[j]=tmp;
72+
for (int i = 0; i < list.size() - 1; i++) {
73+
for (int j = i + 1; j < list.size(); j++) {
74+
if (forSort[i] > forSort[j]) {
75+
tmp = forSort[i];
76+
forSort[i] = forSort[j];
77+
forSort[j] = tmp;
7878
}
7979
}
8080
}
81-
for (int i=0;i<list.size();i++){
82-
rst[i]=forSort[i];
81+
for (int i = 0; i < list.size(); i++) {
82+
rst[i] = forSort[i];
8383
}
8484
return YailList.makeList(rst);
8585
}
8686
// Sort in descending order - Jiang Xu Mao Pao
8787
@SimpleFunction(description = "(Jiang Xu Pai Xu - Mao Pao Pai Xu) Sort the number in the list in decending order. Please make sure there are all number in the list")
88-
public YailList SortDecend(YailList list){
89-
Object[] rst=new Object[list.size()],lst=list.toArray();
90-
double[] forSort=new double[list.size()];
88+
public YailList SortDecend(YailList list) {
89+
Object[] rst = new Object[list.size()], lst = list.toArray();
90+
double[] forSort = new double[list.size()];
9191
double tmp;
92-
for (int i=0;i<list.size();i++){
93-
forSort[i]=new Double(lst[i].toString());
92+
for (int i = 0; i < list.size(); i++) {
93+
forSort[i] = new Double(lst[i].toString());
9494
}
95-
for (int i=0;i<(list.size()-1);i++){
96-
for (int j=i+1;j<list.size();j++){
97-
if (forSort[i]<forSort[j]){
98-
tmp=forSort[i];
99-
forSort[i]=forSort[j];
100-
forSort[j]=tmp;
95+
for (int i = 0; i < list.size() - 1; i++) {
96+
for (int j = i + 1; j < list.size(); j++) {
97+
if (forSort[i] < forSort[j]) {
98+
tmp = forSort[i];
99+
forSort[i] = forSort[j];
100+
forSort[j] = tmp;
101101
}
102102
}
103103
}
104-
for (int i=0;i<list.size();i++){
105-
rst[i]=forSort[i];
104+
for (int i = 0; i < list.size(); i++) {
105+
rst[i] = forSort[i];
106106
}
107107
return YailList.makeList(rst);
108108
}
109109
//greatest common divisor - Zui Da Gong Yue Shu
110110
@SimpleFunction(description = "(Zui Da Gong Yue Shu)Return the greatest common divisor, auto-round down into integer if it is not")
111-
public int GCD(int number1,int number2){
112-
if (number1==number2){
111+
public int GCD(int number1, int number2) {
112+
if (number1 == number2) {
113113
return number1;
114114
}
115-
if (number1<number2){
116-
return GCD(number2,number1);
117-
}else{
118-
if ((number1%2==0)&&(number2%2==0)){
119-
return GCD(number1>>1,number2>>1)<<1;
120-
}else if ((number1%2==0)&&(number2%2!=0)){
121-
return GCD(number1>>1,number2);
122-
}else if ((number1%2!=0)&&(number2%2==0)){
123-
return GCD(number1,number2>>1);
124-
}else{
125-
return GCD(number2,number1-number2);
115+
if (number1 < number2) {
116+
return GCD(number2, number1);
117+
} else {
118+
if ((number1 % 2 == 0) && (number2 % 2 == 0)) {
119+
return GCD(number1 >> 1, number2 >> 1) << 1;
120+
} else if ((number1 % 2 == 0) && (number2 % 2 != 0)) {
121+
return GCD(number1 >> 1, number2);
122+
} else if ((number1 % 2 != 0) && (number2 % 2 == 0)) {
123+
return GCD(number1, number2 >> 1);
124+
} else {
125+
return GCD(number2, number1 - number2);
126126
}
127127
}
128-
//return number2?gcd(b,a%b):a; //from qq1139855151 He Bei Shi Jia Zhuang Chen
128+
// return number2 ? gcd(b, a % b) : a; //from qq1139855151 He Bei Shi Jia Zhuang Chen
129129
}
130130
//Least common multiple - Zui Xiao Gong Bei Shu
131131
@SimpleFunction(description = "(Zui Xiao Gong Bei Shu)Return the least common multiple, auto-round down into integer if it is not")
132-
public int LCM(int number1,int number2){
133-
int gcd=GCD(number1,number2);
134-
return number1*number2/gcd;
132+
public int LCM(int number1, int number2) {
133+
int gcd = GCD(number1, number2);
134+
return number1 * number2 / gcd;
135135
}
136136
//Power - Qiu Mi
137137
@SimpleFunction(description = "(Qiu Mi: number^n)Return number^n")
138-
public double Power(double number,double n){
139-
double tmp,y=1;
140-
n=Math.floor(n);
141-
while (true){
142-
tmp=n%2;
143-
n=Math.floor(n/2);
144-
if (tmp==1)
145-
y=y*number;
146-
if (n==0)
138+
public double Power(double number, double n) {
139+
double tmp, y = 1;
140+
n = Math.floor(n);
141+
while (true) {
142+
tmp = n % 2;
143+
n = Math.floor(n / 2);
144+
if (tmp == 1)
145+
y = y * number;
146+
if (n == 0)
147147
break;
148-
number=number*number;
148+
number = number * number;
149149
}
150150
return y;
151151
}
152152
//Pi - π
153153
@SimpleFunction(description = "(π)Return pi")
154-
public double Pi(){
154+
public double Pi() {
155155
return Math.PI;
156156
}
157157
//e - e
158158
@SimpleFunction(description = "(e)Return Natural logarithm e")
159-
public double e(){
159+
public double e() {
160160
return Math.E;
161161
}
162162
//Cube root (Li Fang Gen)
163163
@SimpleFunction(description = "(Li Fang Gen)Return 3√num")
164-
public double CbRt(double number){
164+
public double CbRt(double number) {
165165
return Math.cbrt(number);
166166
}
167167
//log10
168168
@SimpleFunction(description = "Return Log 10,number")
169-
public double Log10(double number){
169+
public double Log10(double number) {
170170
return Math.log10(number);
171171
}
172172
//1/√num
173173
@SimpleFunction(description = "Return 1/√num")
174-
public double ROTSR(double number){
175-
return 1/Math.sqrt(number);
174+
public double ROTSR(double number) {
175+
return 1 / Math.sqrt(number);
176176
}
177177
//sqrt(number1^2 +number2^2)
178178
@SimpleFunction(description = "Return sqrt(number1^2 +number2^2)")
179-
public double hypot(double number1,double number2){
180-
return Math.hypot(number1,number2);
179+
public double hypot(double number1, double number2) {
180+
return Math.hypot(number1, number2);
181181
}
182182
//Prime number (Zhi Shu)
183183
@SimpleFunction(description = "Return true if number is prime number")
184-
public boolean Prime(int number){
185-
if (number==2)
184+
public boolean Prime(int number) {
185+
if (number == 2)
186186
return true;
187-
else if (number%2==0)
187+
else if (number % 2 == 0)
188188
return false;
189-
else for (int i=3;i<=Math.sqrt(number);i+=2)
190-
if (number%i==0)
189+
else for (int i = 3; i <= Math.sqrt(number); i += 2)
190+
if (number % i == 0)
191191
return false;
192192
return true;
193193
}

0 commit comments

Comments
 (0)