代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/159030/5588904
java mdparalist.java
package CatDecaf.IR; // Java Package generated by the BNF Converter.
import parser.*;
import CatDecaf.Utilities.Debugger.*;
public class MdParaList implements CatDecaf.Utilities.Visitable
{
pub
www.eeworm.com/read/155175/5628623
java rowsortcomparator.java
package com.croftsoft.core.gui.table;
import java.util.*;
/*********************************************************************
* Sorts rows based upon comparison of elemen
www.eeworm.com/read/475959/6771626
cpp 6_2.cpp
#include
using namespace std;
int main()
{ const int SIZE=5; //语句1：定义符号常量用于设置数组大小
double Array[SIZE]; //语句2：将数组元素声明为双精度型
cout
www.eeworm.com/read/194440/8195120
m flipx.m
function flipx
% FLIPX: script to flip the direction of the x axis
%
% just type "flipx" at the matlab prompt
state=get(gca,'xdir');
if(strcmp(state,'normal'))
set(gca,'xdir','reverse')
else
www.eeworm.com/read/194440/8195133
m flipy.m
function flipy
% FLIPY: script to flip the direction of the y axis
%
% just type "flipy" at the matlab prompt
state=get(gca,'ydir');
if(strcmp(state,'normal'))
set(gca,'ydir','reverse')
else
www.eeworm.com/read/393250/8302276
txt 5.34.txt
void Reverse(GList &L)
/* 递归逆转广义表L */
{
GLNode *a[50];
GList p;
int i;
if(L->tag||L->un.ptr.tp){
for(i=0,p=L;p;p=p->un.ptr.tp,i++) {
if(p->un.ptr.hp)
www.eeworm.com/read/368008/9719766
c match.c
/*
* Do shell-style pattern matching for '?', '\', '[..]', and '*' wildcards.
* Returns 1 if match, 0 if not.
*/
#include
int
match(s, p)
char *s, *p;
{
int matched, reverse;
char fir
www.eeworm.com/read/269755/11079200
cpp tmt3.cpp
/// \ingroup newmat
///@{
/// \file tmt3.cpp
/// Part of matrix library test program.
//#define WANT_STREAM
#include "include.h"
#include "newmat.h"
#include "tmt.h"
#ifdef use_n
www.eeworm.com/read/269220/11105377
cpp f0305.cpp
//=====================================
// f0305.cpp
//=====================================
#include
#include
using namespace std;
//-------------------------------------
www.eeworm.com/read/265910/11250251
cpp 10_3.cpp
//10_3
#include
struct Node{
char c;
Node* next;
};
Node* reverse(Node* head);
void main()
{
Node x[4];
for(int i=0; i