首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
program程序设计讲解、Python,Java编程辅导 辅导R语言编程|讲解Python程序
项目预算:
开发周期:
发布时间:
要求地区:
1. BDD and Cucumber
In this assignment you will create user stories to describe a feature of a SaaS
app, use the Cucumber tool to turn those stories into executable acceptance
tests, and run the tests against your SaaS app.
Specifically, you will write Cucumber scenarios that test the happy paths of
parts 1-3 of the Rails Intro assignment, in which you added filtering and
sorting to RottenPotatoes’ index view for Movies.
The app code in rottenpotatoes contains a “canonical” solution to the Rails
Intro assignment against which to write your scenarios, and the necessary
scaffolding for the first couple of scenarios.
Fork this repo to your GitHub account, then clone the fork to your
development environment:
We recommend that you do a git commit as you get each part working. As an
optional additional help, git allows you to associate tags—symbolic names—
with particular commits. For example, immediately after doing a commit, you
could say git tag hw4-part1b , and thereafter you could use git diff hw4-
part1b to see differences since that commit, rather than remembering its
commit ID. Note that after creating a tag in your local repo, you need to
say git push YOUR_REMOTE --tags to push the tags to your remote. See ‘add’ in
the git-remote man page for how to add remotes. (Tags are ignored by
deployment remotes such as Heroku, so there’s no point in pushing tags
there.)
NOTE: Pushing your homework to a public repo is against the edX Honor
Code.
2. Part 1: Create a declarative scenario step for adding movies
The goal of BDD is to express behavioral tasks rather than low-level
operations.
The background step of all the scenarios in this homework requires that the
movies database contain some movies. Analogous to the explanation in
Section 4.7, it would go against the goal of BDD to do this by writing scenarios
that spell out every interaction required to add a new movie, since adding new
movies is not what these scenarios are about.
Recall that the Given steps of a user story specify the initial state of the
system: it does not matter how the system got into that state. For part 1,
therefore, you will create a step definition that will match the step Given the
following movies exist in the Background section of
both sort_movie_list.feature and filter_movie_list.feature. (Later in the
course, we will show how to DRY out the repeated Background sections in the
two feature files.)
Add your code in the movie_steps.rb step definition file. You can just use
ActiveRecord calls to directly add movies to the database; it’s OK to bypass
the GUI associated with creating new movies, since that’s not what these
scenarios are testing.
SUCCESS is when all Background steps for the scenarios
in filter_movie_list.feature and sort_movie_list.feature are passing
Green.
3. Part 2: Happy paths for filtering movies
1. Complete the scenario restrict to movies
withPGorRratings in filter_movie_list.feature. You can use existing step
definitions in web_steps.rb to check and uncheck the appropriate boxes,
submit the form, and check whether the correct movies appear (and just as
importantly, movies with unselected ratings do not appear).
2. Since it’s tedious to repeat steps such as When I check the ‘PG’ checkbox,
And I check the ‘R’ checkbox, etc., create a step definition to match a step
such as:
Given I check the following ratings: G, PG, R
This single step definition should only check the specified boxes, and leave
the other boxes as they were. HINT: this step definition can reuse existing
steps in web_steps.rb , as shown in the example in Section 7.9 in ESaaS.
3. For the scenario all ratings selected, it would be tedious to use And I
should see to name every single movie. That would detract from the goal of
BDD to convey the behavioral intent of the user story. To fix this, create step
definitions that will match steps of the form:
Then I should see all of the movies in movie_steps.rb.
HINT: Consider counting the number of rows in the HTML table to implement
these steps. If you have computed rows as the number of table rows, you can
use the assertion expect(rows).to eq value to fail the test in case the values
don’t match.
Update: You no longer need to implement the scenario for no ratings selected.
4. Use your new step definitions to complete the scenario all ratings selected.
SUCCESS is when all scenarios in filter_movie_list.feature pass with all
steps green.
4. Part 3: Happy paths for sorting movies by
title and by release date
1. Since the scenarios in sort_movie_list.feature involve sorting, you will need
the ability to have steps that test whether one movie appears before another
in the output listing. Create a step definition that matches a step such as
Then I should see "Aladdin" before "Amelie"
HINTS
• page is the Capybara method that returns an object representing the page
returned by the app server. You can use it in expectations such
as expect(page).to have_content('Hello World'). More importantly, you can
search the page for specific elements matching CSS selectors or XPath
expressions; see the Capybara documentation under Querying.
• page.body is the page’s HTML body as one giant string.
• A regular expression could capture whether one string appears before another
in a larger string, though that’s not the only possible strategy.
2. Use the step definition you create above to complete the scenarios sort
movies alphabetically and sort movies in increasing order of release
date in sort_movie_list.feature.
SUCCESS is all steps of all scenarios in both feature files passing Green.
5. Submission
Deploy to Heruku.
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代做ceng0013 design of a pro...
2024-11-13
代做mech4880 refrigeration a...
2024-11-13
代做mcd1350: media studies a...
2024-11-13
代写fint b338f (autumn 2024)...
2024-11-13
代做engd3000 design of tunab...
2024-11-13
代做n1611 financial economet...
2024-11-13
代做econ 2331: economic and ...
2024-11-13
代做cs770/870 assignment 8代...
2024-11-13
代写amath 481/581 autumn qua...
2024-11-13
代做ccc8013 the process of s...
2024-11-13
代写csit040 – modern comput...
2024-11-13
代写econ 2070: introduc2on t...
2024-11-13
代写cct260, project 2 person...
2024-11-13
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!