代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/451253/6367678
h md5.h
#ifndef MD5_H
#define MD5_H
/* The following tests optimise behaviour on little-endian
machines, where there is no need to reverse the byte order
of 32 bit words in the MD5 computation. By
www.eeworm.com/read/479166/6700029
cpp fig20_34.cpp
// Fig. 20.34: fig20_34.cpp
// Standard Library algorithms inplace_merge,
// reverse_copy and unique_copy.
#include
using std::cout;
using std::endl;
#include // algorit
www.eeworm.com/read/258097/11885914
h bitop.h
#ifndef __BITOP_H
#define __BITOP_H
// revn(): reverse #n LSB bit order
unsigned revn(unsigned u, int n);
//
// getbits utility for gunzip
// *note* this getbits utility is:
// 1. byte-orie
www.eeworm.com/read/118495/14868549
h revname.h
/***
revname.h - public declarations related to reverse name resolution
***/
int rvnamedactive();
int killrvnamed();
void open_rvn_socket(int *fd);
void close_rvn_socket(int fd);
int revname(int *l
www.eeworm.com/read/218565/14915257
h md5.h
#ifndef MD5_H
#define MD5_H
/* The following tests optimise behaviour on little-endian
machines, where there is no need to reverse the byte order
of 32 bit words in the MD5 computation. By
www.eeworm.com/read/208576/15243904
cpp fig23_34.cpp
// Fig. 23.34: Fig23_34.cpp
// Standard Library algorithms inplace_merge,
// reverse_copy and unique_copy.
#include
using std::cout;
using std::endl;
#include // algorit
www.eeworm.com/read/38039/1095801
mnu plunge.mnu
PLUNGE
#
Lace
Do lacing when hit side.
#
Start#at#side
Start spiral at side of region.
#
Outside#clean
There is no material outside region of current machining.
#
Reverse#toolpath
Reversed toolpath b
www.eeworm.com/read/487452/1236386
js treefilter-min.js
Ext.tree.TreeFilter=function(a,b){this.tree=a;this.filtered={};Ext.apply(this,b)};Ext.tree.TreeFilter.prototype={clearBlank:false,reverse:false,autoClear:false,remove:false,filter:function(d,a,b){a=a|
www.eeworm.com/read/474783/1391332
js treefilter-min.js
Ext.tree.TreeFilter=function(a,b){this.tree=a;this.filtered={};Ext.apply(this,b)};Ext.tree.TreeFilter.prototype={clearBlank:false,reverse:false,autoClear:false,remove:false,filter:function(d,a,b){a=a|
www.eeworm.com/read/471667/1426719
java reversemap.java
// Copyright (c) 2003-2004 Brian Wellington (bwelling@xbill.org)
package org.xbill.DNS;
import java.net.*;
/**
* A set functions designed to deal with DNS names used in reverse mappings.
* For th