Class: Rouge::Lexers::Factor

Inherits:
RegexLexer show all
Defined in:
lib/rouge/lexers/factor.rb

Constant Summary

Constants inherited from RegexLexer

RegexLexer::MAX_NULL_SCANS

Constants included from Token::Tokens

Token::Tokens::Num, Token::Tokens::Str

Instance Attribute Summary

Attributes inherited from Rouge::Lexer

#options

Class Method Summary collapse

Methods inherited from RegexLexer

append, #delegate, #goto, #group, #groups, #in_state?, #pop!, prepend, #push, #recurse, replace_state, #reset!, #reset_stack, #stack, start, start_procs, state, #state, #state?, state_definitions, states, #step, #stream_tokens, #token

Methods inherited from Rouge::Lexer

aliases, all, #as_bool, #as_lexer, #as_list, #as_string, #as_token, #bool_option, continue_lex, #continue_lex, debug_enabled?, demo, demo_file, desc, detectable?, disable_debug!, enable_debug!, filenames, find, find_fancy, guess, guess_by_filename, guess_by_mimetype, guess_by_source, guesses, #hash_option, #initialize, lex, #lex, #lexer_option, #list_option, lookup_fancy, mimetypes, option, option_docs, #reset!, #stream_tokens, #string_option, #tag, tag, title, #token_option, #with

Methods included from Token::Tokens

token

Constructor Details

This class inherits a constructor from Rouge::Lexer

Class Method Details

.builtins ⇒ Object 



17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
 
# File 'lib/rouge/lexers/factor.rb', line 17

