aboutsummaryrefslogtreecommitdiff
path: root/libtiled/properties.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'libtiled/properties.cpp')
-rw-r--r--libtiled/properties.cpp42
1 files changed, 42 insertions, 0 deletions
diff --git a/libtiled/properties.cpp b/libtiled/properties.cpp
new file mode 100644
index 0000000..53e483d
--- /dev/null
+++ b/libtiled/properties.cpp
@@ -0,0 +1,42 @@
+/*
+ * properties.cpp
+ * Copyright 2010, Thorbjørn Lindeijer <thorbjorn@lindeijer.nl>
+ *
+ * This file is part of libtiled.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ * this list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+ * EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "properties.h"
+
+using namespace Tiled;
+
+void Properties::merge(const Properties &other)
+{
+ // Based on QMap::unite, but using insert instead of insertMulti
+ const_iterator it = other.constEnd();
+ const const_iterator b = other.constBegin();
+ while (it != b) {
+ --it;
+ insert(it.key(), it.value());
+ }
+}