Does anybody have ann taylor coupon code? - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Fashion - 美丽时尚

Does anybody have ann taylor coupon code?

Does anybody have ann taylor coupon code?# Fashion - 美丽时尚

s*32011-02-22 08:02

1 楼

UTF-8 encoding scheme is described below:
0XXXXXXX = this is the entire rune
10XXXXXX = this is a continuation of the rune from the previous byte
110XXXXX = this is the start of a 2-byte rune.
1110XXXX = this is the start of a 3-byte rune.
11110XXX = this is the start of a 4-byte rune.
111110XX = this is the start of a 5-byte rune.
1111110X = this is the start of a 6-byte rune.
11111110 = this is the start of a 7-byte rune.
11111111 = this is the start of a 8-byte rune.
For example, a 3-byte rune would be 1110XXXX 10XXXXXX 10XXXXXX.
Write a function that decides whether a given byte array (or string) is
valid UTF-8 encoded text.
求讨论求指导

S*y2011-02-22 08:02

2 楼

站内联系。虽然journal IF很烂（IF<0.5),还是希望能认真一下，所以请提供正式（学
校或研究所）email以便向编辑推荐。另请附一两行专业背景。

h*m2011-02-22 08:02

3 楼

Please email me if you have. Thanks a lot.

x*j2011-02-22 08:02

4 楼

没太看懂

S*y2011-02-22 08:02

5 楼

Gone.

【在 S********y 的大作中提到】

: 站内联系。虽然journal IF很烂（IF<0.5),还是希望能认真一下，所以请提供正式（学
: 校或研究所）email以便向编辑推荐。另请附一两行专业背景。

g*l2011-02-22 08:02

6 楼

试试welcome1, 25%off full-price
字母要大写

【在 h****m 的大作中提到】

: Please email me if you have. Thanks a lot.

l*a2011-02-22 08:02

7 楼

那就去学习一下UTF-8的定义

【在 x***j 的大作中提到】

: 没太看懂

l*a2011-02-22 08:02

8 楼

通过这个识别每个byte的type,再check是否满足规则？
public int getType(byte input) {
int target=1<<7;
int type=0;
while(target>0) {
if(intput & target==0) return type;
type++;
target>=1;
}
}

【在 s*******3 的大作中提到】

: UTF-8 encoding scheme is described below:
: 0XXXXXXX = this is the entire rune
: 10XXXXXX = this is a continuation of the rune from the previous byte
: 110XXXXX = this is the start of a 2-byte rune.
: 1110XXXX = this is the start of a 3-byte rune.
: 11110XXX = this is the start of a 4-byte rune.
: 111110XX = this is the start of a 5-byte rune.
: 1111110X = this is the start of a 6-byte rune.
: 11111110 = this is the start of a 7-byte rune.
: 11111111 = this is the start of a 8-byte rune.

l*a2011-02-22 08:02

9 楼

Nice~
public boolean validUTF8(byte [] array){
if (array == null || array.length == 0){
return false;
}
int leftByte = 0;
for (int i = 0; i < array.length; i++){
int val = getType(array[i]);
if (leftByte == 0){ // new start
if (val == 1){ // continue byte
return false;
}
else if (val == 0){
continue;
}
else {
leftByte = val-1;
}
}
else{ // shall continue
if (val != 1){
return false;
}
else{
leftByte--;
}
}
}
if (leftByte == 0){
return true;
}
else{
return false;
}
}

public int getType(byte input) {
int target=1<<7;
int type=0;
while(target>0) {
if((input & target)==0) return type;
type++;
target = target>>1;
}
return type;
}

【在 l*****a 的大作中提到】

: 通过这个识别每个byte的type,再check是否满足规则？
: public int getType(byte input) {
: int target=1<<7;
: int type=0;
: while(target>0) {
: if(intput & target==0) return type;
: type++;
: target>=1;
: }
: }

p*p2011-02-22 08:02

10 楼

这样做不是最优吧。没必要把8位都循环一遍。
遇到第一个0就可以返回了：
private int getType(byte b) {
int mask = 1 << 7;
int type = 0;
while((mask & b) != 0) {
type++;
mask >>= 1;
}
return type;
}

【在 l*****a 的大作中提到】

p*p2011-02-22 08:02

11 楼

看错了。你的方法也是第一个0就返回。

【在 p**p 的大作中提到】

: 这样做不是最优吧。没必要把8位都循环一遍。
: 遇到第一个0就可以返回了：
: private int getType(byte b) {
: int mask = 1 << 7;
: int type = 0;
: while((mask & b) != 0) {
: type++;
: mask >>= 1;
: }
: return type;

p*22011-02-22 08:02

12 楼

我回家写一下

【在 l*****a 的大作中提到】

p*p2011-02-22 08:02

13 楼

private int getType(byte b) {
int mask = 1 << 7;
int type = 0;
while((mask & b) != 0) {
type++;
mask >>= 1;
}
return type;
}

public boolean isValidUTF8(byte[] bytes) {
if(bytes == null || bytes.length == 0) {
return false;
}
int bytesLeft = 0;
for(byte b : bytes) {
int type = getType(b);
if(type == 0) {
if(bytesLeft != 0) {
return false;
}
continue;
} else if (type == 1) {
if(bytesLeft == 0) {
return false;
}
bytesLeft--;
} else {
if(bytesLeft != 0) {
return false;
}
bytesLeft = type-1;
}
}
return bytesLeft == 0;
}

【在 s*******3 的大作中提到】

n*p2011-02-22 08:02

14 楼

while(s != NULL && *s != NULL)
{
if (*s & 0x80 == 0) {s++; continue;}
if (*s & 0xC0 == 0x80) return false;
char* t = s+1;
for(int bitmask = 0x40;
bitmask >0 && (*s & bitmask != 0);
bitmask /= 2, t++)
if (*t == NULL || (*t & 0xC0 != 0x80)) return false;
s = t + 1;
}
return true;

【在 s*******3 的大作中提到】

p*22011-02-22 08:02

15 楼

def isUTF(xs: List[String]):Boolean = {
xs match {
case Nil => true
case head::tail => head.toList match {
case '0'::_ => isUTF(xs.tail)
case '1'::'0'::_ => false
case _ =>
val len = (x: String) => x.prefixLength(_ == '1')
val l = len(head)
val rest = tail.take(l-1)
rest.size == l-1 && rest.forall(len(_)==1) && isUTF(xs.drop(l))
}
}
}

l*82011-02-22 08:02

16 楼

bool isUTF8(const string & str) {
int ct = 0;
for (char ch : str) {
int type = 8;
for (ch = ~ch; ch; ch >>= 1)
--type;
if (ct > 0) {
if (type != 1) return false;
--ct;
} else {
if (type == 1) return false;
ct = max(0, type - 1);
}
}
return ct == 0;
}