代码搜索:efficient

找到约 1,594 项符合「efficient」的源代码

代码结果 1,594
www.eeworm.com/read/128531/5985187

s memset.s

/* * linux/arch/alpha/memset.S * * This is an efficient (and small) implementation of the C library "memset()" * function for the alpha. * * (C) Copyright 1996 Linus Torvalds * * This routine
www.eeworm.com/read/127781/5996344

s memset.s

/* * linux/arch/alpha/memset.S * * This is an efficient (and small) implementation of the C library "memset()" * function for the alpha. * * (C) Copyright 1996 Linus Torvalds * * This routine
www.eeworm.com/read/110034/6167782

s memset.s

/* * linux/arch/alpha/memset.S * * This is an efficient (and small) implementation of the C library "memset()" * function for the alpha. * * (C) Copyright 1996 Linus Torvalds * * This routine
www.eeworm.com/read/102935/6226627

s memset.s

/* * linux/arch/alpha/memset.S * * This is an efficient (and small) implementation of the C library "memset()" * function for the alpha. * * (C) Copyright 1996 Linus Torvalds * * This routine
www.eeworm.com/read/339620/12216779

m manual_corner_extraction_no_read.m

%% This code allows complete manual reselection of every corner in the %% images. %% This tool is specifically useful in the case of highly distorted images. %% %% Use it when in memory efficient
www.eeworm.com/read/127767/14337308

txt e417. finding a preference in a preference tree.txt

There is no efficient method for finding a key in a preference node. All the nodes must be traversed and checked for the presence of the key. This example implements such a method. This example can
www.eeworm.com/read/225935/14510362

m manual_corner_extraction_no_read.m

%% This code allows complete manual reselection of every corner in the %% images. %% This tool is specifically useful in the case of highly distorted images. %% %% Use it when in memory efficient
www.eeworm.com/read/117560/14915742

txt radarfdtd.txt

NAME radarFDTD - a full 3D simulation of electromagnetic waves with efficient absorbing boundary conditions SYNOPSIS radarFDTD directory [configuration file] DESCRIPTION When started
www.eeworm.com/read/214343/15104996

java mergeableheap.java

package structure; /** * Interface describing mergeable min heaps. * Min heaps are collections of Comparable data that guarantee * efficient access to the smallest element in the structure. * Me
www.eeworm.com/read/489223/1225817

sgml memory_slices.sgml

Memory Slices efficient way to allocate groups of equal-sized chunks of memory