def self.builtins
  @builtins ||= {}.tap do |builtins|
    builtins[:kernel] = Set.new %w(
      or 2bi 2tri while wrapper nip 4dip wrapper? bi*
      callstack>array both? hashcode die dupd callstack
      callstack? 3dup tri@ pick curry build ?execute 3bi prepose
      >boolean if clone eq? tri* ? = swapd 2over 2keep 3keep clear
      2dup when not tuple? dup 2bi* 2tri* call tri-curry object bi@
      do unless* if* loop bi-curry* drop when* assert= retainstack
      assert? -rot execute 2bi@ 2tri@ boa with either? 3drop bi
      curry?  datastack until 3dip over 3curry tri-curry* tri-curry@
      swap and 2nip throw bi-curry (clone) hashcode* compose 2dip if
      3tri unless compose? tuple keep 2curry equal? assert tri 2drop
      most <wrapper> boolean? identity-hashcode identity-tuple?
      null new dip bi-curry@ rot xor identity-tuple boolean
    )

    builtins[:assocs] = Set.new %w(
      ?at assoc? assoc-clone-like assoc= delete-at* assoc-partition
      extract-keys new-assoc value? assoc-size map>assoc push-at
      assoc-like key? assoc-intersect assoc-refine update
      assoc-union assoc-combine at* assoc-empty? at+ set-at
      assoc-all? assoc-subset?  assoc-hashcode change-at assoc-each
      assoc-diff zip values value-at rename-at inc-at enum? at cache
      assoc>map <enum> assoc assoc-map enum value-at* assoc-map-as
      >alist assoc-filter-as clear-assoc assoc-stack maybe-set-at
      substitute assoc-filter 2cache delete-at assoc-find keys
      assoc-any? unzip
    )

    builtins[:combinators] = Set.new %w(
      case execute-effect no-cond no-case? 3cleave>quot 2cleave
      cond>quot wrong-values? no-cond? cleave>quot no-case case>quot
      3cleave wrong-values to-fixed-point alist>quot case-find
      cond cleave call-effect 2cleave>quot recursive-hashcode
      linear-case-quot spread spread>quot
    )

    builtins[:math] = Set.new %w(
      number= if-zero next-power-of-2 each-integer ?1+
      fp-special? imaginary-part unless-zero float>bits number?
      fp-infinity? bignum? fp-snan? denominator fp-bitwise= *
      + power-of-2? - u>= / >= bitand log2-expects-positive <
      log2 > integer? number bits>double 2/ zero? (find-integer)
      bits>float float? shift ratio? even? ratio fp-sign bitnot
      >fixnum complex? /i /f byte-array>bignum when-zero sgn >bignum
      next-float u< u> mod recip rational find-last-integer >float
      (all-integers?) 2^ times integer fixnum? neg fixnum sq bignum
      (each-integer) bit? fp-qnan? find-integer complex <fp-nan>
      real double>bits bitor rem fp-nan-payload all-integers?
      real-part log2-expects-positive? prev-float align unordered?
      float fp-nan? abs bitxor u<= odd? <= /mod rational? >integer
      real? numerator
    )

    builtins[:sequences] = Set.new %w(
      member-eq? append assert-sequence= find-last-from
      trim-head-slice clone-like 3sequence assert-sequence? map-as
      last-index-from reversed index-from cut* pad-tail
      remove-eq! concat-as but-last snip trim-tail nths
      nth 2selector sequence slice?  <slice> partition
      remove-nth tail-slice empty? tail* if-empty
      find-from virtual-sequence? member? set-length
      drop-prefix unclip unclip-last-slice iota map-sum
      bounds-error? sequence-hashcode-step selector-for
      accumulate-as map start midpoint@ (accumulate) rest-slice
      prepend fourth sift accumulate! new-sequence follow map! like
      first4 1sequence reverse slice unless-empty padding virtual@
      repetition? set-last index 4sequence max-length set-second
      immutable-sequence first2 first3 replicate-as reduce-index
      unclip-slice supremum suffix! insert-nth trim-tail-slice
      tail 3append short count suffix concat flip filter sum
      immutable? reverse! 2sequence map-integers delete-all start*
      indices snip-slice check-slice sequence?  head map-find
      filter! append-as reduce sequence= halves collapse-slice
      interleave 2map filter-as binary-reduce slice-error? product
      bounds-check? bounds-check harvest immutable virtual-exemplar
      find produce remove pad-head last replicate set-fourth
      remove-eq shorten reversed?  map-find-last 3map-as
      2unclip-slice shorter? 3map find-last head-slice pop* 2map-as
      tail-slice* but-last-slice 2map-reduce iota? collector-for
      accumulate each selector append! new-resizable cut-slice
      each-index head-slice* 2reverse-each sequence-hashcode
      pop set-nth ?nth <flat-slice> second join when-empty
      collector immutable-sequence? <reversed> all? 3append-as
      virtual-sequence subseq? remove-nth! push-either new-like
      length last-index push-if 2all? lengthen assert-sequence
      copy map-reduce move third first 3each tail? set-first prefix
      bounds-error any? <repetition> trim-slice exchange surround
      2reduce cut change-nth min-length set-third produce-as
      push-all head? delete-slice rest sum-lengths 2each head*
      infimum remove! glue slice-error subseq trim replace-slice
      push repetition map-index trim-head unclip-last mismatch
    )

    builtins[:namespaces] = Set.new %w(
      global +@ change set-namestack change-global init-namespaces
      on off set-global namespace set with-scope bind with-variable
      inc dec counter initialize namestack get get-global make-assoc
    )

    builtins[:arrays] = Set.new %w(
      <array> 2array 3array pair >array 1array 4array pair?
      array resize-array array?
    )

    builtins[:io] = Set.new %w(
      +character+ bad-seek-type? readln each-morsel
      stream-seek read print with-output-stream contents
      write1 stream-write1 stream-copy stream-element-type
      with-input-stream stream-print stream-read stream-contents
      stream-tell tell-output bl seek-output bad-seek-type nl
      stream-nl write flush stream-lines +byte+ stream-flush
      read1 seek-absolute? stream-read1 lines stream-readln
      stream-read-until each-line seek-end with-output-stream*
      seek-absolute with-streams seek-input seek-relative?
      input-stream stream-write read-partial seek-end?
      seek-relative error-stream read-until with-input-stream*
      with-streams* tell-input each-block output-stream
      stream-read-partial each-stream-block each-stream-line
    )

    builtins[:strings] = Set.new %w(
      resize-string >string <string> 1string string string?
    )

    builtins[:vectors] = Set.new %w(
      with-return restarts return-continuation with-datastack
      recover rethrow-restarts <restart> ifcc set-catchstack
      >continuation< cleanup ignore-errors restart?
      compute-restarts attempt-all-error error-thread
      continue <continuation> attempt-all-error? condition?
      <condition> throw-restarts error catchstack continue-with
      thread-error-hook continuation rethrow callcc1
      error-continuation callcc0 attempt-all condition
      continuation? restart return
    )

    builtins[:continuations] = Set.new %w(
      with-return restarts return-continuation with-datastack
      recover rethrow-restarts <restart> ifcc set-catchstack
      >continuation< cleanup ignore-errors restart?
      compute-restarts attempt-all-error error-thread
      continue <continuation> attempt-all-error? condition?
      <condition> throw-restarts error catchstack continue-with
      thread-error-hook continuation rethrow callcc1
      error-continuation callcc0 attempt-all condition
      continuation? restart return
    )
  end
end

.detect?(text) ⇒ Boolean

Returns:

  • (Boolean) 


13
14
15
 
# File 'lib/rouge/lexers/factor.rb', line 13

def self.detect?(text)
  return true if text.shebang? 'factor'
end