equal
deleted
inserted
replaced
66 AppendL( aArray[iter] ); |
66 AppendL( aArray[iter] ); |
67 } |
67 } |
68 } |
68 } |
69 |
69 |
70 //------------------------------------------------------------------------------ |
70 //------------------------------------------------------------------------------ |
71 void CTsIdList::AppendL(const TArray<TInt>& aArray) |
|
72 { |
|
73 for( TInt iter(0); iter < aArray.Count(); ++iter ) |
|
74 { |
|
75 AppendL( aArray[iter] ); |
|
76 } |
|
77 } |
|
78 |
|
79 //------------------------------------------------------------------------------ |
|
80 void CTsIdList::AppendL(TInt aId) |
71 void CTsIdList::AppendL(TInt aId) |
81 { |
72 { |
82 if( !IsPresent( aId ) ) |
73 if( !IsPresent( aId ) ) |
83 { |
74 { |
84 iIds.AppendL( aId ); |
75 iIds.AppendL( aId ); |
122 TBool CTsIdList::operator ==( const CTsIdList& aList) const |
113 TBool CTsIdList::operator ==( const CTsIdList& aList) const |
123 { |
114 { |
124 TBool retVal(aList.iIds.Count() == iIds.Count()); |
115 TBool retVal(aList.iIds.Count() == iIds.Count()); |
125 for( TInt offset(0); retVal && offset < iIds.Count(); ++offset ) |
116 for( TInt offset(0); retVal && offset < iIds.Count(); ++offset ) |
126 { |
117 { |
127 retVal = (KErrNotFound != aList.iIds.Find(iIds[offset])); |
118 retVal = aList.IsPresent(iIds[offset]); |
128 } |
119 } |
129 return retVal; |
120 return retVal; |
130 } |
121 } |
131 //------------------------------------------------------------------------------ |
122 //------------------------------------------------------------------------------ |
132 TBool CTsIdList::operator !=( const CTsIdList& aList) const |
123 TBool CTsIdList::operator !=( const CTsIdList& aList) const |