Skip to content

Commit 44add3d

Browse files
author
Frankie Robertson
committed
ExhaustiveSearch1Ply => ExhaustiveSearch
1 parent 7620667 commit 44add3d

File tree

4 files changed

+12
-12
lines changed

4 files changed

+12
-12
lines changed

benchmark/benchmarks.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ function prepare_4pls(group)
3939

4040
for (est_nick, ability_estimator) in ability_estimators
4141
next_item_rule = ItemStrategyNextItemRule(
42-
ExhaustiveSearch1Ply(),
42+
ExhaustiveSearch(),
4343
ExpectationBasedItemCriterion(PointResponseExpectation(ability_estimator),
4444
AbilityVarianceStateCriterion(
4545
integrator, distribution_estimator(ability_estimator)))

docs/src/creating_a_cat.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -80,7 +80,7 @@ ComputerAdaptiveTesting.NextItemRules.RandomNextItemRule
8080
Other rules are created by combining a `ItemCriterion` -- which somehow rates
8181
items according to how good they are -- with a `NextItemStrategy` using an
8282
`ItemStrategyNextItemRule`, which acts as an adapter. The default
83-
`NextItemStrategy` (and currently only) is `ExhaustiveSearch1Ply`. When using
83+
`NextItemStrategy` (and currently only) is `ExhaustiveSearch`. When using
8484
the implicit constructors, `ItemCriterion` can therefore be used directly
8585
without wrapping in any place an NextItemRule is expected.
8686

@@ -97,7 +97,7 @@ ComputerAdaptiveTesting.NextItemRules.NextItemStrategy
9797
```
9898

9999
```@docs; canonical=false
100-
ComputerAdaptiveTesting.NextItemRules.ExhaustiveSearch1Ply
100+
ComputerAdaptiveTesting.NextItemRules.ExhaustiveSearch
101101
```
102102

103103
### Evaluating item and state merit with `ItemCriterion` and `StateCriterion`

src/next_item_rules/NextItemRules.jl

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ export ExpectationBasedItemCriterion, AbilityVarianceStateCriterion, init_thread
3636
export NextItemRule, ItemStrategyNextItemRule
3737
export UrryItemCriterion, InformationItemCriterion
3838
export RandomNextItemRule
39-
export ExhaustiveSearch1Ply
39+
export ExhaustiveSearch
4040
export catr_next_item_aliases
4141
export preallocate
4242
export compute_criteria
@@ -116,7 +116,7 @@ $(TYPEDEF)
116116
abstract type NextItemStrategy <: CatConfigBase end
117117

118118
function NextItemStrategy(; parallel = true)
119-
ExhaustiveSearch1Ply(parallel)
119+
ExhaustiveSearch(parallel)
120120
end
121121

122122
function NextItemStrategy(bits...; parallel = true)
@@ -130,7 +130,7 @@ $(TYPEDEF)
130130
$(TYPEDFIELDS)
131131
132132
"""
133-
@with_kw struct ExhaustiveSearch1Ply <: NextItemStrategy
133+
@with_kw struct ExhaustiveSearch <: NextItemStrategy
134134
parallel::Bool = false
135135
end
136136

@@ -144,7 +144,7 @@ adapter by which an `ItemCriterion` can serve as a `NextItemRule`.
144144
$(FUNCTIONNAME)(bits...; ability_estimator=nothing, parallel=true)
145145
146146
Implicit constructor for $(FUNCTIONNAME). Will default to
147-
`ExhaustiveSearch1Ply` when no `NextItemStrategy` is given.
147+
`ExhaustiveSearch` when no `NextItemStrategy` is given.
148148
"""
149149
struct ItemStrategyNextItemRule{
150150
NextItemStrategyT <: NextItemStrategy,
@@ -167,7 +167,7 @@ function ItemStrategyNextItemRule(bits...;
167167
end
168168
end
169169

170-
function (rule::ItemStrategyNextItemRule{ExhaustiveSearch1Ply, ItemCriterionT})(responses,
170+
function (rule::ItemStrategyNextItemRule{ExhaustiveSearch, ItemCriterionT})(responses,
171171
items) where {ItemCriterionT <: ItemCriterion}
172172
#, rule.strategy.parallel
173173
choose_item_1ply(rule.criterion, responses, items)[1]

src/next_item_rules/aliases.jl

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -4,13 +4,13 @@ available through in the `catR` R package. TODO compability with `mirtcat`
44
"""
55
const catr_next_item_aliases = Dict(
66
"MFI" => (ability_estimator; parallel = true) -> ItemStrategyNextItemRule(
7-
ExhaustiveSearch1Ply(parallel),
7+
ExhaustiveSearch(parallel),
88
InformationItemCriterion(ability_estimator)),
99
"bOpt" => (ability_estimator; parallel = true) -> ItemStrategyNextItemRule(
10-
ExhaustiveSearch1Ply(parallel),
10+
ExhaustiveSearch(parallel),
1111
UrryItemCriterion(ability_estimator)),
1212
"MEPV" => (ability_estimator; parallel = true) -> ItemStrategyNextItemRule(
13-
ExhaustiveSearch1Ply(parallel),
13+
ExhaustiveSearch(parallel),
1414
ExpectationBasedItemCriterion(ability_estimator,
1515
AbilityVarianceStateCriterion(ability_estimator))) #"MLWI", #"MPWI", #"MEI",
1616
)
@@ -29,7 +29,7 @@ function _mirtcat_helper(item_criterion_callback)
2929
ability_estimator = AbilityEstimator(bits...; ability_estimator = ability_estimator)
3030
item_criterion = item_criterion_callback(
3131
[bits..., ability_estimator], ability_estimator)
32-
return ItemStrategyNextItemRule(ExhaustiveSearch1Ply(), item_criterion)
32+
return ItemStrategyNextItemRule(ExhaustiveSearch(), item_criterion)
3333
end
3434
return _helper
3535
end

0 commit comments

Comments
 (0)