日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

COMP2017代寫、c/c++編程語言代做

時間:2024-03-30  來源:  作者: 我要糾錯



COMP2017 9017 Assignment 2
Due: 23:59 28 March 2024
This assignment is worth 10% of your final assessment
Task Description
Your task is to create a multi-type linked list data structure and a program that interacts with it. Your
assignment is broken into three tasks that must be completed in order.
• The first part is the basic command syntax of the linked lists, creation, removal, viewing etc.
• The second part is modifying the lists in place, through insertion and deletion of elements.
• The third part is allowing lists to refer to each other in a nested pattern.
It is also recommended to read through the specification carefully. You should ensure that you create
test cases that cover a range of possible inputs before beginning to code.
1 Make sure you identify and
test for edge cases.
Implementation Details
All commands are read through standard in, and all output is given through standard out.
Part 1: Basic Commands
For Part 1, your linked lists must support elements of the following types:
• int
• float
• char
• string
Your program should take in commands from stdin that will create and manage these multi-type
linked lists. The basic commands are:
1Even if you do it on pencil and paper, work through some examples to be sure you understand.
1
COMP2017 9017
• NEW <number of elements> - create a new list
• VIEW <list index> - view a specific list by its index
• TYPE <list index> - view a specific list by its index, printing out the types of each element.
• VIEW ALL - print the number of lists and each list in order of creation
• REMOVE <list index> - remove a list
The index for each list should be 1 higher than the last created list’s index, starting from 0 for the first
list, regardless of how many lists have been removed.
Basic Examples
In the following examples, "> " denotes the following line as input. Your program must not print it to
stdout or read it from stdin. It is included in the formatting only as an indicator, to differentiate
the input from the output of the program.
Command keywords are delimited by exactly one (1) space character and should have no leading
and trailing whitespaces2
. Be sure to replicate the formatting of these examples exactly, character by
character.
The NEW Command
This command takes in a number as input for the initial size of the list. It then reads in an initial value
for each element to initialise the list. 0 is a valid size, negative numbers are not. Lists are labelled
starting at 0 when they begin to exist, and the label always increments, even if a list is removed.
Imagine in the following section that 4 lists have already been created.
> NEW 5
> hello
> 1
> 2
> 3.14
> a
List 4: hello -> 1 -> 2 -> 3.14 -> a
Lists will only be considered as "created" after all lines of the input have been parsed and no error
occurs.
The VIEW Command
This command prints out the contents of the list at the given index.
2
except when INSERT ing a string. See below examples
Systems Programming Page 2 of 15
COMP2017 9017
> VIEW 4
hello -> 1 -> 2 -> 3.14 -> a
The TYPE Command
This command prints out the types of each element at the given list.
> TYPE 4
string -> int -> int -> float -> char
The VIEW ALL Command
This command prints out the current set of lists in index-increasing order.
> VIEW ALL
Number of lists: 3
List 0
List 3
List 4
The REMOVE Command
This command deletes a list, and prints out the current set of lists again in index-increasing order.
> REMOVE 3
List 3 has been removed.
Number of lists: 2
List 0
List 4
Invalid Commands
A command can be identified from a line if the line strictly begins with exactly the command keyword,
and is invalid if its invalid otherwise.
If a command is invalid in some way, print INVALID COMMAND: <command used>. For example, when there is no List 4:
> REMOVE 4
INVALID COMMAND: REMOVE
Systems Programming Page 3 of 15
COMP2017 9017
If a command cannot be identified, use INPUT. For example:
> abracadabra
INVALID COMMAND: INPUT
It is up to you to find and prepare for edge cases.
Type Rules and Exceptions
There can be some ambiguity in certain cases for what a given input’s type is. The order for type
checking is as follows:
• integer
• float
• char
• string
Requirements for types are as follows:
• int can be negative, positive or zero (tests will also not exceed the maximum and minimum
value for an int type).
• float is the same except it will always have a decimal point.3
• float should also be printed to 2 decimal places, though they can be read in to any precision.
• char is any printable4
character in ascii as long as it is singular.
• string covers all other cases.
• Empty lines in list creation should be considered as string.
• string can start with leading and trailing whitespace characters.
• Lines containing one int or float can have leading and trailing whitespaces. These will be
interpreted as numbers. (Note that this is the default behaviour of scanf).
• All inputs will have a maximum total line length of 128 bytes.
> NEW 4
> 1.0
>
> baguette
> 5
List 4: 1.00 -> -> baguette -> 5
3The exception being scientific notation which should also be accepted, i.e. 2e-4 = 0.0002. Note that
scanf accepts this type of input by default.
4isprint() returns true
Systems Programming Page 4 of 15
COMP2017 9017
Note the empty line that was interpreted as an empty string, as well as the extra space in " baguette".
There will be no test cases that do not fit this description.
Note: Curly brackets {} are used in Part 3, and are considered invalid input if they appear in any form
other than specified there. 5
> NEW 3
> 1.0
> {}
> baguette
INVALID COMMAND: NEW
> NEW 3
> 1.0
> {
> wordswords } words
INVALID COMMAND: NEW
Exiting the program
Upon EOF, the program should free all used dynamic memory, then exit.
Part 2: Dynamic Lists
In this part you are to implement two extra commands: INSERT and DELETE.
The INSERT Command
This command takes input of the form INSERT <list id> <index> <value>, and inserts
the value at the given index of the given list. It should then print out the new list in the same format
as VIEW, but with the string "List <n>: " before it. For example:
> VIEW 1
a -> b -> c -> d
> INSERT 1 0 Baguettes
List 1: Baguettes -> a -> b -> c -> d
Negative indices should insert from the end of the list. Indices outside the range are invalid:
> VIEW 1
a -> b -> c -> d
> INSERT 1 -1 Baguettes
List 1: a -> b -> c -> d -> Baguettes
5For completion of Parts 1 and 2, it is sufficient to raise an error whenever curly brackets are detected. Part
3 introduces a single exceptional use which is not an error.
Systems Programming Page 5 of 15
COMP2017 9017
> INSERT 1 97 Croissants
INVALID COMMAND: INSERT
The DELETE COMMAND
This command takes input of the form DELETE <list id> <index> and removes the given
index from the list. It should then print out the new list in the same format as INSERT. The same
conditions on indices apply. For example:
> VIEW 1
a -> b -> c -> d
> DELETE 1 0
List 1: b -> c -> d
> DELETE 1 -1
List 1: b -> c
> DELETE 1 4
INVALID COMMAND: DELETE
Part 3: Nested Lists
For this section, you are to modify your previous code to accept a new type: other lists. This is to a
maximum depth of one. This means every list is either a simple list (contains only regular types), or
a nested list (contains regular types and simple lists). Nested lists cannot contain other nested lists.
Nested lists contain only references to simple list(s). Thus, changes to the simple list should also be
reflected in the nested list.
To insert a simple list into a nested list, it should be specified with curly brackets. When nested lists
are printed, they should be labelled as Nested, like so:
> VIEW 1
a -> b -> c -> d
> NEW 3
> first
> {1}
> last
Nested 2: first -> {List 1} -> last
> VIEW ALL
Number of lists: 2
List 1
Nested 2
Any command that refers to a non-existent list, or would result in any list having depth greater than 1
should give an INVALID COMMAND:
Systems Programming Page 6 of 15
COMP2017 9017
> VIEW 0
a -> b -> c -> d
> NEW 2
> first
> last
List 1: first -> last
> INSERT 1 1 {0}
Nested 1: first -> {List 0} -> last
> NEW 1
> {1}
INVALID COMMAND: NEW
If all references are deleted from a nested list with DELETE, then it becomes a simple list. The TYPE
command should print reference as the type of any references to other lists.
> VIEW 0
a -> b -> c -> d
> VIEW 1
first -> {List 0} -> last
> TYPE 1
string -> reference -> string
Removal of a simple list while it is referenced by any other list should give an
INVALID COMMAND: REMOVE.
The VIEW-NESTED Command
This command can print any list, but when it prints a nested list, it will also print its sub-lists, contained
in curly brackets. Like so:
> VIEW 1
a -> b -> c -> d
> VIEW 2
first -> {List 1} -> last
> VIEW-NESTED 1
a -> b -> c -> d
> VIEW-NESTED 2
first -> {a -> b -> c -> d} -> last
Restrictions
To successfully complete this assignment you must:
• Use dynamic memory.
Systems Programming Page 7 of 15
COMP2017 9017
• Use linked list structures,6
they must be your own implementation.7
• Free all dynamic memory that is used.
• NOT use any external libraries, other than those in glibc.
• Other restricted functions may come at a later date.
Any submission breaking these restrictions will receive a deduction of up to 5 marks per breach.
All texts within your submission that may be read by a reviewer (marker), including code comments,
git commit messages, README files, and so on, should be written in English. Any readable text that
is not written in English will receive a deduction of 1 mark per line.
Working on Your Assignment
You are encouraged to submit your assignment on Ed while you are in the process of completing it.
By submitting you will obtain some feedback of your progress on the sample test cases provided.
If you have any questions about C functions, then refer to the corresponding man pages. You can and
should ask questions about this assignment on Ed. As with any assignment, make sure that your work
is your own, and that you do not share your code or solutions with other students.
Getting Started
The most important factor for success is your choice of data structures. We recommend:
1. Read the specification and write test cases.
2. Design your data structures.
3. Part 1 Commands
4. Part 2 Commands
5. Part 3 Commands
Writing even a few simple test cases of your own will ensure you understand the details of what
you’ve been asked to do. Even on pen and paper, this is incredibly beneficial.
Data structure design will have the largest impact on the quality of your code (both in terms of style
and correctness). The scaffold has a few suggestions on the function prototypes you should use, but
does not cover every instance. Be considerate of how your linked-list will function.
6There are no requirements on what kind of data structure is used to keep track of all the created lists, as
long as it is dynamic and the lists themselves are linked lists of any kind.
7This means you mustn’t cite or borrow code from any other source. Design and implement the structure
yourself.
Systems Programming Page 8 of 15
COMP2017 9017
Debugging and Avoiding Leaks
It is recommended that you use tools such as gdb, valgrind and ASAN
(the -fsanitize=address,leaks compilation flags).
These will assist in finding basic errors (gdb) and monitoring memory leaks (valgrind, ASAN).
However, they cannot automatically prevent memory errors and leaks. You should be conscious of
where leaks may occur and verify them yourself.8
Note: Mac users may need to use a full virtual machine (VM) to make use of these tools. We have had
reports of both valgrind and ASAN being unusable on Macs. Please refer to Ed for more details.
Compilation and Testing
Your program should be compiled by the default rule, which is the first defined rule of the Makefile.
You should name this make rule build. After compilation, your program should be a single binary
file called mtll which is used to run your program.
# compile the program
make
# alternatively
# make build
# run the program
./mtll
You should implement your program in multiple C source and header files. This is required for full
style marks.9 They must all compile together into one single binary when the program is built.
You should also do your own testing. If you need to compile/create your tests before running them,
please implement a make rule called tests for this and then a separate one for running your tests.
Please also store your tests in the tests directory provided.
After the assignment is released, a small number of test files will be made available. Correctness tests
will be provided to ensure that your code can execute fundamental examples. These tests will not be
the complete set of tests run against your code.
Any attempt to deceive the marking system (such as hard coding test cases) will receive a zero.
# compile the tests if necessary
make tests
# run the tests
make run_tests
8This is helped by having a plan for what data structures you will use, and how your code will manage them.
9
It is recommended to break up your code into suitable sections, i.e. the main source file handles input, a
separate source file for list management functions, etc.
Systems Programming Page 9 of 15
COMP2017 9017
Submission
Submissions for this assignment will be through git.
The general process of writing and submitting is the same:
git add <files>
git commit -m "fix memory leak in function x"
git push
If you have any questions about git usage, feel free to check the Git Lesson, the relevant manual
pages, or ask on Ed.
Do NOT push binaries, including executables and object files. Either add your source files manually,
or create a .gitignore file that includes the names of all your binaries.
None of your git commits should contain a binary file. Any submission breaking this restriction will
receive a deduction of 1 mark per commit.
Marking Details
The assignment is worth 10% of your final grade. This is marked out of 20, and breaks down as
follows:
Marks Item Notes
3/20 Code Style Manual marking
2/20 Test Case Coverage Manual marking
6/20 Part 1 Correctness Automatic tests
6/20 Part 2 Correctness Automatic tests
3/20 Part 3 Correctness Automatic tests
For style, refer to the style guide on ed: https://edstem.org/au/courses/14786/lessons/
49533/slides/334765. You will also be marked based on the modularity and organisation of
your code. For full marks, code should be organised in multiple source files, and use modular, taskspecific functions. Organised data structures are essential here.
The scaffold provides some suggestions on what this looks like, but more will be necessary.
For test case coverage: This first mark is for coverage of basic command syntax. Full marks will be
awarded for consideration of at least 3 edge cases. These may be for sections of the assignment you
have not completed.10
The below table gives an indication of what is expected. Note this is not a set marking scheme, more
a guideline. Refer to the above table for clearer ideas.
10Feel free to look for edge cases in Part 3 even if you do not manage to code it.
Systems Programming Page 10 of 15
COMP2017 9017
Expected Award Level of Completion
Pass Good code style, good test coverage and completion of Part 1.
(Style misses one or two things: not modular, not multiple source files, etc.)
Credit Excellent style and tests, most of Part 2.
Good style and tests, completion of Part 2.
Distinction Excellent style and tests, completion of Part 2
High Distinction Excellent style and tests, completion of Part 3
Further Examples
All Basic Commands:
> NEW 3
> hello
> 2
> 1
List 0: hello -> 2 -> 1
> NEW 3
> 3.14
> world
> a
List 1: 3.14 -> world -> a
> VIEW ALL
Number of lists: 2
List 0
List 1
> VIEW 1
3.14 -> world -> a
> REMOVE 0
List 0 has been removed.
Number of lists: 1
List 1
> NEW 3
foo
bar
5
List 2: foo -> bar -> 5
> VIEW ALL
Number of lists: 2
List 1
List 2
Systems Programming Page 11 of 15
COMP2017 9017
Insert and Delete Commands:
> NEW 3
> hello
> 6
> 2e-2
List 0: hello -> 6 -> 0.02
> DELETE 0 2
List 0: hello -> 6
> INSERT 0 -2 goodbye
List 0: hello -> goodbye -> 6
> DELETE 0 -1
List 0: hello -> goodbye
> DELETE 0 -1
List 0: hello
> DELETE 0 -1
List 0:
> REMOVE 0
List 0 has been removed.
Number of lists: 0
Note the leading space in ’ goodbye’.
Nested Lists
> NEW 3
> this
> is
> simple
List 0: this -> is -> simple
> NEW 4
> this
> is-nested
> {0}
> 4.0 h
Nested 1: this -> is-nested -> {List 0} -> 4.0 h
> VIEW-NESTED 1
this -> is-nested -> {this -> is -> simple} -> 4.0 h
> NEW 1
> other
List 2: other
> INSERT 0 2 {2}
INVALID COMMAND: INSERT
> REMOVE 0
Systems Programming Page 12 of 15
COMP2017 9017
INVALID COMMAND: REMOVE
> DELETE 1 2
List 1: this -> is-nested -> 4.0 h
> INSERT 0 2 {1}
Nested 0: this -> is -> {List 1} -> simple
> INSERT 0 0 {1}
Nested 0: {List 1} -> this -> is -> {List 1} -> simple
> DELETE 0 0
Nested 0: this -> is -> {List 1} -> simple
> VIEW-NESTED 0
this -> is -> {this -> is-nested -> 4.0 h} -> simple
Note "4.0 h" is a string, not a float.
Systems Programming Page 13 of 15
COMP2017 9017
Academic Declaration
By submitting this assignment you declare the following: I declare that I have read and understood
the University of Sydney Student Plagiarism: Coursework Policy and Procedure, and except where
specifically acknowledged, the work contained in this assignment/project is my own work, and has
not been copied from other sources or been previously submitted for award or assessment.
I understand that failure to comply with the Student Plagiarism: Coursework Policy and Procedure
can lead to severe penalties as outlined under Chapter 8 of the University of Sydney By-Law 1999 (as
amended). These penalties may be imposed in cases where any significant portion of my submitted
work has been copied without proper acknowledgment from other sources, including published works,
the Internet, existing programs, the work of other students, or work previously submitted for other
awards or assessments.
I realise that I may be asked to identify those portions of the work contributed by me and required to
demonstrate my knowledge of the relevant material by answering oral questions or by undertaking
supplementary work, either written or in the laboratory, in order to arrive at the final assessment
mark.
I acknowledge that the School of Computer Science, in assessing this assignment, may reproduce
it entirely, may provide a copy to another member of faculty, and/or communicate a copy of this
assignment to a plagiarism checking service or in-house computer program, and that a copy of the
assignment may be maintained by the service or the School of Computer Science for the purpose of
future plagiarism checking.
Systems Programming Page 14 of 15
COMP2017 9017
Changes
Any changes made to this document will be updated here.
19/03/2024-23:00 - New restriction and deduction rules will apply to non-English readable texts.
18/03/2024-20:45 - Made NEW, VIEW, and TYPE examples share the same context. Clarify list creation time, clarify invalid input conditions, added nested list insert example
17/03/2024-19:47 - Update INSERT and DELETE outputs. Resolve Further example - Nested lists
typo
16/03/2024-19:36 - Update invalid command criteria, update testing instructions, resolved typos in
examples, made the VIEW, VIEW_NESTED command consistent, updated restrictions, reformatted
Changes page.
15/03/2024-22:30 - resolve typos in description, test cases made consistent with spec, clarifications
made in part 1 (various)
15/03/2024-15:47 - resolve typos in Part 1 (The TYPE command, requirements for types), Part 3
snippet 2
Systems Programming Page 15 of 15

