3 * Copyright (c) 2007-2010 SlimDX Group
\r
5 * Permission is hereby granted, free of charge, to any person obtaining a copy
\r
6 * of this software and associated documentation files (the "Software"), to deal
\r
7 * in the Software without restriction, including without limitation the rights
\r
8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
\r
9 * copies of the Software, and to permit persons to whom the Software is
\r
10 * furnished to do so, subject to the following conditions:
\r
12 * The above copyright notice and this permission notice shall be included in
\r
13 * all copies or substantial portions of the Software.
\r
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
\r
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
\r
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
\r
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
\r
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
\r
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
\r
24 #include "IntersectInformation.h"
\r
26 using namespace System;
\r
32 bool IntersectInformation::operator == ( IntersectInformation left, IntersectInformation right )
\r
34 return IntersectInformation::Equals( left, right );
\r
37 bool IntersectInformation::operator != ( IntersectInformation left, IntersectInformation right )
\r
39 return !IntersectInformation::Equals( left, right );
\r
42 int IntersectInformation::GetHashCode()
\r
44 return FaceIndex.GetHashCode() + U.GetHashCode() + V.GetHashCode()
\r
45 + Distance.GetHashCode();
\r
48 bool IntersectInformation::Equals( Object^ value )
\r
50 if( value == nullptr )
\r
53 if( value->GetType() != GetType() )
\r
56 return Equals( safe_cast<IntersectInformation>( value ) );
\r
59 bool IntersectInformation::Equals( IntersectInformation value )
\r
61 return ( FaceIndex == value.FaceIndex && U == value.U && V == value.V
\r
62 && Distance == value.Distance );
\r
65 bool IntersectInformation::Equals( IntersectInformation% value1, IntersectInformation% value2 )
\r
67 return ( value1.FaceIndex == value2.FaceIndex && value1.U == value2.U && value1.V == value2.V
\r
68 && value1.Distance == value2.Distance );
\r