代码搜索:Multiplication

找到约 1,176 项符合「Multiplication」的源代码

代码结果 1,176
www.eeworm.com/read/270032/11050992

h mat2.h

/* ------------------------------------------------------------------------- *\ MAT2.H : Definition and manipulation of a 2D matrix (either integers or reals) by Christophe Schlick (1 June
www.eeworm.com/read/406924/2272128

h rsa.h

/*------------------------------------------------------------------------------------------------ Software implementation of RSA using Montgomery Multiplication ------------------------------------
www.eeworm.com/read/350489/10740579

inc mmb.inc

comment * Algorithm : MMB (The Modular Multiplication based Block cipher ) Block : 16 bytes KeySize : 128 bits ( 16 bytes ) Abstract : The Modular Multiplication based Block cipher (MMB)
www.eeworm.com/read/226071/14498204

def iso_8859_15_fontindx.def

#define ISO_8859_15_FONT_NUM 81 #define ISO_8859_15_FONT_HEIGHT 26 #define CHAR_8859_15_ae (0x9200 + OSD_2BIT_FONT_NUM + OSD_1BIT_FONT_NUM) #define CHAR_8859_15_a_acute (0x8C01 + OSD_2BIT_
www.eeworm.com/read/226071/14498257

def iso_8859_15_fontindx.def

#define ISO_8859_15_FONT_NUM 81 #define ISO_8859_15_FONT_HEIGHT 26 #define CHAR_8859_15_ae (0x9200 + OSD_2BIT_FONT_NUM + OSD_1BIT_FONT_NUM) #define CHAR_8859_15_a_acute (0x8C01 + OSD_2BIT_
www.eeworm.com/read/226071/14498420

def iso_8859_15_fontindx.def

#define ISO_8859_15_FONT_NUM 81 #define ISO_8859_15_FONT_HEIGHT 26 #define CHAR_8859_15_ae (0x9200 + OSD_2BIT_FONT_NUM + OSD_1BIT_FONT_NUM) #define CHAR_8859_15_a_acute (0x8C01 + OSD_2BIT_
www.eeworm.com/read/226071/14498780

def iso_8859_15_fontindx.def

#define ISO_8859_15_FONT_NUM 81 #define ISO_8859_15_FONT_HEIGHT 26 #define CHAR_8859_15_ae (0x9200 + OSD_2BIT_FONT_NUM + OSD_1BIT_FONT_NUM) #define CHAR_8859_15_a_acute (0x8C01 + OSD_2BIT_
www.eeworm.com/read/162614/5530625

c pr22026.c

/* PR tree-optimization/22026 VRP used think that ~[0,0] + ~[0,0] = ~[0,0], which is wrong. The same applies to subtraction and unsigned multiplication. */ /* { dg-do compile } */ /* { dg-opt
www.eeworm.com/read/427960/8909640

c mrfast.c

/* * MIRACL fast fourier multiplication routine, using 3 prime method. * mrfast.c - only faster for very high precision multiplication * of numbers > about 4096 bits (see bel
www.eeworm.com/read/349903/10785784

c mrfast.c

/* * MIRACL fast fourier multiplication routine, using 3 prime method. * mrfast.c - only faster for very high precision multiplication * of numbers > about 4096 bits (see bel