Pike-devel October 2002

pike-devel@lists.lysator.liu.se

5 participants
49 discussions

7.3 -> 7.4
by Johan Sundstr�m (ska bli kalif i st�llet f�r kalifen) ＠ Pike (-) developers forum 05 Dec '02

05 Dec '02

Comments, AIEE!s and other thoughts about this (Nilsson and I trying to remember what should be done and figure out a good way to do so): # in the raw repository: > mv 7.3 7.4 # elsewhere: > cvs co Pike/7.4 > cd Pike/7.4 > cvs tag -R pre73to745split # back in the reposityory: # remove empty directories > mv 7.4/README.txt 7.4/README > mv 7.4/README.cvs.txt 7.4/README.cvs > cp -rp 7.4 7.5 # finish 7.4/CHANGES # clean up 7.5/CHANGES # (tell someone to update their rsync settings) # rerun CL indexer (since raw changes go unnoticed) # make dists # make announce

3 3

Dumping modules outside of install.pike - how to?
by Marek Habersack (Grendel) ＠ Pike (-) developers forum 21 Nov '02

21 Nov '02

As mentioned in the other posting, I have the following problem: /usr/lib/pike7.3/7.3.58/modules/Standards.pmod/PKCS.pmod/RSA.pmod.o:-: Warning: Decode failed: Failed to decode program "/tmp/buildd/pike7.3-7.3.58/lib/modules/Crypto/rsa.pike". it happens because I have to redump the PKCS module in the Debian compliation process, otherwise the .o files in PKCS.pmod will have incorrect data. I'm dumping the modules with a line similar to that used from within install.pike (see lines 51, 52 and 182 of the packaging/debian/rules file) and yet the dumped files have incorrect paths embedded in them. I'd appreciate some help on that one...

2 1

Proposal for new ADT interface
by Peta, jo det �r jag ＠ Pike developers forum 02 Nov '02

02 Nov '02

I'm currently working on a thesis that should bring Pike some new ADTs. I'm currently working on a common interface for the new ADTs and this is a draft of how it might be. The goal of the interface is resemble as much as possible of the current types array, multiset and mapping. Another goal with the interface is to keep it as minimal as possible. No unnecessary methods. The reason is simple, lack of time. The time I've got on hand is far to little to do a trough out analysis of possible fields of application and methods in the ADTs. The solution is to keep the interface incomplete by sufficient to work with a few algorithms and let other add new methods when they develop new algorithms. The base of the interface is four different concepts, one base concept and three sub-concepts that inherit all the methods from the base concept. Collection |---- Sequence |---- Set |---- Map Additional sub-concepts to the sub-concepts could be added later, for example sorted set. If an ADT implements all the methods in a concept and its super concepts it is an implementation of the concept. 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. 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. array _values() Return an array with the values in the ADT. 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. void add_all(collection col) Add all the items in the collection col to this collection. Sequence A sequence is a linear container that allows index-based access and automatically expands to accommodate new elements. A vector is a good example. void insert(int 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 remove(mixed item) Remove the item item from the sequence. Return the number of removed items. int index_of(int ind, mixed item) Return the index of the first item in the sequence with the index ind or higher that mach the item item. -1 if no object was found. Throw an error if ind is out of range. void add(mixed item) Add the object item as fast as possible to the sequence. Int remove_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. 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 Set Set is a collection containing any number of items but only one of each item. 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 '[](set set, 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. 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. array _indices() Return an array with the indices in the map. iterator get_iterator(mixed key) Get an iterator for this ADT positioned at the key or null if the key could not be found. int remove(mixed key) Remove the pair with the key key. Return 0 if the key could not be removed. 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 changes I've also analysed the current iterators and how well they would work with generic algorithms and I found that it is only one thing that really lacks, the possibility to walk backwards. Actually the possibility to walk backwards is already there, it just doesn't have it's own method. iterator '-=(int n) Move the iterator n steps backwards 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 '! but since there is a has_previous I believe it should be a has_next to. int '==(iterator iter) Return true if the two iterators is pointing to the same object. Well this is briefly what I have in mind. If you have any questions or comments you're more then welcome.

4 11

pike 7.3 Thread.Condition.wait and roxen.pike
by Martin Stjernholm, Roxen IS ＠ Pike developers forum 02 Nov '02

02 Nov '02

That is most odd. Could you try to minimize the differences between your version and mine to see when it stops working? Can't do it myself since my variant works for me (it's exactly that fix I've made in a couple of places in the WebServer 3.3 cvs). It must some strange compiler bug here. / Martin Stjernholm, Roxen IS Previous text: >2002-10-24 21:21: >Subject: pike 7.3 Thread.Condition.wait and roxen.pike >-------------------------------------------------------------------- >It works. At least for me, which yours doesn't. > > / Martin Nilsson (Fake Build Master) >

4 15

Re: Proposal for new ADT interface
by Leif Stensson, Lysator ＠ Pike developers forum 29 Oct '02

29 Oct '02

Sure, but this is supposed to be a master thesis work. Just adding wrappers to existing datatypes seem more like a weekend's work, or less. So I wondered if there was something more to it than it seemed from the description Peta just gave. / Leif Stensson, Lysator Previous text: >2002-10-28 18:54: >Subject: Re: Proposal for new ADT interface >-------------------------------------------------------------------- >Isn't the point to build a base standard, to later extend it with >other abstract datatypes? > > > > / Brevbäraren >

3 2

References to Thread.Mutex
by Martin Stjernholm, Roxen IS ＠ Pike developers forum 28 Oct '02

28 Oct '02

I've now fixed a ref from Thread.MutexKey to Thread.Mutex.

1 0

allocate_mapping
by Martin Nilsson (Fake Build Master) ＠ Pike (-) developers forum 27 Oct '02

27 Oct '02

What is the size-argument to allocate_mapping? The maximum number of entries or the expected number of entries?

2 2

pike 7.3 Thread.Condition.wait and roxen.pike
by Martin Nilsson (Fake Build Master) ＠ Pike (-) developers forum 25 Oct '02

25 Oct '02

Default is perhaps more desriptive.

1 0

Xenofarm and Pike binary export.
by Xavier Beaudouin - Kiwi ＠ Pike developers forum 25 Oct '02

25 Oct '02

Howdy, Seems that I have trouble on one machine behind my dsl link... Since binary export is setup here, I cannot send result, timeout is allways reached and the result is queued forever. Is there any way to either : - fix this ? - to separe binary export from results sending ? - to avoid binary export ? Thanks ----/ Sample output /----- Resending rescue_default/ThuOct24132406CEST2002/xenofarm_result.tar.gz Host: pike.ida.liu.se File: generated/pikefarm/packages/result Port: 80 flen: 4669808 IP : 130.236.182.30 Connecting...done sending request..done sending data..[loong time]Failed to resend. Resending in the next client run. ----/ end / ----------------

2 2

mktime
by Martin Nilsson (Fake Build Master) ＠ Pike (-) developers forum 25 Oct '02

25 Oct '02

Wouldn't it be simpler to write a mktime function from scratch to use instead of getting the OS-ones to work?

3 3

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 October 2002