src/engine/client.cpp (1024*1024*1024)//10 mb limit sendmap //not required for newer SVN versions
src/fpsgame/render.cpp (FVAR(swayup, -1, 0.05f, 1);) //not required for SVN version since revision 3724

src/fpsgame/render.cpp (        { "ogro2", "ogro2/blue", "ogro2/red", "ogro2/hudguns", NULL, "quadringss", { NULL, NULL, NULL }, "ogro", "ogro_blue", "ogro_red", true },)//hudguns for the ogro

//old school texturing
src/engine/octaedit.cpp (c.texture[i] = o.children ? 2+i : o.texture[i];)//i hate default.png

src/engine/octa.cpp (loopl(6) c->texture[l] = DEFAULT_GEOM;) => (loopl(6)
        {
            c->texture[l] = 2+l;
        }
)//newmap reverted back to trooper

========

//changedvars
src/engine/command.cpp (COMMAND(writecfg, "s");
#endif

void changedvars()
{
    vector<ident *> ids;
    enumerate(idents, ident, id, if(id.flags&IDF_OVERRIDDEN) ids.add(&id));
    ids.sortname();
    loopv(ids) printvar(ids[i]);
}
COMMAND(changedvars, "");)


src/engine/console.cpp (//static inline bool sortbinds(keym *x, keym *y)
//{
//    return strcmp(x->name, y->name) < 0;
//}
....
    //binds.sort(sortbinds);
    binds.sortname();
....
//static inline bool sortcompletions(const char *x, const char *y)
//{
//    return strcmp(x, y) < 0;
//}
....
    //cmds.sort(sortcompletions);
    cmds.sort();
)


src/shared/tools.h (//template<class T>
//static inline bool compareless(const T &x, const T &y) { return x < y; }

struct sortless
{
    template<class T> bool operator()(const T &x, const T &y) const { return x < y; }
    bool operator()(char *x, char *y) const { return strcmp(x, y) < 0; }
    bool operator()(const char *x, const char *y) const { return strcmp(x, y) < 0; }
};

struct sortnameless
{
    template<class T> bool operator()(const T &x, const T &y) const { return sortless()(x.name, y.name); }
    template<class T> bool operator()(T *x, T *y) const { return sortless()(x->name, y->name); }
    template<class T> bool operator()(const T *x, const T *y) const { return sortless()(x->name, y->name); }
};
....
    //insertionsort(buf, buf+n, compareless<T>);
    insertionsort(buf, buf+n, sortless());
....
    //quicksort(buf, buf+n, compareless<T>);
    quicksort(buf, buf+n, sortless());
....
    //void sort() { sort(compareless<T>); }
    void sort() { sort(sortless()); }
    void sortname() { sort(sortnameless()); }
)//changedvars