This file is indexed.

/usr/include/opencascade/TCollection_DoubleMap.gxx is in libopencascade-foundation-dev 6.5.0.dfsg-2build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
// Lastly modified by :
// +---------------------------------------------------------------------------+
// !       szy ! Modified Assign method                  ! 7-05-2003! 3.0-00-3!
// +---------------------------------------------------------------------------+
// File:	TCollection_DoubleMap.gxx
// Created:	Fri Jan  8 18:15:52 1993
// Author:	Remi LEQUETTE
//		<rle@phylox>


#include <Standard_DomainError.hxx>
#include <Standard_MultiplyDefined.hxx>
#include <Standard_NoSuchObject.hxx>


//=======================================================================
//function : TCollection_DoubleMap
//purpose  : 
//=======================================================================

TCollection_DoubleMap::TCollection_DoubleMap(const Standard_Integer NbBuckets):
       TCollection_BasicMap(NbBuckets,Standard_False)
{
}

//=======================================================================
//function : TCollection_DoubleMap
//purpose  : 
//=======================================================================

TCollection_DoubleMap::TCollection_DoubleMap
  (const TCollection_DoubleMap& Other) :
       TCollection_BasicMap(Other.NbBuckets(),Standard_False)
{
  if (Other.Extent() != 0)
    Standard_DomainError::Raise("TCollection:Copy of DoubleMap");
}

//=======================================================================
//function : Assign
//purpose  : 
//=======================================================================

TCollection_DoubleMap& TCollection_DoubleMap::Assign
  (const TCollection_DoubleMap& Other)
{
  if (this == &Other) return *this;
  Clear();
//  ReSize(Other.NbBuckets());
  if  (!Other.IsEmpty()) { 
    ReSize(Other.Extent());
    for (TCollection_DoubleMapIterator It(Other); It.More(); It.Next()) {
      Bind(It.Key1(),It.Key2());
    }
  }
  return *this;
}


//=======================================================================
//function : ReSize
//purpose  : 
//=======================================================================

void TCollection_DoubleMap::ReSize(const Standard_Integer N)
{
  Standard_Integer newBuck;
  Standard_Address newData1=NULL, newData2=NULL;
  if (BeginResize(N,newBuck,newData1,newData2)) {
    if (myData1) {
      TCollection_DoubleMapNode** newdata1 = (TCollection_DoubleMapNode**) newData1;
      TCollection_DoubleMapNode** newdata2 = (TCollection_DoubleMapNode**) newData2;
      TCollection_DoubleMapNode** olddata1 = (TCollection_DoubleMapNode**) myData1;
      TCollection_DoubleMapNode *p, *q;
      Standard_Integer i,k1,k2;
      for (i = 0; i <= NbBuckets(); i++) {
	if (olddata1[i]) {
	  p = olddata1[i];
	  while (p) {
	    k1 = Hasher1::HashCode(p->Key1(),newBuck);
	    k2 = Hasher2::HashCode(p->Key2(),newBuck);
	    q = (TCollection_DoubleMapNode*) p->Next();
	    p->Next() = newdata1[k1];
	    p->Next2() = newdata2[k2];
	    newdata1[k1] = p;
	    newdata2[k2] = p;
	    p = q;
	  }
	}
      }
    }
    EndResize(N,newBuck,newData1,newData2);
  }
}

//=======================================================================
//function : Clear
//purpose  : 
//=======================================================================

void TCollection_DoubleMap::Clear()
{
  if (!IsEmpty()) {
    Standard_Integer i;
    TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**) myData1;
//    TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**) myData2;
    TCollection_DoubleMapNode *p,*q;
    for (i = 0; i <= NbBuckets(); i++) {
      p = data1[i];
      while (p) {
	q = (TCollection_DoubleMapNode*) p->Next();
	delete p;
	p = q;
      }
    }
  }
  TCollection_BasicMap::Destroy();
}

//=======================================================================
//function : Bind
//purpose  : 
//=======================================================================

