0027664: Incomplete intersection curve from the attached shapes
[occt.git] / src / IntPatch / IntPatch_PrmPrmIntersection_T3Bits.cxx
CommitLineData
b311480e 1// Created on: 1999-12-16
2// Created by: Atelier CAS2000
3// Copyright (c) 1999-1999 Matra Datavision
973c2be1 4// Copyright (c) 1999-2014 OPEN CASCADE SAS
b311480e 5//
973c2be1 6// This file is part of Open CASCADE Technology software library.
b311480e 7//
d5f74e42 8// This library is free software; you can redistribute it and/or modify it under
9// the terms of the GNU Lesser General Public License version 2.1 as published
973c2be1 10// by the Free Software Foundation, with special exception defined in the file
11// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12// distribution for complete text of the license and disclaimer of any warranty.
b311480e 13//
973c2be1 14// Alternatively, this file may be used under the terms of Open CASCADE
15// commercial license or contractual agreement.
7fd59977 16
42cf5bc1 17
18#include <IntPatch_PrmPrmIntersection_T3Bits.hxx>
7fd59977 19
20IntPatch_PrmPrmIntersection_T3Bits::IntPatch_PrmPrmIntersection_T3Bits(const Standard_Integer size)
21{
22 //-- ex: size=4 -> 4**3 = 64 bits -> 2 mots 32bits
23 Standard_Integer nb = (size*size*size)>>5;
24 Isize = nb;
25 p = new Standard_Integer [nb];
26 do { ((Standard_Integer *) p)[--nb]=0; } while(nb);
27}
28
29void IntPatch_PrmPrmIntersection_T3Bits::Destroy()
30{
31 if(p) { delete[] ((Standard_Integer*)p); p=NULL; }
32}
33
34void IntPatch_PrmPrmIntersection_T3Bits::ResetAnd()
35{
36 //ind = 0;
37}
38
39Standard_Integer IntPatch_PrmPrmIntersection_T3Bits::And(IntPatch_PrmPrmIntersection_T3Bits& Oth,
40 Standard_Integer& indice)
41{
42 int k=indice>>5;
7fd59977 43 while(k<Isize)
44 {
45 Standard_Integer r=((Standard_Integer *) p)[k] & ((Standard_Integer *) Oth.p)[k];
46 if(r)
47 {
48 unsigned long int c=0;
49 do
50 {
51 if(r&1)
52 {
53 const Standard_Integer op = (k<<5)|(c);
54 Raz(op);
55 Oth.Raz(op);
56 indice = op;
57 return(1);
58 }
59 c++;
60 r>>=1;
61 }
62 while(c<32);
63 }
64 k++;
65 }
66 return(0);
67}