Pike-devel April 2003

pike-devel@lists.lysator.liu.se

11 participants
58 discussions

negative indices in array ranges
by Martin Baehr 14 Aug '26

14 Aug '26

hi, instead of having to do: reverse(reverse(foo/"/")[1..]); i'd very much prefer: (foo/"/")[..-2]; are there any reasons that speak against supporting this other than me not being able to offer a patch? greetings, martin.

13 51

negative indices in array ranges
by Mirar ＠ Pike developers forum 14 Aug '26

14 Aug '26

levels might possibly be from -1 and up, -1 meaning infinite.

10 25

full MySQL 4.x support. or pike roadmap
by thomas.gusenleitner＠com-bet.com ＠ Pike developers forum 01 Mar '26

01 Mar '26

HI to all! mysql 4.x support works only with a mysql CFLAGS=-DUSE_OLD_FUNCTIONS is this correct ? are there plans to make a full 4.x support ? bye, thomas

4 4

Image.SSL?
by Marcus Comstedt (ACROSS) (Hail Ilpalazzo!) ＠ Pike (-) developers forum 04 May '04

04 May '04

Pike v7.3 release 62 running Hilfe v3.5 (Incremental Pike Frontend) > Image.gurkburk; /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/handshake.pike:978:Index 'decode_certificate' not present in module 'X509'. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:26:Error finding program /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:26:Illegal program pointer. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:35:Illegal program pointer. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:36:Illegal program pointer. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:37:Illegal program pointer. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:41:No inherit or surrounding class alert. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:42:No inherit or surrounding class urgent. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:43:No inherit or surrounding class application. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:46:No inherit or surrounding class handshake. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:123:No inherit or surrounding class alert. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/connection.pike:126:No inherit or surrounding class urgent. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:9:Error finding program /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:9:Illegal program pointer. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:120:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:147:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:364:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:397:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:402:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:410:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:420:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:425:Must return a value for a non-void function. /pike/home/marcus/Pike/7.3/lib/modules/SSL.pmod/sslfile.pike:434:Must return a value for a non-void function. Compiler Error: 1:Index 'gurkburk' not present in module 'Image'. > Two questions: 1) Why is it trying to load SSL.pmod? 2) Why is it failing?

12 137

More about ADTs
by Peta, jo det �r jag ＠ Pike developers forum 04 May '04

04 May '04

