- maim
- xclip
Set this on your i3 config file ~/.i3/config
# Screenshots
| #yahoo finance nse data downloader for daily,15 min , 5 mintimeframe | |
| #There is a time period restriction for 5 min, 15 min data from YF so it's recommended to run this weekly/Fortnightly | |
| import os | |
| import yfinance as yf | |
| import pandas as pd | |
| import requests | |
| from datetime import datetime, timedelta | |
| /* | |
| ** Binary Search Tree implementation in C++ | |
| ** Harish R | |
| */ | |
| #include<iostream> | |
| using namespace std; | |
| class BST { | |
| struct node { |
| /* Deleting a node from Binary search tree */ | |
| #include<iostream> | |
| using namespace std; | |
| struct Node { | |
| int data; | |
| struct Node *left; | |
| struct Node *right; | |
| }; | |
| //Function to find minimum in a tree. | |
| Node* FindMin(Node* root) |
| // Stack - Object oriented implementation using arrays | |
| #include <iostream> | |
| using namespace std; | |
| #define MAX_SIZE 101 | |
| class Stack | |
| { | |
| private: | |
| int A[MAX_SIZE]; // array to store the stack | |
| int top; // variable to mark the top index of stack. |
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |