taesik

example > $login $db2 create db $db2 connect to $db2 "select * from table(mon_get_tablespace('',-2)) as t" $db2 "select * from table(mon_get_container('',-2)) as t"

tablespace A tablespace is a logical name for a set of one or more containers. A container exists as one of a directory, a file, or a device. When a database is created, three default tablespaces are automatically created. SYSCATSPACE - System catalog table TEMPSPACE1 - temporary space for SQL execution USERSPACE1 - User tables Tablespaces are classified into four types according to their use. R..

fn get_count(string: &str) -> usize { string.matches(|x| match x {'a'|'e'|'i'|'o'|'u' => true, _ => false}).count() }

"64607935616" --> "#######5616" "1" --> "1" "" --> "" fn maskify(cc: &str) -> String { let mask_length = cc.len().saturating_sub(4); "#".repeat(mask_length) + &cc[mask_length..] }

"camelCasing" => "camel Casing" fn solution(s: &str) -> String { let mut res = String::new(); for c in s.chars() { if c.is_uppercase() { res.push(' '); } res.push(c); } res }

fn largest_five_digit_number(num: &str) -> u32 { (0..num.len() - 4).filter_map(|start| num[start..start+5].parse::().ok()).max().unwrap() } In the following 6 digit number: 283910 91 is the greatest sequence of 2 consecutive digits. In the following 10 digit number: 1234567890 67890 is the greatest sequence of 5 consecutive digits. fn largest_five_digit_number(num: &str) -> u32 { (0..num.len() -..

Define a function that takes one integer argument and returns logical value true or false depending on if the integer is a prime. function isPrime(num) { if (num < 2) return false; const limit = Math.sqrt(num); for (let i = 2; i

Write a function called maxSubarraySum which accepts an array of integers and a number called n. The function should calculate the maximum sum of n consecutive elements in the array. function maxSubarraySum(arr,num) { let maxSum = 0; let tempSum = 0; if(arr.length < num) return null; for(let i =0; i< num; i++) { maxSum += arr[i]; } tempSum = maxSum; for(let i=num; i

Implement a function called countUniqueValues which accepts a sorted array, and counts the unique values in the array . There can be negative numbers in the array, but it will always be sorted. function countUniqueValues(arr) { if(arr.length ===0) return 0; let i =0; for(let j=1; j