diff options
author | Nicolas Goaziou <mail@nicolasgoaziou.fr> | 2020-05-01 16:23:52 +0200 |
---|---|---|
committer | Nicolas Goaziou <mail@nicolasgoaziou.fr> | 2020-05-01 16:23:52 +0200 |
commit | a5e4713015f0444951124d88cbd759dec0a43307 (patch) | |
tree | c6290cf1ec6fe998d4a315a43bfe7faf80e0f522 | |
parent | a978840cb262b66f61693f9ca32dd86bfa871f57 (diff) | |
download | patches-a5e4713015f0444951124d88cbd759dec0a43307.tar patches-a5e4713015f0444951124d88cbd759dec0a43307.tar.gz |
gnu: fet: Update to 5.44.4.
* gnu/packages/education.scm (fet): Update to 5.44.4.
[description]: Remove uninformative part.
-rw-r--r-- | gnu/packages/education.scm | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/gnu/packages/education.scm b/gnu/packages/education.scm index a1fee29c4e..d6c2cd02c3 100644 --- a/gnu/packages/education.scm +++ b/gnu/packages/education.scm @@ -606,14 +606,14 @@ Portuguese, Spanish and Italian.") (define-public fet (package (name "fet") - (version "5.44.0") + (version "5.44.4") (source (origin (method url-fetch) (uri (string-append "https://www.lalescu.ro/liviu/fet/download/" "fet-" version ".tar.bz2")) (sha256 - (base32 "13q3b0g1zz885g15gir8fbalvix8sy42v1p429h0751490wq5c3h")))) + (base32 "1bji4910v6adhngdh5ajz5bxam9z3yqnh8d1h1xajy6npm6qq3nx")))) (build-system gnu-build-system) (arguments `(#:phases @@ -632,14 +632,14 @@ Portuguese, Spanish and Italian.") `(("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. + (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.") +Usually, FET is able to solve a complicated timetable in maximum 5-20 minutes. +For extremely difficult timetables, it may take a longer time, a matter of +hours.") (license license:agpl3+))) (define-public klavaro |