@@ -79,7 +79,7 @@ public FloatDict(String[] keys, float[] values) {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Returns the number of key/value pairs
    */
   public int size() {
     return count;
@@ -122,7 +122,7 @@ protected void crop() {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Return the internal array being used to store the keys
    */
   public Iterable<String> keys() {
     return new Iterable<String>() {
@@ -210,7 +210,7 @@ public float value(int index) {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Return the internal array being used to store the values
    */
   public Iterable<Float> values() {
     return new Iterable<Float>() {
@@ -277,9 +277,9 @@ public float get(String key) {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Create a new key/value pair or change the value of one
    */
-  public void set(String key, int amount) {
+  public void set(String key, float amount) {
     int index = index(key);
     if (index == -1) {
       create(key, amount);
@@ -291,7 +291,7 @@ public void set(String key, int amount) {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Check if a key is a part of the data structure
    */
   public boolean hasKey(String key) {
     return index(key) != -1;
@@ -392,7 +392,7 @@ protected void create(String what, float much) {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Remove a key/value pair
    */
   public void remove(String key) {
     removeIndex(index(key));
@@ -463,7 +463,7 @@ public void sortKeys() {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Sort the keys alphabetially in reverse
    */
   public void sortKeysReverse() {
     sortImpl(true, true);
@@ -484,7 +484,7 @@ public void sortKeysReverse() {
    * Sort by values in descending order (largest value will be at [0]).
    * 
    * @webref floatdict:method
-   * @brief Sort by values in descending order  
+   * @brief Sort by values in ascending order  
    */
   public void sortValues() {
     sortImpl(false, false);
@@ -499,7 +499,7 @@ public void sortValues() {
 
   /**
    * @webref floatdict:method
-   * @brief To come...
+   * @brief Sort by values in descending order
    */
   public void sortValuesReverse() {
     sortImpl(false, true);
 
@@ -201,7 +201,7 @@ public int value(int index) {
 
   /** 
    * @webref intdict:method
-   * @brief To come...
+   * @brief Return the internal array being used to store the keys
    */
   public Iterable<Integer> values() {
     return new Iterable<Integer>() {
 
@@ -77,7 +77,7 @@ public StringDict(String[] keys, String[] values) {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Returns the number of key/value pairs
    */
   public int size() {
     return count;
@@ -120,7 +120,7 @@ protected void crop() {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Return the internal array being used to store the keys
    */
   public Iterable<String> keys() {
     return new Iterable<String>() {
@@ -173,7 +173,7 @@ public String value(int index) {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Return the internal array being used to store the values
    */
   public Iterable<String> values() {
     return new Iterable<String>() {
@@ -206,7 +206,7 @@ public boolean hasNext() {
    * @webref stringdict:method
    * @brief Create a new array and copy each of the values into it
    */
-  public int[] valueArray() {
+  public String[] valueArray() {
     return valueArray(null);
   }
 
@@ -216,9 +216,9 @@ public int[] valueArray() {
    * creating a new array each time). If 'array' is null, or not the same
    * size as the number of values, a new array will be allocated and returned.
    */
-  public int[] valueArray(int[] array) {
+  public String[] valueArray(String[] array) {
     if (array == null || array.length != size()) {
-      array = new int[count];
+      array = new String[count];
     }
     System.arraycopy(values, 0, array, 0, count);
     return array;
@@ -239,7 +239,7 @@ public String get(String key) {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Create a new key/value pair or change the value of one
    */
   public void set(String key, String amount) {
     int index = index(key);
@@ -258,7 +258,7 @@ public int index(String what) {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Check if a key is a part of the data structure
    */
   public boolean hasKey(String key) {
     return index(key) != -1;
@@ -278,7 +278,7 @@ protected void create(String key, String value) {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Remove a key/value pair
    */
   public void remove(String key) {
     removeIndex(index(key));
@@ -325,7 +325,7 @@ public void sortKeys() {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Sort the keys alphabetially in reverse
    */
   public void sortKeysReverse() {
     sortImpl(true, true);
@@ -336,7 +336,7 @@ public void sortKeysReverse() {
    * Sort by values in descending order (largest value will be at [0]).
    *
    * @webref stringdict:method
-   * @brief Sort by values in descending order
+   * @brief Sort by values in ascending order
    */
   public void sortValues() {
     sortImpl(false, false);
@@ -345,7 +345,7 @@ public void sortValues() {
 
   /**
    * @webref stringdict:method
-   * @brief To come...
+   * @brief Sort by values in descending order
    */
   public void sortValuesReverse() {
     sortImpl(false, true);