mitsuba-af602c6fd98a/src/shapes/hair.cpp
/**
	 * \brief Intersect a ray with all segments stored in the kd-tree
	 * (Visiblity query version)
	 */
\brief Intersect a ray with all segments stored in the kd-tree
(Visiblity query version)
\ brief Intersect a ray with all segments stored in the kd - tree ( Visiblity query version )
inline bool rayIntersect(const Ray &ray, Float _mint, Float _maxt) const {
		Float tempT = std::numeric_limits<Float>::infinity();
		Float mint, maxt;
		if (m_aabb.rayIntersect(ray, mint, maxt)) {
			if (_mint > mint) mint = _mint;
			if (_maxt < maxt) maxt = _maxt;
			if (EXPECT_TAKEN(maxt > mint)) {
				if (rayIntersectHavran<true>(ray, mint, maxt, tempT, NULL))
					return true;
			}
		}
		return false;
	}
inline bool rayIntersect ( const Ray & ray , Float _mint , Float _maxt ) const { Float tempT = std :: numeric_limits < Float > :: infinity ( ) ; Float mint , maxt ; if ( m_aabb . rayIntersect ( ray , mint , maxt ) ) { if ( _mint > mint ) mint = _mint ; if ( _maxt < maxt ) maxt = _maxt ; if ( EXPECT_TAKEN ( maxt > mint ) ) { if ( rayIntersectHavran < true > ( ray , mint , maxt , tempT , NULL ) ) return true ; } } return false ; }
\brief Intersect a ray with all segments stored in the kd-tree
 (Visiblity query version)
\ brief Intersect a ray with all segments stored in the kd - tree ( Visiblity query version )