Update some dead links in the codebase

(cherry picked from commit 12ae7a4c02)
This commit is contained in:
Michael Alexsander Silva Dias 2019-07-23 21:06:12 -03:00 committed by Rémi Verschelde
parent 5a8fad0f4e
commit eef5dc98fa
6 changed files with 7 additions and 7 deletions

View file

@ -38,7 +38,7 @@
*/ */
// based on the very nice implementation of rb-trees by: // based on the very nice implementation of rb-trees by:
// http://web.mit.edu/~emin/www/source_code/red_black_tree/index.html // https://web.archive.org/web/20120507164830/http://web.mit.edu/~emin/www/source_code/red_black_tree/index.html
template <class K, class V, class C = Comparator<K>, class A = DefaultAllocator> template <class K, class V, class C = Comparator<K>, class A = DefaultAllocator>
class Map { class Map {

View file

@ -294,8 +294,8 @@ Vector<Plane> CameraMatrix::get_projection_planes(const Transform &p_transform)
/** Fast Plane Extraction from combined modelview/projection matrices. /** Fast Plane Extraction from combined modelview/projection matrices.
* References: * References:
* http://www.markmorley.com/opengl/frustumculling.html * https://web.archive.org/web/20011221205252/http://www.markmorley.com/opengl/frustumculling.html
* http://www2.ravensoft.com/users/ggribb/plane%20extraction.pdf * https://web.archive.org/web/20061020020112/http://www2.ravensoft.com/users/ggribb/plane%20extraction.pdf
*/ */
Vector<Plane> planes; Vector<Plane> planes;

View file

@ -39,7 +39,7 @@
*/ */
// based on the very nice implementation of rb-trees by: // based on the very nice implementation of rb-trees by:
// http://web.mit.edu/~emin/www/source_code/red_black_tree/index.html // https://web.archive.org/web/20120507164830/http://web.mit.edu/~emin/www/source_code/red_black_tree/index.html
template <class T, class C = Comparator<T>, class A = DefaultAllocator> template <class T, class C = Comparator<T>, class A = DefaultAllocator>
class Set { class Set {

View file

@ -305,7 +305,7 @@ public:
void reload_axis_lock(); void reload_axis_lock();
/// Doc: /// Doc:
/// http://www.bulletphysics.org/mediawiki-1.5.8/index.php?title=Anti_tunneling_by_Motion_Clamping /// https://web.archive.org/web/20180404091446/http://www.bulletphysics.org/mediawiki-1.5.8/index.php/Anti_tunneling_by_Motion_Clamping
void set_continuous_collision_detection(bool p_enable); void set_continuous_collision_detection(bool p_enable);
bool is_continuous_collision_detection_enabled() const; bool is_continuous_collision_detection_enabled() const;

View file

@ -70,7 +70,7 @@
* documentation for any purpose is hereby granted without fee, provided that * documentation for any purpose is hereby granted without fee, provided that
* the above copyright notice and this license appear in all source copies. * the above copyright notice and this license appear in all source copies.
* THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY OF * THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY OF
* ANY KIND. See http://www.dspguru.com/wol.htm for more information. * ANY KIND. See https://dspguru.com/wide-open-license/ for more information.
* *
*****************************************************************************/ *****************************************************************************/

View file

@ -673,7 +673,7 @@ public IEnumerable<Point3D> GetCellsOnRay(Ray ray, int maxDepth)
// "A Fast Voxel Traversal Algorithm for Ray Tracing" // "A Fast Voxel Traversal Algorithm for Ray Tracing"
// John Amanatides, Andrew Woo // John Amanatides, Andrew Woo
// http://www.cse.yorku.ca/~amana/research/grid.pdf // http://www.cse.yorku.ca/~amana/research/grid.pdf
// http://www.devmaster.net/articles/raytracing_series/A%20faster%20voxel%20traversal%20algorithm%20for%20ray%20tracing.pdf // https://web.archive.org/web/20100616193049/http://www.devmaster.net/articles/raytracing_series/A%20faster%20voxel%20traversal%20algorithm%20for%20ray%20tracing.pdf
// NOTES: // NOTES:
// * This code assumes that the ray's position and direction are in 'cell coordinates', which means // * This code assumes that the ray's position and direction are in 'cell coordinates', which means