-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleda.patch
More file actions
56 lines (44 loc) · 1.9 KB
/
leda.patch
File metadata and controls
56 lines (44 loc) · 1.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
diff -ru LEDA-7.2/app/window/terminal.cpp LEDA-7.2/app/window/terminal.cpp
--- LEDA-7.2/app/window/terminal.cpp 2025-01-06 14:23:54.000000000 +0100
+++ LEDA-7.2/app/window/terminal.cpp 2025-04-01 09:59:51.618368881 +0200
@@ -19,6 +19,7 @@
#include <unistd.h>
#include <signal.h>
+#include <string.h>
using namespace leda;
@@ -93,7 +94,7 @@
void sig_handler(int s) {
cout << endl;
- cout << string("SIGNAL (%d): %s",s,sys_siglist[s]) << endl;
+ cout << string("SIGNAL (%d): %s",s,strsignal(s)) << endl;
closed = true;
/*
terminate_child_process();
diff -ru LEDA-7.2/incl/LEDA/graph/member_array.h LEDA-7.2/incl/LEDA/graph/member_array.h
--- LEDA-7.2/incl/LEDA/graph/member_array.h 2025-01-04 09:21:10.000000000 +0100
+++ LEDA-7.2/incl/LEDA/graph/member_array.h 2025-04-01 08:35:17.847445179 +0200
@@ -34,7 +34,7 @@
member_array(array& arr, T data::*p) : A(arr), ptr(p) {}
- T1& operator[](index v) { return (T1&)(((data&)A[v]).*ptr); }
+ T1& operator[](index v) { return reinterpret_cast<T1&>(((data&)A[v]).*ptr); }
const T1& operator[](index v) const { return (const T1&)(((data&)A[v]).*ptr); }
};
diff -ru LEDA-7.2/incl/LEDA/graphics/anim/view_base.h LEDA-7.2/incl/LEDA/graphics/anim/view_base.h
--- LEDA-7.2/incl/LEDA/graphics/anim/view_base.h 2025-01-04 09:21:10.000000000 +0100
+++ LEDA-7.2/incl/LEDA/graphics/anim/view_base.h 2025-04-01 09:09:04.601803860 +0200
@@ -210,7 +210,7 @@
class path
{
- motion_base* P;
+ motion_base* P = nullptr;
bool x;
public:
diff -ru LEDA-7.2/test/system/thread/qsort2.cpp LEDA-7.2/test/system/thread/qsort2.cpp
--- LEDA-7.2/test/system/thread/qsort2.cpp 2023-03-06 01:53:30.000000000 +0100
+++ LEDA-7.2/test/system/thread/qsort2.cpp 2025-04-01 11:23:56.186254216 +0200
@@ -117,7 +117,7 @@
int* p = Arg[0].left+1;
int* q = Arg[1].left;
- while (k-- > 0) swap(*p++,*q--);
+ while (l-- > 0) swap(*p++,*q--);
//delete[] Arg;