| /dports/devel/p5-Date-Manip/Date-Manip-6.85/internal/ |
| H A D | NOTES | 36 Make sure that new and changed zones refer to valid Olsen time zones. Make
81 ./internal/dumps
89 ./internal/tzdata -c
118 so every entry should be checked to ensure that it acceptable. Then,
120 any previous value for the entry. It is especially important that the first
121 line in each entry should remain unchanged unless there is good reason
143 for i in `find lib -type f -name \*.pod | egrep -v 'Lang\/' |
150 internal/langpod
160 …for i in `find . -type f | egrep -v '.git' | xargs egrep -l 'Copyright \(c\) ....\-.... Sullivan B…
164 chmod +x internal/tzdata internal/gen_dm5abbrevs examples/dm_* internal/langpod
[all …]
|
| /dports/math/eigen3/eigen-3.3.9/doc/ |
| H A D | NewExpressionType.dox | 7 … tailored to very advanced users who are not afraid of dealing with some %Eigen's internal aspects.
18 vectorization etc., and refer to that page here.
60 \c Traits<X> in the \c Eigen::internal namespace containing
64 expression class to refer to dense matrices. The entries of the
102 are computed by finding the corresponding entry of the vector from
103 which the circulant matrix is constructed. Getting this entry may
108 The \c CoeffReadCost constant records the cost of computing an entry
110 this is the same as the cost of computing an entry of the vector from
115 remember that we can query an expression object to find the size but
121 \section TopicEntry The entry point
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/doc/ |
| H A D | NewExpressionType.dox | 7 … tailored to very advanced users who are not afraid of dealing with some %Eigen's internal aspects.
18 vectorization etc., and refer to that page here.
60 \c Traits<X> in the \c Eigen::internal namespace containing
64 expression class to refer to dense matrices. The entries of the
102 are computed by finding the corresponding entry of the vector from
103 which the circulant matrix is constructed. Getting this entry may
108 The \c CoeffReadCost constant records the cost of computing an entry
110 this is the same as the cost of computing an entry of the vector from
115 remember that we can query an expression object to find the size but
121 \section TopicEntry The entry point
[all …]
|
| /dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/doc/ |
| H A D | NewExpressionType.dox | 7 … tailored to very advanced users who are not afraid of dealing with some %Eigen's internal aspects.
18 vectorization etc., and refer to that page here.
60 \c Traits<X> in the \c Eigen::internal namespace containing
64 expression class to refer to dense matrices. The entries of the
102 are computed by finding the corresponding entry of the vector from
103 which the circulant matrix is constructed. Getting this entry may
108 The \c CoeffReadCost constant records the cost of computing an entry
110 this is the same as the cost of computing an entry of the vector from
115 remember that we can query an expression object to find the size but
121 \section TopicEntry The entry point
[all …]
|
| /dports/misc/opennn/opennn-5.0.5/eigen/doc/ |
| H A D | NewExpressionType.dox | 7 … tailored to very advanced users who are not afraid of dealing with some %Eigen's internal aspects.
18 vectorization etc., and refer to that page here.
60 \c Traits<X> in the \c Eigen::internal namespace containing
64 expression class to refer to dense matrices. The entries of the
102 are computed by finding the corresponding entry of the vector from
103 which the circulant matrix is constructed. Getting this entry may
108 The \c CoeffReadCost constant records the cost of computing an entry
110 this is the same as the cost of computing an entry of the vector from
115 remember that we can query an expression object to find the size but
121 \section TopicEntry The entry point
[all …]
|
| /dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/doc/ |
| H A D | NewExpressionType.dox | 7 … tailored to very advanced users who are not afraid of dealing with some %Eigen's internal aspects.
18 vectorization etc., and refer to that page here.
60 \c Traits<X> in the \c Eigen::internal namespace containing
64 expression class to refer to dense matrices. The entries of the
102 are computed by finding the corresponding entry of the vector from
103 which the circulant matrix is constructed. Getting this entry may
108 The \c CoeffReadCost constant records the cost of computing an entry
110 this is the same as the cost of computing an entry of the vector from
115 remember that we can query an expression object to find the size but
121 \section TopicEntry The entry point
[all …]
|
| /dports/comms/qt5-connectivity/kde-qtconnectivity-5.15.2p1/dist/ |
| H A D | changes-5.3.1 | 4 For more details, refer to the online documentation included in this
29 may not be able to find remote services via a minimal service discovery.
56 - Added "classname" entry to all qmldir files enabling QML
77 * Fixed internal read buffer corruption during timeouts.
|
| /dports/misc/gnome-user-docs/gnome-user-docs-41.1/gnome-help/C/ |
| H A D | net-wireless-troubleshooting-hardware-check.page | 42 <p>Look through the information that appeared and find the <em>Wireless
57 has (<link xref="#pci">internal PCI</link>, <link xref="#usb">USB</link>,
63 <title>PCI (internal) wireless adapter</title>
74 <p>Look through the list of devices that is shown and find any that are
79 <code>802.11</code>. Here is an example of what the entry might look
86 step</link>. If you didn’t find anything related to your wireless
109 <p>Look through the list of devices that is shown and find any that seem
110 to refer to a wireless or network device. The one corresponding to your
113 example of what the entry might look like:</p>
119 step</link>. If you didn’t find anything related to your wireless
[all …]
|
| /dports/www/py-pyramid/pyramid-1.7.3/docs/narr/ |
| H A D | startup.rst | 44 application's ``paste.app_factory`` :term:`entry point` will be named on the
48 will refer to your :app:`Pyramid` application. If instead of a simple
50 ``[composite:main]``), refer to the documentation for that particular
51 composite to understand how to make it refer to your :app:`Pyramid`
60 #. The application's *constructor* named by the entry point referenced on the
93 entry point URI ``egg:MyProject`` (see :ref:`MyProject_ini` for more
94 information about entry point URIs, and how they relate to callables) will
107 section of our .ini file except the ``use`` option (which is internal to
140 There, in :ref:`request_logging_with_pastes_translogger`, you will also find
|
| /dports/multimedia/libv4l/linux-5.13-rc2/Documentation/driver-api/nvdimm/ |
| H A D | btt.rst | 36 arena are internal to it (with the exception of one field that points to the
79 The map is a simple lookup/indirection table that maps an LBA to an internal
81 flags, and the remaining form the internal block number.
97 29 - 0 Mappings to internal 'postmap' blocks
119 premap ABA is 256G. We now refer to the map, and find out the mapping for block
141 lba' alternate lba entry
142 old_map' alternate old postmap entry
143 new_map' alternate new postmap entry
178 internal, postmap block that the reader is (still) reading has been inserted
262 - All internal available blocks are not uniquely and entirely addressed by the
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/Documentation/driver-api/nvdimm/ |
| H A D | btt.rst | 36 arena are internal to it (with the exception of one field that points to the
79 The map is a simple lookup/indirection table that maps an LBA to an internal
81 flags, and the remaining form the internal block number.
97 29 - 0 Mappings to internal 'postmap' blocks
119 premap ABA is 256G. We now refer to the map, and find out the mapping for block
141 lba' alternate lba entry
142 old_map' alternate old postmap entry
143 new_map' alternate new postmap entry
178 internal, postmap block that the reader is (still) reading has been inserted
262 - All internal available blocks are not uniquely and entirely addressed by the
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/Documentation/driver-api/nvdimm/ |
| H A D | btt.rst | 36 arena are internal to it (with the exception of one field that points to the
79 The map is a simple lookup/indirection table that maps an LBA to an internal
81 flags, and the remaining form the internal block number.
97 29 - 0 Mappings to internal 'postmap' blocks
119 premap ABA is 256G. We now refer to the map, and find out the mapping for block
141 lba' alternate lba entry
142 old_map' alternate old postmap entry
143 new_map' alternate new postmap entry
178 internal, postmap block that the reader is (still) reading has been inserted
262 - All internal available blocks are not uniquely and entirely addressed by the
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
57 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
61 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
65 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
79 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| H A D | boyer_moore.qbk | 25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
59 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
63 …algorithm allocates two internal tables. The first one is proportional to the length of the patter…
67 …find a pattern in the corpus is ['O(N)] (linear) time; that is, proportional to the length of the …
81 …es is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
57 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
61 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
65 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
79 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| H A D | boyer_moore.qbk | 25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
59 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
63 …algorithm allocates two internal tables. The first one is proportional to the length of the patter…
67 …find a pattern in the corpus is ['O(N)] (linear) time; that is, proportional to the length of the …
81 …es is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/databases/percona57-server/boost_1_59_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
57 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
61 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
65 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
79 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/databases/percona57-client/boost_1_59_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
57 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
61 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
65 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
79 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
57 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
61 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
65 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
79 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/infra/config/lib/ |
| H A D | consoles.star | 28 load("@stdlib//internal/graph.star", "graph")
29 load("@stdlib//internal/luci/common.star", "keys")
80 # We didn't find the category, the key uses:
134 given name or None if the name does not refer to a console_view with
146 given name or None if the name does not refer to a console_view with
163 with the given name or None if the name does not refer to an
226 """Create a console view, optionally providing an entry ordering.
243 be used as aliases for other entries to refer to.
245 The value for each entry defines the ordering to be applied to
320 """Specifies the details of a console view entry.
[all …]
|
| /dports/misc/p5-Net-vCard/Net-vCard-0.5/ |
| H A D | README | 15 personal information that you would typically find on a business card.
38 The current state of this module is a pretty solid parser and internal
81 implies that several types refer to the same address.
84 entry by the first name and listing the remainder in "_alias" hash key.
89 entry.
|
| /dports/devel/boost-docs/boost_1_72_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
71 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
75 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
79 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
93 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/devel/boost-libs/boost_1_72_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
71 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
75 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
79 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
93 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
71 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
75 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
79 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
93 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|
| /dports/devel/hyperscan/boost_1_75_0/libs/algorithm/doc/ |
| H A D | boyer_moore_horspool.qbk | 19 …oyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer…
25 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being s…
71 …s efficiency derives from the fact that with each unsuccessful attempt to find a match between the…
75 The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern…
79 …ct, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler t…
93 …le is stored. This table, called the skip table, contains (logically) one entry for every possible…
|