From cca66b9ec4e494c1d919bff0f71a820d8afab1fa Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Sun, 7 Apr 2024 20:24:48 +0200
Subject: Adding upstream version 1.2.2.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp | 95 ++++++++++++++++++++++++++++
 1 file changed, 95 insertions(+)
 create mode 100644 src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp

(limited to 'src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp')

diff --git a/src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp b/src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp
new file mode 100644
index 0000000..9428922
--- /dev/null
+++ b/src/3rdparty/adaptagrams/libvpsc/cbuffer.cpp
@@ -0,0 +1,95 @@
+/*
+ * vim: ts=4 sw=4 et tw=0 wm=0
+ *
+ * libvpsc - A solver for the problem of Variable Placement with 
+ *           Separation Constraints.
+ *
+ * Copyright (C) 2005-2008  Monash University
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * See the file LICENSE.LGPL distributed with the library.
+ *
+ * This library 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.
+ *
+ * Author(s):  Tim Dwyer
+ *
+*/
+
+#include <cfloat>
+
+#include "libvpsc/cbuffer.h"
+#include "libvpsc/constraint.h"
+#include "libvpsc/assertions.h"
+
+namespace vpsc {
+    static const double ZERO_UPPERBOUND=-0.0000001;
+    void CBuffer::load() {
+        size=0; 
+        double buffMaxSlack=-DBL_MAX;
+        unsigned buffMaxSlackPos=0;
+        for(Constraints::iterator i=master_list.begin();
+                i!=master_list.end();++i) {
+            Constraint *c=*i;
+            double slack = c->slack();
+            if(c->equality||slack<ZERO_UPPERBOUND) {
+                if(size<maxsize) {
+                    // make sure buffer is full
+                    buffer[size]=c;
+                    if(slack>buffMaxSlack) {
+                        buffMaxSlack=slack;
+                        buffMaxSlackPos=size;
+                    }
+                    size++;
+                } else {
+                    // if c is more violated than the least violated
+                    // constraint in the buffer then replace it
+                    buffer[buffMaxSlackPos]=c;
+                    // need to search the buffer for the new least
+                    // violated constraint
+                    buffMaxSlack=-DBL_MAX;
+                    for(unsigned i=0;i<size;i++) {
+                        c=buffer[i];
+                        if(!c->equality&&buffMaxSlack < c->slack()) {
+                            buffMaxSlack = slack;
+                            buffMaxSlackPos = i;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    Constraint* CBuffer::mostViolated() {
+        Constraint* v=nullptr;
+        while(true) {
+            if(size==0) {
+                load();
+                if(size==0) break;
+            }
+            double minSlack=DBL_MAX;
+            int i,deletePos=-1;
+            for(i=0;i<(int)size;i++) {
+                Constraint *c=buffer[i];
+                double slack = c->slack();
+                if(!(c->equality||slack < ZERO_UPPERBOUND)) {
+                    COLA_ASSERT(size>0);
+                    buffer[i--]=buffer[--size];
+                } else if(c->equality||slack < minSlack) {
+                    v=c;
+                    deletePos=i;    
+                    minSlack=slack;
+                }
+            }
+            if(deletePos>=0) {
+                COLA_ASSERT(size>0);
+                buffer[deletePos]=buffer[--size];
+                break;
+            }
+        }
+        return v;
+    }
+}
-- 
cgit v1.2.3