1
|
|
|
<?php |
2
|
|
|
namespace Jmw\Collection\Set; |
3
|
|
|
|
4
|
|
|
use Jmw\Collection\CollectionAbstract; |
5
|
|
|
use Jmw\Collection\CollectionInterface; |
6
|
|
|
|
7
|
|
|
/** |
8
|
|
|
* This class provides a skeletal implementation of the Set interface |
9
|
|
|
* to minimize the effort required to implement this interface. |
10
|
|
|
* |
11
|
|
|
* The process of implementing a set by extending this class is identical |
12
|
|
|
* to that of implementing a Collection by extending AbstractCollection, except |
13
|
|
|
* that all of the methods and constructors in subclasses of this class must |
14
|
|
|
* obey the additional constraints imposed by the Set interface (for instance, |
15
|
|
|
* the add method must not permit addition of multiple instances of an object to a set). |
16
|
|
|
* |
17
|
|
|
* Note that this class does not override any of the implementations from the |
18
|
|
|
* AbstractCollection class except hashCode. |
19
|
|
|
* It merely adds implementations for hashCode and removeAll. |
20
|
|
|
* @author john |
21
|
|
|
* |
22
|
|
|
*/ |
23
|
|
|
abstract class SetAbstract extends CollectionAbstract implements SetInterface |
24
|
|
|
{ |
25
|
|
|
/** |
26
|
|
|
* Removes all of this collection's elements that are also contained in the specified collection (optional operation). |
27
|
|
|
* @param CollectionInterface $collection |
28
|
|
|
*/ |
29
|
|
|
public function removeAll(CollectionInterface $collection) |
30
|
|
|
{ |
31
|
|
|
$changed = false; |
32
|
|
|
if($this->size() > $collection->size()) |
33
|
|
|
{ |
34
|
|
|
$iterator = $collection->iterator(); |
35
|
|
|
|
36
|
|
View Code Duplication |
while($iterator->hasNext()) |
|
|
|
|
37
|
|
|
{ |
38
|
|
|
$element = $iterator->next(); |
39
|
|
|
if($this->contains($element)) |
40
|
|
|
{ |
41
|
|
|
$this->remove($element); |
42
|
|
|
$changed = true; |
43
|
|
|
} |
44
|
|
|
} |
45
|
|
|
} |
46
|
|
|
else |
47
|
|
|
{ |
48
|
|
|
$iterator = $this->iterator(); |
49
|
|
|
|
50
|
|
View Code Duplication |
while($iterator->hasNext()) |
|
|
|
|
51
|
|
|
{ |
52
|
|
|
$element = $iterator->next(); |
53
|
|
|
if($collection->contains($element)) |
54
|
|
|
{ |
55
|
|
|
$iterator->remove(); |
56
|
|
|
$changed = true; |
57
|
|
|
} |
58
|
|
|
} |
59
|
|
|
} |
60
|
|
|
|
61
|
|
|
return $changed; |
62
|
|
|
} |
63
|
|
|
|
64
|
|
|
/** |
65
|
|
|
* Returns the hash code value for this set. |
66
|
|
|
* The hash code of a set is defined to be the sum of the hash codes of |
67
|
|
|
* the elements in the set, where the hash code of a null element is defined to be zero. |
68
|
|
|
* This ensures that s1.equals(s2) implies that s1.hashCode()==s2.hashCode() |
69
|
|
|
* for any two sets s1 and s2, as required by the general contract of Collection.hashCode(). |
70
|
|
|
* @return string |
71
|
|
|
*/ |
72
|
|
|
public function hashCode() |
73
|
|
|
{ |
74
|
|
|
$iterator = $this->iterator(); |
75
|
|
|
|
76
|
|
|
$code = 0; |
77
|
|
|
while($iterator->hasNext()) |
78
|
|
|
{ |
79
|
|
|
$code += $iterator->next(); |
80
|
|
|
} |
81
|
|
|
|
82
|
|
|
return $code; |
83
|
|
|
} |
84
|
|
|
} |
Duplicated code is one of the most pungent code smells. If you need to duplicate the same code in three or more different places, we strongly encourage you to look into extracting the code into a single class or operation.
You can also find more detailed suggestions in the “Code” section of your repository.