Skip to content

Instantly share code, notes, and snippets.

@bradlucas
bradlucas / delete.md
Created Mar 26, 2021 — forked from twhitacre/delete.md
LinkedIn: Delete Messages (April 2020)
View delete.md

What

LinkedIn is a valuable resource, but sometimes it sucks. One of those times is when you want to delete messages. You have to select each message one by one. It takes about 4 "clicks" to successfully delete a message.

This script should help. Since LI requires you to perform multiple steps, I decided to automate it for you. Once you initiate the script, it will run every second. If a message has the ability to be deleted, it will be. If not, it will be archived. Some "InMail" messages cannot be deleted on the web app. This script should work as long as LI doesn't change their page layout or element names, which will happen eventually.

Last tested: April, 29, 2020

Setup & Cavets

@bradlucas
bradlucas / filter-branch-new-repo-from-folder
Created Nov 20, 2020 — forked from FabreFrederic/filter-branch-new-repo-from-folder
Splitting a subfolder out into a new repository
View filter-branch-new-repo-from-folder
git filter-branch --prune-empty --subdirectory-filter my_folder_name
@bradlucas
bradlucas / list.md
Created Nov 2, 2020 — forked from ih2502mk/list.md
Quantopian Lectures Saved
View list.md
@bradlucas
bradlucas / hadoop-map-reduce.clj
Created Jul 16, 2020 — forked from BertrandDechoux/hadoop-map-reduce.clj
Hadoop map-reduce explained with clojure map, reduce and mapcat using the word count example.
View hadoop-map-reduce.clj
; Interested in a short introduction to hadoop mapreduce?
(declare mapreduce)
; Let's look at the "hello world job" ie word count.
(def input [
[1 "hadoop map-reduce explained"]
[2 "with clojure map, reduce and mapcat"]
[3 "using the world count example"]])
@bradlucas
bradlucas / tree-seq-extra.clj
Created Dec 21, 2019 — forked from stathissideris/tree-seq-extra.clj
Like Clojure's tree-seq, but with depth info for each node or the full path (recursive - blow up the stack for deep trees)
View tree-seq-extra.clj
(defn tree-seq-depth
"Returns a lazy sequence of vectors of the nodes in a tree and their
depth as [node depth], via a depth-first walk. branch? must be a fn
of one arg that returns true if passed a node that can have
children (but may not). children must be a fn of one arg that
returns a sequence of the children. Will only be called on nodes for
which branch? returns true. Root is the root node of the tree."
[branch? children root]
(let [walk (fn walk [depth node]
(lazy-seq
View all_weather_1.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View all_weather_1.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View ibotta-report-2018-06-05.csv
ad_name os date imps clicks spend ?column? ?column? pi_conversions pc_conversions registrations month year bucket
Generic 2017 45 Android 2018-06-05 1 0 0.00 0 0 0 June 2018 45 Day Dormant
Evergreen 45 Android 2018-06-05 0 0 0.00 0 0 0 June 2018 45 Day Dormant
Back to School 45 iOS 2018-06-05 0 0 0.00 0 0 0 June 2018 45 Day Dormant
Registered Not Redeemed 0-14 Days Android 2018-06-05 0 0 0.00 0 0 0 June 2018
Cash Back 60 iOS 2018-06-05 0 0 0.00 0 0 0 June 2018 60 Day Dormant
Evergreen 60 Android 2018-06-05 0 0 0.00 0 0 0 June 2018 60 Day Dormant
Not Registered Android 2018-06-05 0 0 0.00 0 0 0 June 2018
Save Money 45 Android 2018-06-05 0 0 0.00 0 0 0 June 2018 45 Day Dormant
Cash Back 60 Android 2018-06-05 0 0 0.00 0 0 0 June 2018 60 Day Dormant