[packages/blobby2] Rel 2
arekm
arekm at pld-linux.org
Wed May 20 18:19:22 CEST 2026
commit a2ec179f419b063db61a907c07ec924dd5285845
Author: Arkadiusz Miśkiewicz <arekm at maven.pl>
Date: Wed May 20 18:18:58 2026 +0200
Rel 2
blobby2-raknet-last.patch | 111 ++++++++++++++++++++++++++++++++++++++++++++++
blobby2.spec | 4 +-
2 files changed, 114 insertions(+), 1 deletion(-)
---
diff --git a/blobby2.spec b/blobby2.spec
index dbdde95..189648f 100644
--- a/blobby2.spec
+++ b/blobby2.spec
@@ -2,11 +2,12 @@ Summary: Blobby Volley 2 game
Summary(pl.UTF-8): Gra Blobby Volley 2
Name: blobby2
Version: 1.1.1
-Release: 1
+Release: 2
License: GPL v2
Group: X11/Applications/Games
Source0: https://github.com/danielknobe/blobbyvolley2/archive/v%{version}/%{name}-%{version}.tar.gz
# Source0-md5: 2c95af30dc3a40d2505b6367299849e7
+Patch0: %{name}-raknet-last.patch
URL: https://blobbyvolley.de/
BuildRequires: OpenGL-devel
BuildRequires: SDL2-devel
@@ -38,6 +39,7 @@ Dedykowany serwer gry Blobby Volley 2.
%prep
%setup -q -n blobbyvolley2-%{version}
+%patch -P0 -p1
%build
install -d build
diff --git a/blobby2-raknet-last.patch b/blobby2-raknet-last.patch
new file mode 100644
index 0000000..a709f6f
--- /dev/null
+++ b/blobby2-raknet-last.patch
@@ -0,0 +1,111 @@
+--- blobbyvolley2-1.1.1/src/raknet/LinkedList.h.orig
++++ blobbyvolley2-1.1.1/src/raknet/LinkedList.h
+@@ -272,7 +272,7 @@
+ template <class LinkedListType>
+ bool LinkedList<LinkedListType>::operator= ( const LinkedList<LinkedListType>& original_copy )
+ {
+- typename LinkedList::node * original_copy_pointer, *save_position;
++ typename LinkedList::node * original_copy_pointer, *last, *save_position;
+
+ if ( ( &original_copy ) != this )
+ {
+@@ -318,7 +318,7 @@
+
+
+ // Save the current element
+- this->last = this->position;
++ last = this->position;
+
+ // Point to the next node in the source list
+ original_copy_pointer = original_copy_pointer->next;
+@@ -336,10 +336,10 @@
+
+
+ // Set the previous pointer for the new node
+- ( this->position->previous ) = this->last;
++ ( this->position->previous ) = last;
+
+ // Set the next pointer for the old node to the new node
+- ( this->last->next ) = this->position;
++ ( last->next ) = this->position;
+
+ }
+
+@@ -422,7 +422,7 @@
+ do
+ {
+ // Save the current element
+- this->last = this->position;
++ last = this->position;
+
+ // Point to the next node in the source list
+ original_copy_pointer = original_copy_pointer->next;
+@@ -442,7 +442,7 @@
+ ( this->position->previous ) = last;
+
+ // Set the next pointer for the old node to the new node
+- ( this->last->next ) = this->position;
++ ( last->next ) = this->position;
+
+ }
+
+@@ -463,6 +463,7 @@
+ CircularLinkedList<CircularLinkedListType>::CircularLinkedList( const CircularLinkedList& original_copy )
+ {
+ node * original_copy_pointer;
++ node *last;
+ node *save_position;
+
+ if ( original_copy.list_size == 0 )
+@@ -504,7 +505,7 @@
+
+
+ // Save the current element
+- this->last = this->position;
++ last = this->position;
+
+ // Point to the next node in the source list
+ original_copy_pointer = original_copy_pointer->next;
+@@ -521,10 +522,10 @@
+ save_position = position;
+
+ // Set the previous pointer for the new node
+- ( this->position->previous ) = this->last;
++ ( this->position->previous ) = last;
+
+ // Set the next pointer for the old node to the new node
+- ( this->last->next ) = this->position;
++ ( last->next ) = this->position;
+
+ }
+
+@@ -545,6 +546,7 @@
+ bool CircularLinkedList<CircularLinkedListType>::operator= ( const CircularLinkedList& original_copy )
+ {
+ node * original_copy_pointer;
++ node *last;
+ node *save_position;
+
+ if ( ( &original_copy ) != this )
+@@ -589,7 +591,7 @@
+ do
+ {
+ // Save the current element
+- this->last = this->position;
++ last = this->position;
+
+ // Point to the next node in the source list
+ original_copy_pointer = original_copy_pointer->next;
+@@ -606,10 +608,10 @@
+ save_position = this->position;
+
+ // Set the previous pointer for the new node
+- ( this->position->previous ) = this->last;
++ ( this->position->previous ) = last;
+
+ // Set the next pointer for the old node to the new node
+- ( this->last->next ) = this->position;
++ ( last->next ) = this->position;
+
+ }
+
================================================================
---- gitweb:
http://git.pld-linux.org/gitweb.cgi/packages/blobby2.git/commitdiff/a2ec179f419b063db61a907c07ec924dd5285845
More information about the pld-cvs-commit
mailing list