Yuriy Guts YuriyGuts

## kindle-cloud-reader-custom-sepia.js
function applyCustomStyle() {
    var config = {
        backgroundColor: "rgb(246, 239, 220)",
        foregroundColor: "rgb(64, 41, 25)",
        highlightColor: "rgb(255, 245, 173)",
        codeFontSize: "12px"
    };

    var masterFrameContents = $("#KindleReaderIFrame").contents();
    var pageFrameContents = masterFrameContents.find("iframe").contents();

## Dump-FileTree.ps1
<#

.SYNOPSIS
Dumps the entire file tree of the specified folder(s) and saves the results to a ZIP archive.

.PARAMETER SourceFolderList
Path to the folder(s) to retrieve the file tree for. Multiple folders should be separated by the pipe character ("|").

.PARAMETER BackupStorageList
Path to the folder(s) where the ZIP file will be stored. Multiple folders should be separated by the pipe character ("|").

## LinqJoinMonadic.cs
static class Program
{
    static void Main(string[] args)
    {
        var indices = Enumerable.Range(0, 26);
        var alphabet = indices.Select(i => (char)('A' + i));

        WriteHeader("WhereMonadic");
        foreach (var item in indices.WhereMonadic(item => item % 2 == 0))
        {

## RandomTreeGenerator.cs
private static void PopulateNodeWithRandomSubtree(TreeNode nodeToPopulate, int currentLevel)
{
    // These can be the arguments of the function if necessary.
    const int maxTreeDepth = 5;
    const int maxSiblingCount = 4;

    // Generate children for this node if a fair coin toss yields 0 at least QUOTA times,
    // where QUOTA increases after each level. That way the deeper it gets, the less will
    // be the probability of generating more children.

## FindLeavesInFlatNodeArray.cs
// Precalculate levels according to separator characters.
var nodes = flattenedTree.Select(flatNode => new {
        Value = flatNode.Value,
        Level = flatNode.Value.Count(c => c == '.'),
        IsLeaf = false
    }).ToArray();

// Find leaves by comparing the levels of each two adjacent items.
for (int i = 1; i < nodes.Length; i++)
{
	function applyCustomStyle() {
	var config = {
	backgroundColor: "rgb(246, 239, 220)",
	foregroundColor: "rgb(64, 41, 25)",
	highlightColor: "rgb(255, 245, 173)",
	codeFontSize: "12px"
	};

	var masterFrameContents = $("#KindleReaderIFrame").contents();
	var pageFrameContents = masterFrameContents.find("iframe").contents();
	<#

	.SYNOPSIS
	Dumps the entire file tree of the specified folder(s) and saves the results to a ZIP archive.

	.PARAMETER SourceFolderList
	Path to the folder(s) to retrieve the file tree for. Multiple folders should be separated by the pipe character ("\|").

	.PARAMETER BackupStorageList
	Path to the folder(s) where the ZIP file will be stored. Multiple folders should be separated by the pipe character ("\|").
	static class Program
	{
	static void Main(string[] args)
	{
	var indices = Enumerable.Range(0, 26);
	var alphabet = indices.Select(i => (char)('A' + i));

	WriteHeader("WhereMonadic");
	foreach (var item in indices.WhereMonadic(item => item % 2 == 0))
	{
	private static void PopulateNodeWithRandomSubtree(TreeNode nodeToPopulate, int currentLevel)
	{
	// These can be the arguments of the function if necessary.
	const int maxTreeDepth = 5;
	const int maxSiblingCount = 4;

	// Generate children for this node if a fair coin toss yields 0 at least QUOTA times,
	// where QUOTA increases after each level. That way the deeper it gets, the less will
	// be the probability of generating more children.
	// Precalculate levels according to separator characters.
	var nodes = flattenedTree.Select(flatNode => new {
	Value = flatNode.Value,
	Level = flatNode.Value.Count(c => c == '.'),
	IsLeaf = false
	}).ToArray();

	// Find leaves by comparing the levels of each two adjacent items.
	for (int i = 1; i < nodes.Length; i++)
	{