void TCollection_DoubleMap::Bind(const TheKey1& K1, const TheKey2& K2)
{
  if (Resizable()) ReSize(Extent());
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k1 = Hasher1::HashCode(K1,NbBuckets());
  Standard_Integer k2 = Hasher2::HashCode(K2,NbBuckets());
  TCollection_DoubleMapNode* p;
  p = data1[k1];
  while (p) {
    if (Hasher1::IsEqual(p->Key1(),K1)) 
      Standard_MultiplyDefined::Raise("DoubleMap:Bind");
    p = (TCollection_DoubleMapNode*) p->Next();
  }
  p = data2[k2];
  while (p) {
    if (Hasher2::IsEqual(p->Key2(),K2)) 
      Standard_MultiplyDefined::Raise("DoubleMap:Bind");
    p = (TCollection_DoubleMapNode*)p->Next2();
  }
  p = new TCollection_DoubleMapNode(K1,K2,data1[k1],data2[k2]);
  data1[k1] = p;
  data2[k2] = p;
  Increment();
}

//=======================================================================
//function : AreBound
//purpose  : 
//=======================================================================

Standard_Boolean TCollection_DoubleMap::AreBound(const TheKey1& K1, 
						 const TheKey2& K2) const
{
  if (IsEmpty()) return Standard_False;
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k1 = Hasher1::HashCode(K1,NbBuckets());
  Standard_Integer k2 = Hasher2::HashCode(K2,NbBuckets());
  TCollection_DoubleMapNode *p1, *p2;
  p1 = data1[k1];
  while (p1) {
    if (Hasher1::IsEqual(p1->Key1(),K1)) break;
    p1 = (TCollection_DoubleMapNode*) p1->Next();
  }
  if (p1 == NULL) return Standard_False;
  p2 = data2[k2];
  while (p2) {
    if (Hasher2::IsEqual(p2->Key2(),K2)) 
      break;
    p2 = (TCollection_DoubleMapNode*)p2->Next2();
  }
  if (p2 == NULL) return Standard_False;
  return p1 == p2;
}

//=======================================================================
//function : IsBound1
//purpose  : 
//=======================================================================

Standard_Boolean TCollection_DoubleMap::IsBound1(const TheKey1& K1) const
{
  if (IsEmpty()) return Standard_False;
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  Standard_Integer k1 = Hasher1::HashCode(K1,NbBuckets());
  TCollection_DoubleMapNode *p1;
  p1 = data1[k1];
  while (p1) {
    if (Hasher1::IsEqual(p1->Key1(),K1)) return Standard_True;
    p1 = (TCollection_DoubleMapNode*)  p1->Next();
  }
  return Standard_False;
}

//=======================================================================
//function : IsBound2
//purpose  : 
//=======================================================================

Standard_Boolean TCollection_DoubleMap::IsBound2(const TheKey2& K2) const
{
  if (IsEmpty()) return Standard_False;
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k2 = Hasher2::HashCode(K2,NbBuckets());
  TCollection_DoubleMapNode *p2;
  p2 = data2[k2];
  while (p2) {
    if (Hasher2::IsEqual(p2->Key2(),K2)) return Standard_True;
    p2 = (TCollection_DoubleMapNode*)p2->Next2();
  }
  return Standard_False;
}

//=======================================================================
//function : Find1
//purpose  : 
//=======================================================================

const TheKey2& TCollection_DoubleMap::Find1(const TheKey1& K1) const
{
  Standard_NoSuchObject_Raise_if(IsEmpty(),"TCollection_DoubleMap::Find1");  
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  Standard_Integer k1 = Hasher1::HashCode(K1,NbBuckets());
  TCollection_DoubleMapNode *p1;
  p1 = data1[k1];
  while (p1) {
    if (Hasher1::IsEqual(p1->Key1(),K1)) return p1->Key2();
    p1 = (TCollection_DoubleMapNode*) p1->Next();
  }
  Standard_NoSuchObject::Raise("TCollection_DoubleMap::Find1");
  return p1->Key2();
}

//=======================================================================
//function : Find2
//purpose  : 
//=======================================================================

const TheKey1& TCollection_DoubleMap::Find2(const TheKey2& K2) const
{
  Standard_NoSuchObject_Raise_if(IsEmpty(),"TCollection_DoubleMap::Find2");  
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k2 = Hasher2::HashCode(K2,NbBuckets());
  TCollection_DoubleMapNode *p2;
  p2 = data2[k2];
  while (p2) {
    if (Hasher2::IsEqual(p2->Key2(),K2)) return p2->Key1();
    p2 = (TCollection_DoubleMapNode*)p2->Next2();
  }
  Standard_NoSuchObject::Raise("TCollection_DoubleMap::Find2");
  return p2->Key1();
}

