summaryrefslogtreecommitdiffstats
path: root/src/util
diff options
context:
space:
mode:
authorJon A. Cruz <jon@joncruz.org>2011-10-25 07:45:35 +0000
committerJon A. Cruz <jon@joncruz.org>2011-10-25 07:45:35 +0000
commit1a5d5d8a7e796035bc70d5c727d4d901dda50726 (patch)
treee15866e9b83d8948e6f7329193bbe4b6eefaa840 /src/util
parentcppcheck (diff)
downloadinkscape-1a5d5d8a7e796035bc70d5c727d4d901dda50726.tar.gz
inkscape-1a5d5d8a7e796035bc70d5c727d4d901dda50726.zip
Cleanup pass on documentation that was dumping garbage into doxygen output.
(bzr r10696)
Diffstat (limited to 'src/util')
-rw-r--r--src/util/enums.h26
-rw-r--r--src/util/list.h39
2 files changed, 35 insertions, 30 deletions
diff --git a/src/util/enums.h b/src/util/enums.h
index 824da3f75..34138ad21 100644
--- a/src/util/enums.h
+++ b/src/util/enums.h
@@ -1,6 +1,4 @@
-/**
- * \brief Simplified management of enumerations of svg items with UI labels
- *
+/*
* Authors:
* Nicholas Bishop <nicholasbishop@gmail.com>
* Johan Engelen <j.b.c.engelen@ewi.utwente.nl>
@@ -9,16 +7,6 @@
*
* Released under GNU GPL. Read the file 'COPYING' for more information.
*/
-
-/* IMPORTANT
- * When initializing the EnumData struct, you cannot use _(...) to translate strings.
- * Instead, one must use N_(...) and do the translation every time the string is retreived.
- *
- * Note that get_id_from_key and get_id_from_label return 0 if it cannot find an entry for that key string
- * Note that get_label and get_key return an empty string when the requested id is not in the list.
- */
-
-
#ifndef INKSCAPE_UTIL_ENUMS_H
#define INKSCAPE_UTIL_ENUMS_H
@@ -27,6 +15,12 @@
namespace Inkscape {
namespace Util {
+/**
+ * Simplified management of enumerations of svg items with UI labels.
+ * IMPORTANT:
+ * When initializing the EnumData struct, you cannot use _(...) to translate strings.
+ * Instead, one must use N_(...) and do the translation every time the string is retreived.
+ */
template<typename E>
struct EnumData
{
@@ -37,6 +31,12 @@ struct EnumData
const Glib::ustring empty_string("");
+/**
+ * Simplified management of enumerations of svg items with UI labels.
+ *
+ * @note that get_id_from_key and get_id_from_label return 0 if it cannot find an entry for that key string.
+ * @note that get_label and get_key return an empty string when the requested id is not in the list.
+ */
template<typename E> class EnumDataConverter
{
public:
diff --git a/src/util/list.h b/src/util/list.h
index e65aa849b..de5a458e9 100644
--- a/src/util/list.h
+++ b/src/util/list.h
@@ -1,6 +1,4 @@
-/** \file
- * Inkscape::Util::List - managed linked list
- *
+/*
* Authors:
* MenTaLguY <mental@rydia.net>
*
@@ -227,7 +225,8 @@ public:
MutableList const &);
};
-/** @brief Creates a (non-empty) linked list.
+/**
+ * Creates a (non-empty) linked list.
*
* Creates a new linked list with a copy of the given value (\a first)
* in its first element; the remainder of the list will be the list
@@ -241,7 +240,7 @@ public:
* @param first the value for the first element of the list
* @param rest the rest of the list; may be an empty list
*
- * @returns a new list
+ * @return a new list
*
* @see List<>
* @see is_empty<>
@@ -254,7 +253,8 @@ inline List<T> cons(typename Traits::Reference<T>::RValue first,
return List<T>(first, rest);
}
-/** @brief Creates a (non-empty) linked list whose tail can be exchanged
+/**
+ * Creates a (non-empty) linked list whose tail can be exchanged
* for another.
*
* Creates a new linked list, but one whose tail can be exchanged for
@@ -274,7 +274,7 @@ inline List<T> cons(typename Traits::Reference<T>::RValue first,
* @param first the value for the first element of the list
* @param rest the rest of the list; may be an empty list
*
- * @returns a new list
+ * @return a new list
*/
template <typename T>
inline MutableList<T> cons(typename Traits::Reference<T>::RValue first,
@@ -283,19 +283,21 @@ inline MutableList<T> cons(typename Traits::Reference<T>::RValue first,
return MutableList<T>(first, rest);
}
-/** @brief Returns true if the given list is empty.
+/**
+ * Returns true if the given list is empty.
*
* Returns true if the given list is empty. This is equivalent
* to !list.
*
* @param list the list
*
- * @returns true if the list is empty, false otherwise.
+ * @return true if the list is empty, false otherwise.
*/
template <typename T>
inline bool is_empty(List<T> const &list) { return !list._cell; }
-/** @brief Returns the first value in a linked list.
+/**
+ * Returns the first value in a linked list.
*
* Returns a reference to the first value in the list. This
* corresponds to the value of the first argument passed to cons().
@@ -314,14 +316,15 @@ inline bool is_empty(List<T> const &list) { return !list._cell; }
*
* @param list the list; cannot be empty
*
- * @returns a reference to the first value in the list
+ * @return a reference to the first value in the list
*/
template <typename T>
inline typename List<T>::reference first(List<T> const &list) {
return list._cell->value;
}
-/** @brief Returns the remainder of a linked list after the first element.
+/**
+ * Returns the remainder of a linked list after the first element.
*
* Returns the remainder of the list after the first element (its "tail").
*
@@ -334,14 +337,15 @@ inline typename List<T>::reference first(List<T> const &list) {
*
* @param list the list; cannot be empty
*
- * @returns the remainder of the list
+ * @return the remainder of the list
*/
template <typename T>
inline List<T> const &rest(List<T> const &list) {
return reinterpret_cast<List<T> const &>(list._cell->next);
}
-/** @brief Returns a reference to the remainder of a linked list after
+/**
+ * Returns a reference to the remainder of a linked list after
* the first element.
*
* Returns a reference to the remainder of the list after the first
@@ -359,14 +363,15 @@ inline List<T> const &rest(List<T> const &list) {
*
* @param list the list; cannot be empty
*
- * @returns a reference to the remainder of the list
+ * @return a reference to the remainder of the list
*/
template <typename T>
inline MutableList<T> &rest(MutableList<T> const &list) {
return reinterpret_cast<MutableList<T> &>(list._cell->next);
}
-/** @brief Sets a new tail for an existing linked list.
+/**
+ * Sets a new tail for an existing linked list.
*
* Sets the tail of the given MutableList<>, corresponding to the
* second argument of cons().
@@ -380,7 +385,7 @@ inline MutableList<T> &rest(MutableList<T> const &list) {
* @param list the list; cannot be empty
* @param rest the new tail; corresponds to the second argument of cons()
*
- * @returns the new tail
+ * @return the new tail
*/
template <typename T>
inline MutableList<T> const &set_rest(MutableList<T> const &list,