return false;
}
-astring filename_list::text_form() const
+astring filename_list::text_form(int max_lines) const
{
astring to_return;
-//hmmm: a length limit might be nice?
for (int i = 0; i < elements(); i++) {
to_return += a_sprintf("%d. ", i + 1);
if (get(i))
true if the size is different (when EQUAL_FILESIZE is true), when the timestamp is different
(when EQUAL_TIMESTAMP is true), and when the checksum is different (you get the idea). */
- basis::astring text_form() const;
+ //! max_lines is the maximum number of lines to print into the string.
+ basis::astring text_form(int max_lines = MAXINT32) const;
virtual int packed_size() const;
The buckets are currently simple lists, but if the hashing algorithm is well
chosen, then that's not a major problem. This makes lookups a lot faster
than a linear search, but no particular performance guarantees are made at
- this time (hmmm).
+ this time.
*/
template <class key_type, class contents>
//! Parses XML input and invokes a callback for the different syntactic pieces.
-// hmmm, could this be the first class ever named this? perhaps it should be
-// in a textual namespace. -->after current sprint.
-
class xml_parser
{
public:
astring buffer;
while (!ini.eof()) {
int chars = ini.getline(buffer, MAX_LINE_SIZE);
- if (!chars) continue; // hmmm.
+ if (!chars) continue; // hmmm: what does no chars mean?
variable_tokenizer t;
t.parse(buffer);
DEFINE_CLASS_NAME("raw_socket");
-// int open(
-//hmmm...
-
int close(basis::un_int &socket);
// disconnects, destroys and resets the "socket" to zero.