1. 08 Jun, 2004 1 commit
  2. 07 Jun, 2004 5 commits
  3. 06 Jun, 2004 8 commits
  4. 05 Jun, 2004 4 commits
    • Tom Lane's avatar
      Tweak palloc/repalloc to allow zero bytes to be requested, as per recent · c3a153af
      Tom Lane authored
      proposal.  Eliminate several dozen now-unnecessary hacks to avoid palloc(0).
      (It's likely there are more that I didn't find.)
      c3a153af
    • Tom Lane's avatar
      Adjust PageGetMaxOffsetNumber to ensure sane behavior on uninitialized · 24a1e20f
      Tom Lane authored
      pages, even when the macro's result is stored into an unsigned variable.
      24a1e20f
    • Bruce Momjian's avatar
      Slight code cleanup for printf's. · 641c5b56
      Bruce Momjian authored
      641c5b56
    • Tom Lane's avatar
      Make the world very nearly safe for composite-type columns in tables. · ae93e5fd
      Tom Lane authored
      1. Solve the problem of not having TOAST references hiding inside composite
      values by establishing the rule that toasting only goes one level deep:
      a tuple can contain toasted fields, but a composite-type datum that is
      to be inserted into a tuple cannot.  Enforcing this in heap_formtuple
      is relatively cheap and it avoids a large increase in the cost of running
      the tuptoaster during final storage of a row.
      2. Fix some interesting problems in expansion of inherited queries that
      reference whole-row variables.  We never really did this correctly before,
      but it's now relatively painless to solve by expanding the parent's
      whole-row Var into a RowExpr() selecting the proper columns from the
      child.
      If you dike out the preventive check in CheckAttributeType(),
      composite-type columns now seem to actually work.  However, we surely
      cannot ship them like this --- without I/O for composite types, you
      can't get pg_dump to dump tables containing them.  So a little more
      work still to do.
      ae93e5fd
  5. 04 Jun, 2004 7 commits
  6. 03 Jun, 2004 11 commits
  7. 02 Jun, 2004 4 commits
    • Bruce Momjian's avatar
      Small patch that adds some documentation for the area() function. · 70f5a87e
      Bruce Momjian authored
      Specifically, point out that intersecting points in a path will yield
      (most likely), unexpected results.  Visually these are identical paths,
      but mathematically they're not the same.  Ex:
      
        area |                                           plan
      ------
      +-----------------------------------------------------------------------
      -------------------
          -0 | ((0,0),(0,1),(2,1),(2,2),(1,2),(1,0),(0,0))
           2 | ((0,0),(0,1),(1,1),(1,2),(2,2),(2,1),(1,1),(1,0),(0,0))
      
      The current algorithm for area(PATH) is very quick, but only handles
      non-intersecting paths.  I'm going to work on two other functions for
      the PATH data type that determines if a PATH is intersecting or not,
      and a function that returns the area() for an intersecting PATH.  The
      intersecting area() function will be considerably slower (I think it's
      going to be O(n!) or worse instead of the current O(n), but that comes
      with the territory).
      
      Sean Chittenden
      70f5a87e
    • Bruce Momjian's avatar
      Per previous discussions, here are two functions to send INT and TERM · e8d9d68c
      Bruce Momjian authored
      (cancel and terminate) signals to other backends.   They permit only INT
      and TERM, and permits sending only to postgresql backends.
      
      Magnus Hagander
      e8d9d68c
    • Bruce Momjian's avatar
    • Bruce Momjian's avatar
      Improve without cluster wording. · 36ae5efa
      Bruce Momjian authored
      36ae5efa