server/src/automate.c

#include <platform.h>

#include "kernel/faction.h"
#include "kernel/order.h"
#include "kernel/region.h"
#include "kernel/unit.h"

#include "util/log.h"

#include "automate.h"
#include "keyword.h"
#include "study.h"

#include <stdlib.h>
#include <assert.h>

static int cmp_scholars(const void *lhs, const void *rhs)
{
    const scholar *a = (const scholar *)lhs;
    const scholar *b = (const scholar *)rhs;
    if (a->sk == b->sk) {
        /* sort by level, descending: */
        return b->level - a->level;
    }
    /* order by skill */
    return (int)a->sk - (int)b->sk;
}

int autostudy_init(scholar scholars[], int max_scholars, region *r)
{
    unit *u;
    int nscholars = 0;

    for (u = r->units; u; u = u->next) {
        keyword_t kwd = getkeyword(u->thisorder);
        if (kwd == K_AUTOSTUDY) {
            scholar * st = scholars + nscholars;
            if (++nscholars == max_scholars) {
                log_fatal("you must increase MAXSCHOLARS");
            }
            st->u = u;
            init_order(u->thisorder, u->faction->locale);
            st->sk = getskill(u->faction->locale);
            st->level = effskill_study(u, st->sk);
            st->learn = 0;
        }
    }
    if (nscholars > 0) {
        qsort(scholars, nscholars, sizeof(scholar), cmp_scholars);
    }
    return nscholars;
}

static void teaching(scholar *s, int n) {
    assert(n <= s->u->number);
    s->learn += n;
}

static void learning(scholar *s, int n) {
    assert(n <= s->u->number);
    s->learn += n;
}

void autostudy_run(scholar scholars[], int nscholars)
{
    int ti = 0;
    while (ti != nscholars) {
        skill_t sk = scholars[ti].sk;
        int t, s, se, ts = 0, tt = 0, si = ti;
        for (se = ti; se != nscholars && scholars[se].sk == sk; ++se) {
            int mint;
            ts += scholars[se].u->number; /* count total scholars */
            mint = (ts + 10) / 11; /* need a minimum of ceil(ts/11) teachers */
            for (; mint > tt && si != nscholars; ++si) {
                tt += scholars[si].u->number;
            }
        }
        /* now si splits the teachers and students 1:10 */
        /* first student must be 2 levels below first teacher: */
        for (; si != se && scholars[ti].level - TEACHDIFFERENCE > scholars[si].level; ++si) {
            tt += scholars[si].u->number;
        }
        if (si == se) {
            /* there are no students, so standard learning only */
            for (t = ti; t != se; ++t) {
                learning(scholars + t, scholars[t].u->number);
            }
        }
        else {
            /* invariant: unit ti can still teach i students */
            int i = scholars[ti].u->number * STUDENTS_PER_TEACHER;
            /* invariant: unit si has n students that can still be taught */
            int n = scholars[si].u->number;
            for (t = ti, s = si; t != si && s != se; ) {
                if (i > n) {
                    /* t has more than enough teaching capacity for s */
                    i -= n;
                    teaching(scholars + s, n);
                    learning(scholars + s, scholars[s].u->number);
                    /* next student, please: */
                    if (++s == se) {
                        continue;
                    }
                    n = scholars[s].u->number;
                }
                else {
                    /* s gets partial credit and we need a new teacher */
                    teaching(scholars + s, i);

                    /* we are done with this teacher. any remaining people are regular learners: */
                    if (scholars[t].u->number > 1) {
                        /* remain = number - ceil(taught/10); */
                        int remain = (STUDENTS_PER_TEACHER * scholars[t].u->number - i + STUDENTS_PER_TEACHER - 1) / STUDENTS_PER_TEACHER;
                        learning(scholars + t, remain);
                    }

                    /* we want a new teacher for s. if any exists, it's next in the sequence. */
                    if (++t == si) {
                        continue;
                    }
                    if (scholars[t].level - TEACHDIFFERENCE < scholars[s].level) {
                        /* next teacher cannot teach, we must skip students. */
                        do {
                            learning(scholars + s, (n - i));
                            i = 0;
                            if (++s == se) {
                                continue;
                            }
                            n = scholars[s].u->number;
                        } while (scholars[t].level - TEACHDIFFERENCE < scholars[s].level);
                    }
                    i = scholars[t].u->number * STUDENTS_PER_TEACHER;
                }
            }
        }
        ti = se;
    }
}

#define MAXSCHOLARS 128

void do_autostudy(region *r)
{
    scholar scholars[MAXSCHOLARS];
    int i, nscholars = autostudy_init(scholars, MAXSCHOLARS, r);
    autostudy_run(scholars, nscholars);
    for (i = 0; i != nscholars; ++i) {
        int days = STUDYDAYS * scholars[i].learn;
        learn_skill(scholars[i].u, scholars[i].sk, days);
    }
}