TMS320F28335内部有三个SCI模块，SCIA、SCIB、SCIC。
每一个SCI模块都有一个接收器和发送器，SCI的接收器和发送器各有一个16级的FIFO(First In First Out先入先出)队列，它们都还有自己独立的使能位和中断位；可以工作在半双工或全双工模式；...
分类：
其他好文 时间：
2014-11-22 13:24:38
阅读次数：
270
关于如何使用EF Power Tool的介绍请看 http://www.cnblogs.com/LingzhiSun/archive/2011/05/24/EFPowerTool_1.html， 这里不再啰嗦。MySql里有个默认的范例数据库 world， 里面有三个表，下载Entity Frame...
分类：
数据库 时间：
2014-11-22 11:50:04
阅读次数：
244
Description
Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her in the first station of Algorithms City Metro, ...
分类：
其他好文 时间：
2014-11-21 23:21:05
阅读次数：
499
Let'sbegin witha naive method.We first need to sort the array A[n]. And we want to solve the problem by iterating through A from beginning and ending....
分类：
其他好文 时间：
2014-11-21 20:28:55
阅读次数：
159
fao.us第二篇：Engine Events
Document events have the opportunity to first be intercepted at the Famo.us Surface upon which the event occurs, then by the on() method of the Context containing that surface, and finally as a default, the Engine itself.
事件首先被发生事件的...
分类：
其他好文 时间：
2014-11-21 12:50:28
阅读次数：
183
ProblemImplement Count And Say function. For example, first, let user input a number, say 1. Then, the function will generate the next 10 numbers whic...
分类：
其他好文 时间：
2014-11-21 10:20:56
阅读次数：
158
Description
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of think...
分类：
其他好文 时间：
2014-11-20 23:50:12
阅读次数：
354
一：起因
（1）STL中关于二分查找的函数有三个：lower_bound 、upper_bound 、binary_search —— 这三个函数都运用于有序区间（当然这也是运用二分查找
的前提），下面记录一下这两个函数；
（2）ForwardIter lower_bound(ForwardIter first, ForwardIter last,const _Tp& val)算法返回一个...
分类：
其他好文 时间：
2014-11-20 23:47:22
阅读次数：
152
Problem B: Andy's First Dictionary
Time limit: 3 seconds
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of wo...
分类：
其他好文 时间：
2014-11-20 23:43:25
阅读次数：
299
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类：
其他好文 时间：
2014-11-20 23:32:37
阅读次数：
254
