recursive是什么意思

recursive生词本

英 [rɪˈkɜ:sɪv]

美 [rɪˈkɜ:rsɪv]

adj. 回归的，递归的

双语例句

1. The syntax analyzer has one recursive procedure for each nonterminal U. 对于每个非终结符号U,语法分析程序都有一个递归过程.

来自辞典例句

2. There is a recursive formula for the number of spanning trees in a graph. 对于一个图的生成树的棵数,存在一个递推公式.

来自辞典例句

3. Recursive TimeOuts is the total number of recursive query sending timeouts. 递归超时是指递归查询发送超时总数.

来自互联网

4. The final parser composite is a non - deterministic recursive - descent parser with infinite look - ahead. 最终分析器的合成物是一个 非 确定性的无限递推分析器.

来自互联网

5. So recursive function will not get the right results. 使递归函数不能得到正确的结果.

来自互联网

recursive

adj.

回归的, 递归的

习惯用语 | 词性变化 | 参考词汇 | 更多...近/反义词[七国语言]英汉公共大词典

基本解释

recursive

递归的

例句

recursive function

递归函数

recursive orbit

回归轨道

recursive estimation algorithm

递推估计算法

自己到在线词典上查

 

 

你必须用 File 类（）。

写了个简单的例子让你参考：

import java.io.*

import java.util.*

class SimpleLocalDriveSearch {

    private List result = new ArrayList( )

    private void recursiveSearch( File rootDir, String suffix ) {

        File[ ] files = rootDir.listFiles( )

        if ( files != null )

            for ( int i = 0i <files.lengthi++ ) {

                if ( files[ i ].isFile( ) &&files[ i ].getName( ).endsWith( suffix ) )

                    result.add( files[ i ] )

                recursiveSearch( files[ i ], suffix )

            }

    }

    public List search( File startDir, String matchingExtension ) {

        result.clear( )

        recursiveSearch( startDir, "." + matchingExtension )

        return result

    }

    public static void main( String[ ] args ) throws Exception {

        System.out.println( "Enter the extension of files to be searched for:" )

        String ext = new BufferedReader( new InputStreamReader( System.in ) ).readLine( )

        SimpleLocalDriveSearch slds = new SimpleLocalDriveSearch( )

        File[ ] roots = File.listRoots( )

        for ( int i = 0i <roots.lengthi++ ) {

            List found = slds.search( roots[ i ], ext )

            if ( found.size( ) >0 )

                for ( Iterator iter = found.iterator( )iter.hasNext( ))

                    System.out.println( iter.next( ) )

            else

                System.out.println( "No match on " + roots[ i ] )

        }

    }

}

 

 

 

---