//=======================================================================
//function : UnBind1
//purpose  : 
//=======================================================================

Standard_Boolean TCollection_DoubleMap::UnBind1(const TheKey1& K1)
{
  if (IsEmpty()) return Standard_False;
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k1 = Hasher1::HashCode(K1,NbBuckets());
  Standard_Integer k2;
  TCollection_DoubleMapNode *p1, *p2, *q1, *q2;
  q1 = q2 = NULL;
  p1 = data1[k1];
  while (p1) {
    if (Hasher1::IsEqual(p1->Key1(),K1)) {
      // remove from the first
      if (q1)
	q1->Next() = p1->Next();
      else
	data1[k1] = (TCollection_DoubleMapNode*) p1->Next();
      // remove from the second
      k2 = Hasher2::HashCode(p1->Key2(),NbBuckets());
      p2 = data2[k2];
      while (p2) {
	if (p2 == p1) {
	  if (q2)
	    q2->Next2() = p2->Next2();
	  else
	    data2[k2] = (TCollection_DoubleMapNode*)p2->Next2();
	  break;
	}
	q2 = p2;
	p2 = (TCollection_DoubleMapNode*)p2->Next2();
      }
      delete p1;
      Decrement();
      return Standard_True;
    }
    q1 = p1;
    p1 = (TCollection_DoubleMapNode*) p1->Next();
  }
  return Standard_False;
}

//=======================================================================
//function : UnBind2
//purpose  : 
//=======================================================================

Standard_Boolean TCollection_DoubleMap::UnBind2(const TheKey2& K2)
{
  if (IsEmpty()) return Standard_False;
  TCollection_DoubleMapNode** data1 = (TCollection_DoubleMapNode**)myData1;
  TCollection_DoubleMapNode** data2 = (TCollection_DoubleMapNode**)myData2;
  Standard_Integer k2 = Hasher2::HashCode(K2,NbBuckets());
  Standard_Integer k1;
  TCollection_DoubleMapNode *p1, *p2, *q1, *q2;
  q1 = q2 = NULL;
  p2 = data2[k2];
  while (p2) {
    if (Hasher2::IsEqual(p2->Key2(),K2)) {
      // remove from the second
      if (q2)
	q2->Next2() = p2->Next2();
      else
	data2[k2] = (TCollection_DoubleMapNode*)p2->Next2();
      // remove from the first
      k1 = Hasher1::HashCode(p2->Key1(),NbBuckets());
      p1 = data1[k1];
      while (p1) {
	if (p2 == p1) {
	  if (q1)
	    q1->Next() = p1->Next();
	  else
	    data1[k1] = (TCollection_DoubleMapNode*) p1->Next();
	  break;
	}
	q1 = p1;
	p1 = (TCollection_DoubleMapNode*)  p1->Next();
      }
      delete p2;
      Decrement();
      return Standard_True;
    }
    q2 = p2;
    p2 = (TCollection_DoubleMapNode*)p2->Next2();
  }
  return Standard_False;
}

// method of the iterator

//=======================================================================
//function : Key1
//purpose  : 
//=======================================================================

const TheKey1& TCollection_DoubleMapIterator::Key1() const
{
  Standard_NoSuchObject_Raise_if(!More(),"TCollection_DoubleMapIterator::Key1");  
  return ((TCollection_DoubleMapNode*) myNode)->Key1();
}

//=======================================================================
//function : Key2
//purpose  : 
//=======================================================================

const TheKey2& TCollection_DoubleMapIterator::Key2() const
{
  Standard_NoSuchObject_Raise_if(!More(),"TCollection_DoubleMapIterator::Key2");  
  return ((TCollection_DoubleMapNode*) myNode)->Key2();
}


// @@SDM: begin

// Copyright Open CasCade......................................Version    5.0-00
// Lastly modified by : szy                                    Date :  7-05-2003

// File history synopsis (creation,modification,correction)
// +---------------------------------------------------------------------------+
// ! Developer !              Comments                   !   Date   ! Version  !
// +-----------!-----------------------------------------!----------!----------+
// !       rle ! Creation                                ! 8-01-1993! 5.0-00-3!
// !       szy ! Modified Assign method                  ! 7-05-2003! 5.0-00-3!
// +---------------------------------------------------------------------------+

// @@SDM: end