DAM-M3-UF5. Estructures de dades - Historial de revisió

Alex: /* Estructures de dades */

2025-04-02T14:58:29Z

‎Estructures de dades

Alex: /* Consistència entre compareTo ~ equals */

2022-01-13T15:59:38Z

‎Consistència entre compareTo ~ equals

Alex: /* Consistència entre compareTo ~ equals */

2022-01-13T15:42:54Z

‎Consistència entre compareTo ~ equals

Alex: /* Consistència entre compareTo ~ equals */

2022-01-13T15:42:11Z

‎Consistència entre compareTo ~ equals

Alex: /* Ordenació */

2022-01-13T15:41:33Z

‎Ordenació

Alex: /* Mapes */

2021-11-09T12:35:46Z

‎Mapes

Alex: /* Ordenació */

2021-11-09T12:33:14Z

‎Ordenació

Alex: /* Tipus genèrics */

2021-11-09T12:32:38Z

‎Tipus genèrics

Alex: /* Tipus genèrics */

2021-11-09T12:32:00Z

‎Tipus genèrics

Alex: /* Tipus genèrics */

2021-11-09T12:31:09Z

‎Tipus genèrics

@@ Línia 360: / Línia 360: @@
 		return this.compareTo(p) == 0;
+	}
 </code>

@@ Línia 352: / Línia 352: @@
 	@Override
 	public int compareTo(Punt o) {
-		return (x + y) - (o.getX() + o.getY());
+		return x - o.getX();
+	}

@@ Línia 340: / Línia 340: @@
 Concretament diu:
-<q><i>The natural ordering for a class C is said to be consistent with equals if and only if e1.compareTo(e2) == 0 has the same boolean value as e1.equals(e2) for every e1 and e2 of class C. Note that null is not an instance of any class, and e.compareTo(null) should throw a NullPointerException even though e.equals(null) returns false.</i><q>
+<q><i>The natural ordering for a class C is said to be consistent with equals if and only if '''e1.compareTo(e2) == 0''' has the same boolean value as '''e1.equals(e2)''' for every e1 and e2 of class C. Note that null is not an instance of any class, and e.compareTo(null) should throw a NullPointerException even though e.equals(null) returns false.</i><q>
-<q><i>It is strongly recommended (though not required) that natural orderings be consistent with equals. This is so because sorted sets (and sorted maps) without explicit comparators behave "strangely" when they are used with elements (or keys) whose natural ordering is inconsistent with equals. In particular, such a sorted set (or sorted map) violates the general contract for set (or map), which is defined in terms of the equals method.</i><q>
+<q><i>'''It is strongly recommended (though not required)''' that natural orderings be consistent with equals. This is so because sorted sets (and sorted maps) without explicit comparators behave "strangely" when they are used with elements (or keys) whose natural ordering is inconsistent with equals. In particular, such a sorted set (or sorted map) violates the general contract for set (or map), which is defined in terms of the equals method.</i><q>

@@ Línia 340: / Línia 340: @@
 Concretament diu:
-<q>The natural ordering for a class C is said to be consistent with equals if and only if e1.compareTo(e2) == 0 has the same boolean value as e1.equals(e2) for every e1 and e2 of class C. Note that null is not an instance of any class, and e.compareTo(null) should throw a NullPointerException even though e.equals(null) returns false.<q>
+<q><i>The natural ordering for a class C is said to be consistent with equals if and only if e1.compareTo(e2) == 0 has the same boolean value as e1.equals(e2) for every e1 and e2 of class C. Note that null is not an instance of any class, and e.compareTo(null) should throw a NullPointerException even though e.equals(null) returns false.</i><q>
-<q>It is strongly recommended (though not required) that natural orderings be consistent with equals. This is so because sorted sets (and sorted maps) without explicit comparators behave "strangely" when they are used with elements (or keys) whose natural ordering is inconsistent with equals. In particular, such a sorted set (or sorted map) violates the general contract for set (or map), which is defined in terms of the equals method.<q>
+<q><i>It is strongly recommended (though not required) that natural orderings be consistent with equals. This is so because sorted sets (and sorted maps) without explicit comparators behave "strangely" when they are used with elements (or keys) whose natural ordering is inconsistent with equals. In particular, such a sorted set (or sorted map) violates the general contract for set (or map), which is defined in terms of the equals method.</i><q>

@@ Línia 327: / Línia 327: @@
+     }
+}
 </code>
 </pre>

@@ Línia 333: / Línia 333: @@
 === Mapes ===
-Accés indexat. Sense repetits per clau '''HashMap''' (Sense ordre, per garantir l'ordre dels elements '''TreeMap''')
+Accés indexat. Sense repetits per clau '''HashMap&lt;E,T&gt;''' (Sense ordre, per garantir l'ordre dels elements cal fer servir '''TreeMap'''). On '''E''' indica el tipus de l'índex i '''T''' el tipus de les dades.
 <html>
 <pre>
 <code class='java'>
-Map<Integer, String> exempleBuit = new HashMap<Integer, String>();
+Map&lt;Integer, String&gt; exempleBuit = new HashMap&lt;Integer, String&gt;();
@@ Línia 344: / Línia 344: @@
 System.out.println(exempleBuit.get(new Integer(100))); // Clau no existeix
-Map<Integer, String> exempleErrors = new HashMap<Integer, String>() {{
+Map&lt;Integer, String&gt; exempleErrors = new HashMap&lt;Integer, String&gt;() {{
 	put(100, "Aquest projecte ja existeix");
 	put(101, "Cal indicar la empresa");
@@ Línia 362: / Línia 362: @@
-Map<String, String> exempleErrorsCodi = new	HashMap<String, String>() {{
+Map&lt;String, String&gt; exempleErrorsCodi = new	HashMap&lt;String, String&gt;() {{
 	put("ERROREXI", "Aquest projecte ja existeix");
 	put("ERROREMP", "Cal indicar la empresa");

@@ Línia 294: / Línia 294: @@
 <pre>
 <code class='java'>
-public class Persona implements Comparable<Persona> {
+public class Persona implements Comparable&lt;Persona&gt; {
      private String nom;
      private String dni;

@@ Línia 193: / Línia 193: @@
 <pre>
 <code class='java'>
-public class Persona implements Comparable&lt;Persona> {
+public class Persona implements Comparable&lt;Persona&gt; {
 ...
+}
-TreeSet\lPersona\g persones = new TreeSet<Persona\g();
+TreeSet&lt;Persona&gt; persones = new TreeSet&lt;Persona&gt;();
-Iterator\lPersona\g iter = persones.iterator();
+Iterator&lt;Persona&gt; iter = persones.iterator();
 </code>
 </pre>