mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-06-02 18:06:43 +08:00
d5f74e42d6
License statement text corrected; compiler warnings caused by Bison 2.41 disabled for MSVC; a few other compiler warnings on 54-bit Windows eliminated by appropriate type cast Wrong license statements corrected in several files. Copyright and license statements added in XSD and GLSL files. Copyright year updated in some files. Obsolete documentation files removed from DrawResources.
78 lines
2.9 KiB
Plaintext
78 lines
2.9 KiB
Plaintext
-- Created on: 1992-09-23
|
|
-- Created by: Christian CAILLET
|
|
-- Copyright (c) 1992-1999 Matra Datavision
|
|
-- Copyright (c) 1999-2014 OPEN CASCADE SAS
|
|
--
|
|
-- This file is part of Open CASCADE Technology software library.
|
|
--
|
|
-- This library is free software; you can redistribute it and/or modify it under
|
|
-- the terms of the GNU Lesser General Public License version 2.1 as published
|
|
-- by the Free Software Foundation, with special exception defined in the file
|
|
-- OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
|
-- distribution for complete text of the license and disclaimer of any warranty.
|
|
--
|
|
-- Alternatively, this file may be used under the terms of Open CASCADE
|
|
-- commercial license or contractual agreement.
|
|
|
|
class Compare from IFGraph inherits GraphContent
|
|
|
|
---Purpose : this class evaluates effect of two compared sub-parts :
|
|
-- cumulation (union), common part (intersection-overlapping)
|
|
-- part specific to first sub-part or to the second one
|
|
-- Results are kept in a Graph, several question can be set
|
|
-- Basic Iteration gives Cumulation (union)
|
|
|
|
uses Transient, EntityIterator, Graph
|
|
|
|
is
|
|
|
|
Create (agraph : Graph) returns Compare;
|
|
---Purpose : creates empty Compare, ready to work
|
|
|
|
GetFromEntity (me : in out; ent : any Transient; first : Boolean);
|
|
---Purpose : adds an entity and its shared ones to the list :
|
|
-- first True means adds to the first sub-list, else to the 2nd
|
|
|
|
GetFromIter (me : in out; iter : EntityIterator; first : Boolean);
|
|
---Purpose : adds a list of entities (as an iterator) as such, that is,
|
|
-- their shared entities are not considered (use AllShared to
|
|
-- have them)
|
|
-- first True means adds to the first sub-list, else to the 2nd
|
|
|
|
Merge (me : in out);
|
|
---Purpose : merges the second list into the first one, hence the second
|
|
-- list is empty
|
|
|
|
RemoveSecond (me : in out);
|
|
---Purpose : Removes the contents of second list
|
|
|
|
KeepCommon (me : in out);
|
|
---Purpose : Keeps only Common part, sets it as First list and clears
|
|
-- second list
|
|
|
|
ResetData (me : in out);
|
|
---Purpose : Allows to restart on a new data set
|
|
|
|
-- -- Results -- --
|
|
-- More-Next-Value-Entity give all entities taken into the Cumulation
|
|
-- other informations are provided, as EntityIterator : hence they
|
|
-- are available for other evaluations
|
|
|
|
Evaluate (me : in out) is redefined;
|
|
---Purpose : Recomputes result of comparing to sub-parts
|
|
|
|
Common (me) returns EntityIterator;
|
|
---Purpose : returns entities common to the both parts
|
|
|
|
FirstOnly (me) returns EntityIterator;
|
|
---Purpose : returns entities which are exclusively in the first list
|
|
|
|
SecondOnly (me) returns EntityIterator;
|
|
---Purpose : returns entities which are exclusively in the second part
|
|
|
|
fields
|
|
|
|
thegraph : Graph;
|
|
|
|
end Compare;
|