973c2be1 |
1 | // Copyright (c) 1999-2014 OPEN CASCADE SAS |
b311480e |
2 | // |
973c2be1 |
3 | // This file is part of Open CASCADE Technology software library. |
b311480e |
4 | // |
d5f74e42 |
5 | // This library is free software; you can redistribute it and/or modify it under |
6 | // the terms of the GNU Lesser General Public License version 2.1 as published |
973c2be1 |
7 | // by the Free Software Foundation, with special exception defined in the file |
8 | // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT |
9 | // distribution for complete text of the license and disclaimer of any warranty. |
b311480e |
10 | // |
973c2be1 |
11 | // Alternatively, this file may be used under the terms of Open CASCADE |
12 | // commercial license or contractual agreement. |
b311480e |
13 | |
7fd59977 |
14 | |
42cf5bc1 |
15 | #include <Interface_EntityIterator.hxx> |
16 | #include <Standard_OutOfRange.hxx> |
17 | #include <StepData_Field.hxx> |
18 | #include <StepData_FieldList.hxx> |
7fd59977 |
19 | |
20 | static StepData_Field nulfild; |
21 | |
e6f550da |
22 | StepData_FieldList::~StepData_FieldList() |
23 | { |
24 | } |
25 | |
7fd59977 |
26 | StepData_FieldList::StepData_FieldList () { } |
27 | |
28 | Standard_Integer StepData_FieldList::NbFields () const |
29 | { return 0; } |
30 | |
35e08fe8 |
31 | const StepData_Field& StepData_FieldList::Field (const Standard_Integer) const |
7fd59977 |
32 | { |
9775fa61 |
33 | throw Standard_OutOfRange("StepData_FieldList : Field"); |
7fd59977 |
34 | } |
35 | |
35e08fe8 |
36 | StepData_Field& StepData_FieldList::CField (const Standard_Integer) |
7fd59977 |
37 | { |
9775fa61 |
38 | throw Standard_OutOfRange("StepData_FieldList : CField"); |
7fd59977 |
39 | } |
40 | |
41 | |
42 | void StepData_FieldList::FillShared (Interface_EntityIterator& iter) const |
43 | { |
44 | Standard_Integer i, nb = NbFields(); |
45 | for (i = 1; i <= nb; i ++) { |
46 | const StepData_Field& fi = Field(i); |
47 | if (fi.Kind() != 7) continue; // KindEntity |
48 | Standard_Integer i1,i2, nb1 = 1, nb2 = 1, ari = fi.Arity(); |
49 | if (ari == 1) nb1 = fi.Length(); |
50 | if (ari == 2) { nb1 = fi.Length(1); nb2 = fi.Length(2); } |
51 | for (i1 = 1; i1 <= nb1; i1 ++) |
52 | for (i2 = 1; i2 <= nb2; i2 ++) |
53 | iter.AddItem (fi.Entity(i1,i2)); |
54 | } |
55 | } |