Home
last modified time | relevance | path

Searched refs:bijective (Results 1 – 25 of 268) sorted by relevance

1234567891011

/dports/lang/gambit-c/gambit-4.9.3/gsc/tests/40-univ/
H A Dbijectivetype.scm36 (else (bijective x)))
38 (define-target (bijective x)
64 (test ##null? (bijective '()))
70 (test ##boolean? (bijective #t))
71 (test ##boolean? (bijective #f))
74 (test ##fixnum? (bijective 0))
75 (test ##fixnum? (bijective 1))
76 (test ##fixnum? (bijective -1))
79 (test ##flonum? (bijective 1.5))
80 (test ##flonum? (bijective -1.5))
[all …]
H A Dbijectiveval.scm22 (define-target (bijective x)
41 (println (if (##null? (bijective '())) "'()" ""))
44 (println (bijective #!void))
47 (println (bijective #t))
48 (println (bijective #f))
51 (println (bijective 0))
52 (println (bijective -1))
55 (println (bijective 1.5))
56 (println (bijective -1.5))
59 (println (bijective ""))
[all …]
H A Dbijectiveproc.scm35 (else (bijective x)))
37 (define-target (bijective x)
69 (println ((bijective id) "id")))
70 (println ((bijective rest) "a" "b" "c" "d" "e"))))
/dports/math/pspp/pspp-1.4.1/src/language/tests/
H A Dfloat-format.c279 bool bijective = false; in cmd_debug_float_format() local
300 bijective = true; in cmd_debug_float_format()
302 bijective = false; in cmd_debug_float_format()
311 if ((bijective && !lex_force_match (lexer, T_EQUALS)) in cmd_debug_float_format()
312 || (!bijective && !lex_force_match (lexer, T_GT))) in cmd_debug_float_format()
318 if (bijective) in cmd_debug_float_format()
/dports/editors/libreoffice/libreoffice-7.2.6.2/offapi/com/sun/star/geometry/
H A DXMapping2D.idl27 /** Interface defining an arbitrary bijective mapping from R^2 to R^2.<p>
29 This interface provides methods to define an arbitrary bijective
33 bijective, i.e. map a pair of real numbers to exactly one other
52 non-bijective mappings.<p>
/dports/editors/libreoffice6/libreoffice-6.4.7.2/offapi/com/sun/star/geometry/
H A DXMapping2D.idl27 /** Interface defining an arbitrary bijective mapping from R^2 to R^2.<p>
29 This interface provides methods to define an arbitrary bijective
33 bijective, i.e. map a pair of real numbers to exactly one other
52 non-bijective mappings.<p>
/dports/math/curv/curv-0.5/ideas/language/structure/
H A DTransport3 In the most recent release (0.4), the Curv data model was bijective with JSON.
6 In the current prototype, the data model is not bijective with JSON.
11 imported as a string or as a symbol? Symbols are not bijective with strings,
/dports/math/polymake/polymake-4.5/demo/
H A Dtransformations.ipynb9 …ormations are a special case. By the way, a *transformation* is always bijective, by definition.\…
201 …"Sometimes we are interested in images of polytopes under a linear map which is not bijective. An…
296bijective map, the images of VERTICES do not have to be VERTICES. Moreover, even if this is the c…
/dports/math/R-cran-memisc/memisc/R/
H A Drecode.R91 bijective <- FALSE
97 if(copy) bijective <- TRUE
99 bijective <- TRUE
102 if(length(lab.x) && bijective && !length(names(newcodes))){
/dports/lang/purescript/purescript-0.14.5/_cabal_deps/network-3.1.2.2/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/network-3.1.2.0/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/www/hs-yesod-bin/yesod-bin-1.6.1/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/www/hs-wai-app-static/wai-app-static-3.1.7.2/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/network-3.1.2.2/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/network-3.1.2.2/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/devel/hs-ghcprofview/ghcprofview-0.1.0.1/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/network-3.1.2.0/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/devel/stack/stack-2.7.3/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/x11/hs-xmobar/xmobar-0.39/_cabal_deps/network-3.1.2.0/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/textproc/hs-pandoc/pandoc-2.14.2/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/textproc/hs-pandoc-crossref/pandoc-crossref-0.3.12.0/_cabal_deps/network-3.1.2.1/Network/Socket/
H A DReadShow.hs115 bijectiveRead bi def = P.parens $ bijective <++ def
117 bijective = do function
/dports/sysutils/vector/vector-0.10.0/cargo-crates/bimap-0.2.0/
H A DCargo.toml.orig-cargo5 description = "A fast two-way bijective map implementation"
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Documentation/commands/_descriptions/
H A Dcalculate-surface-map.rst8 interior points of the surface. More common use cases are to compute a bijective mapping

1234567891011