Lesson10 Fianl and fellings
1)Revision History
Date |
Issue |
Description |
Author |
8/May/2015 |
1.0 |
Finish the WPF of our small game,solve the logic problem |
Haoxiaotian |
15/May/2015 |
2.0 |
Finish the windows phone and the windows part |
Haoxiaotian |
2)Problem Statement
we are a group,and we think out a good idea, it's a game,but when we finish it ,find that what we do is a little ugly,there is still a lot to do,and there is a lot to study.
Our game's name is Naughty egg, what you should do is to controll your own ball, and escape from the bads and try to meet the goods. There is 3 level wait for you!
When we start the game, we know nothing, for the interface and the background control. And we first do some logical thinking, and design the basic things of the game, drow some uggly pictures, and after that we began.
Not only did we learn something new, but also we gradually did our work. We also meet with a lot of problems, such as how to bind the action of the interface with the background data. Too many things we are unfamiliar with.
3)Glossary
Table of Contents
1. Introduction
2. Definitions
2.1 What we do
2.2 Team work
2.3 How to achieve it
Introduction:
about the game:
It's a simple game, the idea come from my team mate Shen Yuelong,The following is the main idea:
In our life, there is always something or some people pass by, good or bad, and some are important. But when we have time, when we reflect on ourselves, we ususally find that we missed something or we spent much time on useless things. When we see this, we are gradually growing up. This is our game's main idea.
The game is easy, you are a small ball, there will be lots of things runing background (good or bad), coming and leaving,but you can't see, just like what happened in our life. You are the small ball, when the good comes, the background color will change to green, the closer you are, the deeper the background color will be. And the same with the bad things, the diffence is in this cases the color will be red.
Definitions
(1)What we do
a simple game
(2)Team work
with my partner ShenYuelong
(3)How to achieve it
The launguage:c#
visual studio 2013, work with the wpf, windows 8.1 and windows phone 8.1
4)Supplementary Specification
Table of Contents
1. Objectives
2. Scope
3. References
4. Functionality
5. Usability
6. Reliability
7. Performance
8. Supportability
9. Security
10. Design Constraints
Naughty Egg Specification
Objectives
What we want is though this game developing experience, turely learn something and do something.
And the main idea of our game is also inform us do the important things in different times and try to avoid the bad things surrounded with us.
Scope
Using in the windows platform
References
books and some blogs
Functionality
Have fun and help to understand what is life.
Usability
Windows 8.1 and Windows Phone.
Reliability
The game is still have some bags, we need do more.
Performance
Clear, stable and efficient. Easy to use and friendly to users.
Supportability
None.
Security
Local file saving data, not connecting to the Internet.
Lesson10 Fianl and fellings的更多相关文章
- Java之fianl修饰符
fianl修饰的变量不可以改变,一旦获得初始值,该final变量的值就不能被重新赋值. 1.final成员变量(必需由程序员显式地指定初始值) 类变量:必须在静态初始化块中或者声明该变量时指定初始值, ...
- 《java入门第一季》之面向对象面试题(fianl关键字)
/* 面试题:final修饰局部变量的问题 基本类型:基本类型的值不能发生改变. 引用类型:引用类型的(地址值)(不能发生改变),但是,该对象的堆内存的值是可以改变的. */ class Studen ...
- React.js 小书 Lesson10 - 组件的 state 和 setState
作者:胡子大哈 原文链接:http://huziketang.com/books/react/lesson10 转载请注明出处,保留原文链接和作者信息. state 我们前面提到过,一个组件的显示形态 ...
- lesson10总结
package lesson10; public class Fa { String name="I am Fa"; static{ System.out.println(&qu ...
- fianl关键词
一.final关键字概述 final关键字具有最终或不可改变的含义,可用于修饰类.变量.方法.因此被final修饰的类.变量.方法具有以下特征: --final修饰的类不能被继承: --final修饰 ...
- lesson10:hashmap变慢原因分析
下面的英文描述了String.hashCode()方法,在特定情况下,返回值为0的问题: Java offers the HashMap and Hashtable classes, which us ...
- Day05(fianl、抽象类、接口)
final关键字修饰的类不能被继承.修改,修饰的方法不能被子类覆盖,修饰的变量(是常量)不能被修改. 抽象类:abstract关键字定义的类 继承树中越是在上方的类越抽象,在解决实际问题时,通常将父类 ...
- static和fianl修饰变量的区别
参考:http://hllvm.group.iteye.com/group/topic/37682 http://blog.csdn.net/javakuroro/article/details/68 ...
- 自测之Lesson10:管道
题目:建立双向管道,实现:父进程向子进程传送一个字符串,子进程对该字符串进行处理(小写字母转为大写字母)后再传回父进程. 实现代码: #include <stdio.h> #include ...
随机推荐
- py2exe安装使用
一.简介 py2exe是一个将python脚本转换成windows上的可独立执行的可执行程序(*.exe)的工具,这样,你就可以不用装python而在windows系统上运行这个可执行程序. py2e ...
- linux 下chown改变隐藏文件夹
chown 在更改隐藏文件的时候,发现无法更改其用户组,如果需要将隐藏文件夹也做一个更改,那么需要加上-h选项. sudo chown ai/node/ * -hR 使用以上命令即可.
- 如何在nlp问题中定义自己的数据集
我之前大致写了一篇在pytorch中如何自己定义数据集合,在这里如何自定义数据集 不过这个例子使用的是image,也就是图像.如果我们用到的是文本呢,处理的是NLP问题呢? 在解决这个问题的时候,我在 ...
- [Codeforces967C]Stairs and Elevators(二分查找)
[不稳定的传送门] Sloution 每次试一下最近的2个楼梯或者电梯就行了 Code #include <cstdio> #include <algorithm> #incl ...
- activity堆栈式管理
package com.chinaCEB.cebActivity.utils; import java.util.Stack; import android.app.Activity; import ...
- poj3348 Cows 凸包 叉积求多边形面积
graham扫描法,参考yyb #include <algorithm> #include <iostream> #include <cstdio> #includ ...
- 《Cracking the Coding Interview》——第13章:C和C++——题目7
2014-04-25 20:18 题目:给定一个Node结构体,其中包含数据成员和两个Node*指针指向其他两个Node结构(还不如直接说这是个图呢).给你一个Node指针作为参数,请做一份深拷贝作为 ...
- 《Cracking the Coding Interview》——第11章:排序和搜索——题目7
2014-03-21 22:05 题目:给你N个盒子堆成一座塔,要求下面盒子的长和宽都要严格大于上面的.问最多能堆多少个盒子? 解法1:O(n^2)的动态规划解决.其实是最长递增子序列问题,所以也可以 ...
- 《Cracking the Coding Interview》——第11章:排序和搜索——题目1
2014-03-21 20:35 题目:给定已升序排列的数组A和数组B,如果A有足够的额外空间容纳A和B,请讲B数组合入到A中. 解法:由后往前进行归并. 代码: // 11.1 Given two ...
- 《Cracking the Coding Interview》——第1章:数组和字符串——题目1
2014-03-18 01:25 题目:给定一个字符串,判断其中是否有重复字母. 解法:对于可能有n种字符的字符集,用一个长度为n的数组统计每个字符的出现次数,大于1则表示有重复. 代码: // 1. ...