PHP array ordering
Publish: 19.10.2007 15:45:21Array sorting is very simple, because PHP have plenty of implements sort functions. Problem incoming as late as case, when we want sort of method, which isn’t implements.
{0}HTC S710 VOX
Publish: 18.9.2007 22:49:51It is extraordinary mobile phone, which is full of equipment as telescopic mini-keyboard or Wi-Fi. This article isn’t recension, but first familiarization only.
{6804}Modified Preorder Tree Traversal Algorithm #3
Publish: 17.9.2007 16:11:43Modified preorder tree traversal is one of the meanings, how to save tree structure in relational database. In this third part we will finish moving of bundles and more we will create very simple method to renumber of embranchments.
{0}Simple check variables
Publish: 18.9.2007 12:22:02The forms are practically simplest method how to get dates from user. This simplicity have connection with danger of this dates. We can’t believe to users and so it is necessary all this inputs make safe and check dates. It is not enough e.g. write, that in this input user must write valid email, because always exists somebody, who writes random string and not valid email. Badly checked input can lead to errors as SQL injection or XSS attack. <br /><br />
Such form is component of almost every Web and if you are bored with making check of each such form, you may make few so simple functions, which will care about checking. It can’t be only forms, but also about checking of variables in scripts. In this example we will make class, which will have each method to care about check of different value in.
{4667}Modified Preorder Tree Traversal Algoritm #2
Publish: 11.8.2007 00:32:33Modified preorder tree traversal is one of the meanings, how to save tree structure in relational database. We will show in this article, how we can erase or move embranchments from created tree.
{0}Modified Preorder Tree Traversal Algoritmus #1
Publish: 10.8.2007 14:37:11Modified Preorder Tree Traversal is one of the methods, how to save tree structure of dates in relational databases. Methods, how to save tree structure is of course plenty, but not all are so efficient. We can use for example various recursive methods, which are mostly in the bigger size of trees very slow because of for gaining of the whole tree will be needed minimally as many SQL queries as many levels of branches is. Next chance is use container, which is faster then recursion, but also in the bigger size of tree we will rain down many SQL queries on database.
{42352}
