diff options
| author | David Robillard <d@drobilla.net> | 2009-05-13 16:04:14 +0000 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2009-05-13 16:04:14 +0000 |
| commit | 0a04be1e9e8f3c6b355c014f5755bb30da0d5aec (patch) | |
| tree | b4eb149da0fc57af8c4e9356231aa191e6f1a118 /src/collections.c | |
| parent | 011d130c2b7f54b859ae41aac8b95d5825b975be (diff) | |
| download | lilv-0a04be1e9e8f3c6b355c014f5755bb30da0d5aec.tar.gz lilv-0a04be1e9e8f3c6b355c014f5755bb30da0d5aec.tar.bz2 lilv-0a04be1e9e8f3c6b355c014f5755bb30da0d5aec.zip | |
Strip trailing whitespace.
git-svn-id: http://svn.drobilla.net/lad/trunk/slv2@1999 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'src/collections.c')
| -rw-r--r-- | src/collections.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/src/collections.c b/src/collections.c index 4598eab..a16c7fb 100644 --- a/src/collections.c +++ b/src/collections.c @@ -1,6 +1,6 @@ /* 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) @@ -75,19 +75,19 @@ 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) @@ -109,7 +109,7 @@ 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; } @@ -129,11 +129,11 @@ 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); |