shell ํ๋์์ pintos --gdb ~~~
๋๋จธ์ง shell์์ gdb kernel.o ํ target remote localhost:1234
b process.c:345 : process.c์ 345๋ฒ์งธ ์ค์ ์ฝ์
YoungseokCh
/ update-alternatives-clang.sh
Created
July 17, 2024 05:21
— forked from junkdog/update-alternatives-clang.sh
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
| #!/usr/bin/env bash | |
| # --slave /usr/bin/$1 $1 /usr/bin/$1-\${version} \\ | |
| function register_clang_version { | |
| local version=$1 | |
| local priority=$2 | |
| update-alternatives \ | |
| --install /usr/bin/llvm-config llvm-config /usr/bin/llvm-config-${version} ${priority} \ |
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
| #!/usr/bin/python3 | |
| import discord | |
| import random | |
| import os | |
| TOKEN = os.environ["randombot_TOKEN"] | |
| client = discord.Client() | |
| @client.event | |
| async def on_ready(): |
$ sudo vim /usr/share/X11/xkb/symbols/altwin์์ symbols[Group1] = [ Alt_R, Meta_R ]์ ๊ฐ์ ๋ค์๊ณผ ๊ฐ์ด ๋ฐ๊ฟ์ค๋ค:
// Meta is mapped to second level of Alt.
partial modifier_keys
xkb_symbols "meta_alt" {
$ sudo vim /usr/share/X11/xkb/symbols/altwin์์ symbols[Group1] = [ Alt_R, Meta_R ]์ ๊ฐ์ ๋ค์๊ณผ ๊ฐ์ด ๋ฐ๊ฟ์ค๋ค:
// Meta is mapped to second level of Alt.
partial modifier_keys
xkb_symbols "meta_alt" {
$ sudo vim /usr/share/X11/xkb/symbols/altwin์์ symbols[Group1] = [ Alt_R, Meta_R ]์ ๊ฐ์ ๋ค์๊ณผ ๊ฐ์ด ๋ฐ๊ฟ์ค๋ค:
// Meta is mapped to second level of Alt.
partial modifier_keys
xkb_symbols "meta_alt" {
$ sudo vim /usr/share/X11/xkb/symbols/altwin์์ symbols[Group1] = [ Alt_R, Meta_R ]์ ๊ฐ์ ๋ค์๊ณผ ๊ฐ์ด ๋ฐ๊ฟ์ค๋ค:
// Meta is mapped to second level of Alt.
partial modifier_keys
xkb_symbols "meta_alt" {
YoungseokCh
/ feynnman_algorithm.py
Last active
November 19, 2018 11:49
This is variation of Feynnman's problem solving algorithm written in Python. This code requires coffee because I love it. Have FUN!
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
| ##### Feynnman Algorithm ##### | |
| # 1. Write down the problem. | |
| # 2. Think real hard. | |
| # 3. Write down the solution. | |
| ############################## | |
| class Paper(object): | |
| def __init__(self): | |
| self.s = "" | |
| def write_down(self,string): | |
| self.s += string |
YoungseokCh
/ changeTyporaDelimiter.py
Last active
September 15, 2018 02:23
Typora sets the math equations delimiters as ($,$) and ((<p class='md-mathblock>)$,$) for HTML source. This file converts the delimiters to (\( , \)) and ( \[, \] ) to use in Mathjax using in-line inputs and output.txt.
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
| def checkInline(s): | |
| i = 0 | |
| while True: | |
| try: | |
| if s[i] == '$': | |
| return i | |
| except IndexError: | |
| return -1 | |
| i += 1 |
YoungseokCh
/ mergesort.py
Last active
September 13, 2018 16:52
user defined list sorting function using divide-and-conquer
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
| def merge(X,left,middle,right): #Assume that left and right part are sorted | |
| A=X[left:middle+1] | |
| B=X[middle+1:right+1] | |
| a,b=len(A),len(B) | |
| i,j=0,0 #i for A, j for B | |
| while (i!=a and j!=b): #compare elements of both part until one reaches end | |
| if A[i]<=B[j]: #right one is bigger | |
| X[left+i+j]=A[i] #Modify X i+j th element as left one | |
| i+=1 | |
| else: |
NewerOlder