Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.

BUG:215923


git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdebase@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 188 insertions, 0 deletions

diff --git a/kdesu/kdesud/repo.cpp b/kdesu/kdesud/repo.cpp
new file mode 100644
index 000000000..783a9baca
--- /dev/null
+++ b/kdesu/kdesud/repo.cpp
@@ -0,0 +1,188 @@
+/* vi: ts=8 sts=4 sw=4
+ *
+ * This file is part of the KDE project, module kdesu.
+ * Copyright (C) 1999,2000 Geert Jansen <g.t.jansen@stud.tue.nl>
+ */
+
+#include <time.h>
+#include <assert.h>
+
+#include <qcstring.h>
+#include <qmap.h>
+#include <qvaluestack.h>
+#include <kdebug.h>
+
+#include "repo.h"
+
+
+Repository::Repository()
+{
+    head_time = (unsigned) -1;
+}
+
+
+Repository::~Repository()
+{}
+
+
+void Repository::add(const QCString &key, Data_entry &data)
+{
+    RepoIterator it = repo.find(key);
+    if (it != repo.end())
+        remove(key);
+    if (data.timeout == 0)
+        data.timeout = (unsigned) -1;
+    else
+        data.timeout += time(0L);
+    head_time = QMIN(head_time, data.timeout);
+    repo.insert(key, data);
+}
+
+int Repository::remove(const QCString &key)
+{
+    if( key.isEmpty() )
+        return -1;
+
+     RepoIterator it = repo.find(key);
+     if (it == repo.end())
+        return -1;
+     it.data().value.fill('x');
+     it.data().group.fill('x');
+     repo.remove(it);
+     return 0;
+}
+
+int Repository::removeSpecialKey(const QCString &key)
+{
+    int found = -1;
+    if ( !key.isEmpty() )
+    {
+        QValueStack<QCString> rm_keys;
+        for (RepoCIterator it=repo.begin(); it!=repo.end(); ++it)
+        {
+            if (  key.find( it.data().group ) == 0 &&
+                  it.key().find( key ) >= 0 )
+            {
+                rm_keys.push(it.key());
+                found = 0;
+            }
+        }
+        while (!rm_keys.isEmpty())
+        {
+            kdDebug(1205) << "Removed key: " << rm_keys.top() << endl;
+            remove(rm_keys.pop());
+        }
+    }
+    return found;
+}
+
+int Repository::removeGroup(const QCString &group)
+{
+    int found = -1;
+    if ( !group.isEmpty() )
+    {
+        QValueStack<QCString> rm_keys;
+        for (RepoCIterator it=repo.begin(); it!=repo.end(); ++it)
+        {
+            if (it.data().group == group)
+            {
+                rm_keys.push(it.key());
+                found = 0;
+            }
+        }
+        while (!rm_keys.isEmpty())
+        {
+            kdDebug(1205) << "Removed key: " << rm_keys.top() << endl;
+            remove(rm_keys.pop());
+        }
+    }
+    return found;
+}
+
+int Repository::hasGroup(const QCString &group) const
+{
+    if ( !group.isEmpty() )
+    {
+        RepoCIterator it;
+        for (it=repo.begin(); it!=repo.end(); ++it)
+        {
+            if (it.data().group == group)
+                return 0;
+        }
+    }
+    return -1;
+}
+
+QCString Repository::findKeys(const QCString &group, const char *sep ) const
+{
+    QCString list="";
+    if( !group.isEmpty() )
+    {
+        kdDebug(1205) << "Looking for matching key with group key: " << group << endl;
+        int pos;
+        QCString key;
+        RepoCIterator it;
+        for (it=repo.begin(); it!=repo.end(); ++it)
+        {
+            if (it.data().group == group)
+            {
+                key = it.key().copy();
+                kdDebug(1205) << "Matching key found: " << key << endl;
+                pos = key.findRev(sep);
+                key.truncate( pos );
+                key.remove(0, 2);
+                if (!list.isEmpty())
+                {
+                    // Add the same keys only once please :)
+                    if( !list.contains(key) )
+                    {
+                        kdDebug(1205) << "Key added to list: " << key << endl;
+                        list += '\007'; // I do not know
+                        list.append(key);
+                    }
+                }
+                else
+                    list = key;
+            }
+        }
+    }
+    return list;
+}
+
+QCString Repository::find(const QCString &key) const
+{
+    if( key.isEmpty() )
+        return 0;
+
+    RepoCIterator it = repo.find(key);
+    if (it == repo.end())
+        return 0;
+    return it.data().value;
+}
+
+
+int Repository::expire()
+{
+    unsigned current = time(0L);
+    if (current < head_time)
+	return 0;
+
+    unsigned t;
+    QValueStack<QCString> keys;
+    head_time = (unsigned) -1;
+    RepoIterator it;
+    for (it=repo.begin(); it!=repo.end(); ++it)
+    {
+	t = it.data().timeout;
+	if (t <= current)
+	    keys.push(it.key());
+	else
+	    head_time = QMIN(head_time, t);
+    }
+
+    int n = keys.count();
+    while (!keys.isEmpty())
+	remove(keys.pop());
+    return n;
+}
+