代码搜索：zero
找到约 10,000 项符合「zero」的源代码
代码结果 10,000
www.eeworm.com/read/367274/9763284
ph ptmri8a.ph
%PS_Times_Italic = (
name => 'Times-Italic',
widths => {
"multiply" => 675, "Ntilde" => 667, "zero" => 500, "eth" => 500,
"Ograve" => 722, "uacute" => 500, "braceleft" => 400,
"
www.eeworm.com/read/367274/9763299
ph phvl8a.ph
%PS_Helvetica_Light = (
name => 'Helvetica-Light',
widths => {
"multiply" => 660, "Ntilde" => 722, "zero" => 556, "eth" => 556,
"Ograve" => 778, "uacute" => 556, "braceleft" => 333,
www.eeworm.com/read/367274/9763303
ph putbi8a.ph
%PS_Utopia_BoldItalic = (
name => 'Utopia-BoldItalic',
widths => {
"Ntilde" => 741, "multiply" => 600, "zero" => 560, "eth" => 562,
"Ograve" => 761, "uacute" => 634, "braceleft" => 34
www.eeworm.com/read/367274/9763313
ph pbkl8a.ph
%PS_Bookman_Light = (
name => 'Bookman-Light',
widths => {
"multiply" => 600, "Ntilde" => 740, "zero" => 620, "eth" => 560,
"Ograve" => 800, "uacute" => 680, "braceleft" => 280,
www.eeworm.com/read/367274/9763329
ph pplb8a.ph
%PS_Palatino_Bold = (
name => 'Palatino-Bold',
widths => {
"multiply" => 606, "Ntilde" => 833, "zero" => 500, "eth" => 556,
"Ograve" => 833, "uacute" => 611, "braceleft" => 310,
www.eeworm.com/read/367274/9763335
ph putri8a.ph
%PS_Utopia_Italic = (
name => 'Utopia-Italic',
widths => {
"Ntilde" => 763, "multiply" => 570, "zero" => 530, "eth" => 537,
"Ograve" => 753, "uacute" => 618, "braceleft" => 340,
www.eeworm.com/read/367274/9763339
ph phvro8a.ph
%PS_Helvetica_Oblique = (
name => 'Helvetica-Oblique',
widths => {
"multiply" => 584, "Ntilde" => 722, "zero" => 556, "eth" => 556,
"Ograve" => 778, "uacute" => 556, "braceleft" => 33
www.eeworm.com/read/170836/9785612
h network.h
/*
* Networking abstraction in PuTTY.
*
* The way this works is: a back end can choose to open any number
* of sockets - including zero, which might be necessary in some.
* It can register a
www.eeworm.com/read/415696/11057524
m oversamp.m
% Program 3-4
% oversamp.m
%
% Insert zero data to input data
%
% Programmed by H.Harada
%
function [out] = oversamp( indata, nsymb , sample)
%****************** variables ***************
www.eeworm.com/read/266379/11229016
cpp fig10_53.cpp
/**
* Compute all-shortest paths.
* a contains the adjacency matrix with
* a[ i ][ i ] presumed to be zero.
* d contains the values of the shortest path.
* Vertices are numbered starting at