-
Notifications
You must be signed in to change notification settings - Fork 7
/
dae.rs
187 lines (161 loc) · 4.3 KB
/
dae.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
// parse collada file format
use std::mem;
use std::ptr;
use std::io::{BufferedReader, File};
use std::slice::{Found, NotFound};
// 实现 boyer-moore 算法
fn compare_last_char() {
if false {
if (!last_char_in_search()) {
move_whole_to_next();
}
else {
}
}
else {
compare_last_char()
}
}
type NNode<T> = Option<Box<Node<T>>>; // normal node
type PNode<T> = RawLink<Node<T>>; // pointer node
struct RawLink<T> {
p: *mut T
}
pub struct XmlList<T> {
head: NNode<T>,
tail: PNode<T>,
length: uint,
}
pub struct Node<T> {
child: NNode<T>,
prev: PNode<T>,
next: NNode<T>,
value: T,
}
impl<T> RawLink<T> {
pub fn none() -> RawLink<T> {
RawLink{ p: ptr::null_mut() }
}
pub fn some(n: &mut T) -> RawLink<T>{
RawLink{ p: n}
}
pub fn resolve<'a>(&mut self) -> Option<&'a mut T>{
if self.p.is_null() {
None
} else {
Some(unsafe {mem::transmute(self.p) })
}
}
}
impl<T> Node<T> {
pub fn new(v: T) -> Node<T> {
Node{child: None, prev: RawLink::none(), next: None, value: v}
}
}
fn link_pre<T>(mut new_node: Box<Node<T>>, prev: PNode<T>) -> NNode<T> {
new_node.prev = prev;
Some(new_node)
}
impl<T> XmlList<T> {
pub fn new() -> XmlList<T> {
XmlList{head: None, tail: RawLink::none(), length: 0}
}
fn push_back_node(&mut self, mut new_tail: Box<Node<T>>) {
match self.tail.resolve() {
None => {
self.tail = RawLink::some(&mut *new_tail);
self.head = Some(new_tail);
}
Some(tail) => {
self.tail = RawLink::some(&mut *new_tail);
tail.next = link_pre(new_tail, RawLink::some(tail));
}
}
self.length += 1;
}
pub fn push_back(&mut self, elt: T) {
self.push_back_node(box Node::new(elt))
}
#[inline]
#[unstable = "matches collection reform specification, waiting for dust to settle"]
pub fn iter<'a>(&'a self) -> Items<'a, T> {
Items{nelem: self.len(), head: &self.head, tail: self.tail}
}
#[inline]
#[unstable = "matches collection reform specification, waiting for dust to settle"]
pub fn len(&self) -> uint {
self.length
}
}
pub struct Items<'a, T:'a> {
head: &'a NNode<T>,
tail: PNode<T>,
nelem: uint,
}
impl<'a, A> Iterator<&'a A> for Items<'a A>{
#[inline]
fn next(&mut self) -> Option<&'a A> {
if self.nelem == 0 {
return None;
}
self.head.as_ref().map(|head| {
self.nelem -= 1;
self.head = &head.next;
&head.value
})
}
}
// 先找出 library_*
fn find_tag<'r>(v: &'r[String], tag: &str) -> Option<&'r[String]> {
// let tag_begin = concat!("<" , tag , ">");
// let tag_end = concat!("</" , tag , ">");
let tag_begin = "<".to_string() + String::from_str(tag) + ">".to_string();
let tag_end = "</".to_string() + String::from_str(tag) + ">".to_string();
// println!("{}",tag_begin);
// println!("{}",tag_end);
let index_begin = match v.binary_search(|x| x.cmp(&tag_begin)) {
Found(index) => {
println!("found index: {}",index);
index
},
NotFound(err) => {
println!("not found err: {}", err);
return None
},
};
println!("tag_begin found");
match v.slice(index_begin, v.len()).binary_search(|x| x.cmp(&tag_end)) {
Found(index) => {
println!("found index: {}",index);
return Some(v.slice(index_begin, index))
},
NotFound(err) => {
println!("not found err: {}", err);
return None
},
}
}
// let input = "1.202 2.43 1.567";
// let numbers: Vec<f32> = input.split_str(" ").filter_map(|x| from_str::<f32>(x)).collect();
// let mut sum = 0.0f32;
// for f in numbers.iter() {
// sum += *f;
// }
// println!("{}", sum);
fn main() {
// read line-by-line, parse library_* modules
let path = Path::new("example/models/Badblue_fly.dae");
let raw_lines: String = File::open(&path).read_to_string().unwrap();
let mut trim_lines: Vec<String> = raw_lines.as_slice().split('\n').map(|x| x.trim().to_string()).collect();
trim_lines.sort();
let geometries = find_tag(trim_lines.as_slice(), "library_geometries");
// println!("{}",v);
let mut dlist: XmlList<uint> = XmlList::new();
for i in range(0u, 10u) {
println!("add: {}",i);
dlist.push_back(i);
}
for it in dlist.iter() {
println!("result: {}", it);
}
}