代码搜索:recursive

找到约 2,177 项符合「recursive」的源代码

代码结果 2,177
www.eeworm.com/read/375190/2739801

cpp recursive_variant_test.cpp

//----------------------------------------------------------------------------- // boost-libs variant/test/recursive_variant_test.cpp source file // See http://www.boost.org for updates, documentation
www.eeworm.com/read/366702/2876084

f90 write_recursive.f90

! { dg-do run } ! PR26766 Recursive I/O with internal units ! Test case derived from example in PR ! Submitted by Jerry DeLisle program pr26766 implicit none character (le
www.eeworm.com/read/366702/2876187

f recursive_check_1.f

! { dg-do compile } ! PR fortran/26551 SUBROUTINE SUB() CALL SUB() ! { dg-error "cannot call itself, as it is not RECURSIVE" } END SUBROUTINE FUNCTION FUNC() RESULT (FOO)
www.eeworm.com/read/366702/2876897

f90 recursive_stack.f90

! { dg-do run } ! { dg-options "-frecursive" } program recursive_stack call foo (.true.) end program recursive_stack subroutine foo (recurse) logical recurse integer iarray(100,100) if (recur
www.eeworm.com/read/160391/5571788

m recursive_combine_pots.m

function pot = recursive_combine_pots(pot1, pot2) % RECURSIVE_COMBINE_POTS recursive combine two potentials % pot = recursive_combine_pots(pot1, pot2) pot1 = reduce_pot(pot1); pot2 = reduce_pot(
www.eeworm.com/read/269492/11096774

m recursive_likelyhood_estimate.m

递推的极大似然辨识程序 clear %清零 a(1)=1;b(1)=0;c(1)=1;d(1)=0;u(1)=d(1);z(1)=0;z(2)=0; %初始化 for i=2:1200 %产生m序列u(i) a(i)=xor(c(i-1),d(i-1)); b(i)=a(i-1); c(i)=b(i-1); d(i)=c(i-1); u(i)=d(i); end u; %
www.eeworm.com/read/434325/7874317

m rctrap.m

function T = rctrap(f,a,b,n) %--------------------------------------------------------------------------- %RCTRAP Quadrature using the recursive trapezoidal rule. % Sample call % T = rctrap('f
www.eeworm.com/read/421644/10718206

npp recursive_write_natural.adb.npp

with Ada.Text_Io; use Ada.Text_Io; procedure Recursive_program is procedure Write_Natural( Num : Natural) is First_Digit : Natural; --Unit digit Other_Digits : Natural; --All except first digit beg