代码搜索结果

找到约 10,000 项符合 S 的代码

counter.js

function s_rep(s, o, n) { var i = s.indexOf(o), l = n.length > 0 ? n.length : 1; while (s && i >= 0) { s = s.substring(0, i) + n + s.substring(i + o.length);

counter.js

function s_rep(s, o, n) { var i = s.indexOf(o), l = n.length > 0 ? n.length : 1; while (s && i >= 0) { s = s.substring(0, i) + n + s.substring(i + o.length);

counter.js

function s_rep(s, o, n) { var i = s.indexOf(o), l = n.length > 0 ? n.length : 1; while (s && i >= 0) { s = s.substring(0, i) + n + s.substring(i + o.length);

counter.js

function s_rep(s, o, n) { var i = s.indexOf(o), l = n.length > 0 ? n.length : 1; while (s && i >= 0) { s = s.substring(0, i) + n + s.substring(i + o.length);

exm041~8.m

%exm0414_1.m rand('<mark>s</mark>tate',0);a=rand(2,2); %产生 随机阵 <mark>s</mark>1=num2<mark>s</mark>tr(a) %把数值数组转换为串数组 <mark>s</mark>_<mark>s</mark>=<mark>s</mark>printf('%.10e\n',a) %10数位科学记述串,每写一个元素就换行。 fprintf('%.5g\\',a) %以5位数位最短形式显示。不能赋值用 <mark>s</mark>_<mark>s</mark><mark>s</mark>can=<mark>s</mark><mark>s</mark>canf(<mark>s</mark>_<m ...

usbio_ti.inf

; ; USBIO Setup Information file ; Copyright (c) Thesycon GmbH 1998-2001 ; ; To create a customized version of this file ; modify sections marked with ### modify here ### ; For details, refer to

alloc.c

# /* */ #include "../param.h" #include "../systm.h" #include "../filsys.h" #include "../conf.h" #include "../buf.h" #include "../inode.h" #include "../user.h" /* * iinit is called once (from main)

string_add.cpp

/* * This file contains code from "C++ Primer, Fourth Edition", by Stanley B. * Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the * copyright and warranty notices given in that

string_add.cpp

/* * This file contains code from "C++ Primer, Fourth Edition", by Stanley B. * Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the * copyright and warranty notices given in that

string_add.cpp

/* * This file contains code from "C++ Primer, Fourth Edition", by Stanley B. * Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the * copyright and warranty notices given in that