代码搜索：shift
找到约 10,000 项符合「shift」的源代码
代码结果 10,000
www.eeworm.com/read/448529/7531908
m cirshftt.m
function y = cirshftt(x,m,N)
% Circular shift of m samples wrt size N in sequence x: (time domain)
% -------------------------------------------------------------------
% [y] = cirshftt(x,m,N)
% y
www.eeworm.com/read/447865/7544724
java md5.java
package utils.md5;
import java.io.*;
/**
* Fast implementation of RSA's MD5 hash generator in Java JDK Beta-2 or higher.
*
* Originally written by Santeri Paavolainen, Helsinki Finland
www.eeworm.com/read/439761/7701912
txt readme.txt
VoltMeter_ver1.1.zip
This zip file contains programming files and associated source code.
PROGRAMMING FILES:
-----------------
top_level.jed - JEDEC file used to program the CoolRunn
www.eeworm.com/read/439437/7709122
m cirshftt.m
function y = cirshftt(x,m,N)
% Circular shift of m samples wrt size N in sequence x: (time domain)
% -------------------------------------------------------------------
% [y] = cirshftt(x,m,N)
% y
www.eeworm.com/read/438437/7731250
args mpirun.ch_v.args
#!/bin/sh
case $arg in
-chv-jobid)
chvOptions="$chvOptions --jobid=\"$1\""
chv_jobid="$1"
shift;
device_knows_arg=1
;;
-chv-machines-file)
chvOptions="$
www.eeworm.com/read/438437/7731256
args mpirun.ch_v3.args
#! /bin/sh
#
# MPICH-V3
# Copyright (C) 2002, 2003 Groupe Cluster et Grid, LRI, Universite de Paris Sud
#
#
# This file is part of MPICH-V3.
#
# MPICH-V3 is free software; you can redistribute it
www.eeworm.com/read/438437/7731314
args mpirun.ch_v2.args
#! /bin/sh
#
# MPICH-V2
# Copyright (C) 2002, 2003 Groupe Cluster et Grid, LRI, Universite de Paris Sud
#
#
# This file is part of MPICH-V2.
#
# MPICH-V2 is free software; you can redistribute it
www.eeworm.com/read/434968/7799712
dat input.dat
with main; version=30 ;
type=mbs; eqtype = nonlinear; autogravity=true; eqn_ok=true; generation = direct; language=pascal; size=1; scene=3;
bkgcolor=15723509; gridcolor=16711680; axessaturati
www.eeworm.com/read/434781/7801999
java rightshifttest.java
// operators/RightShiftTest.java
// TIJ4 Chapter Operators, Exercise 11, page 116
/* Start with a number that has a binary one in the most significant position
* (hint: Use a hexadecimal constant)