This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Background: #202020 | |
| Font: Monaco, 11pt | |
| Text: #CFCFCF | |
| Bold Text: #CFCFCF | |
| Selection: #CFCFCF (65% Opacity) / #9C9C9C | |
| Cursor: #CFCFCF | |
| ANSI Colours: | |
| Black (0): #151515 | |
| Bright Black (8): #3E3E3E | |
| Red (1): #9A2D32 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # /etc/csh.login OR ~/.login | |
| setenv SHELL /bin/bash | |
| exec /bin/bash -l |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| === macOS | |
| $ clang -v | |
| Apple LLVM version 7.0.2 (clang-700.1.81) | |
| <snip> | |
| $ clang hello.c -g -o hello.out | |
| $ dwarfdump hello.out # NOTE: macOS-specific binary that reads Mach-O rather than ELF executables | |
| ---------------------------------------------------------------------- | |
| File: hello.out (x86_64) | |
| ---------------------------------------------------------------------- | |
| .debug_info contents: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| from math import sqrt | |
| # Find an approximate solution to the weighted set packing problem using | |
| # Halldorsson's algorithm (2000). Our approximate solution is at worst only a | |
| # factor of sqrt(m) worse than the optimal solution. | |
| # | |
| # Input: | |
| # S = { a, b, c... } # Set of base elements (m = |S|) | |
| # C = { C_1, C_2, C_3, ... } # Collection of weighted subsets of S | |
| # C_i = ({ a, c, ... }, weight) # Weighted subset of S |
OlderNewer