Let the message list be sorted by something other than the date
Newest-first was the only order, so the mail you had not read yet was wherever it happened to fall. Seven presets and up to three levels of your own. It covers the Inbox alone by default: unread-first is what people want in the folder they triage and confusing in Sent, where everything is read and the order that matters is when it went. Search keeps newest-first whatever the setting says, since a result list is already ordered by the question that was asked. The server does the sorting, over the whole folder, for the same reason search runs there: a list sorted in the browser is sorted only as far as the browser has loaded, which on a folder of ten thousand is the first fifty and a lie about the rest. Two details that are easy to get wrong and were worth pinning in tests. hasKeyword sorts a boolean and false comes before true, so "unread first" is $seen ASCENDING while "starred first" is $flagged DESCENDING -- the other way round. Getting either backwards puts exactly the mail you were looking for at the bottom. And every order ends with newest-first as a tiebreak, because a sort whose last level is a keyword or a subject leaves every tie undefined, and an undefined order changes between two looks at the same folder for no reason the reader can see. Sorting on a keyword is optional in RFC 8621, and a server that will not do it fails the whole query rather than degrading it -- so this setting could turn a folder into one that does not open. The refusal is caught once, the keyword levels dropped and the query retried, and nothing is said: the reader asked for an order and got the closest the server can give, and a toast on every folder change would be the app complaining about its own request. The mock now honours the sort instead of always answering newest-first, which had it reproducing a server that silently returns a different order from the one asked for -- the one shape of wrongness a client cannot detect. MOCK_NO_KEYWORD_SORT=1 reproduces a server that refuses the keyword sorts, so the fallback can be developed against.
This commit is contained in:
@@ -0,0 +1,138 @@
|
||||
import { describe, expect, it } from "vitest";
|
||||
import { appliesTo, comparatorsFor, isOptionalSort, MAX_LEVELS, withoutOptionalSorts } from "@/lib/listSort";
|
||||
|
||||
describe("comparatorsFor, presets", () => {
|
||||
it("puts newest first by default, and can reverse it", () => {
|
||||
expect(comparatorsFor("newest")).toEqual([{ property: "receivedAt", isAscending: false }]);
|
||||
// No tiebreak appended: receivedAt already *is* the tiebreaker, and adding
|
||||
// a contradictory second one after it would say nothing.
|
||||
expect(comparatorsFor("oldest")).toEqual([{ property: "receivedAt", isAscending: true }]);
|
||||
});
|
||||
|
||||
it("sorts unread first as $seen ASCENDING, because false sorts before true", () => {
|
||||
// Getting this backwards puts exactly the mail you were looking for at the
|
||||
// bottom, which is why it is asserted rather than assumed.
|
||||
expect(comparatorsFor("unreadFirst")[0]).toEqual({ property: "hasKeyword", keyword: "$seen", isAscending: true });
|
||||
});
|
||||
|
||||
it("sorts starred first as $flagged DESCENDING, which is the other way round", () => {
|
||||
expect(comparatorsFor("starredFirst")[0]).toEqual({ property: "hasKeyword", keyword: "$flagged", isAscending: false });
|
||||
});
|
||||
|
||||
it("handles the plain field presets", () => {
|
||||
expect(comparatorsFor("largest")[0]).toEqual({ property: "size", isAscending: false });
|
||||
expect(comparatorsFor("sender")[0]).toEqual({ property: "from", isAscending: true });
|
||||
expect(comparatorsFor("subject")[0]).toEqual({ property: "subject", isAscending: true });
|
||||
});
|
||||
|
||||
it("falls back to newest for a preset it does not know", () => {
|
||||
expect(comparatorsFor("nonsense" as never)).toEqual([{ property: "receivedAt", isAscending: false }]);
|
||||
});
|
||||
});
|
||||
|
||||
describe("comparatorsFor, the tiebreak", () => {
|
||||
it("always ends newest-first, so a tie does not shuffle between loads", () => {
|
||||
for (const p of ["unreadFirst", "starredFirst", "largest", "sender", "subject"] as const) {
|
||||
const out = comparatorsFor(p);
|
||||
expect(out[out.length - 1]).toEqual({ property: "receivedAt", isAscending: false });
|
||||
}
|
||||
});
|
||||
|
||||
it("does not add a second one when the sort already ends on receivedAt", () => {
|
||||
expect(comparatorsFor("newest")).toHaveLength(1);
|
||||
expect(comparatorsFor("oldest")).toHaveLength(1);
|
||||
expect(comparatorsFor("custom", [{ field: "date", descending: false }])).toHaveLength(1);
|
||||
});
|
||||
});
|
||||
|
||||
describe("comparatorsFor, custom levels", () => {
|
||||
it("keeps the levels in the order given", () => {
|
||||
const out = comparatorsFor("custom", [
|
||||
{ field: "starred", descending: true },
|
||||
{ field: "unread", descending: true },
|
||||
]);
|
||||
expect(out).toEqual([
|
||||
{ property: "hasKeyword", keyword: "$flagged", isAscending: false },
|
||||
{ property: "hasKeyword", keyword: "$seen", isAscending: true },
|
||||
{ property: "receivedAt", isAscending: false },
|
||||
]);
|
||||
});
|
||||
|
||||
it("takes at most three, since past that nobody can predict the result", () => {
|
||||
const out = comparatorsFor("custom", [
|
||||
{ field: "starred", descending: true },
|
||||
{ field: "unread", descending: true },
|
||||
{ field: "from", descending: false },
|
||||
{ field: "size", descending: true },
|
||||
]);
|
||||
expect(out.filter((c) => c.property === "size")).toEqual([]);
|
||||
expect(out).toHaveLength(MAX_LEVELS + 1); // three levels plus the tiebreak
|
||||
});
|
||||
|
||||
it("drops a field repeated at two levels, which can only be a mistake", () => {
|
||||
const out = comparatorsFor("custom", [
|
||||
{ field: "from", descending: false },
|
||||
{ field: "from", descending: true },
|
||||
]);
|
||||
expect(out).toEqual([
|
||||
{ property: "from", isAscending: true },
|
||||
{ property: "receivedAt", isAscending: false },
|
||||
]);
|
||||
});
|
||||
|
||||
it("falls back to the tiebreak alone when no levels were given", () => {
|
||||
expect(comparatorsFor("custom", [])).toEqual([{ property: "receivedAt", isAscending: false }]);
|
||||
});
|
||||
|
||||
it("reverses a date level without losing the tiebreak", () => {
|
||||
const out = comparatorsFor("custom", [{ field: "sent", descending: false }]);
|
||||
expect(out).toEqual([
|
||||
{ property: "sentAt", isAscending: true },
|
||||
{ property: "receivedAt", isAscending: false },
|
||||
]);
|
||||
});
|
||||
});
|
||||
|
||||
describe("optional sorts, which a server is allowed to refuse", () => {
|
||||
it("recognises the keyword properties", () => {
|
||||
expect(isOptionalSort({ property: "hasKeyword", keyword: "$seen" })).toBe(true);
|
||||
expect(isOptionalSort({ property: "someInThreadHaveKeyword", keyword: "$flagged" })).toBe(true);
|
||||
expect(isOptionalSort({ property: "receivedAt" })).toBe(false);
|
||||
expect(isOptionalSort({ property: "size" })).toBe(false);
|
||||
});
|
||||
|
||||
it("strips them, leaving something the server must accept", () => {
|
||||
const out = withoutOptionalSorts(comparatorsFor("custom", [
|
||||
{ field: "unread", descending: true },
|
||||
{ field: "size", descending: true },
|
||||
]));
|
||||
expect(out).toEqual([
|
||||
{ property: "size", isAscending: false },
|
||||
{ property: "receivedAt", isAscending: false },
|
||||
]);
|
||||
});
|
||||
|
||||
it("still ends on the tiebreak when stripping removed everything else", () => {
|
||||
expect(withoutOptionalSorts(comparatorsFor("unreadFirst"))).toEqual([{ property: "receivedAt", isAscending: false }]);
|
||||
});
|
||||
|
||||
it("leaves a sort that was never optional alone", () => {
|
||||
const plain = comparatorsFor("largest");
|
||||
expect(withoutOptionalSorts(plain)).toEqual(plain);
|
||||
});
|
||||
});
|
||||
|
||||
describe("appliesTo", () => {
|
||||
it("covers only the inbox on the narrow scope", () => {
|
||||
// Unread-first is what people want where they triage, and confusing in
|
||||
// Sent, where everything is read.
|
||||
expect(appliesTo("inbox", "inbox")).toBe(true);
|
||||
expect(appliesTo("inbox", "sent")).toBe(false);
|
||||
expect(appliesTo("inbox", null)).toBe(false);
|
||||
});
|
||||
|
||||
it("covers everything on the wide one", () => {
|
||||
expect(appliesTo("all", "sent")).toBe(true);
|
||||
expect(appliesTo("all", null)).toBe(true);
|
||||
});
|
||||
});
|
||||
@@ -0,0 +1,115 @@
|
||||
/**
|
||||
* What order the message list is in, expressed as a JMAP sort.
|
||||
*
|
||||
* The ordering is done by the **server**, over the whole folder, for the same
|
||||
* reason search is: a list sorted in the browser is only sorted as far as the
|
||||
* browser has loaded, which on a folder of ten thousand is the first fifty and
|
||||
* a lie about the rest.
|
||||
*
|
||||
* That has a cost worth stating. `hasKeyword` is an optional sort property in
|
||||
* RFC 8621, so a server may refuse "unread first" outright — and a refusal
|
||||
* fails the whole query rather than degrading it. `isSupportedSort` and the
|
||||
* fallback in the store exist for that, because a mailbox that will not open
|
||||
* is a worse outcome than one in the wrong order.
|
||||
*/
|
||||
import type { Comparator } from "@/jmap/types";
|
||||
|
||||
export type SortField = "date" | "sent" | "from" | "to" | "subject" | "size" | "unread" | "starred";
|
||||
|
||||
export interface SortLevel {
|
||||
field: SortField;
|
||||
/**
|
||||
* "Biggest first" for a quantity, "newest first" for a date, and for the two
|
||||
* keyword fields the state people actually want at the top: unread first,
|
||||
* starred first.
|
||||
*/
|
||||
descending: boolean;
|
||||
}
|
||||
|
||||
export type SortPreset = "newest" | "oldest" | "unreadFirst" | "starredFirst" | "largest" | "sender" | "subject" | "custom";
|
||||
|
||||
/** The last word in every sort, so rows inside a tie do not shuffle between loads. */
|
||||
const TIEBREAK: Comparator = { property: "receivedAt", isAscending: false };
|
||||
|
||||
/** At most three: past that nobody can predict the order they asked for. */
|
||||
export const MAX_LEVELS = 3;
|
||||
|
||||
const PRESETS: Record<Exclude<SortPreset, "custom">, SortLevel[]> = {
|
||||
newest: [{ field: "date", descending: true }],
|
||||
oldest: [{ field: "date", descending: false }],
|
||||
unreadFirst: [{ field: "unread", descending: true }],
|
||||
starredFirst: [{ field: "starred", descending: true }],
|
||||
largest: [{ field: "size", descending: true }],
|
||||
sender: [{ field: "from", descending: false }],
|
||||
subject: [{ field: "subject", descending: false }],
|
||||
};
|
||||
|
||||
/**
|
||||
* One level as JMAP says it.
|
||||
*
|
||||
* The two keyword fields need care. `hasKeyword` sorts a boolean, and false
|
||||
* comes before true ascending — so "unread first" is `$seen` *ascending*
|
||||
* (not-seen first) while "starred first" is `$flagged` *descending*. Getting
|
||||
* this backwards puts exactly the mail you were looking for at the bottom,
|
||||
* which is why it is spelled out rather than inferred.
|
||||
*/
|
||||
function comparator(level: SortLevel): Comparator {
|
||||
switch (level.field) {
|
||||
case "date":
|
||||
return { property: "receivedAt", isAscending: !level.descending };
|
||||
case "sent":
|
||||
return { property: "sentAt", isAscending: !level.descending };
|
||||
case "from":
|
||||
return { property: "from", isAscending: !level.descending };
|
||||
case "to":
|
||||
return { property: "to", isAscending: !level.descending };
|
||||
case "subject":
|
||||
return { property: "subject", isAscending: !level.descending };
|
||||
case "size":
|
||||
return { property: "size", isAscending: !level.descending };
|
||||
case "unread":
|
||||
return { property: "hasKeyword", keyword: "$seen", isAscending: level.descending };
|
||||
case "starred":
|
||||
return { property: "hasKeyword", keyword: "$flagged", isAscending: !level.descending };
|
||||
}
|
||||
}
|
||||
|
||||
/** Whether a comparator asks for something a server is allowed to refuse. */
|
||||
export function isOptionalSort(c: Comparator): boolean {
|
||||
return c.property === "hasKeyword" || c.property === "allInThreadHaveKeyword" || c.property === "someInThreadHaveKeyword";
|
||||
}
|
||||
|
||||
/**
|
||||
* The sort for a preset, or for the levels behind "custom".
|
||||
*
|
||||
* Always ends with newest-first. A sort whose last level is a keyword or a
|
||||
* subject leaves every tie undefined, and an undefined order is one that
|
||||
* changes between two loads of the same folder for no reason the reader can
|
||||
* see.
|
||||
*/
|
||||
export function comparatorsFor(preset: SortPreset, levels: SortLevel[] = []): Comparator[] {
|
||||
const chosen = preset === "custom" ? levels.slice(0, MAX_LEVELS) : (PRESETS[preset] ?? PRESETS.newest);
|
||||
const out = chosen.filter((l, i) => chosen.findIndex((o) => o.field === l.field) === i).map(comparator);
|
||||
const last = out[out.length - 1];
|
||||
if (!last || last.property !== "receivedAt") out.push(TIEBREAK);
|
||||
return out;
|
||||
}
|
||||
|
||||
/** The sort with anything optional stripped, for a server that refused the first attempt. */
|
||||
export function withoutOptionalSorts(sort: Comparator[]): Comparator[] {
|
||||
const kept = sort.filter((c) => !isOptionalSort(c));
|
||||
const last = kept[kept.length - 1];
|
||||
if (!last || last.property !== "receivedAt") kept.push(TIEBREAK);
|
||||
return kept;
|
||||
}
|
||||
|
||||
/**
|
||||
* Whether this folder should use the configured order at all.
|
||||
*
|
||||
* "Inbox only" is the useful scope rather than a timid one: unread-first is
|
||||
* what people want in the folder they triage, and confusing in Sent, where
|
||||
* everything is read and the order that matters is when it went.
|
||||
*/
|
||||
export function appliesTo(scope: "inbox" | "all", role: string | null | undefined): boolean {
|
||||
return scope === "all" || role === "inbox";
|
||||
}
|
||||
@@ -2,6 +2,7 @@ import { create } from "zustand";
|
||||
import type { FolderRef } from "@/lib/sieveFolders";
|
||||
import { SPAM_HEADER_PROPS } from "@/lib/spamScore";
|
||||
import { groupByArchivePath, archivePath, type ArchiveGranularity } from "@/lib/archiveDate";
|
||||
import { isOptionalSort, withoutOptionalSorts } from "@/lib/listSort";
|
||||
import { JmapMethodError, chunk, client, setErrorMessage } from "@/jmap/client";
|
||||
import type {
|
||||
Comparator,
|
||||
@@ -1129,7 +1130,45 @@ function sortIdentities(list: Identity[], accountId: Id): Identity[] {
|
||||
return [...list].sort((a, b) => (a.id === pref ? -1 : b.id === pref ? 1 : a.email.localeCompare(b.email)));
|
||||
}
|
||||
|
||||
/**
|
||||
* Sort properties a server has already refused, so it is asked once and not
|
||||
* once per folder for the rest of the session.
|
||||
*
|
||||
* Keyed by nothing: a refusal is about the server, and there is only one.
|
||||
*/
|
||||
let sortRefused = false;
|
||||
|
||||
async function runQuery(accountId: Id, q: ListQuery, position: number, limit: number) {
|
||||
/*
|
||||
* `hasKeyword` is an optional sort in RFC 8621, and a server that will not
|
||||
* do it fails the whole query rather than degrading it -- so "unread first"
|
||||
* on such a server means a folder that does not open at all, which is a
|
||||
* worse outcome than one in the wrong order.
|
||||
*
|
||||
* The refusal is caught once, the optional levels dropped, and the query
|
||||
* retried. Nothing is said the first time: the reader asked for an order and
|
||||
* got the closest the server can give, and a toast on every folder change
|
||||
* would be the app complaining about its own request.
|
||||
*/
|
||||
const query = sortRefused ? { ...q, sort: withoutOptionalSorts(q.sort) } : q;
|
||||
try {
|
||||
return await runQueryOnce(accountId, query, position, limit);
|
||||
} catch (err) {
|
||||
const optional = query.sort.some(isOptionalSort);
|
||||
if (!optional || !isUnsupportedSort(err)) throw err;
|
||||
sortRefused = true;
|
||||
return await runQueryOnce(accountId, { ...q, sort: withoutOptionalSorts(q.sort) }, position, limit);
|
||||
}
|
||||
}
|
||||
|
||||
/** The error a server raises for a sort property it does not implement. */
|
||||
function isUnsupportedSort(err: unknown): boolean {
|
||||
const type = (err as { type?: string } | null)?.type;
|
||||
const message = String((err as Error | null)?.message ?? "");
|
||||
return type === "unsupportedSort" || /unsupportedSort/i.test(message);
|
||||
}
|
||||
|
||||
async function runQueryOnce(accountId: Id, q: ListQuery, position: number, limit: number) {
|
||||
const calls: Array<[string, Record<string, unknown>, string]> = [
|
||||
["Email/query", { accountId, filter: q.filter, sort: q.sort, collapseThreads: q.collapseThreads, position, limit, calculateTotal: true }, "q"],
|
||||
["Email/get", { accountId, "#ids": { resultOf: "q", name: "Email/query", path: "/ids" }, properties: LIST_PROPS }, "e"],
|
||||
|
||||
@@ -1,6 +1,7 @@
|
||||
import { useEffect, useState } from "react";
|
||||
import { create } from "zustand";
|
||||
import { hasCachedJson, loadJson, saveJson } from "@/lib/storage";
|
||||
import type { SortLevel, SortPreset } from "@/lib/listSort";
|
||||
import { pendingSettingsKeys, queueSettingsPush } from "@/lib/settingsSync";
|
||||
import { setDateTimePrefs, setUiLanguageForFormatting, type DateFormat, type TimeFormat } from "@/lib/datetime";
|
||||
import type { SwipeAction } from "@/lib/swipe";
|
||||
@@ -141,6 +142,15 @@ export interface Settings {
|
||||
* dates nobody put there is a surprise rather than a feature.
|
||||
*/
|
||||
birthdayCalendar: boolean;
|
||||
/** What order the message list is in. See lib/listSort.ts. */
|
||||
listSortPreset: SortPreset;
|
||||
listSortLevels: SortLevel[];
|
||||
/**
|
||||
* Which folders it covers. Inbox-only is the useful default rather than a
|
||||
* timid one: unread-first is what people want where they triage, and
|
||||
* confusing in Sent, where everything is read.
|
||||
*/
|
||||
listSortScope: "inbox" | "all";
|
||||
fontSize: "small" | "medium" | "large";
|
||||
templates: Template[];
|
||||
labels: Label[];
|
||||
@@ -253,6 +263,9 @@ export const DEFAULT_SETTINGS: Settings = {
|
||||
timeZone: null,
|
||||
labelsSidebar: true,
|
||||
birthdayCalendar: false,
|
||||
listSortPreset: "newest",
|
||||
listSortLevels: [],
|
||||
listSortScope: "inbox",
|
||||
fontSize: "medium",
|
||||
templates: [],
|
||||
labels: [],
|
||||
|
||||
@@ -1,6 +1,8 @@
|
||||
import { useCallback, useEffect, useMemo, useRef, useState } from "react";
|
||||
import { useLocation, useSearch } from "wouter";
|
||||
import { DEFAULT_SORT, useMail, type ListQuery } from "@/store/mail";
|
||||
import { appliesTo, comparatorsFor } from "@/lib/listSort";
|
||||
import type { Comparator } from "@/jmap/types";
|
||||
import { useSettings } from "@/store/settings";
|
||||
import { withBase } from "@/lib/basePath";
|
||||
import { useCompose } from "@/store/compose";
|
||||
@@ -63,6 +65,20 @@ export function MailView({ mailboxId, threadId, search }: { mailboxId?: string;
|
||||
navigate(`/mail/${inboxId}`, { replace: true });
|
||||
}, [search, mailboxId, mailboxesLoaded, mailboxes, inboxId, navigate]);
|
||||
|
||||
/*
|
||||
* Search keeps newest-first whatever the setting says. A result list is
|
||||
* already ordered by the question that was asked, and putting unread at the
|
||||
* top of it answers a different one.
|
||||
*/
|
||||
const sortForFolder = useCallback(
|
||||
(mailboxId: Id | null): Comparator[] => {
|
||||
const role = mailboxId ? useMail.getState().mailboxes[mailboxId]?.role : null;
|
||||
if (!appliesTo(settings.listSortScope, role)) return DEFAULT_SORT;
|
||||
return comparatorsFor(settings.listSortPreset, settings.listSortLevels);
|
||||
},
|
||||
[settings.listSortScope, settings.listSortPreset, settings.listSortLevels],
|
||||
);
|
||||
|
||||
// Build & run the list query
|
||||
const listQuery = useMemo<ListQuery | null>(() => {
|
||||
if (search) {
|
||||
@@ -77,7 +93,7 @@ export function MailView({ mailboxId, threadId, search }: { mailboxId?: string;
|
||||
// Scheduled joins Drafts and Sent as a folder of individual messages: they
|
||||
// are outgoing, and collapsing them into their threads hides them.
|
||||
const isDraftsOrSent = mb?.role === "drafts" || mb?.role === "sent" || mailboxId === scheduledId;
|
||||
return { key: "", filter: { inMailbox: mailboxId }, sort: DEFAULT_SORT, collapseThreads: settings.conversationMode && !isDraftsOrSent, mailboxId };
|
||||
return { key: "", filter: { inMailbox: mailboxId }, sort: sortForFolder(mailboxId), collapseThreads: settings.conversationMode && !isDraftsOrSent, mailboxId };
|
||||
}, [search, q, mailboxId, mailboxes, settings.conversationMode, scheduledId]);
|
||||
|
||||
useEffect(() => {
|
||||
|
||||
@@ -4,6 +4,7 @@ import { browserTimeZone, listTimeZones } from "@/lib/dates";
|
||||
import { toast } from "@/ui/toast";
|
||||
import { useState } from "react";
|
||||
import { t, tNode } from "@/lib/i18n";
|
||||
import { MAX_LEVELS, type SortField, type SortPreset } from "@/lib/listSort";
|
||||
import {
|
||||
canUnregisterMailtoHandler,
|
||||
isInstalledApp,
|
||||
@@ -35,6 +36,21 @@ const DATE_FORMATS: Array<{ value: DateFormat; label: string }> = [
|
||||
{ value: "ymd-dash", label: "Year-Month-Day (ISO 8601)" },
|
||||
];
|
||||
|
||||
/**
|
||||
* What each direction means in the reader's terms. "Descending" is meaningless
|
||||
* for a field like Unread, where the question is which state belongs at the top.
|
||||
*/
|
||||
const DIRECTION_LABELS: Record<SortField, [string, string]> = {
|
||||
unread: ["Unread first", "Read first"],
|
||||
starred: ["Starred first", "Unstarred first"],
|
||||
date: ["Newest first", "Oldest first"],
|
||||
sent: ["Newest first", "Oldest first"],
|
||||
from: ["Z to A", "A to Z"],
|
||||
to: ["Z to A", "A to Z"],
|
||||
subject: ["Z to A", "A to Z"],
|
||||
size: ["Largest first", "Smallest first"],
|
||||
};
|
||||
|
||||
export function GeneralSettings() {
|
||||
const s = useSettings((st) => st.settings);
|
||||
const update = useSettings((st) => st.update);
|
||||
@@ -81,6 +97,77 @@ export function GeneralSettings() {
|
||||
<Switch checked={s.showPreview} onChange={(v) => update({ showPreview: v })} label={t("Show message snippets")} hint={t("Preview the first line of each message in the list.")} />
|
||||
<Switch checked={s.showAvatars} onChange={(v) => update({ showAvatars: v })} label={t("Show sender avatars")} />
|
||||
|
||||
<div className="field-row">
|
||||
<div className="field">
|
||||
<label>{t("Message order")}</label>
|
||||
<select className="select" value={s.listSortPreset} onChange={(e) => update({ listSortPreset: e.target.value as SortPreset })}>
|
||||
<option value="newest">{t("Newest first")}</option>
|
||||
<option value="oldest">{t("Oldest first")}</option>
|
||||
<option value="unreadFirst">{t("Unread first")}</option>
|
||||
<option value="starredFirst">{t("Starred first")}</option>
|
||||
<option value="largest">{t("Largest first")}</option>
|
||||
<option value="sender">{t("By sender")}</option>
|
||||
<option value="subject">{t("By subject")}</option>
|
||||
<option value="custom">{t("Custom…")}</option>
|
||||
</select>
|
||||
</div>
|
||||
<div className="field">
|
||||
<label>{t("Applies to")}</label>
|
||||
<select className="select" value={s.listSortScope} onChange={(e) => update({ listSortScope: e.target.value as "inbox" | "all" })}>
|
||||
<option value="inbox">{t("The Inbox only")}</option>
|
||||
<option value="all">{t("Every folder")}</option>
|
||||
</select>
|
||||
</div>
|
||||
</div>
|
||||
{s.listSortPreset === "custom" && (
|
||||
<div className="field">
|
||||
<label>{t("Sort by, in order")}</label>
|
||||
{Array.from({ length: MAX_LEVELS }, (_, i) => {
|
||||
const level = s.listSortLevels[i];
|
||||
return (
|
||||
<div className="field-row" key={i} style={{ marginBottom: 6 }}>
|
||||
<select
|
||||
className="select"
|
||||
value={level?.field ?? ""}
|
||||
onChange={(e) => {
|
||||
const next = [...s.listSortLevels];
|
||||
if (!e.target.value) next.splice(i);
|
||||
else next[i] = { field: e.target.value as SortField, descending: level?.descending ?? true };
|
||||
update({ listSortLevels: next.filter(Boolean).slice(0, MAX_LEVELS) });
|
||||
}}
|
||||
>
|
||||
<option value="">{i === 0 ? t("Choose…") : t("Then nothing")}</option>
|
||||
<option value="unread">{t("Unread")}</option>
|
||||
<option value="starred">{t("Starred")}</option>
|
||||
<option value="date">{t("Date received")}</option>
|
||||
<option value="sent">{t("Date sent")}</option>
|
||||
<option value="from">{t("Sender")}</option>
|
||||
<option value="subject">{t("Subject")}</option>
|
||||
<option value="size">{t("Size")}</option>
|
||||
</select>
|
||||
{level && (
|
||||
<select
|
||||
className="select"
|
||||
value={level.descending ? "desc" : "asc"}
|
||||
onChange={(e) => {
|
||||
const next = [...s.listSortLevels];
|
||||
next[i] = { ...level, descending: e.target.value === "desc" };
|
||||
update({ listSortLevels: next });
|
||||
}}
|
||||
>
|
||||
<option value="desc">{DIRECTION_LABELS[level.field]![0]}</option>
|
||||
<option value="asc">{DIRECTION_LABELS[level.field]![1]}</option>
|
||||
</select>
|
||||
)}
|
||||
</div>
|
||||
);
|
||||
})}
|
||||
<p className="hint">
|
||||
{t("Ordered by the server over the whole folder, not just the messages loaded so far. Ties always fall back to newest first, so the order never shuffles between two looks at the same folder.")}
|
||||
</p>
|
||||
</div>
|
||||
)}
|
||||
|
||||
<h2>{t("Composing")}</h2>
|
||||
<div className="field-row">
|
||||
<div className="field">
|
||||
|
||||
Reference in New Issue
Block a user