reyou

🎯

Focusing

reyou / MockHttpClient.cs

Created August 23, 2018 18:14 — forked from GeorgDangl/MockHttpClient.cs

Mock an Asp.Net Core HttpClient with a custom HttpMessageHandler using Moq

	using System;
	using System.Net.Http;
	using System.Threading;
	using System.Threading.Tasks;
	using Moq;
	using Moq.Protected;

	namespace Tests
	{
	public class MockHttpClient

reyou / gist:a0b77761ac3bfd0c2df41fc909c4b62a

Created June 24, 2018 18:10

GET logstash-*/_mapping V2

reyou / gist:40ab77b390f9d7e16bf6d27bb180654f

Created June 24, 2018 15:38

GET logstash-*/_mapping

reyou / Render HTML file.js

Created May 25, 2018 21:51

	var express = require("express");
	var app = express();
	var path = require("path");


	app.get('/',function(req,res){
	res.sendFile(path.join(__dirname+'/index.html'));
	//__dirname : It will resolve to your project folder.
	});

reyou / insertion_sort_class.java

Created May 25, 2018 14:05

	package TheAlgorithmDesignManual.AaaIntroduction;

	public class insertion_sort_class {

	public void insertion_sort(int[] s, int n) {
	// counters
	int i, j;
	for (i = 1; i < n; i++) {
	j = i;
	while ((j > 0) && (s[j] < s[j - 1])) {

reyou / print all permutations of a given string.js

Created May 24, 2018 02:29

	// https://stackoverflow.com/questions/7537791/understanding-recursion-to-generate-permutations/50382627#50382627
	let str = "ABC";

	permute(str, 0, str.length - 1, 0);

	function permute(str, left, right, depth) {
	if (left === right) {
	console.log("PRINT:", str + "\n");
	} else {
	for (let i = left; i <= right; i++) {

reyou / Inorder Successor in a binary search tree.cpp

Created May 24, 2018 02:27

	// https://www.youtube.com/watch?v=5cPbNCrdotA
	// we are trying to find next higher value
	struct Node
	{
	int data;
	struct Node *left;
	struct Node *right;
	}
	// function to find In order successor in a BST

reyou / find the size of the largest shape.js

Created May 24, 2018 02:25

	/** Algorithm: given a collection (matrix) of
	pixels you must find the size of the largest shape.
	Shapes were defined as pixels touching each other orthogonality. */
	var input = [
	[1, 1, 1, 1, 0],
	[1, 1, 0, 1, 0],
	[1, 1, 0, 0, 0],
	[0, 0, 0, 0, 0]
	];
	var input2 = [

reyou / find min in binary tree.recursive.cpp

Last active May 24, 2018 02:21