Updates from July, 2009 Toggle Comment Threads | Keyboard Shortcuts

  • Jane Wells 7:42 pm on July 6, 2009 Permalink
    Tags: timeline   

    In case anyone has forgotten the timelin… 

    In case anyone has forgotten the timeline, here’s what’s left:

    July 6 (today!): Mentors and students can begin submitting mid-term evaluations.

    July 13: Mid-term evaluations deadline; Google begins issuing mid-term student payments provided passing student survey is on file. Note: WordPress mentors are expected to submit final evaluations no later than July 10, so that we will have time to resolve any issues before the 13th.

    Interim Period: Mentors give students a helping hand and guidance on their projects.

    August 10: Suggested ‘pencils down’ date. Take a week to scrub code, write tests, improve documentation, etc.

    August 17: Firm ‘pencils down’ date. Mentors, students and organization administrators can begin submitting final evaluations to Google.

    August 24: Final evaluation deadline; Google begins issuing student and mentoring organization payments provided forms and evaluations are on file.

    August 25: Final results of GSoC 2009 announced.

    September 3: Students can begin submitting required code samples to Google.

    **There is about a month until the pencils down date.**

     
  • Jane Wells 6:59 pm on July 6, 2009 Permalink
    Tags: , evaluations,   

    Hi everyone. As you know, this is midter… 

    Hi everyone. As you know, this is midterm week. Evaluations begin today and will be finalized by the 13th. You may recall from the very first post on this blog that there were three basic expectations of everyone:
    1. Work directly with your mentor to define your plan of action and begin executing it;
    2. Post an update at least weekly on this blog; and the big one,
    3. “It’s expected by the halfway point for you to have a functioning plugin/code that works. The second half of the summer will be spend refining and integrating your work so that by the end of the summer, it is release-ready. For some this will mean scaling back their projects; be realistic when you nail down the final scope of your projects with your mentors.”

    Your mentors will be evaluating you on the quality of your code and how well you met the above-mentioned expectations in relation to your project proposals and/or revised project plans from the first interim period. Here’s what Google says about evaluations:

    How do evaluations work?

    Google will pre-publish the evaluation questions for both students and mentors. Mentors will fill out mid-term and final evaluations for their students via the Google Summer of Code 2009 site. These evaluations will be visible in the system to the mentor and the mentoring organization’s administrator(s). Students will fill out a mid-term and final evaluation of their mentors online as well, and their evaluations will only be visible in the system to the mentoring organization’s administrator(s). Program administrators from Google will have access to all evaluation data.

    In almost all cases, students will never see their mentor’s evaluation of their progress, nor will a mentor see a student’s evaluation of her/his mentorship. However, in the case where the mentoring organization’s administrator and a student’s mentor are one and the same, the student’s evaluation will be shared with the mentor. Organization administrators are expected to review mid-term and final evaluations and to provide course corrections where necessary.

    In some cases, Google’s program administrators may need to share the results of evaluations with the student and mentor, such as to arbitrate when payment should not be made; should this need arise, all parties will be notified in advance.

    The evaluation links on the GSoC site should go live today.

     
  • mike 11:15 am on July 6, 2009 Permalink
    Tags:   

    Ok, Here is the update. I`ll be soon p… 

    Ok,

    Here is the update.

    I`ll be soon posting a link to the very early dev version of Buildpress (need to confirm with Mr.Andrew).
    The latest updates include

    working Create New Theme (with the Buildpress Builder UI)

    • features 8 differnt types of layouts (2 cols, 3cols with 2 fully widgetized sidebars + Top and Bottom Banners)
    • 3 types of page size (viz fixed 750px, 950px and liquid – 100%)
    • Customizable Fonts, colors and sizes (for the demo only h1,h2,h3,p are featured). More customizations will be included.

    Completely AJAX powered,

    • working Delete Theme action
    • working Activate Theme action

    The “Buildpress Builder” which is the UI that will help create layouts, has 2 panels viz Panel-1 = layout of the theme, Panel-2 = Cosmetics of the theme. (currently the panels are populated with just test variables, you can play with em :))

    Buildpress uses the WP options table instead of an own table to store individual theme settings. This will help it perform much faster since the options are autoloaded at start of WP.

    I am currently working on a bit of the cosmetics for rendering themes. Will post a link soon 🙂

     
  • Dan Larkin 3:56 am on July 6, 2009 Permalink
    Tags: ,   

    Finally, some code in time for the deadl… 

    Finally, some code in time for the deadline.

    That patch, once applied, should prompt you for a database upgrade, automatically populate the tree with the necessary data, and use some new methods to take advantage of MPTT to display the category list (full and paged). If there are any bugs, please let me know, as I’ve only been able to test it under the conditions of my controlled environment (XAMPP for Linux).

    For large numbers of categories (several hundred to a few thousand), I see a fairly consistent speedup of 8-10% with my set-up. Currently, it only works for displaying the data in the order it is stored in. Ryan and I decided that the best way to do that would be in order by name. Oddly enough, it would seem that using PHP5’s strcmp() to do the ordering produces a slightly different order than MySQL’s ORDER BY. Namely, you get the natural number ordering that Windows was so proud of a few years back (i.e. 80 comes before 100).

    It still needs some polish, for instance the MPTT_Walker class still uses the old paged_walk() method, but since this seems to be used for comments only, I’m waiting until I handle those. Other things like that are scattered around. Also I still need to convert cat_rows() to be iterative rather than recursive, like I did for walk(). Other than that, the main portion of code for categories is done.

    Again, feel free to test it out and let me know how it goes!

     
    • Dan Larkin 3:02 pm on July 6, 2009 Permalink

      I should add, don’t use on any installations you really care about just yet. Like I said, it needs to be tested. I doubt any of you were planning on throwing it at your production site just yet, but in case you were, save yourself the trouble and just use it on a test installation for a while first.

      • Dan Larkin 6:34 pm on July 6, 2009 Permalink

        Also of note, the patch applies to rev. 11635 (thanks for pointing it out, Rudolf). I forgot to update my SVN checkout before generating the patch.

    • diegocaro 8:19 am on July 8, 2009 Permalink

      Dan, I found a bug in my code… I watched your code and maybe your code have the same bug. Check my post in https://gsoc2009wp.wordpress.com/2009/07/08/hello-this-week-has-been-test-test/#comment-65 .

      • Dan Larkin 2:50 pm on July 8, 2009 Permalink

        I’m not sure I follow what the bug is exactly, or rather when it occurs. The depth of the next element should simply be whatever the next element to display is, and shouldn’t depend at all on the empty terms that get_terms() left out, should it?

        • diegocaro 4:56 pm on July 8, 2009 Permalink

          When hide_terms = true and hierarchical = true, get_terms delete some items of array results.

          Example, if you have $cats = array(0 => A, 1=> B, 2=>C), and then you delete the item 2, the new array is $cats = array(0 => A, 2 => C).

          So, for get the next depth, I use de $i + 1 item, but this doesn’t work when the array is not continuos. For example, when you are in the item $i = 0, you cannot get the next item using “$i + 1”, because the item 1 doesn’t exist.

          • Dan Larkin 5:00 pm on July 8, 2009 Permalink

            Oh, I see now. I believe what I did was use $next->depth (from the depth stored in the database), but I’ll have to double-check.

    • Dan Larkin 11:50 pm on July 8, 2009 Permalink

      I now have an updated patch, this time based on SVN rev. 11695. This one features the re-written mptt_cat_rows() method, as well as a bug fix. I found yesterday that my code was building the tree in the wrong order for some reason. Said reason happened to be get_terms() relying on the cached hierarchy in retrieving based on a parent ID, so I removed that section of code and it all works fine now. It might lead to a performance hit at some point though, so I’ll need to test it and see if there’s a better workaround. It’s odd that I didn’t notice it before, so I’m wondering if perhaps it was a change introduced when I updated my SVN checkout (though realistically I probably just missed it).

      http://files.stealyourcarbon.net/mptt-07082009.diff

      • Dan Larkin 8:58 pm on July 9, 2009 Permalink

        Just realized I left some debugging code in there that prints out some variable info when inserting new nodes in the tree. My current build isn’t diff-worthy since I’ve started working on pages already, but the pertinent code in is in the get_lft() method of MPTT_Category. You can remove the relevante lines after patching if you want to test it out and not see the debugging info. Sorry for the inconvenience.

c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r
Reply
e
Edit
o
Show/Hide comments
t
Go to top
l
Go to login
h
Show/Hide help
shift + esc
Cancel