summaryrefslogtreecommitdiff
path: root/gnu/packages/education.scm
diff options
context:
space:
mode:
authorMark H Weaver <mhw@netris.org>2019-08-29 17:19:18 -0400
committerMark H Weaver <mhw@netris.org>2019-08-29 17:19:18 -0400
commit0481289cbccba2646bf654f0ae49ac9c45602d5d (patch)
treecbe1351e2751e9d22c4c8add02991a3e6674f26a /gnu/packages/education.scm
parentc55fae452032aa4b1b63406983e9abdf70adc957 (diff)
parent9fbf4d2a52d4d3e01059f3432bb3f78182b5a822 (diff)
downloadpatches-0481289cbccba2646bf654f0ae49ac9c45602d5d.tar
patches-0481289cbccba2646bf654f0ae49ac9c45602d5d.tar.gz
Merge branch 'master' into core-updates
Diffstat (limited to 'gnu/packages/education.scm')
-rw-r--r--gnu/packages/education.scm40
1 files changed, 40 insertions, 0 deletions
diff --git a/gnu/packages/education.scm b/gnu/packages/education.scm
index 70e7c8331b..58214747e7 100644
--- a/gnu/packages/education.scm
+++ b/gnu/packages/education.scm
@@ -481,3 +481,43 @@ use the computer and at the same time teach them a little math,
letters of the alphabet, spelling, eye-hand coordination, etc.")
(home-page "http://www.schoolsplay.org")
(license license:gpl3+)))
+
+(define-public fet
+ (package
+ (name "fet")
+ (version "5.39.0")
+ (source (origin
+ (method url-fetch)
+ (uri (string-append "https://www.lalescu.ro/liviu/fet/download/"
+ "fet-" version ".tar.bz2"))
+ (sha256
+ (base32
+ "100bmggkychqs2cavqxy7015lr4icw6k99qb03im0v4jasqqmyix"))))
+ (build-system gnu-build-system)
+ (arguments
+ `(#:phases
+ (modify-phases %standard-phases
+ (add-after 'unpack 'fix-hardcoded-directories
+ (lambda* (#:key outputs #:allow-other-keys)
+ (substitute* (list "fet.pro"
+ "src/src.pro"
+ "src/src-cl.pro"
+ "src/interface/fet.cpp")
+ (("/usr") (assoc-ref outputs "out")))
+ #t))
+ (replace 'configure
+ (lambda _ (invoke "qmake" "fet.pro"))))))
+ (inputs
+ `(("qtbase" ,qtbase)))
+ (home-page "https://www.lalescu.ro/liviu/fet/")
+ (synopsis "Timetabling software")
+ (description "FET is a program for automatically scheduling the
+timetable of a school, high-school or university. It uses a fast and
+efficient timetabling algorithm.
+
+Usually, FET is able to solve a complicated timetable in maximum 5-20
+minutes. For simpler timetables, it may take a shorter time, under
+5 minutes (in some cases, a matter of seconds). For extremely
+difficult timetables, it may take a longer time, a matter of hours.")
+ (license license:agpl3+)))
+