1import{p as a,o as s,i as r,f as d,c as h,d as l}from"../chunks/BA1mfeB7.js";import"../chunks/2SshL0Bl.js";import{g as u}from"../chunks/B541GaVu.js";const e="guest-user";function c(){return[{id:1001,userId:e,title:"this week",content:`midterms next week so trying to be realistic about what i can actually get done. 2 3## uni 4- [ ] finish OS assignment (due thursday, not started) 5- [x] read chapter 7 for networks 6- [ ] review lecture notes for algorithms â the dynamic programming stuff still feels shaky 7- [ ] form study group for midterm maybe? 8 9## side project 10- [ ] fix the bug where notes don't save if you close the tab too fast 11- [ ] add tag filtering (been on the list forever) 12- [ ] just get *something* out that other people can use 13 14## honest note to self 15last week i spent 3 evenings on the project and kinda neglected the OS stuff. need to flip that ratio this week. midterms matter. 16 17project can wait 10 days. the grade cannot.`,tags:["Planning"],isPinned:!0,deletedAt:null,createdAt:new Date("2026-03-16T09:15:00"),updatedAt:new Date("2026-03-16T09:28:00")},{id:1002,userId:e,title:"working on the note saving bug",content:`okay so the bug is: if you type something and close the tab within like 2 seconds, it doesn't save. 18 19figured out why â the debounce is 1500ms and the beforeunload fires before it flushes. 20 21tried this: 22 23\`\`\`typescript 24window.addEventListener('beforeunload', () => { 25 if (pendingNote) { 26 saveNote(pendingNote, { keepalive: true }) 27 } 28}) 29\`\`\` 30 31the \`keepalive\` flag on fetch lets the request survive after the page closes. seems to work? tested it a few times and it held up. 32 33not 100% sure this is bulletproof but it's way better than before. shipping it. 34 35--- 36 37also went down a rabbit hole reading about the Page Visibility API. interesting but probably overkill for what i need right now. bookmarking for later.`,tags:["Code"],isPinned:!1,deletedAt:null,createdAt:new Date("2026-03-15T21:10:00"),updatedAt:new Date("2026-03-15T22:04:00")},{id:1003,userId:e,title:"dynamic programming â things i keep forgetting",content:`writing this after getting stuck on the same type of problem twice in a row. 38 39the pattern i keep missing: when to use top-down (memoization) vs bottom-up (tabulation). 40 41top-down â just recursion + cache. easier to think about, write the naive solution first then add the memo map. 42 43\`\`\`python 44def fib(n, memo={}): 45 if n in memo: return memo[n] 46 if n <= 1: return n 47 memo[n] = fib(n-1) + fib(n-2) 48 return memo[n] 49\`\`\` 50 51bottom-up â fill a table iteratively. usually faster in practice, no stack overhead. 52 53the thing that finally clicked: *define the subproblem first*. before writing any code, write one sentence that says what dp[i] means. if you can't do that, you don't understand the problem yet. 54 55## problems i still want to revisit 56- [ ] coin change (did it, want to make sure i can do it without looking) 57- [ ] longest common subsequence 58- [ ] knapsack`,tags:["CS","Learning"],isPinned:!1,deletedAt:null,createdAt:new Date("2026-03-12T16:45:00"),updatedAt:new Date("2026-03-12T16:45:00")},{id:1004,userId:e,title:"side project â what is it actually for",content:`been building this for ~2 months. showed it to a few friends and got "oh cool" which means nothing. 59 60thinking about who actually uses something like this. 61 62probably people who: 63- are already into the whole deep work / focus thing 64- write while they work (devs, students, writers) 65- find pomodoro apps too rigid but want *some* structure 66 67## what makes it different from just using notion or obsidian 68honestly not much right now. i need to be honest with myself about that. 69 70the timer + notes being in one place is the thing. you start a session, you write in that session. the notes are tied to the work, not floating in some giant second brain. 71 72that's the pitch i think. needs to be simpler and more obvious when you open it though. 73 74## what i want to do next (project-wise, not this week) 75- landing page that actually explains the thing 76- let people sign up and use it for real 77- maybe post it somewhere and see if anyone cares`,tags:["Planning"],isPinned:!1,deletedAt:null,createdAt:new Date("2026-03-09T20:00:00"),updatedAt:new Date("2026-03-09T20:00:00")},{id:1005,userId:e,title:"networks lecture â packet switching",content:`catching up on the lecture i missed tuesday. 78 79## circuit switching vs packet switching 80circuit switching â dedicated path for the whole call. guaranteed bandwidth, but wasteful if you're not talking. 81 82packet switching â data broken into packets, each finds its own route. more efficient, but no guarantees. 83 84the internet is packet switched. that's why video calls can get choppy â packets might take different paths and arr
84ive out of order. 85 86## TCP vs UDP (came up again) 87TCP â reliable, ordered, slower. use for anything where correctness matters (HTTP, file transfer). 88UDP â fast, no guarantees. use when speed > correctness (video, games, DNS). 89 90> prof mentioned something interesting: "the internet was designed to survive a nuclear attack." that's why there's no central point of failure. routing just finds another path. 91 92## still confused about 93- BGP routing, the slides lost me 94- how routers actually decide the best path in real time 95 96need to revisit before the midterm.`,tags:["CS"],isPinned:!1,deletedAt:null,createdAt:new Date("2026-03-05T14:30:00"),updatedAt:new Date("2026-03-05T14:30:00")}]}var g=d('<div class="flex h-screen items-center justify-center bg-background text-muted-foreground text-sm">Setting up demoâ¦</div>');function w(t,n){a(n,!1),s(()=>{localStorage.removeItem("deepwork-notes"),localStorage.removeItem("deepwork-notes-trash");const i=c();localStorage.setItem("deepwork-notes",JSON.stringify(i)),localStorage.setItem("deepwork-onboarding-tutorial-seen","1"),localStorage.setItem("GuestModeWarningAcknowledged","true"),u("/app",{replaceState:!0})}),r();var o=g();h(t,o),l()}export{w as component};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.