Datasets:
thechaingamer
/
ada-git-code

Dataset card Data Studio Files
xet
Community
text
stringlengths
0
234
end loop;
end arrayAtoArrayB;
t_start:time;
t_end:time;
t_exe:duration;
package Duration_IO is new Fixed_IO(Duration);
--------------------------------------------------------------
task type T is
entry Compute_Fitness(i : integer);
end T;
task body T is
routine : integer;
loop_number : integer;
current_i : integer;
begin
accept Compute_Fitness(i : integer) do
current_i := i-1;
end Compute_Fitness;
loop_number := (Task_Load*(current_i))+1;
for k in loop_number..(loop_number+Task_Load-1) loop
routine := 0;
for j in 1..(gene_length-1) loop
routine := routine + map(parent(k)(j))(parent(k)(j+1));
end loop;
fitness(k) := routine;
delay(0.001);
end loop;
end T;
final_result :integer :=0;
n : integer :=0;
fit : integer :=1;
tmp :integer :=0;
result :integer :=0;
taskComplete : integer := 0;
best :integer:=5000;
end_condition:integer;
---------------------------
function condition return integer is
answer :integer :=0;
begin
for i in 1..(population_size-1) loop
fit := fitness(i);
if fitness(i+1)<=fitness(i) then
fit := fitness(i+1);
end if;
end loop;
if fit<best then
best :=fit;
mutation_rate:=100;
n:=0;
else
n:=n+1;
end if;
if n>end_condition/4 then
mutation_rate := 75;
end if;
if n>end_condition/2 then
mutation_rate := 50;
end if;
if n>3*end_condition/4 then
mutation_rate := 10;
end if;
if n>=end_condition then
answer:=1;
else
answer:=0;
end if;
return answer;
end condition;
---------------------------
generation:integer:=1;
begin
put("End condition : ");
get(end_condition);
put("Number of threads : ");
get(Task_number);
new_line;
Task_Load:= population_size/Task_number;
t_start:=clock;
reset(g);
generate_first;
generate_map;
----------------------------- start find the route
Find_route:
loop
declare
Mul_Task : array(1..Task_number) of T;
begin