代码搜索：gives
找到约 3,869 项符合「gives」的源代码
代码结果 3,869
www.eeworm.com/read/140466/13079107
readme
EXAMPLE 5: POLISH
This example shows how Memphis can be used to process
Gentle structures in C/C++ code.
Like Memphis, Gentle supports domains types and pattern matching.
Unlike Memphis, Gentle prov
www.eeworm.com/read/144216/5752067
magic
sv_magic()
----------
av.c
av_store()
Storing a non-undef element into an SMAGICAL array, av,
assigns the equivalent lowercase form of magic (of the first
MAGIC in the chain) to the value (with obj
www.eeworm.com/read/134009/5895959
magic
sv_magic()
----------
av.c
av_store()
Storing a non-undef element into an SMAGICAL array, av,
assigns the equivalent lowercase form of magic (of the first
MAGIC in the chain) to the value (with obj
www.eeworm.com/read/156531/5611513
magic
sv_magic()
----------
av.c
av_store()
Storing a non-undef element into an SMAGICAL array, av,
assigns the equivalent lowercase form of magic (of the first
MAGIC in the chain) to the value (wi
www.eeworm.com/read/184884/9068218
txt readme.txt
This package simulates the protocols of Chapter 3 of "Computer Networks 3/e"
by Andrew S. Tanenbaum, published by Prentice Hall PTR, 1996. It was written
by Andrew S. Tanenbaum and may be freely dist
www.eeworm.com/read/166212/10029111
readme
This package simulates the protocols of Chapter 3 of "Computer Networks 3/e"
by Andrew S. Tanenbaum, published by Prentice Hall PTR, 1996. It was written
by Andrew S. Tanenbaum and may be freely dist
www.eeworm.com/read/459145/7280326
readme
This package simulates the protocols of Chapter 3 of "Computer Networks 3/e"
by Andrew S. Tanenbaum, published by Prentice Hall PTR, 1996. It was written
by Andrew S. Tanenbaum and may be freely dist
www.eeworm.com/read/241323/13156438
m legexp.m
%> The file gives a demo of the Legendre polynomials and
%> associated Legendre functions.
%> It also calculates expansions of functions in such a ON basis.
%> The definition of the Lege
www.eeworm.com/read/137901/13280784
readme
This package simulates the protocols of Chapter 3 of "Computer Networks 3/e"
by Andrew S. Tanenbaum, published by Prentice Hall PTR, 1996. It was written
by Andrew S. Tanenbaum and may be freely dist
www.eeworm.com/read/144216/5752555
t cmp.t
#!./perl
@FOO = ('s', 'N/A', 'a', 'NaN', -1, undef, 0, 1);
$expect = ($#FOO+2) * ($#FOO+1);
print "1..$expect\n";
my $ok = 0;
for my $i (0..$#FOO) {
for my $j ($i..$#FOO) {
$ok++;
my $cmp = $