代码搜索:reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/267293/4268103
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/152843/5659386
c speedstep-ich.c
/*
* (C) 2001 Dave Jones, Arjan van de ven.
* (C) 2002 - 2003 Dominik Brodowski
*
* Licensed under the terms of the GNU GPL License version 2.
* Based upon reverse engineered
www.eeworm.com/read/248620/12550131
h libc.h
#ifndef __LIBC
#define __LIBC
int strlen(char *buf);
char *reverse(char *buf);
char *itoa(int i,char *buf);
char * strcat (char *dest, const char *src);
char * stpcpy (char *dest, const char *
www.eeworm.com/read/133137/14053772
h primitives.h
// Primitives.cc New primitives not in primitives.cxx
// W. Langdon cs.ucl.ac.uk 25 January 1995
// $Revision: 1.29 $
//Modifications (in reverse order)
//WBL 4 Apr 97 Make compatible with DEC
www.eeworm.com/read/133137/14053949
cc pareto.cc
// pareto.cc File to perform pareto selection, build with GPQUICK-2.1
// W. Langdon cs.ucl.ac.uk 24 August 1994
//$Revision: 1.47 $
//Modifications (in reverse order)
//#define DEBUG
//WBL 31
www.eeworm.com/read/113029/15472115
cpp fig21_34.cpp
// Fig. 21.34: fig21_34.cpp
// Standard library algorithms inplace_merge,
// reverse_copy and unique_copy.
#include
using std::cout;
using std::endl;
#include // algo
www.eeworm.com/read/104053/15711613
news
NEWS: what has changed recently with procps, in reverse cronological order.
Please send bug reports to procps-bugs@redhat.com
NEWS for version 2.0.7 of procps
SMP support has been added to top. Th
www.eeworm.com/read/432289/8613976
cpp rparse.cpp
//: C18:Rparse.cpp
// From Thinking in C++, 2nd Edition
// at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Reverse the order of words in a string
#in
www.eeworm.com/read/427909/8913629
m assignedgenums.m
function [edge_id, nedges] = assignEdgeNums(adj_mat)
% give each edge a unique number
% we number (i,j) for j>i first, in row, column order.
% Then we number the reverse links
nnodes = length(ad
www.eeworm.com/read/185238/9048560
c function.c
#include
#include
#include "Setting.H"
#include "RS.H"
#include "costable.h"
#include "sintable.h"
/* Input is in reverse order, output is in natural order;
* FFT is samplin