|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Problem | |
---|---|
jitas.core | |
jitas.xml.parser |
Uses of Problem in jitas.core |
---|
Methods in jitas.core that return Problem | |
---|---|
Problem |
Tutor.getNextProblem(int problemNumber,
java.lang.String userName,
java.lang.String domainName)
|
Problem |
TutorInterface.getNextProblem(int problemNumber,
java.lang.String userName,
java.lang.String domainName)
Gets the next problem, specified by the user. |
Problem |
StudentModel.getNextProblem(java.util.SortedMap<java.lang.Integer,Problem> problems,
int problemNumber)
Gets a problem with a given ID from a collection of problems |
Problem |
StudentModel.getNextProblem(java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Gets the next problem that hasn't yet been solved by the student from the set(map) of problems, based on id. |
Problem |
Student.getNextProblem(java.lang.String domainName,
java.util.SortedMap<java.lang.Integer,Problem> problems)
Gets the next problem the student hasnt solved in the current subdomain of a given domain |
Problem |
Student.getNextProblem(java.lang.String domainName,
java.util.SortedMap<java.lang.Integer,Problem> problems,
int problemNumber)
Returns a problem, given a problemID, for a domain |
Problem |
Tutor.getNextProblem(java.lang.String userName,
java.lang.String domainName)
|
Problem |
TutorInterface.getNextProblem(java.lang.String userName,
java.lang.String domainName)
Gets the next problem, based on the current problem number. |
Problem |
ProblemSelectionAlgorithm.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Return a Problem object that has been calculated by a specific algorithm This design pattern aims to increase flexibility for client to add/use their own algorithm for system chosen problems |
Problem |
Domain.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Get the next problem (as selected by the system) from a subdomain |
Problem |
DefaultSelectionAlgorithm.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Return a Problem object that has been calculated by the default algorithm |
Problem |
Subdomain.getProblem(int problemNumber)
Gets a problem specified by the problem number |
Problem |
Tutor.getProblem(java.lang.String userName,
java.lang.String domainName)
|
Problem |
TutorInterface.getProblem(java.lang.String userName,
java.lang.String domainName)
Gets the next problem, specified by the system. |
Methods in jitas.core that return types with arguments of type Problem | |
---|---|
java.util.SortedMap<java.lang.Integer,Problem> |
Tutor.getAllProblems(java.lang.String userName,
java.lang.String domainName)
|
java.util.SortedMap<java.lang.Integer,Problem> |
TutorInterface.getAllProblems(java.lang.String userName,
java.lang.String domainName)
Gets all the problems in the current working subdomain of the domain and returns them as a SortedMap. |
java.util.SortedMap<java.lang.Integer,Problem> |
Subdomain.getProblems()
Returns the map of problems associated with this subdomain |
java.util.SortedMap<java.lang.Integer,Problem> |
Domain.getProblems(java.lang.String subdomainName)
Get all the problems for a given subdomain |
Methods in jitas.core with parameters of type Problem | |
---|---|
boolean |
Subdomain.addProblem(Problem p)
Adds a problem to the List |
int |
Problem.compareTo(Problem object)
Standard compareTo override, based on the Problem id |
Method parameters in jitas.core with type arguments of type Problem | |
---|---|
Problem |
StudentModel.getNextProblem(java.util.SortedMap<java.lang.Integer,Problem> problems,
int problemNumber)
Gets a problem with a given ID from a collection of problems |
Problem |
StudentModel.getNextProblem(java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Gets the next problem that hasn't yet been solved by the student from the set(map) of problems, based on id. |
Problem |
Student.getNextProblem(java.lang.String domainName,
java.util.SortedMap<java.lang.Integer,Problem> problems)
Gets the next problem the student hasnt solved in the current subdomain of a given domain |
Problem |
Student.getNextProblem(java.lang.String domainName,
java.util.SortedMap<java.lang.Integer,Problem> problems,
int problemNumber)
Returns a problem, given a problemID, for a domain |
Problem |
ProblemSelectionAlgorithm.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Return a Problem object that has been calculated by a specific algorithm This design pattern aims to increase flexibility for client to add/use their own algorithm for system chosen problems |
Problem |
Domain.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Get the next problem (as selected by the system) from a subdomain |
Problem |
DefaultSelectionAlgorithm.getNextProblem(Student student,
Domain domain,
java.util.SortedMap<java.lang.Integer,Problem> problems,
java.lang.String subdomainName)
Return a Problem object that has been calculated by the default algorithm |
Uses of Problem in jitas.xml.parser |
---|
Methods in jitas.xml.parser that return types with arguments of type Problem | |
---|---|
java.util.SortedMap<java.lang.Integer,Problem> |
ProblemParser.processTree()
Parses the XML file, creating a Problem object for each problems represented in the file. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |