I am watching dsa js tutorial and implementing in on dart currently on radix sort

//radix sort import 'dart:math' as Math;

main() { }

getDigitNum(int n, int i) { // return ((n / 100).round() %10); // var cal = (n.abs() / Math.pow(10, =i)) % 10; var cal = (n.round().abs() / Math.pow(10, i)) % 10; // var cal = (n / 100)%10;

return cal.round(); }

digitCount(int number) { if (number == 0) { return 1; } return (number.abs().toString().length); }

mostDigits(List number) { var maxDigits = 0; for (var i = 0; i < number.length; i++) { maxDigits = Math.max(maxDigits, digitCount(number[i])); } return maxDigits; }

radixSort(List nums) { var maxDightCount = mostDigits(nums); for (var k = 0; k < maxDightCount; k++) { List digitBuckets = List.from({});//confused here } }

//here is the js codefunction getDigit(num, i) { return Math.floor(Math.abs(num) / Math.pow(10, i)) % 10; }

function digitCount(num) { if (num === 0) return 1; return Math.floor(Math.log10(Math.abs(num))) + 1; }

function mostDigits(nums) { let maxDigits = 0; for (let i = 0; i < nums.length; i++) { maxDigits = Math.max(maxDigits, digitCount(nums[i])); } return maxDigits; }

function radixSort(nums){ let maxDigitCount = mostDigits(nums); for(let k = 0; k < maxDigitCount; k++){ let digitBuckets = Array.from({length: 10}, () => []); for(let i = 0; i < nums.length; i++){ let digit = getDigit(nums[i],k); digitBuckets[digit].push(nums[i]); } nums = [].concat(...digitBuckets); } return nums; }

radixSort([23,345,5467,12,2345,9852])

//i just want help this part below js code

let digitBuckets = Array.from({length: 10}, () => []);

//dart code List digitBuckets = List.from({});//confused here

This will be similar to SinglyLinkedList. The differences would be:

• fromList() constructor will sort the elements of the list before inserting them.

• append() won't be implemented.

• insert() will not take position as parameter, since we'll decide where the newNode goes.

Some ground-works have been done to make the process easier such as tighter generics types (Please look into the ADTs and nil on RedBlackTree). The process should start with removal of // @dart=2.9 on the files (module + test) and start addressing the errors by adding punctuations. The pattern for converting tests is to first append a ? on the pre-setUp variables and then append ! to all test cases (to ensure the value isn't null and are initialized, which is ensured since setUp initializes them any way). Only files that are NNBDed are tree_adt.dart and binary_tree_adt.dart.

The test/graph/vertex_test.dart has variables bleeding throughout the codebase. We need to clean those up in spirit of other files. We should extract all local var declarations in the top level and lock/unlock them on setUp. Also, we can add lockAll, unlockAll, _initializeVertex etc functions to keep setUp uncluttered. We can test/graph/graph_test.dart for inspiration.

• Add inComing and outGoing fields on Vertex to include connections
• Remove Connection and replace it with LinkedHashMap with num as values (weight)
• Refactor Graph as abstract class
• Remove Settings

Goals:

• [X] Binary Search Tree.

• [x] AVL Tree.

• [X] Red-Black Tree.

• [ ] B Tree.

• [ ] B+ Tree.

• [x] Threaded Binary Tree.

• [x] Trie.

• [ ] Radix Tree.