代码搜索:Fast

找到约 10,000 项符合「Fast」的源代码

代码结果 10,000
www.eeworm.com/read/403190/2313985

svn-base toolbox_fast_marching.m.svn-base

K 14 svn:executable V 0 END
www.eeworm.com/read/403190/2314036

svn-base perform_fast_marching.m.svn-base

function [D,S,Q] = perform_fast_marching(W, start_points, options) % perform_fast_marching - launch the Fast Marching algorithm, in 2D or 3D. % % [D,S,Q] = perform_fast_marching(W, start_points, op
www.eeworm.com/read/403190/2314038

svn-base toolbox_fast_marching.m.svn-base

% Toolbox Fast Marching - a toolbox for the computation of the Fast % Marching algorithm both in 2D and 3D. % % The Fast Marching algorithm, introduced by Sethian (1996) is a numerical % algorithm
www.eeworm.com/read/375190/2731552

hpp x86_fast_rounding_control.hpp

/* Boost interval/detail/x86gcc_rounding_control.hpp file * * This header provides a rounding control policy * that avoids flushing results to memory. In * order for this optimization to be reliab
www.eeworm.com/read/373367/2764378

cc gr_fast_atan2f.cc

/* -*- c++ -*- */ /* * Copyright 2005 Free Software Foundation, Inc. * * This file is part of GNU Radio * * GNU Radio is free software; you can redistribute it and/or modify * it under the ter
www.eeworm.com/read/366702/2876106

f90 fast-math-pr33299.f90

! { dg-require-effective-target vect_double } PROGRAM test REAL(8) :: f,dist(2) dist = [1.0_8, 0.5_8] if( f(1.0_8, dist) /= MINVAL(dist)) then call abort () endif END PROGRAM test FUNCTI
www.eeworm.com/read/366702/2880507

c fast-math-vect-pow-1.c

/* { dg-do compile } */ /* { dg-require-effective-target vect_float } */ float x[256]; void foo(void) { int i; for (i=0; i
www.eeworm.com/read/366702/2880537

c fast-math-vect-reduc-5.c

/* { dg-require-effective-target vect_float } */ /* need -funsafe-math-optimizations to vectorize the summation. also need -ffinite-math-only to create the min/max expr. */ #include #
www.eeworm.com/read/366702/2880591

c fast-math-vect-pow-2.c

/* { dg-do compile } */ typedef double d_type; struct { d_type x; d_type y; } S[100]; #define N 16 d_type foo (d_type t); d_type main1 () { int i; d_type t; for (i = 0; i < N; i++) {
www.eeworm.com/read/366702/2880796

c fast-math-vect-pr25911.c

/* { dg-do compile } */ float bessel_Kn_scaled_small_x(int n) { int k; float k_term, sum1; for(k=1; k