lspci | grep Eth
dmesg
might need to find a suitable slot if you see the below
This Solarflare Network Adapter requires the equivalent of 8 lanes at PCI Express 3 speed for full throughput, but is currently limited to 4 lanes at PCI Express 1 speed. Consult your motherboard documentation to find a more suitable slot
| VARIABLES counter, pc | |
| (* define statement *) | |
| AllDone == \A t \in Threads : pc[t] = "Done" | |
| Correct == AllDone => counter = ThreadCount | |
| VARIABLE localCounter | |
| vars == << counter, pc, localCounter >> |
| --------------------------- MODULE concurrent_map --------------------------- | |
| EXTENDS TLC, Integers, FiniteSets, Sequences | |
| ReaderCount == 2 | |
| Readers == 1..ReaderCount | |
I hereby claim:
To claim this, I am signing this object:
| package com.company; | |
| import java.util.ArrayList; | |
| import java.util.Arrays; | |
| public class Main { | |
| public static final int INF = Integer.MAX_VALUE; | |
| public static void main(String[] args) { |
| package practice; | |
| import java.util.ArrayDeque; | |
| import java.util.ArrayList; | |
| import java.util.Queue; | |
| import practice.BinarySearchTree.Node; | |
| public class BSTPrint { | |
| def calc_avg(items): | |
| if not items: | |
| return 0 | |
| total = sum(items) | |
| return float(total)/len(items) | |
| def std_deviation(items): | |
| if not items: return 0 | |
| mean = calc_avg(items) |
| //function return all subset of a list | |
| sset: {[xs] (enlist ()) {x, (y,) each x }/ xs} | |
| //or using the map each right /: | |
| sset: {[xs] (enlist ()) {x, y ,/: x }/ xs} | |
| //q)sset (1; 2; 3;`a) | |
| () | |
| ,1 | |
| ,2 | |
| 2 1 |
I hereby claim:
To claim this, I am signing this object:
| def solution(N, A, B, C): | |
| edges = [(C[i],A[i],B[i]) for i in xrange(len(A))] | |
| edges.sort(key=lambda e: e[0]) | |
| maxLenAt = [0]*N | |
| costAt = [0]*N | |
| def updatePath(u,costu,lenu, v,costv, lenv, cost): | |
| if costu < cost and lenu+1 > lenv: | |
| maxLenAt[v] = lenu+1 | |
| costAt[v] = cost |