From ea7fc4dc07d37096550cf25a5f9032ac207415ee Mon Sep 17 00:00:00 2001
From: David Robillard <d@drobilla.net>
Date: Thu, 12 Feb 2009 05:34:22 +0000
Subject: Add missing file (oops).

git-svn-id: http://svn.drobilla.net/lad/trunk/slv2@1928 a436a847-0d15-0410-975c-d299462d15a1
---
 src/collections.c | 155 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 155 insertions(+)
 create mode 100644 src/collections.c

(limited to 'src/collections.c')

diff --git a/src/collections.c b/src/collections.c
new file mode 100644
index 0000000..4598eab
--- /dev/null
+++ b/src/collections.c
@@ -0,0 +1,155 @@
+/* SLV2
+ * Copyright (C) 2008 Dave Robillard <http://drobilla.net>
+ *  
+ * This library is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the Free
+ * Software Foundation; either version 2 of the License, or (at your option)
+ * any later version.
+ *
+ * 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.  See the GNU General Public License
+ * for more details.
+ *
+ * You should have received a copy of the GNU General Public License along
+ * with this program; if not, write to the Free Software Foundation, Inc.,
+ * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ */
+
+#define _XOPEN_SOURCE 500
+
+#include <string.h>
+#include <limits.h>
+#include <librdf.h>
+#include "slv2/collections.h"
+#include "slv2/pluginclass.h"
+#include "slv2/pluginui.h"
+#include "slv2_internal.h"
+
+#define SLV2_COLLECTION_IMPL(CollType, ElemType, prefix, free_func) \
+\
+CollType \
+prefix ## _new() \
+{ \
+	return raptor_new_sequence((void (*)(void*))free_func, NULL); \
+} \
+\
+\
+void \
+prefix ## _free(CollType coll) \
+{ \
+	if (coll) \
+		raptor_free_sequence(coll); \
+} \
+\
+\
+unsigned \
+prefix ## _size(CollType coll) \
+{ \
+	return (coll ? raptor_sequence_size(coll) : 0); \
+} \
+\
+\
+ElemType \
+prefix ## _get_at(CollType coll, unsigned index) \
+{ \
+	if (index > INT_MAX) \
+		return NULL; \
+	else \
+		return (ElemType)raptor_sequence_get_at(coll, (int)index); \
+}
+
+SLV2_COLLECTION_IMPL(SLV2PluginClasses, SLV2PluginClass,
+		slv2_plugin_classes, &slv2_plugin_class_free)
+SLV2_COLLECTION_IMPL(SLV2ScalePoints, SLV2ScalePoint,
+		slv2_scale_points, &slv2_scale_point_free)
+SLV2_COLLECTION_IMPL(SLV2Values, SLV2Value,
+		slv2_values, &slv2_value_free)
+SLV2_COLLECTION_IMPL(SLV2UIs, SLV2UI,
+		slv2_uis, &slv2_ui_free)
+
+
+/* **** PLUGIN CLASSES **** */
+
+SLV2PluginClass
+slv2_plugin_classes_get_by_uri(SLV2PluginClasses list, SLV2Value uri)
+{
+	// good old fashioned binary search
+	
+	int lower = 0;
+	int upper = raptor_sequence_size(list) - 1;
+	int i;
+	
+	while (upper >= lower) {
+		i = lower + ((upper - lower) / 2);
+
+		SLV2PluginClass p = raptor_sequence_get_at(list, i);
+	
+		const int cmp = strcmp(slv2_value_as_uri(slv2_plugin_class_get_uri(p)),
+		                       slv2_value_as_uri(uri));
+		
+		if (cmp == 0)
+			return p;
+		else if (cmp > 0)
+			upper = i - 1;
+		else
+			lower = i + 1;
+	}
+
+	return NULL;
+}
+
+
+
+/* **** VALUES **** */
+
+bool
+slv2_values_contains(SLV2Values list, SLV2Value value)
+{
+	for (unsigned i=0; i < slv2_values_size(list); ++i)
+		if (slv2_value_equals(slv2_values_get_at(list, i), value))
+			return true;
+	
+	return false;
+}
+
+
+void
+slv2_values_set_at(SLV2Values list, unsigned index, void* value)
+{
+	if (index <= INT_MAX)
+		raptor_sequence_set_at(list, index, value);
+}
+
+
+
+/* **** PLUGIN UIS **** */
+
+SLV2UI
+slv2_uis_get_by_uri(SLV2UIs list, SLV2Value uri)
+{
+	// good old fashioned binary search
+	
+	int lower = 0;
+	int upper = raptor_sequence_size(list) - 1;
+	int i;
+	
+	while (upper >= lower) {
+		i = lower + ((upper - lower) / 2);
+
+		SLV2UI ui = raptor_sequence_get_at(list, i);
+
+		const int cmp = strcmp(slv2_value_as_uri(slv2_ui_get_uri(ui)),
+		                       slv2_value_as_uri(uri));
+
+		if (cmp == 0)
+			return ui;
+		else if (cmp > 0)
+			upper = i - 1;
+		else
+			lower = i + 1;
+	}
+
+	return NULL;
+}
+
-- 
cgit v1.2.1