diff options
author | Tristan Gingold <tgingold@free.fr> | 2019-03-20 07:37:03 +0100 |
---|---|---|
committer | Tristan Gingold <tgingold@free.fr> | 2019-03-20 18:53:04 +0100 |
commit | 0c79f9cfade3b5a8fc8bb24cad944e70109b86e5 (patch) | |
tree | 8c0fc1ae4bcb20a2ec2d665b9d6bd4d246419e36 /src/grt | |
parent | 0ed24515f1d273ebe494e51dd7fdfb70ca13cc73 (diff) | |
download | ghdl-0c79f9cfade3b5a8fc8bb24cad944e70109b86e5.tar.gz ghdl-0c79f9cfade3b5a8fc8bb24cad944e70109b86e5.tar.bz2 ghdl-0c79f9cfade3b5a8fc8bb24cad944e70109b86e5.zip |
move algos to grt.
Diffstat (limited to 'src/grt')
-rw-r--r-- | src/grt/grt-algos.adb | 55 | ||||
-rw-r--r-- | src/grt/grt-algos.ads | 28 |
2 files changed, 83 insertions, 0 deletions
diff --git a/src/grt/grt-algos.adb b/src/grt/grt-algos.adb new file mode 100644 index 000000000..9482e8208 --- /dev/null +++ b/src/grt/grt-algos.adb @@ -0,0 +1,55 @@ +-- Generic algorithms +-- Copyright (C) 2016 Tristan Gingold +-- +-- GHDL 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; either version 2, or (at your option) any later +-- version. +-- +-- GHDL 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. +-- +-- You should have received a copy of the GNU General Public License +-- along with GHDL; see the file COPYING. If not, write to the Free +-- Software Foundation, 59 Temple Place - Suite 330, Boston, MA +-- 02111-1307, USA. + +package body Grt.Algos is + procedure Heap_Sort (N : Natural) is + -- An heap is an almost complete binary tree whose each edge is less + -- than or equal as its decendent. + + -- Bubble down element I of a partially ordered heap of length N in + -- array ARR. + procedure Bubble_Down (I, N : Natural) + is + Child : Natural; + Parent : Natural := I; + begin + loop + Child := 2 * Parent; + if Child < N and then Lt (Child, Child + 1) then + Child := Child + 1; + end if; + exit when Child > N; + exit when not Lt (Parent, Child); + Swap (Parent, Child); + Parent := Child; + end loop; + end Bubble_Down; + + begin + -- Heapify + for I in reverse 1 .. N / 2 loop + Bubble_Down (I, N); + end loop; + + -- Sort + for I in reverse 2 .. N loop + Swap (1, I); + Bubble_Down (1, I - 1); + end loop; + end Heap_Sort; +end Grt.Algos; diff --git a/src/grt/grt-algos.ads b/src/grt/grt-algos.ads new file mode 100644 index 000000000..85fe93ac3 --- /dev/null +++ b/src/grt/grt-algos.ads @@ -0,0 +1,28 @@ +-- Generic algorithms +-- Copyright (C) 2016 Tristan Gingold +-- +-- GHDL 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; either version 2, or (at your option) any later +-- version. +-- +-- GHDL 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. +-- +-- You should have received a copy of the GNU General Public License +-- along with GHDL; see the file COPYING. If not, write to the Free +-- Software Foundation, 59 Temple Place - Suite 330, Boston, MA +-- 02111-1307, USA. + +package Grt.Algos is + -- Heap sort the N elements. + generic + -- Compare two elements, return true iff OP1 < OP2. + with function Lt (Op1, Op2 : Natural) return Boolean; + + -- Swap two elements. + with procedure Swap (From : Natural; To : Natural); + procedure Heap_Sort (N : Natural); +end Grt.Algos; |