代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/284998/8878255
cpp priorityqueue2.cpp
//: C04:PriorityQueue2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Changing the priority
#i
www.eeworm.com/read/185150/9055510
cpp 2_6.cpp
//2_6.cpp
#include
using namespace std;
void main(void)
{
int n, right_digit, newnum = 0;
cout > n;
cout
www.eeworm.com/read/381159/9106908
h fft2.h
#ifndef FFT2_H_INCLUDED
#define FFT2_H_INCLUDED
#include
#include "complex.h"
#include
const double PI = 3.14159;
void fft2(complex *X,int N);
void reverse(complex *X,i
www.eeworm.com/read/281673/9142600
cpp priorityqueue2.cpp
//: C04:PriorityQueue2.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Changing the priority
#i
www.eeworm.com/read/183326/9169896
6 gdc.6
.\" $Id: gdc.6,v 1.2 2003/03/15 20:50:03 tom Exp $
.TH GDC 6
.SH NAME
gdc \- grand digital clock (curses)
.SH SYNOPSIS
.B gdc
[-s] [
.I n
]
.SH DESCRIPTION
.I Gdc
runs a digital clock made of reverse-
www.eeworm.com/read/377834/9260676
cpp 算法分析_3次反转算法.cpp
/************************************************************************/
/*数字k将数组a分成两部分:a[0:k-1]，a[k:n-1] 分别记为U,V;换位算法要求将
UV变为VU 。3次反转算法先将U反转为U(-1),再将V反转为V(-1),最后将U(-1)V(-1)
反转为VU。3次反转算法用了floor(k
www.eeworm.com/read/377683/9266134
test collate9.test
#
# 2007 November 12
#
# The author disclaims copyright to this source code. In place of
# a legal notice, here is a blessing:
#
# May you do good and not evil.
# May you find forgiveness for y
www.eeworm.com/read/178564/9391659
h stl_iterator.h
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
www.eeworm.com/read/178378/9404352
cpp priorityqueue2.cpp
//: C20:PriorityQueue2.cpp
// From Thinking in C++, 2nd Edition
// at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Changing the priority
#include
www.eeworm.com/read/169910/9833210
c fbit_rev.c
/*
fbit_rev.c
Arrange input samples in bit-reverse addressing order
- the index j is the bit reverse of i
*/
#include "fcomplex.h" /* floating-point complex.h header file */