Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
trs
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Taddeüs Kroes
trs
Commits
ecf5d466
Commit
ecf5d466
authored
12 years ago
by
Taddeus Kroes
Browse files
Options
Downloads
Patches
Plain Diff
Cleared up some variable names.
parent
54783d37
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
TODO
+5
-5
5 additions, 5 deletions
TODO
with
5 additions
and
5 deletions
TODO
+
5
−
5
View file @
ecf5d466
...
...
@@ -86,24 +86,24 @@ Division of 0 by 1 reduces to 0.
To generate a hint for expression list A, ..., B:
1. Create a possibility tree for A.
2. Validate all expressions up to B:
set
root node
= A
set
ROOT
= A
for each expression C in <A, B] do:
if final answer of C is not equal to final answer of A:
validation failes at c
find C in the possibility tree, traversing from
the root node
find C in the possibility tree, traversing from
ROOT
if not found:
validation continues, but generate an efficiency warning at C
# FIXME: validation fails at C?
set
root node
= C
set
ROOT
= C
3. Generate a hint:
#
root node
should now be equal to B, so lookup of B is unnecessary
#
ROOT
should now be equal to B, so lookup of B is unnecessary
set N = empty dictionary
for each possibility of
the current root
P node do:
for each possibility of
ROOT
P node do:
evaluate P(B) until the final expression of A is reached
set N[P] = the number of explicit possibilities that have been applied in the evaluation
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment