代码搜索：Invert
找到约 1,464 项符合「Invert」的源代码
代码结果 1,464
www.eeworm.com/read/357083/3030120
h ipt_mark.h
#ifndef _IPT_MARK_H
#define _IPT_MARK_H
struct ipt_mark_info {
unsigned long mark, mask;
u_int8_t invert;
};
#endif /*_IPT_MARK_H*/
www.eeworm.com/read/350657/3123005
h ipt_mark.h
#ifndef _IPT_MARK_H
#define _IPT_MARK_H
struct ipt_mark_info {
unsigned long mark, mask;
u_int8_t invert;
};
#endif /*_IPT_MARK_H*/
www.eeworm.com/read/264095/4296386
h ipt_mark.h
#ifndef _IPT_MARK_H
#define _IPT_MARK_H
struct ipt_mark_info {
unsigned long mark, mask;
u_int8_t invert;
};
#endif /*_IPT_MARK_H*/
www.eeworm.com/read/262041/4316466
h ipt_mark.h
#ifndef _IPT_MARK_H
#define _IPT_MARK_H
struct ipt_mark_info {
unsigned long mark, mask;
u_int8_t invert;
};
#endif /*_IPT_MARK_H*/
www.eeworm.com/read/368322/9701738
cpp utility.cpp
#include "stdafx.h"
#include "Utility.h"
#include "registry.h"
#include "RegExp.h"
#include
// invert case, capitalize
void MakeInvertCase(CString & rString)
{
INT nLen = rStri
www.eeworm.com/read/201202/15413543
sci iwt_ti.sci
function x = IWT_TI(pkt,qmf)
// IWT_TI -- Invert translation invariant wavelet transform
// Usage
// x = IWT_TI(TIWT,qmf)
// Inputs
// TIWT translation-invariant wavelet transform tab
www.eeworm.com/read/385796/8788657
v spi.v
module spi(
clock ,
reset48 ,
add ,
cs128 ,
cs ,
cs_invert,
rd ,
din ,
dout ,
sclk ,
irq_b ,
dataout
);
input clock ;
input din ;
input reset48 ;
input
www.eeworm.com/read/177211/9465077
c ldpc_h2g.c
/* Invert sparse binary H for LDPC*/
/* Author : Igor Kozintsev igor@ifp.uiuc.edu
Please let me know if you find bugs in this code (I did test
it but I still have some doubts). All othe
www.eeworm.com/read/371082/9569151
c ldpc_h2g.c
/* Invert sparse binary H for LDPC*/
/* Author : Igor Kozintsev igor@ifp.uiuc.edu
Please let me know if you find bugs in this code (I did test
it but I still have some doubts). All othe
www.eeworm.com/read/298568/7950852
c ldpc_h2g.c
/* Invert sparse binary H for LDPC*/
/* Author : Igor Kozintsev igor@ifp.uiuc.edu
Please let me know if you find bugs in this code (I did test
it but I still have some doubts). All othe