def __getitem__(self, lhs: Union[int. list[bool]]) -> Union[float, Runner]: The function should take a list[bool] and will return a new Runner object containing only the filtered values

def tpr(tp, fn): # TODO return def TEST_tpr(): tpr_score = tpr(tp=100, fn=1) todo_check([ (np.isclose(tpr_score,0.99009, rtol=.01),"tpr_score is incorrect") ]) TEST_tpr() garbage_collect(['TEST_tpr'])

public List<String> getLikes(String user) This will take a String representing a user (like "Mike") and return a unique List containing all of the users that have liked the user "Mike." public List<String> getLikedBy(String user) This will take a String representing a user (like "Tony") and return a unique List containing each user that "Tony" has liked. create a Main to test your work. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.HashSet;import java.util.List;import java.util.Map;import java.util.Set; public class FacebookLikeManager { public List<String> facebookMap; private Set<String> likesSets; public FacebookLikeManager() { facebookMap = new ArrayList<>(); likesSets = new HashSet<>(Arrays.asList("Mike","Kristen","Bill","Sara")); } public void buildMap(String filePath) {...

Can you fix the code please on the first picture shows the error output. // Corrected code #define _CRT_SECURE_NO_WARNINGS #include "LibraryManagement.h" #include "Books.h" #include "DigitalMedia.h" #include "LibraryConfig.h" #include #include #include #include // Include the necessary header for boolean data type // Comparison function for qsort to sort Digital Media by ID int compareDigitalMedia(const void* a, const void* b) { return ((struct DigitalMedia*)a)->id - ((struct DigitalMedia*)b)->id; } // initializing library struct Library initializeLibrary() { struct Library lib; lib.bookCount = 0; lib.ebookCount = 0; lib.digitalMediaCount = 0; // Initialize book array for (int i = 0; i < MAX_BOOK_COUNT; i++) { lib.books[i].commonAttributes.id = -1; // Set an invalid ID to mark empty slot } // Initialize ebook array for (int i = 0; i < MAX_EBOOK_COUNT; i++) { lib.ebooks[i].commonAttributes.id = -1; }...

import 'dart:io';import 'module.dart';List<Module> modules = [];void main() {int? choice = 1;while (choice != 5) {choice = menu();if (choice != null && choice >= 1 && choice <= 5) {switch (choice) {case 1:createFromExisting();break;case 2:printModuleData();break;case 3:changeWeights();break;case 4:printAverageOfClass();break;}} else {print('Invalid choice, please choose again');choice = -1;}}print('Good bye!');}void createFromExisting() {//30 marks//This method retrieves the data from the TPG316C.csv file to create a new Module////Steps://1. Ask the user to enter a name for the new module//2. Read the name//3. Ask the user to enter the name of the file to read module data from (we will use TPG316C.csv)//4. Read the name of the file//5. Read the lines from the file into a List<String>//6. Create a new Module instance with empty fields, except for the name of the Module//7. Use the first element in the List<String> created in step 5 to extract the...

2 = 0 ) { numList [ i ] i } } } [1, 2, 3, 4, 5] [0, 2, 4, 6, 8] [2, 4, 6, 8, 10] [1, 3, 5, 7, 9]

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function...

Part 5. Operator Overload: add Next, you will add the ability to use the addition operator (+) in conjunction with Simpy objects and floats. You will implement add such that the left-hand side operand of an addition expression can be either a simpy object or a float value using a Union type. The add_method should return a new Simpy object and should not mutate the object the method is called on. When the right-hand side of an addition expression is also a simpy object, you should assert that both objects' values attributes have equal lengths. Then, you should produce a new simpy object where each item in its values attribute corresponds to the items of the original Simpy objects at the same index added together. For example: a = Simpy([1.0, 1.0, 1.0]) b = Simpy([2.0, 3.0, 4.0]) c = a + b print(c) # Output: Simpy([3.0, 4.0, 5.0]) When the right-hand side of an addition expression is a float value, you should produce a new simpy object where each item corresponds to the item at the same...

void getVectorSize(int& size); void readData(vector<Highscore>& scores); void sortData(vector<Highscore>& scores); vector<Highscore>::iterator findLocationOfLargest( const vector<Highscore>::iterator startingLocation, const vector<Highscore>::iterator endingLocation); void displayData(const vector<Highscore>& scores); The size parameter from the given code won't be needed now, since a vector knows its own size. Notice that the findLocationOfLargest() function does not need the vector itself as a parameter, since you can access the vector using the provided iterator parameters. The name field in the struct must still be a c-string The focus of this assignment is to use iterators. You must use iterators wherever possible to access the vector. As a result, you must not use square brackets, the push_back() function, the at() function, etc. Also, the word "index" shouldn't appear in your code anywhere. You won't get full credit if...