/* * Copyright (c) 2021-2022 joshua stein * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include #include "focusable.h" #include "util.h" struct focusable **focusables = NULL; short nfocusables = 0; struct focusable * find_focusable(GrafPtr win) { short n; for (n = 0; n < nfocusables; n++) { if (focusables[n]->win == win) return focusables[n]; } return NULL; } bool add_focusable(struct focusable *focusable) { short n; struct focusable **new_focusables; new_focusables = xreallocarray(focusables, sizeof(struct focusable *), nfocusables + 1); if (new_focusables == NULL) return false; focusables = new_focusables; nfocusables++; if (nfocusables > 1) for (n = nfocusables - 1; n > 0; n--) focusables[n] = focusables[n - 1]; focusables[0] = focusable; show_focusable(focusable); return true; } void show_focusable(struct focusable *focusable) { struct focusable *last, *tmp; short n; if (nfocusables > 1 && focusables[0] != focusable) { last = focusables[0]; focusables[0] = focusable; for (n = 1; n < nfocusables; n++) { tmp = focusables[n]; focusables[n] = last; last = tmp; if (last == focusable) break; } } focusable->visible = true; ShowWindow(focusable->win); SelectWindow(focusable->win); } void destroy_focusable(struct focusable *focusable) { short n; if (focusable->visible) CloseWindow(focusable->win); for (n = 0; n < nfocusables; n++) { if (focusables[n] == focusable) { for (; n < nfocusables - 1; n++) focusables[n] = focusables[n + 1]; break; } } nfocusables--; if (nfocusables) focusables = xreallocarray(focusables, sizeof(Ptr), nfocusables); else { xfree(&focusables); focusables = NULL; } if (nfocusables && focusables[0]->visible) SelectWindow(focusables[0]->win); /* focusable is now bogus */ } void hide_focusable(struct focusable *focusable) { short n; HideWindow(focusable->win); focusable->visible = false; for (n = 0; n < nfocusables; n++) { if (focusables[n] == focusable) { for (; n < nfocusables - 1; n++) focusables[n] = focusables[n + 1]; break; } } focusables[nfocusables - 1] = focusable; }