Skip to main content

generate unique random number between a range using static class in typescript

I am creating a simple class which includes all four methods for different type of random occurrence and based on random range its generate a unique set of the random numbers between ranges.





working link=>
https://stackblitz.com/edit/typescript-qrmqc4

code=>

enum randomType
{
includeMinMax=0,
exculdeMin=1,
exculdeMax=2,
exculdeMinMax=3

}
//get random number between two range
class seedRandom
{
static maxOccur=100;
//min and max include
public static getRandomNumber(min:number,max:number)
{
return Math.round(Math.random()*(max-min)+min);
}
//if you don't wanna include max value or max exclude
public static getRandomNumberNotMax(min:number,max:number)
{
return Math.round(Math.random()*(max-(min+1))+min);
}
//if you don't wanna include min value or min exclude
public static getRandomNumberNotMin(min:number,max:number)
{
return Math.ceil(Math.random()*(max-min))+(min);
}
//if you don't wanna include min value and max value or min and max exclude
public static getRandomNumberNotMinAndMax(min:number,max:number)
{
return Math.ceil(Math.random()*((max-1)-min))+(min);
}
//get a range
public static uniqueRandomSet(min:number,max:number,total:number,
RandomType:randomType=randomType.includeMinMax):Array<number>
{
if(this.maxOccur<=total)
{
throw new Error("are you druck increase maxOccur ")
}
let rNumbers:Array<number>=[];
for(let i=0;i<this.maxOccur;i++)
{
let random;
switch(RandomType)
{
case randomType.includeMinMax:
random=this.getRandomNumber(min,max);
break;
case randomType.exculdeMin:
random=this.getRandomNumberNotMin(min,max);
break;
case randomType.exculdeMax:
random= this.getRandomNumberNotMax(min,max);
break;
case randomType.exculdeMinMax:
random=this.getRandomNumberNotMin(min,max);
break;
}

while(rNumbers.indexOf(random)===-1)
{
rNumbers.push(random);
}
if(rNumbers.length===total)
{
return rNumbers;
}
}
return rNumbers;
}
}

console.log(seedRandom.uniqueRandomSet(11,41,10,randomType.exculdeMax));

Comments

Post a Comment

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...
Post a Comment
Read more

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js
Post a Comment
Read more

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...
Post a Comment
Read more