I've made som changes and here is a new suggestion for a common interface of the new ADTs. Common API for new ADTs in Pike 1. Introduction This document describes a common platform for new ADTs in pike to stand on. The purpose of the platform is to make the new ADTs as flexible as possible and possible to use together with generic algorithms. The base of the platform is the Collection concept, being the base concepts of all the ADTs, and the Iterator concept making it possible to iterate over collections without knowing the underlying structure. Besides the two base concepts this document also describes a few sub-concepts that are related to the two base concepts according to the two figures below. Figur 1 Collection concepts Collection |-----------> Ordered Collection | | | |--------> Sequence | |--------> Ordered Set <------| | |--------> Ordered Map <--| | |----> Map --------------------------------------| | |----> Set ------------------------------------------| Figur 2 Interface concepts Iterator -------> Ordered Iterator 2. Collection concepts 2.1. Collection Collection is the base concept of all the ADTs. The reason it is called collection is that all the ADTs in the library is in some way a collection of items. To implement a collection the following methods must be implemented iterator _get_iterator() Return an iterator for this ADT positioned at the first item in the ADT. int _sizeof() Return the current size of the ADT. Return -1 if the size could not be decided or is truly unlimited. array _values() Return an array with the values in the ADT. int _has_value(mixed value) Returns 1 if value is in the value domain of collection, or 0 (zero) if not found int _equal(mixed coll) Decide if the collection coll and this collection contains the same elements, an if it is important, in the same order. string _sprintf(int conversion_type, mapping(string:int)|void params) Present the collection in a human readable way. For more information see _sprintf in the pike manual. int is_empty() Return 0 if the ADT do has elements. int max_size() Return the maximal size of the ADT if there is any, otherwise -1. void clear() Clear the ADT. iterator first() Return an iterator for this ADT positioned at the first item in the ADT, same as _get_iterator(). iterator last() Return an iterator for this ADT positioned at the last item in the ADT. 2.2. Set Set is a collection containing any number of items but only one of each item. It is a sub-concept of Collection and must thereby besides implementing the methods below also implements the methods in Collections. int '[](mixed item) Return 1 if the item could be found in the set, 0 if it couldn't int '[]=(mixed item, int exist) Add the item to the set if exist is true remove the item if exist is false. iterator get_iterator(mixed item) Get an iterator for this ADT positioned at the item or null if the item could not be found int insert(mixed item) Add the item to the set if it isn't a part of the set. Return true if the item was added, else false. mixed delete(mixed item) Remove the item from the set. If the item was removed it will be returned otherwise a 0 zero_type is returned. multiset cast("multiset") The set should at least be able to cast to a multiset, additional castings are optional. 2.3. Map A map is a data structure that allows you to associate a key with one or more values and then quickly retrieve those values using the key. To implement a Map the ADT must have all the methods in this concept and in the Collection concept. mixed '[](mixed key) Return the item associated with the key if it could be found, 0 if it couldn't mixed '[]=(mixed key, mixed item) If there is an item with the key key then the associated item will be overwritten with the supplied item. If there is no key in the map a new key-item pair will be added. iterator get_iterator(mixed key) Get an iterator for this ADT positioned at the key or null if the key could not be found. mixed insert(mixed key, mixed item) If the key doesn't exist or duplicates are allowed, associate the value with the key and return 0, otherwise don't modify the map and return the current value associated with the key. mixed delete(mixed key) Remove the pair with the key key. Return the keys value if it was removed, if the key could not be removed return zero_type. mapping cast("mapping") The map should at leas be able to cast to a mapping, additional castings are optional. 2.4. OrderedCollection An OrderedCollection is a collection that has indices that could be used to find the values and the indices are strictly ordered is some way. Any type could be used as an index if it satisfies a few rules. See Index for more information. There is also nothing that prevents the use of the values as indices as long as the value satisfies the rules for an Index. int _has_index(int index) Returns 1 if index is in the index domain of collection, or 0 (zero) if not found array _indices() Return an array with the indices of the collection. 2.5. Sequence A sequence is a sub-concept of an Ordered Collection. It is a linear collection that allows index-based access and automatically expands to accommodate new elements. A vector is a good example. mixed '[](int ind) Return the item at index ind in the sequence. Throw an error if ind is out of range. mixed '[]=(int ind, mixed item) Set the index ind to be item. Throw an error if ind is out of range int _search(mixed item, void|int start) Return the index of the first item in the sequence with the index start or higher that match the item item. -1 if no object was found. Throw an error if start is out of range. void insert(index ind, mixed item) Insert an item in the sequence at the index ind. The size of the sequence is increased by one and the items at index and above have their indices increases by one. Throw an error if ind is out of range. int(0..1) delete(mixed item) Remove the first value that are equal to item from the sequence. Return 1 if a item was removed, otherwise 0; void add(mixed item) Add the object item as fast as possible to the sequence. int delete_at(int ind) Remove the item at the index ind. The size of the sequence is decreased by one and the items above ind have their indices decreases by one. Return 0 if the removal failed. Throw an error if ind is out of range. iterator get_iterator(int ind) Get an iterator for this ADT positioned at the index ind. Throw an error if ind is out of range. array cast("array") The sequence should at least be able to cast to an array, additional castings are optional. 2.6. OrderedMap An OrderedMap is a map where the keys are orderable and the iterator belonging to an OrderedMap will traverse the values in that order. 2.7. OrderedSet An OrderedSet is a set were the values are orderable and the iterator belonging to an OrderedSet will traverse the values in that order. 3. Iterator concepts 3.1. Iterator The iterator concept does not differ much from the present day iterator. Only a few new methods are added to make it possible to step backwards and compare iterators. int(01) '!() Should return 0 (zero) when not at end of collection, and 1 at end of collection void '+=(int n) Should advance the specified number of steps iterator '-=(int n) Move the iterator n steps backwards int '==(iterator iter) Return true if the two iterators is pointing to the same object. Throw an error if the two iterators belong to different collections. mixed index() Should return the current index. mixed value() Should return the current value int has_previous() Return true if the iterator can move one step backwards. int has_next() Return true if the iterator can move one step forwards. It have the same use as '!(). collection get_collection() Return the collection this iterator iterates over. Optional void set_value(mixed value) Set the value of this iterator. This method should only be available if it is possible to set the value via an iterator. Optional void add(mixed value) Add a new item to the collection after the item the iterator currently is pointing at. This method should only be available if it is possible to add entries via the iterator Optional mixed remove() Remove the item the iterator currently is pointing at and move to the next item. This method should only be available if it is possible to remove entries via the iterator 3.2. OrderedIterator An OrderedIterator is an iterator working on an OrderedCollection. It has two characteristics, first it traverse the collection in the same order each time it is traversed, if the there hasn't been any changes in the collection, beginning with the item with the lowest index and ending with the item with the highest index. Secondly it is possibly to say that an iterator is less then or greater then another iterator. int(0..1) '<(OrderedIterator iter) Return 1 if iter is positioned after this iterator, otherwise 0. Throw an error if the two iterators belong to different collections. Int(0..1) '>(OrderedIterator iter) Return 1 if iter is positioned before this iterator otherwise 0. Throw an error if the two iterators belong to different collections. 4. Index If a type could be used as an index in an OrderedCollection then it must be possible to use the following operations on it. '== If the two indexes a and b is equal it should return 1 otherwise 0. The following rules must also be satisfied. a == a must be true a == b implies b == a !(a == b) implies a != b a == b and b == c implies a == c '< If the index a is ordered lower than b it should return 1 otherwise 0. The following rules must also be satisfied. a < a must be false a < b implies !(b < a) a < b implies (b > a) a < b and b < c implies a < c '> If the index a is ordered higher than b it should return 1 otherwise 0. The following rules must also be satisfied. a > a must be false a > b implies !(b > a) a > b implies b < a a > b and b > c implies a > c

