Use a consistent style for FOREACH macros

4 files changed, 9 insertions, 9 deletions

diff --git a/src/gui/PluginMenu.cpp b/src/gui/PluginMenu.cpp
index 66cf9b35..1993a7a7 100644
--- a/src/gui/PluginMenu.cpp
+++ b/src/gui/PluginMenu.cpp
@@ -56,7 +56,7 @@ PluginMenu::clear()
 
 	// Build skeleton
 	LV2Children children;
-	LILV_FOREACH(plugin_classes, i, classes) {
+	LILV_FOREACH (plugin_classes, i, classes) {
 		const LilvPluginClass* c = lilv_plugin_classes_get(classes, i);
 		const LilvNode*        p = lilv_plugin_class_get_parent_uri(c);
 		if (!p) {
diff --git a/src/gui/Port.cpp b/src/gui/Port.cpp
index 52f10edf..e4e02aa6 100644
--- a/src/gui/Port.cpp
+++ b/src/gui/Port.cpp
@@ -310,7 +310,7 @@ Port::build_uri_menu()
 	rdfs::URISet ranges;
 	LilvNodes* range = lilv_world_find_nodes(
 		world.lilv_world(), designation, rdfs_range, nullptr);
-	LILV_FOREACH(nodes, r, range) {
+	LILV_FOREACH (nodes, r, range) {
 		ranges.insert(URI(lilv_node_as_string(lilv_nodes_get(range, r))));
 	}
 	rdfs::classes(world, ranges, false);
diff --git a/src/gui/RDFS.cpp b/src/gui/RDFS.cpp
index fc722479..23a9e768 100644
--- a/src/gui/RDFS.cpp
+++ b/src/gui/RDFS.cpp
@@ -76,7 +76,7 @@ closure(World& world, const LilvNode* pred, URISet& types, bool super)
 					world.lilv_world(), type, pred, nullptr)
 				: lilv_world_find_nodes(
 					world.lilv_world(), nullptr, pred, type);
-			LILV_FOREACH(nodes, m, matches) {
+			LILV_FOREACH (nodes, m, matches) {
 				const LilvNode* klass_node = lilv_nodes_get(matches, m);
 				if (lilv_node_is_uri(klass_node)) {
 					URI klass(lilv_node_as_uri(klass_node));
@@ -158,13 +158,13 @@ properties(World&                                            world,
 
 	LilvNodes* props = lilv_world_find_nodes(
 		world.lilv_world(), nullptr, rdf_type, rdf_Property);
-	LILV_FOREACH(nodes, p, props) {
+	LILV_FOREACH (nodes, p, props) {
 		const LilvNode* prop = lilv_nodes_get(props, p);
 		if (lilv_node_is_uri(prop)) {
 			LilvNodes* domains = lilv_world_find_nodes(
 				world.lilv_world(), prop, rdfs_domain, nullptr);
 			unsigned n_matching_domains = 0;
-			LILV_FOREACH(nodes, d, domains) {
+			LILV_FOREACH (nodes, d, domains) {
 				const LilvNode* domain_node = lilv_nodes_get(domains, d);
 				if (!lilv_node_is_uri(domain_node)) {
 					// TODO: Blank node domains (e.g. unions)
@@ -205,7 +205,7 @@ instances(World& world, const URISet& types)
 		LilvNode*  type    = lilv_new_uri(world.lilv_world(), t.c_str());
 		LilvNodes* objects = lilv_world_find_nodes(
 			world.lilv_world(), nullptr, rdf_type, type);
-		LILV_FOREACH(nodes, o, objects) {
+		LILV_FOREACH (nodes, o, objects) {
 			const LilvNode* object = lilv_nodes_get(objects, o);
 			if (!lilv_node_is_uri(object)) {
 				continue;
@@ -230,7 +230,7 @@ range(World& world, const LilvNode* prop, bool recursive)
 		world.lilv_world(), prop, rdfs_range, nullptr);
 
 	URISet ranges;
-	LILV_FOREACH(nodes, n, nodes) {
+	LILV_FOREACH (nodes, n, nodes) {
 		if (lilv_node_is_uri(lilv_nodes_get(nodes, n))) {
 			ranges.insert(URI(lilv_node_as_string(lilv_nodes_get(nodes, n))));
 		}
diff --git a/src/gui/URIEntry.cpp b/src/gui/URIEntry.cpp
index 036e7a0b..4ae8da10 100644
--- a/src/gui/URIEntry.cpp
+++ b/src/gui/URIEntry.cpp
@@ -131,11 +131,11 @@ URIEntry::build_subclass_menu(const LilvNode* klass)
 
 	// Put subclasses/types in a map keyed by label (to sort menu)
 	std::map<std::string, const LilvNode*> entries;
-	LILV_FOREACH(nodes, s, subclasses) {
+	LILV_FOREACH (nodes, s, subclasses) {
 		const LilvNode* node = lilv_nodes_get(subclasses, s);
 		entries.emplace(rdfs::label(world, node), node);
 	}
-	LILV_FOREACH(nodes, s, subtypes) {
+	LILV_FOREACH (nodes, s, subtypes) {
 		const LilvNode* node = lilv_nodes_get(subtypes, s);
 		entries.emplace(rdfs::label(world, node), node);
 	}