Skip to content

Instantly share code, notes, and snippets.

View c0rp-aubakirov's full-sized avatar
🏠
Working from home

Sanzhar Aubakirov c0rp-aubakirov

🏠
Working from home
View GitHub Profile
public enum CrossoverType {
ONE_POINT_CROSSOVER, TWO_POINT_CROSSOVER, UNIFORM_CROSSOVER, VAR_TO_VAR_CROSSOVER;
/**
*
* @param value should represent one of enum in CrossoverType
* @return return suited CrossoverType or ONE_POINT_CROSSOVER of nothing is found
*/
public static CrossoverType parse(String value) {
final List<CrossoverType> list = Arrays.asList(CrossoverType.values());
public class CrossoverFactory extends AbstractFactory{
public static ICrossover createCrossover(CrossoverType type) {
report(type.name(), "Crossover");
switch (type) {
case ONE_POINT_CROSSOVER:
return new OnePointCrossover();
case TWO_POINT_CROSSOVER:
return new TwoPointCrossover();
case UNIFORM_CROSSOVER:
return new UniformCrossover();
boolean consecutiveAscending = true;
boolean consecutiveDescending = true;
// Check to see if the newPin is made up of consecutive numbers in
// ascending order
for (int j = 0; j < newPin.length() - 1; j++) {
if (Convert.toLong(newPin.substring(j, j + 1)) == null
|| Convert.toLong(newPin.substring(j + 1, j + 2)) == null) {
consecutiveAscending = false;
break;
}
package kz.moe.classifier;
import com.google.gson.Gson;
import com.google.gson.GsonBuilder;
import com.google.gson.reflect.TypeToken;
import kz.moe.classifier.genetic.creature.BasicCreature;
import kz.moe.classifier.genetic.creature.Chromosome;
import kz.moe.classifier.genetic.creature.Gene;
import kz.moe.classifier.genetic.creature.ICreature;
import kz.moe.classifier.genetic.crossover.ICrossover;
@c0rp-aubakirov
c0rp-aubakirov / stop
Last active April 4, 2016 19:45
Stop words
а
в
г
е
ж
и
к
м
о
с
@c0rp-aubakirov
c0rp-aubakirov / oleg_non_stop
Created April 4, 2016 19:35
Oleg top words, that not in STOP_WORDS
пример
проблемы
типа
решение
делать
например
проект
проект
кстати
стоит
@c0rp-aubakirov
c0rp-aubakirov / mag_non_stop
Created April 4, 2016 19:35
Magzhan top words, that not in STOP_WORDS
написать
решение
a
вижу
class
поэтому
работать
+
джаве
new
@c0rp-aubakirov
c0rp-aubakirov / oleg_dict
Created April 4, 2016 19:34
All Oleg dictionary with word count in first column
1 |
1 aasawodli
1 abstractrequest
1 access
1 act
1 ae
1 afanalyzer
1 ago
1 ahybsifeo
1 air
@c0rp-aubakirov
c0rp-aubakirov / magzhan_dict
Created April 4, 2016 19:34
All Magzhan dictionary with word count in first column
1 aaaan
1 aan
1 ab
1 abaddnew
1 abstract
1 abstractrequest
1 act
1 addressid
1 ae
1 against
@c0rp-aubakirov
c0rp-aubakirov / FCFS.cpp
Created March 26, 2016 19:29
Алгоритм First Come First Served (FCFS) Простейшим алгоритмом является алгоритм First Come First Served (FCFS) – первым пришел, первым обслужен. Все запросы организуются в очередь FIFO и обслуживаются в порядке поступления. Пример. На диске из 100 цилиндров (от 0 до 99) есть следующая очередь запросов: 23, 67, 55, 14, 31, 7, 84, 10 и головки в н…
#include <iostream>
#include<conio.h>
#include<math.h>
using namespace std;
int main()
{
int a[10],b,n,c=0;
int i=0;
cout<<"vvedite nach znachenie golovki:";