11 73

SDL
by David Hedbor ＠ Pike developers forum 04 May '04

04 May '04

I have now implemented and checked in SDL.Surface->set_pixel and get_pixel methods. Note that they do no boundary checking so if you write outside the surface... Well, go figure. I could add it but I'd rather avoid any checks I can for performance reasons...

6 18

Starting new pike processes from the testsuite
by Niels M�ller (ny flexiblare br�stkorg) ＠ Pike (-) developers forum 24 Feb '04

24 Feb '04

What's the recommended way of starting separate processes (which are Pike programs) from the testsuite? I want to make a test case for the SSL code, by starting a https process using the SSL.pmod/https.pike program (which I'm not sure it really belongs in the module tree) or some similar code, and then use the client code in the url/http modules to connect to it.

9 35

Pike Cookbook
by Martin Nilsson (har bott i google) ＠ Pike (-) developers forum 02 Jun '03

02 Jun '03

Johan Sundström and I are about to make some attempts to make a Pike Cookbook. Regardless if we have the strength to make it all the way into a book or not, I think this is a good project to spend some time on. While we can get some ideas what this cookbook should contain by looking at e.g. the Perl and Python cookbooks, much of what is in them deals with how to solve problems that are inherit in the langauges themselves. As a consequence we would like to know what problems you have with Pike and how you solve them (if you have). Johan and I will set up some sort of database or repository and collect the responses as well as inserting our own stuff. We will probably aim at getting the same basic layout as in the present cookbooks in the database, e.g.: ----------------------8<-------------------- Title: Hello World Contributor: Martin Nilsson Problem: Make a program that prints Hello World! and exits. Solution: int main() { write("Hello World!\n"); } Discussion: The above code is probably the smallest possible program, counting tokens, that solves the problem. Without unessecary white spaces this is 36 characters. A more "proper" solution would however be: int main(int argc, array(string) args, array(strings) env) { write("Hello World!\n"); return 0; } Here all the passed arguments are received in fairly typed variables, which you don't have to do. I say fairly typed, because there is always at least one argument passed to the program, the path of the program itself, so argc could be declared as int(1..). After the interesting code has been executed 0 is returned, as result code of the program. There is an implicit return 0; at the end of every function, which we relied on in the first code. Since the return value is always 0, the main function could be declared to return int(0..0). Since the Pike master only feeds positive return values from main into an exit call, return 0; can be replaced with exit(0);. While this doesn't really matter here it does matter if we chose another aproach for this program all together. When Pike executes a script it first loads the file and compiles it into a program. Then it instansiate an object from the program and call its main function. Thus we can put our code in the object constructor and when finished exit Pike, so it doesn't find out that the main function is missing. void create() { write("Hello World!\n"); exit(0); } ----------------------8<-------------------- So please give us your thoughts, problems and solutions, either here or as private messages.

8 26

Pointers/lvalues
by Martin Stjernholm, Roxen IS ＠ Pike developers forum 14 May '03

