MCPcopy Create free account

hub / github.com/3rfaan/courses / functions

Functions2,101 in github.com/3rfaan/courses

↓ 1 callersFunctiongreetingPrefix
(language string)
Go/Learn Go with Tests/helloworld/hello.go:24
↓ 1 callersFunctiongreetings
(s: &str)
Rust/rust-by-practice/src/compound_types/string/string2.rs:7
↓ 1 callersFunctiongreetings
(s: String)
Rust/rust-by-practice/src/compound_types/string/string7.rs:8
↓ 1 callersFunctionhandle_connection
(mut stream: TcpStream)
Rust/The Rust Programming Language Book/http_server/src/main.rs:24
↓ 1 callersFunctionheight
Compute the "height" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.*/
C/freeCodeCamp/Data Structures/binary-tree-level-order-traversal.c:46
↓ 1 callersFunctionimpl_hello_macro
(ast: &syn::DeriveInput)
Rust/The Rust Programming Language Book/hello_macro_derive/src/lib.rs:15
↓ 1 callersFunctioninOrderSuccessor
C/freeCodeCamp/Data Structures/bst-get-successor.c:17
↓ 1 callersFunctioninitEditor
init ***/
C/kilo/kilo.c:1071
↓ 1 callersFunctioninput
C/Neso Academy/input.c:3
↓ 1 callersFunctioninsert
C/freeCodeCamp/Data Structures/linked-list1.c:33
↓ 1 callersMethodinsert
(&mut self, key: String)
Rust/FCC/todo-cli/src/main.rs:49
↓ 1 callersFunctioninsert_at_tail
insert int at end of list
C/freeCodeCamp/Data Structures/doubly-linked-list.c:50
↓ 1 callersMethodinsert_but_ignore_index
(&mut self, key: &ByteStr, value: &ByteStr)
Rust/rust-in-action/actionkv/src/lib.rs:142
↓ 1 callersFunctioninvert
C/The C Programming Language 2nd Edition/2 - Types, Operators, and Expressions/exc-2-7.c:7
↓ 1 callersFunctionisBinarySearchTree
C/freeCodeCamp/Data Structures/bst-check.c:58
↓ 1 callersFunctionisBstUtil
Check if a tree is a binary search tree
C/freeCodeCamp/Data Structures/bst-check.c:42
↓ 1 callersFunctionis_a_color_word
TODO: Fix the compiler error in the `main` function without changing this function.
Rust/rustlings/solutions/09_strings/strings2.rs:2
↓ 1 callersMethodis_bot
(&self)
Rust/Algorithms and Data Structures/fcc/src/solutions/everything_be_true.rs:34
↓ 1 callersFunctionis_even
(num: i64)
Rust/rustlings/solutions/02_functions/functions4.rs:6
↓ 1 callersFunctionis_prime
Function to find out if a number is a prime by checking if the given number (n) is NOT evenly dividable by all numbers from 2 to the square root of th
Rust/Algorithms and Data Structures/fcc/src/solutions/sum_all_primes.rs:17
↓ 1 callersFunctionitoa
itoa: convert n to characters in s; pointer version */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-6/itoa.c:16
↓ 1 callersFunctionitoa
itoa: convert n to characters in s; recursive */
C/The C Programming Language 2nd Edition/4 - Functions and Program Structure/exc-4-12.c:18
↓ 1 callersFunctionitoa
itoa: convert n to characters in s, w characters wide */
C/The C Programming Language 2nd Edition/3 - Control Flow/exc-3-6.c:24
↓ 1 callersFunctionitoa
itoa: convert n to characters in s */
C/The C Programming Language 2nd Edition/3 - Control Flow/exc-3-4.c:24
↓ 1 callersFunctionitoa
itoa: convert n to characters in s */
C/The C Programming Language 2nd Edition/examples/itoa.c:21
↓ 1 callersFunctionitob
itob: convert n to characters in s - base b */
C/The C Programming Language 2nd Edition/3 - Control Flow/exc-3-5.c:33
↓ 1 callersMethodjmp
(1nnn) JUMP to `addr`
Rust/rust-in-action/chip_8/src/main.rs:67
↓ 1 callersFunctionkey2btn
(key: &str)
Rust/chip8/wasm/src/lib.rs:74
↓ 1 callersFunctionlibranges
C/The C Programming Language 2nd Edition/2 - Types, Operators, and Expressions/exc-2-1.c:18
↓ 1 callersFunctionload_fpu_control_word
(control: u16)
Rust/Inline Assembly/13-memory.rs:3
↓ 1 callersMethodload_game
* @param {Uint8Array} data
Rust/chip8/wasm/web/wasm.js:253
↓ 1 callersFunctionlongest
Don't change this function.
Rust/rustlings/solutions/16_lifetimes/lifetimes2.rs:2
↓ 1 callersFunctionmainloop
(chip8)
Rust/chip8/wasm/web/index.js:54
↓ 1 callersFunctionmake_post_request
( url: URL, token: Option<&str>, data: T, )
Rust/tauri/github_demo/src-tauri/src/api.rs:33
↓ 1 callersFunctionmake_sausage
()
Rust/rustlings/solutions/10_modules/modules1.rs:8
↓ 1 callersFunctionmanager
C/Neso Academy/employee.c:9
↓ 1 callersFunctionmanager
C/Neso Academy/employee_strtag.c:9
↓ 1 callersFunctionmatch_base_pair
Function to return an array of 2 chars with the matching base DNA pair
Rust/Algorithms and Data Structures/fcc/src/solutions/dna_pairing.rs:24
↓ 1 callersFunctionmathfnc
mathfnc: check string s for supported math functions */
C/The C Programming Language 2nd Edition/4 - Functions and Program Structure/exc-4-5.c:72
↓ 1 callersFunctionmaybe_icecream
This function returns how much icecream there is left in the fridge. If it's before 22:00 (24-hour system), then 5 scoops are left. At 22:00, someone
Rust/rustlings/solutions/12_options/options1.rs:5
↓ 1 callersFunctionminValue
Given a non-empty binary search tree, return the minimum data value found in that tree. Note that the entire tree does not need to be searched
C/freeCodeCamp/Data Structures/bst-get-successor.c:40
↓ 1 callersFunctionmin_max
C/Neso Academy/min_max.c:3
↓ 1 callersMethodmixup
Implement mixup to make it work, DON'T modify other code.
Rust/rust-by-practice/src/generics/generics/generics6.rs:8
↓ 1 callersFunctionmonth_day
month_day: set month, day from day of year */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-9.c:39
↓ 1 callersFunctionmonth_day
month_day: set month, day from day of year */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-8.c:41
↓ 1 callersFunctionmonth_day
month_day: set month, day from day of year */
C/The C Programming Language 2nd Edition/examples/day-converter.c:35
↓ 1 callersFunctionmonth_name
month_name: return name of n-th month */
C/The C Programming Language 2nd Edition/examples/month_name.c:45
↓ 1 callersFunctionmove_ownership
(s: String)
Rust/rust-by-practice/src/collection_types/string/string1.rs:16
↓ 1 callersMethodmove_position
(&mut self, point: Point)
Rust/rustlings/solutions/08_enums/enums3.rs:30
↓ 1 callersFunctionmult
C/Neso Academy/calc.c:5
↓ 1 callersFunctionmultiply
With the return type rewritten, we use pattern matching without `unwrap()`. But it's so Verbose...
Rust/rust-by-practice/src/result_panic/result/result5.rs:5
↓ 1 callersFunctionmultiply1
Rewriting `multiply` to make it succinct You should use BOTH of `and_then` and `map` here.
Rust/rust-by-practice/src/result_panic/result/result5.rs:17
↓ 1 callersFunctionmy_qsort
my_qsort: sort v[left]...v[right] */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-14.c:123
↓ 1 callersFunctionmy_qsort
my_qsort: sort v[left]...v[right] */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-15.c:138
↓ 1 callersMethodname
Returns the file's name.
Rust/rust-in-action/filebasics/src/main.rs:32
↓ 1 callersMethodname
(&self)
Rust/Algorithms and Data Structures/fcc/src/solutions/everything_be_true.rs:20
↓ 1 callersFunctionneed_static
(r: &'static str)
Rust/rust-by-practice/src/lifetime/static_l/static_l1.rs:10
↓ 1 callersFunctionnever_return
()
Rust/rust-by-practice/src/basic_types/functions/functions3.rs:9
↓ 1 callersFunctionnever_return_fn
IMPLEMENT this function in THREE ways
Rust/rust-by-practice/src/basic_types/functions/functions4.rs:20
↓ 1 callersFunctionnewNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
C/freeCodeCamp/Data Structures/bst-get-successor.c:55
↓ 1 callersFunctionnew_executor_and_spawner
()
Rust/Asynchronous Programming/timer_future/src/main.rs:88
↓ 1 callersFunctionnew_integer
C/McCullough/files/malloc.c:19
↓ 1 callersFunctionnew_rectangle
C/McCullough/files/rectangle.c:30
↓ 1 callersMethodnext
(&mut self)
Rust/rustonomicon/data_structures/src/bin/binary_tree.rs:53
↓ 1 callersFunctionnoop
()
Rust/rust-in-action/memscan.rs:3
↓ 1 callersFunctionnum_sq
Squares a number using `as_mut()`. TODO: Add the appropriate trait bound.
Rust/rustlings/solutions/23_conversions/as_ref_mut.rs:20
↓ 1 callersMethodnumber
(&self)
Rust/Algorithms and Data Structures/fcc/src/solutions/everything_be_true.rs:41
↓ 1 callersFunctiononSubmit
(token: string)
Rust/tauri/github_demo/src/components/context/AuthContext.tsx:33
↓ 1 callersMethodor_xy
(8xy1) Set `vx` equal to the bitwise `OR` of the values in `vx` and `vy`
Rust/rust-in-action/chip_8/src/main.rs:110
↓ 1 callersMethodother_function
(&self)
Rust/rustlings/solutions/15_traits/traits5.rs:8
↓ 1 callersMethodpoll
(self: Pin<&mut Self>, cx: &mut Context<'_>)
Rust/Asynchronous Programming/timer_future/src/lib.rs:58
↓ 1 callersFunctionpop
C/freeCodeCamp/Data Structures/stack-array.c:24
↓ 1 callersFunctionpop
C/learn-c/15-linked-lists.c:21
↓ 1 callersMethodpop
(&mut self)
Rust/chip8/chip8_core/src/lib.rs:122
↓ 1 callersFunctionprint
Replace i32 with another type
Rust/rust-by-practice/src/basic_types/functions/functions2.rs:6
↓ 1 callersFunctionprint
C/freeCodeCamp/Data Structures/linked-list1.c:42
↓ 1 callersFunctionprintCurrentLevel
Print nodes at a current level */
C/freeCodeCamp/Data Structures/binary-tree-level-order-traversal.c:30
↓ 1 callersFunctionprintDFS
depth-first search */
C/learn-c/16-binary-trees.c:80
↓ 1 callersFunctionprintLevelOrder
Function to print level order traversal a tree*/
C/freeCodeCamp/Data Structures/binary-tree-level-order-traversal.c:21
↓ 1 callersFunctionprintQueue
C/freeCodeCamp/Data Structures/queue-linked-list.c:46
↓ 1 callersFunctionprint_a
(t: &T)
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:16
↓ 1 callersFunctionprint_b
(t: &T)
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:20
↓ 1 callersFunctionprint_big
C/learn-c/07-functions.c:19
↓ 1 callersFunctionprint_c
(t: &'static dyn Display)
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:27
↓ 1 callersFunctionprint_char
(c: char)
Rust/rust-by-practice/src/basic_types/char_bool_unit/char_bool_unit2.rs:7
↓ 1 callersFunctionprint_d
(t: &'static impl Display)
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:31
↓ 1 callersFunctionprint_e
(t: &(dyn Display + 'static))
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:35
↓ 1 callersFunctionprint_f
(t: &(impl Display + 'static))
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:39
↓ 1 callersFunctionprint_g
(t: &'static String)
Rust/rust-by-practice/src/lifetime/static_l/static_l6.rs:43
↓ 1 callersFunctionprint_it1
(input: impl Debug + 'static)
Rust/rust-by-practice/src/lifetime/static_l/static_l5.rs:8
↓ 1 callersFunctionprint_it2
(input: &T)
Rust/rust-by-practice/src/lifetime/static_l/static_l5.rs:12
↓ 1 callersFunctionprint_list
C/learn-c/15-linked-lists.c:10
↓ 1 callersFunctionprint_refs
`print_refs` takes two references to `i32` which have different lifetimes `'a` and `'b`. These two lifetimes must both be at least as long as the func
Rust/rust-by-practice/src/lifetime/basic/basic5.rs:4
↓ 1 callersFunctionprint_str
(s: &String)
Rust/rust-by-practice/src/ownership_and_borrowing/ownership/ownership4.rs:10
↓ 1 callersFunctionprintd
printd: print n in decimal */
C/The C Programming Language 2nd Edition/examples/printd.c:4
↓ 1 callersFunctionpush_str
(s: &mut String)
Rust/rust-by-practice/src/ownership_and_borrowing/ref_and_borrowing/ref_and_borrowing4.rs:10
↓ 1 callersFunctionqsort
qsort: sort v[left]...v[right] into increasing order */
C/The C Programming Language 2nd Edition/5 - Pointers and Arrays/exc-5-7.c:72
↓ 1 callersFunctionqsort
qsort: sort v[left]...v[right] into increasing order */
C/The C Programming Language 2nd Edition/examples/func-pointer.c:34
↓ 1 callersFunctionqsort
qsort: sort v[left]...v[right] into increasing order */
C/The C Programming Language 2nd Edition/examples/quicksort.c:26
↓ 1 callersFunctionqsort
qsort: sort v[left]...v[right] into increasing order */
C/The C Programming Language 2nd Edition/examples/sort.c:89
← previousnext →501–600 of 2,101, ranked by callers