請加QQ:99515681  郵箱:99515681@qq.com   WX:codehelp 

標簽:

掃一掃在手機打開當前頁
  • 上一篇:INFO-5060代做、代寫C++程序語言
  • 下一篇:代做CS112編程、代寫Poker設計程序
  • 無相關信息
    昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲
    油炸竹蟲
    酸筍煮魚(雞)
    酸筍煮魚(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚
    香茅草烤魚
    檸檬烤魚
    檸檬烤魚
    昆明西山國家級風景名勝區
    昆明西山國家級風景名勝區
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗證碼平臺 幣安官網下載 歐冠直播 WPS下載

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網 版權所有
    ICP備06013414號-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              国产精品久久久久久久久久尿| 欧美激情一区二区三区高清视频| 欧美日韩国产首页在线观看| 影音先锋日韩精品| 久久久精品五月天| 在线看视频不卡| 你懂的亚洲视频| 亚洲视频在线看| 国产精品拍天天在线| 欧美一区亚洲| 亚洲电影免费观看高清完整版在线 | 国产欧美日韩在线| 久久国产66| 日韩视频一区二区三区| 国产精品超碰97尤物18| 久久亚洲综合网| 亚洲一区国产视频| 亚洲精品国产精品乱码不99按摩| 欧美日韩精品免费在线观看视频| 久久成人精品| 日韩午夜一区| 亚洲国产清纯| 在线精品国产成人综合| 国产午夜精品久久久久久久| 欧美女同视频| 欧美精品综合| 久久人人看视频| 亚洲深夜福利网站| 国产一区清纯| 国产精品丝袜91| 欧美69wwwcom| 久久激情视频| 性18欧美另类| 亚洲二区精品| 好看的亚洲午夜视频在线| 欧美日韩成人激情| 亚洲日本电影在线| 亚洲二区在线视频| 国产女同一区二区 | 国产伦精品一区| 国产精品乱码一区二区三区| 午夜精品久久99蜜桃的功能介绍| 亚洲裸体在线观看| 一区在线影院| 亚洲日本欧美| 国产中文一区二区| 国产视频精品va久久久久久| 国产精品美女久久久久久免费| 欧美成年人视频网站欧美| 欧美1区视频| 女人色偷偷aa久久天堂| 免费观看久久久4p| 欧美激情一区二区三区在线| 欧美黄色aa电影| 欧美无乱码久久久免费午夜一区| 国产精品久久久一区二区三区 | 男同欧美伦乱| 欧美日韩在线播放| 国产精品免费看久久久香蕉| 国产精品久久久久久久久果冻传媒| 国产精品女人久久久久久| 国产一区二区三区黄视频| 亚洲日本国产| 性欧美超级视频| 欧美成黄导航| 国产日韩欧美一区二区| 一本色道久久综合亚洲精品不 | 国产欧美日韩在线播放| 亚洲精品国产欧美| 久久影院午夜论| 国产精品久久久亚洲一区| 最新中文字幕一区二区三区| 性久久久久久久久久久久| 欧美色欧美亚洲高清在线视频| 国产一区二区三区四区三区四| 日韩天堂在线观看| 欧美国产视频在线观看| 伊人久久大香线蕉av超碰演员| 欧美一级在线视频| 毛片av中文字幕一区二区| 国外成人在线视频网站| 欧美一区二区三区在线观看| 国产精品手机在线| 亚洲制服欧美中文字幕中文字幕| 久久久99久久精品女同性| 国产精品久99| 欧美在线视频一区| 在线视频成人| 欧美日韩国产一区二区三区| 亚洲女与黑人做爰| 国产一区在线观看视频| 午夜精品久久久久久久久久久久久| 国产麻豆精品在线观看| 另类激情亚洲| 亚洲性人人天天夜夜摸| 国产亚洲欧美激情| 欧美久久久久中文字幕| 夜夜嗨av一区二区三区| 国产主播一区二区| 国产欧美日韩在线观看| 欧美激情精品久久久久久久变态| 一本一道久久综合狠狠老精东影业 | 亚洲激情二区| 国产毛片久久| 国产精品av久久久久久麻豆网| 欧美中文字幕在线视频| 一区二区黄色| 91久久中文| 亚洲人线精品午夜| 国产欧美日韩激情| 国产欧美欧美| 国产日产欧美一区| 国产欧美一区二区三区在线老狼| 欧美国产一区二区在线观看| 久久久福利视频| 久久精品首页| 久久成人在线| 欧美精品一区二区三区一线天视频| 久久久久se| 欧美风情在线观看| 欧美日韩成人综合在线一区二区| 久久国产精品久久久久久电车 | 一区二区三区成人| 亚洲一区区二区| 久久一区亚洲| 欧美日韩亚洲系列| 国产尤物精品| 在线观看中文字幕不卡| 亚洲精品在线电影| 亚洲欧美激情在线视频| 美女露胸一区二区三区| 欧美日韩国产色视频| 国产欧美日韩免费看aⅴ视频| 在线观看成人av| 亚洲午夜女主播在线直播| 久久婷婷国产综合精品青草| 欧美三区免费完整视频在线观看| 国产精品爽爽ⅴa在线观看| 亚洲国产乱码最新视频| 欧美一区二区三区视频在线| 欧美日韩在线看| a91a精品视频在线观看| 久久久视频精品| 精品不卡一区| 免费国产一区二区| 亚洲人成网站色ww在线| 麻豆精品一区二区av白丝在线| 欧美另类高清视频在线| 亚洲国产精品成人综合色在线婷婷| 韩国在线一区| 久久福利毛片| 国产日韩欧美一区在线| 亚洲精品自在在线观看| 欧美不卡视频一区发布| 国产乱码精品一区二区三区忘忧草| 亚洲三级免费电影| 国产精品一区=区| 亚洲在线免费视频| 在线欧美影院| 国产精品久久福利| 久久综合色播五月| 亚洲网站在线| 99热这里只有精品8| 国产亚洲欧美日韩精品| 国产精品男女猛烈高潮激情| 嫩草影视亚洲| 欧美大胆a视频| 亚洲欧美日韩综合一区| 亚洲精品乱码久久久久| 伊人久久婷婷色综合98网| 国产欧美精品日韩| 国产午夜精品一区理论片飘花| 国产精品久久久久久久久动漫| 欧美激情国产精品| 久久久久久久一区二区| 亚洲免费观看高清完整版在线观看熊| 国产视频一区三区| 国产在线精品成人一区二区三区| 国产伦精品一区二区| 国产一级久久| 亚洲伦理在线观看| 亚洲视频一区二区免费在线观看| 国产精品99久久99久久久二8| 亚洲视频日本| 久久精品国产亚洲a| 欧美成年人视频| 国产精品专区h在线观看| 精品福利免费观看| 亚洲一区二区免费看| 久久嫩草精品久久久久| 欧美三级特黄| 亚洲国产精品一区二区www在线| 亚洲精品资源| 久久深夜福利| 国内外成人在线| 亚洲与欧洲av电影| 欧美黄色免费| 亚洲福利在线视频| 久久成人18免费观看| 欧美精品一区二区三区很污很色的 |