代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/168845/5434264
cpp tuple_from_list.cpp
// Copyright Aleksey Gurtovoy 2002-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_
www.eeworm.com/read/163883/5507008
h stl_iterator_base.h
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Copyright (c) 1996-1998
* Silicon Graphics Computer Systems, Inc.
*
* Copyright (c) 1997
* Moscow Center for SPARC Technology
www.eeworm.com/read/162614/5523728
ada c55b03a.ada
-- C55B03A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025,
www.eeworm.com/read/162614/5539598
cc 1.cc
// Copyright (C) 2001, 2004, 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under t
www.eeworm.com/read/161438/5553585
cpp purevirt.cpp
#include
#include
class Base
{
public:
virtual void show_message(void) { cout
www.eeworm.com/read/161438/5553636
cpp strclass.cpp
#include
#include
class StringClass
{
public:
void str_reverse(char *string)
{
if (*string)
{
www.eeworm.com/read/153824/5644842
am makefile.am
EXTRA_DIST = 127.0.0 atm-reverse e164_cc pdf2e164_cc.pl resolv.conf 192.168.27
bind-498-REL.patch hosts2ans.pl README atm named.conf README.DNS
www.eeworm.com/read/153664/5645564
m invmeyerpartition.m
function x = InvMeyerPartition(y, L, deg)
% InvMeyerPartition: Inverse the scale partitioning
% Usage:
% y = MeyerPartition(xhat, L, deg);
% Inputs:
% y Vector of length 2*n; signa
www.eeworm.com/read/153664/5645565
m meyerpartition.m
function y = MeyerPartition(xhat, L, deg)
% MeyerPartition: Partitions a signal into a series of disjoint scales
% Usage:
% y = MeyerPartition(xhat, L, deg);
% Inputs:
% xhat Input si
www.eeworm.com/read/233441/6788217
c ilist_test2.c
#include
#include "ilist.h"
int main()
{
/*
*
* ( 10 )( 9 8 7 6 5 4 3 2 1 0 )
*
* reverse the list
*
* ( 10 )( 0 1 2 3 4 5 6 7 8 9 )