// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

/*
Package builtin provides documentation for Go's predeclared identifiers.
The items documented here are not actually in package builtin
but their descriptions here allow godoc to present documentation
for the language's special identifiers.
*/
package builtin

import "cmp"

        final GregorianCalendar cal = new GregorianCalendar();

        sdf.setCalendar(cal);

        dirents = dir.listFiles();
        if (log.isDebugEnabled()) {
            log.debug(dirents.length + " items listed");
        }
        sorted = new LinkedList<>();
        fmt = req.getParameter("fmt");
        if (fmt == null) {
            fmt = "col";
        }
        sort = 0;

        assertTrue(item1.equals(item1));

        // Same input value (id doesn't matter)
        assertTrue(item1.equals(item2));
        assertTrue(item1.equals(item3));

        // Different input value
        assertFalse(item1.equals(item4));

        // Null and different class
        assertFalse(item1.equals(null));
        assertFalse(item1.equals("string"));
        assertFalse(item1.equals(new Object()));
    }

  - A `create` or `update` API request with duplicate items in a keyed list no longer wipes out managedFields. Examples include env var entries with the same name, or port entries with the same containerPort in a pod spec.

pkg go/doc/comment, type List struct #51082
pkg go/doc/comment, type List struct, ForceBlankBefore bool #51082
pkg go/doc/comment, type List struct, ForceBlankBetween bool #51082
pkg go/doc/comment, type List struct, Items []*ListItem #51082
pkg go/doc/comment, type ListItem struct #51082
pkg go/doc/comment, type ListItem struct, Content []Block #51082
pkg go/doc/comment, type ListItem struct, Number string #51082

        final GregorianCalendar cal = new GregorianCalendar();

        sdf.setCalendar(cal);

        dirents = dir.listFiles();
        if (LogStream.level > 2) {
            log.println(dirents.length + " items listed");
        }
        sorted = new LinkedList();
        fmt = req.getParameter("fmt");
        if (fmt == null) {
            fmt = "col";
        }
        sort = 0;

    }\n  }\n\n  _selectMenuItem({ key, target }) {\n    const items = SelectorEngine.find(SELECTOR_VISIBLE_ITEMS, this._menu).filter(element => isVisible(element))\n\n    if (!items.length) {\n      return\n    }\n\n    // if target isn't included in items (e.g. when expanding the dropdown)\n    // allow cycling to get the last item in case key equals ARROW_UP_KEY\n    getNextActiveElement(items, target, key === ARROW_DOWN_KEY, !items.includes(target)).focus()\n  }\n\n  // Static\n  static jQueryInterface(config)...

labels.file_auth_parameters=Parameters
labels.file_auth_file_crawling_config=File Crawl Config
labels.file_auth_scheme_samba=Samba
labels.file_auth_scheme_ftp=FTP
labels.pagination_page_guide_msg={0}/{1} ({2} items)
labels.list_could_not_find_crud_table=Not registered.
labels.scheduledjob_configuration=Job Scheduler
labels.scheduledjob_title_details=Job
labels.scheduledjob_name=Name
labels.scheduledjob_target=Target

}\n\n      $(this).trigger('click')\n      return\n    }\n\n    const items = [].slice.call(parent.querySelectorAll(SELECTOR_VISIBLE_ITEMS))\n      .filter(item => $(item).is(':visible'))\n\n    if (items.length === 0) {\n      return\n    }\n\n    let index = items.indexOf(event.target)\n\n    if (event.which === ARROW_UP_KEYCODE && index > 0) { // Up\n      index--\n    }\n\n    if (event.which === ARROW_DOWN_KEYCODE && index < items.length - 1) { // Down\n      index++\n    }\n\n    if (index < 0)...

    Deque<NodeAndRemainingSuccessors<N>> stack = new ArrayDeque<>();
    stack.addLast(new NodeAndRemainingSuccessors<>(startNode));

    while (!stack.isEmpty()) {
      // To peek at the top two items, we need to temporarily remove one.
      NodeAndRemainingSuccessors<N> top = stack.removeLast();
      NodeAndRemainingSuccessors<N> prev = stack.peekLast();
      stack.addLast(top);

      N node = top.node;