简体中文
Why Flying?
Focusing on algorithm, software development, internet application and service etc.
TinyMCE integration with phpBB3
Modification Name: TinyMCE integration
Author: Garak
Modification Description:: Integrate TinyMCE WYSIWYG editor in the posting textarea.
Modification Version:: 0.4.3
Requirements: TinyMCE 3.2.0.2 or above
Screenshots: example screenshot (sorry it’s in italian)
New!: since 0.2 version, font size is working properly
Instructions
1 - download TinyMCE (Note: this MOD was tested with version 3.2.0.2, any later 3.2.X versionshould work). Optional: download language pack for a localized version (in this case, please notice comments inside config file at step 5)
2 - unzip tiny_mce directory (Note: it’s NOT the main directory) under styles/prosilver/template/
So, you should have a directory named styles/prosilver/template/tiny_mce (Note: this modcould work with other themes also, but it’s untested)
3 - open file styles/prosilver/template/tiny_mce/plugins/bbcode/editor_plugin.js and replace its content with the following
Read the rest of this entry »
December 31st, 2010  | Posted in Software and Service |   Comments Off
Double-Array Trie
Definition. For a transition from state s to t which takes character c as the input, the condition maintained in the double-array trie is:
check[base[s] + c] = s
base[s] + c = t
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
Procedure Relocate(s : state; b : base_index) 
//Move base for state s to a new place beginning at b  
begin 
foreach input character c for the state s 
//i.e. foreach c such that check[base[s] + c]] = s 
begin 
check[b + c] := s; //mark owner 
base[b + c] := base[base[s] + c]; //copy data 
//the node base[s] + c is to be moved to b + c; 
//Hence, for any i for which check[i] = base[s] + c, 
//update check[i] to b + c 
foreach input character d for the node base[s] + c 
begin 
check[base[base[s] + c] + d] := b + c 
end; 
check[base[s] + c] := none //free the cell
end; 
base[s] := b 
end
September 15th, 2010  | Posted in Algorithm and Arts |   Comments Off
Find The Shortest Path: Dijkstra
Dijkstra is one of the most classic algorithm, which is used to find the shortest path from one vertex to other vertexes in graph. The algorithm use greedy algorithm to find the next shortest path gradually, until all the paths are found.
The complex of the algorithm is O^2, the following is the sample code of Dijkstra: Read the rest of this entry »
July 29th, 2010  | Posted in Algorithm and Arts |   Comments Off
tomcat+hibernate: could not find datasource error!
“tomcat+hibernate: could not find datasource” is a very common error when you config hibernate using tomcat datasource. After survey a lot of material, here I give a right configuration method. I hope it can help you!
First, config tomcat data source. Find the file Tomcat 5.5\conf\Context.x