comparison dwtx/jface/text/link/ProposalPosition.d @ 162:1a5b8f8129df

...
author Frank Benoit <benoit@tionex.de>
date Mon, 08 Sep 2008 00:51:37 +0200
parents 3678e4f1a766
children
comparison
equal deleted inserted replaced
161:f8d52b926852 162:1a5b8f8129df
76 * @since 3.1 76 * @since 3.1
77 */ 77 */
78 private ICompletionProposal[] copy(ICompletionProposal[] proposals) { 78 private ICompletionProposal[] copy(ICompletionProposal[] proposals) {
79 if (proposals !is null) { 79 if (proposals !is null) {
80 ICompletionProposal[] copy= new ICompletionProposal[proposals.length]; 80 ICompletionProposal[] copy= new ICompletionProposal[proposals.length];
81 System.arraycopy(proposals, 0, copy, 0, proposals.length); 81 SimpleType!(ICompletionProposal).arraycopy(proposals, 0, copy, 0, proposals.length);
82 return copy; 82 return copy;
83 } 83 }
84 return null; 84 return null;
85 } 85 }
86 86
87 /* 87 /*
88 * @see java.lang.Object#equals(java.lang.Object) 88 * @see java.lang.Object#equals(java.lang.Object)
89 */ 89 */
90 public bool equals(Object o) { 90 public override int opEquals(Object o) {
91 if ( cast(ProposalPosition)o ) { 91 if ( cast(ProposalPosition)o ) {
92 if (super.equals(o)) { 92 if (super.opEquals(o)) {
93 return Arrays.equals(fProposals, (cast(ProposalPosition)o).fProposals); 93 return Arrays.equals(fProposals, (cast(ProposalPosition)o).fProposals);
94 } 94 }
95 } 95 }
96 return false; 96 return false;
97 } 97 }
109 109
110 /* 110 /*
111 * @see dwtx.jdt.internal.ui.text.link.LinkedPosition#hashCode() 111 * @see dwtx.jdt.internal.ui.text.link.LinkedPosition#hashCode()
112 */ 112 */
113 public override hash_t toHash() { 113 public override hash_t toHash() {
114 return super.toHash() | (fProposals is null ? 0 : fProposals.toHash()); 114 return super.toHash() | (fProposals is null ? 0 : (cast(hash_t)fProposals.ptr)/+.toHash()+/);
115 } 115 }
116 } 116 }