代码搜索：Random
找到约 10,000 项符合「Random」的源代码
代码结果 10,000
www.eeworm.com/read/340688/12139872
h biggirth.h
#ifndef BIGGIRTH
#define BIGGIRTH
#include
#include // C++ I/O library header
#include "Random.h"
class NodesInGraph{
public:
int numOfConnectionParityBit;
int *connecti
www.eeworm.com/read/152083/12141832
h randnumber.h
#include "time.h"
//used to generate a random number from the current seed
const unsigned long maxshort=65536L;
const unsigned long multiplier=1194211693L;
const unsigned long adder=12345L;
c
www.eeworm.com/read/152083/12141838
cpp randnumber.cpp
#include "randnumber.h"
CRandNumber::RandomNumber(unsigned long s)
{
if(s==0)
randSeed=time(0);
else
randSeed=s;
}
unsigned short CRandNumber::Random(unsigned long n)
{
randSeed=m
www.eeworm.com/read/340615/12143362
java imageresult.java
package com.intohotel.util;
import java.awt.Color;
import java.awt.Font;
import java.awt.Graphics;
import java.awt.image.BufferedImage;
import java.util.Random;
import javax.imageio.ImageIO;
www.eeworm.com/read/151959/12158541
m gngauss.m
function [n1,n2]=gngauss(m,sgma)
% [n1 n2]=gngauss(m,sgma)
% [n1 n2]=gngauss(sgma)
% [n1 n2]=gngauss
% GNGAUSS generates two independent gaussian variables with
% mean m & S.D sgma
% if one of
www.eeworm.com/read/151864/12166164
cpp bucketsort.cpp
//桶式排序
#include "iostream.h"
#include "stdlib.h"
#include "string.h"
#include "Compare.h"
#include "BucketSorter.h"
// 设定随即函数的种子
inline void Randomize()
{ srand(1); }
//返回一个0到n-1之间的随
www.eeworm.com/read/151864/12166298
cpp radixsort.cpp
//基数排序
#include "iostream.h"
#include "stdlib.h"
#include "string.h"
#include "Compare.h"
#include "RadixSorter.h"
// 设定随即函数的种子
inline void Randomize()
{ srand(1); }
//返回一个0到n-1之间的随机
www.eeworm.com/read/339796/12203988
h randn.h
/*产生一个服从均值为mu,方差为sigma的正态分布随机数*/
#include
#include
double random(void)
{
int a;
double r;
a=rand()%32767;
r=(a+0.00)/32767.00;
www.eeworm.com/read/339784/12204574
java randomg.java
import java.util.Random;
public class RandomG extends Random
{
public RandomG()
{
super();
}
public int nextG(int bits)
{
return next(bits);
}
}