14 May '03

Grubba and I started talking a bit about adding lvalues as an explicit data type in Pike. I'll jot down what we arrived at for the record (well, some of it are later thoughts by me): An lvalue is a pointer to a variable that allows the variable to be changed (as opposed to a pointer to a function). Generic variable pointers could be implemented by adding two new svalue types: Pointer to variable in object and pointer to variable in frame (if programs get "proper" static variables in some future they would get this too). The frame case is used for pointers to local variables in functions. Refcounting in frames is already implemented for the sake of nested functions, so returning a pointer to a local variable shouldn't be a problem. The solution with special pointer svalue types is better than the double svalue (the thing to index followed by the index) approach currently used internally for lvalues for two reasons: Firstly the index operation is performed when the pointer is created instead of when it's dereferenced, which trigs errors closer to the source. Secondly it would avoid odd effects in various functions that doesn't expect variable pointers. Pointers to values in arrays, mappings and multisets don't need new svalue types since their iterator objects can be used then (more on that later). Variable pointers would be used like in C. Silly example: int append_to_buf (Stdio.File f, pointer(string) buf) { string in = f->read(); *buf += in; return sizeof (in); } Some new operator lfuns would be needed: &foo => Get the pointer to foo; calls `& in foo. &foo->bar => Get the pointer to foo->bar; calls `&->("bar") in foo. &foo[bar] => Ditto for []; calls `&[](bar) in foo. `& and ``& already exist, so the first operator above would actually become ```& with the current naming system. We're however contemplating a new system with more verbose lfun names; `&this for the new operator, `this&_ for `&, and `_&this for ``&. The similarity between pointers and iterators is obvious, so iterators should be able to act as pointers. To accomplish that an lfun corresponding to the dereferencing * operator is necessary: *foo => Gets the value the pointer points to; calls `*this in foo. It's also interesting to have an lfun that returns a pointer svalue so that it can be used in an lvalue context. An example: for (pointer ptr = &my_obj[0]; *ptr; ptr++) *ptr = reverse (*ptr); ^^^^ Here `&*this would be called to produce a pointer value which is used as lvalue. If `&*this returns an object instead of a basic pointer svalue, `&*this would presumably be tried again, which would make it possible to produce a infinite loop if `&*this should be silly enough to return the iterator itself. A simple check for that might be a good idea. To be symmetric with `[]= and `->=, one would add a `*this=_ instead of `&*this. I do however like `&*this better since it's then possible to do e.g. *ptr += ({17}); with an efficient `+= operation without the need for a special `*this+=_. A `&*this lfun makes it possible to try it in any expression where no better suited lfun is available: foo + bar => Try: foo->`+(bar) Then: bar->``+(foo) Then: *(foo->`&*this) + bar Then: foo + *(bar->`&*this) That could be handy when implementing e.g. "smart" strings like Locale.DeferredLocale. I don't know yet if it overall is a good idea or not, though. It's clearly not a good idea in simple assignments and arbitrary function calls.

17 92

--localdir backwards compatibility
by nisse＠lysator.liu.se 13 May '03

13 May '03

The renaming of --localdir to --prepend-include is annoying when trying to keep a configure.in compatible between 2.13 and more modern versions. To make it less painful, I patched in some backwards compatibility to my local version of autoconf-2.57. Seems to work fine for me. --- autoconf.in-original Tue Nov 5 08:16:59 2002 +++ autoconf.in Tue Apr 15 14:23:43 2003 @@ -194,7 +194,9 @@ --prepend-include=* | -B?* | \ --warnings=* | -W?* ) AUTOM4TE="$AUTOM4TE $1"; shift ;; - + --localdir=* ) + AUTOM4TE="$AUTOM4TE --prepend-include=${1:11}" ; shift ;; + # Options with separated arg passed as is to autom4te. --include | -I | \ --prepend-include | -B | \ @@ -202,7 +204,11 @@ test $# = 1 && eval "$exit_missing_arg" AUTOM4TE="$AUTOM4TE $option $2" shift 2 ;; - + --localdir ) + test $# = 1 && eval "$exit_missing_arg" + AUTOM4TE="$AUTOM4TE --prepend-include $2" + shift 2 ;; + --trace=* | -t?* ) traces="$traces --trace='"`echo "$optarg" | sed "s/'/'\\\\\\\\''/g"`"'" shift ;; Regards, /Niels

9 16

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

Pike-devel April 2003