├── .github
└── FUNDING.yml
├── .gitignore
├── LICENSE
├── LICENSE-MIT
├── LICENSES
├── README.md
├── alternative.html
├── config
└── tailwind.css
├── css
├── hyperaudio-lite-editor.css
├── hyperaudio-lite-player.css
├── tailwind-dev.css
└── tailwind-min.css
├── hyperaudio-template.html
├── images
├── favicon-16x16.png
├── favicon-32x32.png
├── icon-192x192.png
├── icon-512x512.png
├── maskable-icon-192x192.png
└── poster.png
├── index.html
├── js
├── .prettierrc.json
├── audio-cut.js
├── caption-modified.js
├── hyperaudio-lite-editor-deepgram.js
├── hyperaudio-lite-editor-export.js
├── hyperaudio-lite-editor-storage.js
├── hyperaudio-lite-editor-whisper.js
├── hyperaudio-lite-extension.js
├── hyperaudio-lite.js
├── hyperaudio-push-notification.js
└── whisper.worker.js
├── legacy.html
├── local.html
├── manifest.json
├── package-lock.json
├── package.json
├── postcss.config.js
├── serviceworker.js
├── tailwind.config.js
├── tailwind.md
└── test
└── test.mp3
/.github/FUNDING.yml:
--------------------------------------------------------------------------------
1 | # These are supported funding model platforms
2 |
3 | github: # Replace with up to 4 GitHub Sponsors-enabled usernames e.g., [user1, user2]
4 | patreon: Hyperaudio
5 | open_collective: # Replace with a single Open Collective username
6 | ko_fi: # Replace with a single Ko-fi username
7 | tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel
8 | community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
9 | liberapay: # Replace with a single Liberapay username
10 | issuehunt: # Replace with a single IssueHunt username
11 | otechie: # Replace with a single Otechie username
12 | lfx_crowdfunding: # Replace with a single LFX Crowdfunding project-name e.g., cloud-foundry
13 | custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']
14 |
--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
1 |
2 | # Created by https://www.toptal.com/developers/gitignore/api/macos,node,linux
3 | # Edit at https://www.toptal.com/developers/gitignore?templates=macos,node,linux
4 |
5 | ### Linux ###
6 | *~
7 |
8 | # temporary files which can be created if a process still has a handle open of a deleted file
9 | .fuse_hidden*
10 |
11 | # KDE directory preferences
12 | .directory
13 |
14 | # Linux trash folder which might appear on any partition or disk
15 | .Trash-*
16 |
17 | # .nfs files are created when an open file is removed but is still being accessed
18 | .nfs*
19 |
20 | ### macOS ###
21 | # General
22 | .DS_Store
23 | .AppleDouble
24 | .LSOverride
25 |
26 | # Icon must end with two \r
27 | Icon
28 |
29 |
30 | # Thumbnails
31 | ._*
32 |
33 | # Files that might appear in the root of a volume
34 | .DocumentRevisions-V100
35 | .fseventsd
36 | .Spotlight-V100
37 | .TemporaryItems
38 | .Trashes
39 | .VolumeIcon.icns
40 | .com.apple.timemachine.donotpresent
41 |
42 | # Directories potentially created on remote AFP share
43 | .AppleDB
44 | .AppleDesktop
45 | Network Trash Folder
46 | Temporary Items
47 | .apdisk
48 |
49 | ### Node ###
50 | # Logs
51 | logs
52 | *.log
53 | npm-debug.log*
54 | yarn-debug.log*
55 | yarn-error.log*
56 | lerna-debug.log*
57 | .pnpm-debug.log*
58 |
59 | # Diagnostic reports (https://nodejs.org/api/report.html)
60 | report.[0-9]*.[0-9]*.[0-9]*.[0-9]*.json
61 |
62 | # Runtime data
63 | pids
64 | *.pid
65 | *.seed
66 | *.pid.lock
67 |
68 | # Directory for instrumented libs generated by jscoverage/JSCover
69 | lib-cov
70 |
71 | # Coverage directory used by tools like istanbul
72 | coverage
73 | *.lcov
74 |
75 | # nyc test coverage
76 | .nyc_output
77 |
78 | # Grunt intermediate storage (https://gruntjs.com/creating-plugins#storing-task-files)
79 | .grunt
80 |
81 | # Bower dependency directory (https://bower.io/)
82 | bower_components
83 |
84 | # node-waf configuration
85 | .lock-wscript
86 |
87 | # Compiled binary addons (https://nodejs.org/api/addons.html)
88 | build/Release
89 |
90 | # Dependency directories
91 | node_modules/
92 | jspm_packages/
93 |
94 | # Snowpack dependency directory (https://snowpack.dev/)
95 | web_modules/
96 |
97 | # TypeScript cache
98 | *.tsbuildinfo
99 |
100 | # Optional npm cache directory
101 | .npm
102 |
103 | # Optional eslint cache
104 | .eslintcache
105 |
106 | # Microbundle cache
107 | .rpt2_cache/
108 | .rts2_cache_cjs/
109 | .rts2_cache_es/
110 | .rts2_cache_umd/
111 |
112 | # Optional REPL history
113 | .node_repl_history
114 |
115 | # Output of 'npm pack'
116 | *.tgz
117 |
118 | # Yarn Integrity file
119 | .yarn-integrity
120 |
121 | # dotenv environment variables file
122 | .env
123 | .env.test
124 | .env.production
125 |
126 | # parcel-bundler cache (https://parceljs.org/)
127 | .cache
128 | .parcel-cache
129 |
130 | # Next.js build output
131 | .next
132 | out
133 |
134 | # Nuxt.js build / generate output
135 | .nuxt
136 | dist
137 |
138 | # Gatsby files
139 | .cache/
140 | # Comment in the public line in if your project uses Gatsby and not Next.js
141 | # https://nextjs.org/blog/next-9-1#public-directory-support
142 | # public
143 |
144 | # vuepress build output
145 | .vuepress/dist
146 |
147 | # Serverless directories
148 | .serverless/
149 |
150 | # FuseBox cache
151 | .fusebox/
152 |
153 | # DynamoDB Local files
154 | .dynamodb/
155 |
156 | # TernJS port file
157 | .tern-port
158 |
159 | # Stores VSCode versions used for testing VSCode extensions
160 | .vscode-test
161 |
162 | # yarn v2
163 | .yarn/cache
164 | .yarn/unplugged
165 | .yarn/build-state.yml
166 | .yarn/install-state.gz
167 | .pnp.*
168 |
169 | # End of https://www.toptal.com/developers/gitignore/api/macos,node,linux
170 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU AFFERO GENERAL PUBLIC LICENSE
2 | Version 3, 19 November 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU Affero General Public License is a free, copyleft license for
11 | software and other kinds of works, specifically designed to ensure
12 | cooperation with the community in the case of network server software.
13 |
14 | The licenses for most software and other practical works are designed
15 | to take away your freedom to share and change the works. By contrast,
16 | our General Public Licenses are intended to guarantee your freedom to
17 | share and change all versions of a program--to make sure it remains free
18 | software for all its users.
19 |
20 | When we speak of free software, we are referring to freedom, not
21 | price. Our General Public Licenses are designed to make sure that you
22 | have the freedom to distribute copies of free software (and charge for
23 | them if you wish), that you receive source code or can get it if you
24 | want it, that you can change the software or use pieces of it in new
25 | free programs, and that you know you can do these things.
26 |
27 | Developers that use our General Public Licenses protect your rights
28 | with two steps: (1) assert copyright on the software, and (2) offer
29 | you this License which gives you legal permission to copy, distribute
30 | and/or modify the software.
31 |
32 | A secondary benefit of defending all users' freedom is that
33 | improvements made in alternate versions of the program, if they
34 | receive widespread use, become available for other developers to
35 | incorporate. Many developers of free software are heartened and
36 | encouraged by the resulting cooperation. However, in the case of
37 | software used on network servers, this result may fail to come about.
38 | The GNU General Public License permits making a modified version and
39 | letting the public access it on a server without ever releasing its
40 | source code to the public.
41 |
42 | The GNU Affero General Public License is designed specifically to
43 | ensure that, in such cases, the modified source code becomes available
44 | to the community. It requires the operator of a network server to
45 | provide the source code of the modified version running there to the
46 | users of that server. Therefore, public use of a modified version, on
47 | a publicly accessible server, gives the public access to the source
48 | code of the modified version.
49 |
50 | An older license, called the Affero General Public License and
51 | published by Affero, was designed to accomplish similar goals. This is
52 | a different license, not a version of the Affero GPL, but Affero has
53 | released a new version of the Affero GPL which permits relicensing under
54 | this license.
55 |
56 | The precise terms and conditions for copying, distribution and
57 | modification follow.
58 |
59 | TERMS AND CONDITIONS
60 |
61 | 0. Definitions.
62 |
63 | "This License" refers to version 3 of the GNU Affero General Public License.
64 |
65 | "Copyright" also means copyright-like laws that apply to other kinds of
66 | works, such as semiconductor masks.
67 |
68 | "The Program" refers to any copyrightable work licensed under this
69 | License. Each licensee is addressed as "you". "Licensees" and
70 | "recipients" may be individuals or organizations.
71 |
72 | To "modify" a work means to copy from or adapt all or part of the work
73 | in a fashion requiring copyright permission, other than the making of an
74 | exact copy. The resulting work is called a "modified version" of the
75 | earlier work or a work "based on" the earlier work.
76 |
77 | A "covered work" means either the unmodified Program or a work based
78 | on the Program.
79 |
80 | To "propagate" a work means to do anything with it that, without
81 | permission, would make you directly or secondarily liable for
82 | infringement under applicable copyright law, except executing it on a
83 | computer or modifying a private copy. Propagation includes copying,
84 | distribution (with or without modification), making available to the
85 | public, and in some countries other activities as well.
86 |
87 | To "convey" a work means any kind of propagation that enables other
88 | parties to make or receive copies. Mere interaction with a user through
89 | a computer network, with no transfer of a copy, is not conveying.
90 |
91 | An interactive user interface displays "Appropriate Legal Notices"
92 | to the extent that it includes a convenient and prominently visible
93 | feature that (1) displays an appropriate copyright notice, and (2)
94 | tells the user that there is no warranty for the work (except to the
95 | extent that warranties are provided), that licensees may convey the
96 | work under this License, and how to view a copy of this License. If
97 | the interface presents a list of user commands or options, such as a
98 | menu, a prominent item in the list meets this criterion.
99 |
100 | 1. Source Code.
101 |
102 | The "source code" for a work means the preferred form of the work
103 | for making modifications to it. "Object code" means any non-source
104 | form of a work.
105 |
106 | A "Standard Interface" means an interface that either is an official
107 | standard defined by a recognized standards body, or, in the case of
108 | interfaces specified for a particular programming language, one that
109 | is widely used among developers working in that language.
110 |
111 | The "System Libraries" of an executable work include anything, other
112 | than the work as a whole, that (a) is included in the normal form of
113 | packaging a Major Component, but which is not part of that Major
114 | Component, and (b) serves only to enable use of the work with that
115 | Major Component, or to implement a Standard Interface for which an
116 | implementation is available to the public in source code form. A
117 | "Major Component", in this context, means a major essential component
118 | (kernel, window system, and so on) of the specific operating system
119 | (if any) on which the executable work runs, or a compiler used to
120 | produce the work, or an object code interpreter used to run it.
121 |
122 | The "Corresponding Source" for a work in object code form means all
123 | the source code needed to generate, install, and (for an executable
124 | work) run the object code and to modify the work, including scripts to
125 | control those activities. However, it does not include the work's
126 | System Libraries, or general-purpose tools or generally available free
127 | programs which are used unmodified in performing those activities but
128 | which are not part of the work. For example, Corresponding Source
129 | includes interface definition files associated with source files for
130 | the work, and the source code for shared libraries and dynamically
131 | linked subprograms that the work is specifically designed to require,
132 | such as by intimate data communication or control flow between those
133 | subprograms and other parts of the work.
134 |
135 | The Corresponding Source need not include anything that users
136 | can regenerate automatically from other parts of the Corresponding
137 | Source.
138 |
139 | The Corresponding Source for a work in source code form is that
140 | same work.
141 |
142 | 2. Basic Permissions.
143 |
144 | All rights granted under this License are granted for the term of
145 | copyright on the Program, and are irrevocable provided the stated
146 | conditions are met. This License explicitly affirms your unlimited
147 | permission to run the unmodified Program. The output from running a
148 | covered work is covered by this License only if the output, given its
149 | content, constitutes a covered work. This License acknowledges your
150 | rights of fair use or other equivalent, as provided by copyright law.
151 |
152 | You may make, run and propagate covered works that you do not
153 | convey, without conditions so long as your license otherwise remains
154 | in force. You may convey covered works to others for the sole purpose
155 | of having them make modifications exclusively for you, or provide you
156 | with facilities for running those works, provided that you comply with
157 | the terms of this License in conveying all material for which you do
158 | not control copyright. Those thus making or running the covered works
159 | for you must do so exclusively on your behalf, under your direction
160 | and control, on terms that prohibit them from making any copies of
161 | your copyrighted material outside their relationship with you.
162 |
163 | Conveying under any other circumstances is permitted solely under
164 | the conditions stated below. Sublicensing is not allowed; section 10
165 | makes it unnecessary.
166 |
167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
168 |
169 | No covered work shall be deemed part of an effective technological
170 | measure under any applicable law fulfilling obligations under article
171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
172 | similar laws prohibiting or restricting circumvention of such
173 | measures.
174 |
175 | When you convey a covered work, you waive any legal power to forbid
176 | circumvention of technological measures to the extent such circumvention
177 | is effected by exercising rights under this License with respect to
178 | the covered work, and you disclaim any intention to limit operation or
179 | modification of the work as a means of enforcing, against the work's
180 | users, your or third parties' legal rights to forbid circumvention of
181 | technological measures.
182 |
183 | 4. Conveying Verbatim Copies.
184 |
185 | You may convey verbatim copies of the Program's source code as you
186 | receive it, in any medium, provided that you conspicuously and
187 | appropriately publish on each copy an appropriate copyright notice;
188 | keep intact all notices stating that this License and any
189 | non-permissive terms added in accord with section 7 apply to the code;
190 | keep intact all notices of the absence of any warranty; and give all
191 | recipients a copy of this License along with the Program.
192 |
193 | You may charge any price or no price for each copy that you convey,
194 | and you may offer support or warranty protection for a fee.
195 |
196 | 5. Conveying Modified Source Versions.
197 |
198 | You may convey a work based on the Program, or the modifications to
199 | produce it from the Program, in the form of source code under the
200 | terms of section 4, provided that you also meet all of these conditions:
201 |
202 | a) The work must carry prominent notices stating that you modified
203 | it, and giving a relevant date.
204 |
205 | b) The work must carry prominent notices stating that it is
206 | released under this License and any conditions added under section
207 | 7. This requirement modifies the requirement in section 4 to
208 | "keep intact all notices".
209 |
210 | c) You must license the entire work, as a whole, under this
211 | License to anyone who comes into possession of a copy. This
212 | License will therefore apply, along with any applicable section 7
213 | additional terms, to the whole of the work, and all its parts,
214 | regardless of how they are packaged. This License gives no
215 | permission to license the work in any other way, but it does not
216 | invalidate such permission if you have separately received it.
217 |
218 | d) If the work has interactive user interfaces, each must display
219 | Appropriate Legal Notices; however, if the Program has interactive
220 | interfaces that do not display Appropriate Legal Notices, your
221 | work need not make them do so.
222 |
223 | A compilation of a covered work with other separate and independent
224 | works, which are not by their nature extensions of the covered work,
225 | and which are not combined with it such as to form a larger program,
226 | in or on a volume of a storage or distribution medium, is called an
227 | "aggregate" if the compilation and its resulting copyright are not
228 | used to limit the access or legal rights of the compilation's users
229 | beyond what the individual works permit. Inclusion of a covered work
230 | in an aggregate does not cause this License to apply to the other
231 | parts of the aggregate.
232 |
233 | 6. Conveying Non-Source Forms.
234 |
235 | You may convey a covered work in object code form under the terms
236 | of sections 4 and 5, provided that you also convey the
237 | machine-readable Corresponding Source under the terms of this License,
238 | in one of these ways:
239 |
240 | a) Convey the object code in, or embodied in, a physical product
241 | (including a physical distribution medium), accompanied by the
242 | Corresponding Source fixed on a durable physical medium
243 | customarily used for software interchange.
244 |
245 | b) Convey the object code in, or embodied in, a physical product
246 | (including a physical distribution medium), accompanied by a
247 | written offer, valid for at least three years and valid for as
248 | long as you offer spare parts or customer support for that product
249 | model, to give anyone who possesses the object code either (1) a
250 | copy of the Corresponding Source for all the software in the
251 | product that is covered by this License, on a durable physical
252 | medium customarily used for software interchange, for a price no
253 | more than your reasonable cost of physically performing this
254 | conveying of source, or (2) access to copy the
255 | Corresponding Source from a network server at no charge.
256 |
257 | c) Convey individual copies of the object code with a copy of the
258 | written offer to provide the Corresponding Source. This
259 | alternative is allowed only occasionally and noncommercially, and
260 | only if you received the object code with such an offer, in accord
261 | with subsection 6b.
262 |
263 | d) Convey the object code by offering access from a designated
264 | place (gratis or for a charge), and offer equivalent access to the
265 | Corresponding Source in the same way through the same place at no
266 | further charge. You need not require recipients to copy the
267 | Corresponding Source along with the object code. If the place to
268 | copy the object code is a network server, the Corresponding Source
269 | may be on a different server (operated by you or a third party)
270 | that supports equivalent copying facilities, provided you maintain
271 | clear directions next to the object code saying where to find the
272 | Corresponding Source. Regardless of what server hosts the
273 | Corresponding Source, you remain obligated to ensure that it is
274 | available for as long as needed to satisfy these requirements.
275 |
276 | e) Convey the object code using peer-to-peer transmission, provided
277 | you inform other peers where the object code and Corresponding
278 | Source of the work are being offered to the general public at no
279 | charge under subsection 6d.
280 |
281 | A separable portion of the object code, whose source code is excluded
282 | from the Corresponding Source as a System Library, need not be
283 | included in conveying the object code work.
284 |
285 | A "User Product" is either (1) a "consumer product", which means any
286 | tangible personal property which is normally used for personal, family,
287 | or household purposes, or (2) anything designed or sold for incorporation
288 | into a dwelling. In determining whether a product is a consumer product,
289 | doubtful cases shall be resolved in favor of coverage. For a particular
290 | product received by a particular user, "normally used" refers to a
291 | typical or common use of that class of product, regardless of the status
292 | of the particular user or of the way in which the particular user
293 | actually uses, or expects or is expected to use, the product. A product
294 | is a consumer product regardless of whether the product has substantial
295 | commercial, industrial or non-consumer uses, unless such uses represent
296 | the only significant mode of use of the product.
297 |
298 | "Installation Information" for a User Product means any methods,
299 | procedures, authorization keys, or other information required to install
300 | and execute modified versions of a covered work in that User Product from
301 | a modified version of its Corresponding Source. The information must
302 | suffice to ensure that the continued functioning of the modified object
303 | code is in no case prevented or interfered with solely because
304 | modification has been made.
305 |
306 | If you convey an object code work under this section in, or with, or
307 | specifically for use in, a User Product, and the conveying occurs as
308 | part of a transaction in which the right of possession and use of the
309 | User Product is transferred to the recipient in perpetuity or for a
310 | fixed term (regardless of how the transaction is characterized), the
311 | Corresponding Source conveyed under this section must be accompanied
312 | by the Installation Information. But this requirement does not apply
313 | if neither you nor any third party retains the ability to install
314 | modified object code on the User Product (for example, the work has
315 | been installed in ROM).
316 |
317 | The requirement to provide Installation Information does not include a
318 | requirement to continue to provide support service, warranty, or updates
319 | for a work that has been modified or installed by the recipient, or for
320 | the User Product in which it has been modified or installed. Access to a
321 | network may be denied when the modification itself materially and
322 | adversely affects the operation of the network or violates the rules and
323 | protocols for communication across the network.
324 |
325 | Corresponding Source conveyed, and Installation Information provided,
326 | in accord with this section must be in a format that is publicly
327 | documented (and with an implementation available to the public in
328 | source code form), and must require no special password or key for
329 | unpacking, reading or copying.
330 |
331 | 7. Additional Terms.
332 |
333 | "Additional permissions" are terms that supplement the terms of this
334 | License by making exceptions from one or more of its conditions.
335 | Additional permissions that are applicable to the entire Program shall
336 | be treated as though they were included in this License, to the extent
337 | that they are valid under applicable law. If additional permissions
338 | apply only to part of the Program, that part may be used separately
339 | under those permissions, but the entire Program remains governed by
340 | this License without regard to the additional permissions.
341 |
342 | When you convey a copy of a covered work, you may at your option
343 | remove any additional permissions from that copy, or from any part of
344 | it. (Additional permissions may be written to require their own
345 | removal in certain cases when you modify the work.) You may place
346 | additional permissions on material, added by you to a covered work,
347 | for which you have or can give appropriate copyright permission.
348 |
349 | Notwithstanding any other provision of this License, for material you
350 | add to a covered work, you may (if authorized by the copyright holders of
351 | that material) supplement the terms of this License with terms:
352 |
353 | a) Disclaiming warranty or limiting liability differently from the
354 | terms of sections 15 and 16 of this License; or
355 |
356 | b) Requiring preservation of specified reasonable legal notices or
357 | author attributions in that material or in the Appropriate Legal
358 | Notices displayed by works containing it; or
359 |
360 | c) Prohibiting misrepresentation of the origin of that material, or
361 | requiring that modified versions of such material be marked in
362 | reasonable ways as different from the original version; or
363 |
364 | d) Limiting the use for publicity purposes of names of licensors or
365 | authors of the material; or
366 |
367 | e) Declining to grant rights under trademark law for use of some
368 | trade names, trademarks, or service marks; or
369 |
370 | f) Requiring indemnification of licensors and authors of that
371 | material by anyone who conveys the material (or modified versions of
372 | it) with contractual assumptions of liability to the recipient, for
373 | any liability that these contractual assumptions directly impose on
374 | those licensors and authors.
375 |
376 | All other non-permissive additional terms are considered "further
377 | restrictions" within the meaning of section 10. If the Program as you
378 | received it, or any part of it, contains a notice stating that it is
379 | governed by this License along with a term that is a further
380 | restriction, you may remove that term. If a license document contains
381 | a further restriction but permits relicensing or conveying under this
382 | License, you may add to a covered work material governed by the terms
383 | of that license document, provided that the further restriction does
384 | not survive such relicensing or conveying.
385 |
386 | If you add terms to a covered work in accord with this section, you
387 | must place, in the relevant source files, a statement of the
388 | additional terms that apply to those files, or a notice indicating
389 | where to find the applicable terms.
390 |
391 | Additional terms, permissive or non-permissive, may be stated in the
392 | form of a separately written license, or stated as exceptions;
393 | the above requirements apply either way.
394 |
395 | 8. Termination.
396 |
397 | You may not propagate or modify a covered work except as expressly
398 | provided under this License. Any attempt otherwise to propagate or
399 | modify it is void, and will automatically terminate your rights under
400 | this License (including any patent licenses granted under the third
401 | paragraph of section 11).
402 |
403 | However, if you cease all violation of this License, then your
404 | license from a particular copyright holder is reinstated (a)
405 | provisionally, unless and until the copyright holder explicitly and
406 | finally terminates your license, and (b) permanently, if the copyright
407 | holder fails to notify you of the violation by some reasonable means
408 | prior to 60 days after the cessation.
409 |
410 | Moreover, your license from a particular copyright holder is
411 | reinstated permanently if the copyright holder notifies you of the
412 | violation by some reasonable means, this is the first time you have
413 | received notice of violation of this License (for any work) from that
414 | copyright holder, and you cure the violation prior to 30 days after
415 | your receipt of the notice.
416 |
417 | Termination of your rights under this section does not terminate the
418 | licenses of parties who have received copies or rights from you under
419 | this License. If your rights have been terminated and not permanently
420 | reinstated, you do not qualify to receive new licenses for the same
421 | material under section 10.
422 |
423 | 9. Acceptance Not Required for Having Copies.
424 |
425 | You are not required to accept this License in order to receive or
426 | run a copy of the Program. Ancillary propagation of a covered work
427 | occurring solely as a consequence of using peer-to-peer transmission
428 | to receive a copy likewise does not require acceptance. However,
429 | nothing other than this License grants you permission to propagate or
430 | modify any covered work. These actions infringe copyright if you do
431 | not accept this License. Therefore, by modifying or propagating a
432 | covered work, you indicate your acceptance of this License to do so.
433 |
434 | 10. Automatic Licensing of Downstream Recipients.
435 |
436 | Each time you convey a covered work, the recipient automatically
437 | receives a license from the original licensors, to run, modify and
438 | propagate that work, subject to this License. You are not responsible
439 | for enforcing compliance by third parties with this License.
440 |
441 | An "entity transaction" is a transaction transferring control of an
442 | organization, or substantially all assets of one, or subdividing an
443 | organization, or merging organizations. If propagation of a covered
444 | work results from an entity transaction, each party to that
445 | transaction who receives a copy of the work also receives whatever
446 | licenses to the work the party's predecessor in interest had or could
447 | give under the previous paragraph, plus a right to possession of the
448 | Corresponding Source of the work from the predecessor in interest, if
449 | the predecessor has it or can get it with reasonable efforts.
450 |
451 | You may not impose any further restrictions on the exercise of the
452 | rights granted or affirmed under this License. For example, you may
453 | not impose a license fee, royalty, or other charge for exercise of
454 | rights granted under this License, and you may not initiate litigation
455 | (including a cross-claim or counterclaim in a lawsuit) alleging that
456 | any patent claim is infringed by making, using, selling, offering for
457 | sale, or importing the Program or any portion of it.
458 |
459 | 11. Patents.
460 |
461 | A "contributor" is a copyright holder who authorizes use under this
462 | License of the Program or a work on which the Program is based. The
463 | work thus licensed is called the contributor's "contributor version".
464 |
465 | A contributor's "essential patent claims" are all patent claims
466 | owned or controlled by the contributor, whether already acquired or
467 | hereafter acquired, that would be infringed by some manner, permitted
468 | by this License, of making, using, or selling its contributor version,
469 | but do not include claims that would be infringed only as a
470 | consequence of further modification of the contributor version. For
471 | purposes of this definition, "control" includes the right to grant
472 | patent sublicenses in a manner consistent with the requirements of
473 | this License.
474 |
475 | Each contributor grants you a non-exclusive, worldwide, royalty-free
476 | patent license under the contributor's essential patent claims, to
477 | make, use, sell, offer for sale, import and otherwise run, modify and
478 | propagate the contents of its contributor version.
479 |
480 | In the following three paragraphs, a "patent license" is any express
481 | agreement or commitment, however denominated, not to enforce a patent
482 | (such as an express permission to practice a patent or covenant not to
483 | sue for patent infringement). To "grant" such a patent license to a
484 | party means to make such an agreement or commitment not to enforce a
485 | patent against the party.
486 |
487 | If you convey a covered work, knowingly relying on a patent license,
488 | and the Corresponding Source of the work is not available for anyone
489 | to copy, free of charge and under the terms of this License, through a
490 | publicly available network server or other readily accessible means,
491 | then you must either (1) cause the Corresponding Source to be so
492 | available, or (2) arrange to deprive yourself of the benefit of the
493 | patent license for this particular work, or (3) arrange, in a manner
494 | consistent with the requirements of this License, to extend the patent
495 | license to downstream recipients. "Knowingly relying" means you have
496 | actual knowledge that, but for the patent license, your conveying the
497 | covered work in a country, or your recipient's use of the covered work
498 | in a country, would infringe one or more identifiable patents in that
499 | country that you have reason to believe are valid.
500 |
501 | If, pursuant to or in connection with a single transaction or
502 | arrangement, you convey, or propagate by procuring conveyance of, a
503 | covered work, and grant a patent license to some of the parties
504 | receiving the covered work authorizing them to use, propagate, modify
505 | or convey a specific copy of the covered work, then the patent license
506 | you grant is automatically extended to all recipients of the covered
507 | work and works based on it.
508 |
509 | A patent license is "discriminatory" if it does not include within
510 | the scope of its coverage, prohibits the exercise of, or is
511 | conditioned on the non-exercise of one or more of the rights that are
512 | specifically granted under this License. You may not convey a covered
513 | work if you are a party to an arrangement with a third party that is
514 | in the business of distributing software, under which you make payment
515 | to the third party based on the extent of your activity of conveying
516 | the work, and under which the third party grants, to any of the
517 | parties who would receive the covered work from you, a discriminatory
518 | patent license (a) in connection with copies of the covered work
519 | conveyed by you (or copies made from those copies), or (b) primarily
520 | for and in connection with specific products or compilations that
521 | contain the covered work, unless you entered into that arrangement,
522 | or that patent license was granted, prior to 28 March 2007.
523 |
524 | Nothing in this License shall be construed as excluding or limiting
525 | any implied license or other defenses to infringement that may
526 | otherwise be available to you under applicable patent law.
527 |
528 | 12. No Surrender of Others' Freedom.
529 |
530 | If conditions are imposed on you (whether by court order, agreement or
531 | otherwise) that contradict the conditions of this License, they do not
532 | excuse you from the conditions of this License. If you cannot convey a
533 | covered work so as to satisfy simultaneously your obligations under this
534 | License and any other pertinent obligations, then as a consequence you may
535 | not convey it at all. For example, if you agree to terms that obligate you
536 | to collect a royalty for further conveying from those to whom you convey
537 | the Program, the only way you could satisfy both those terms and this
538 | License would be to refrain entirely from conveying the Program.
539 |
540 | 13. Remote Network Interaction; Use with the GNU General Public License.
541 |
542 | Notwithstanding any other provision of this License, if you modify the
543 | Program, your modified version must prominently offer all users
544 | interacting with it remotely through a computer network (if your version
545 | supports such interaction) an opportunity to receive the Corresponding
546 | Source of your version by providing access to the Corresponding Source
547 | from a network server at no charge, through some standard or customary
548 | means of facilitating copying of software. This Corresponding Source
549 | shall include the Corresponding Source for any work covered by version 3
550 | of the GNU General Public License that is incorporated pursuant to the
551 | following paragraph.
552 |
553 | Notwithstanding any other provision of this License, you have
554 | permission to link or combine any covered work with a work licensed
555 | under version 3 of the GNU General Public License into a single
556 | combined work, and to convey the resulting work. The terms of this
557 | License will continue to apply to the part which is the covered work,
558 | but the work with which it is combined will remain governed by version
559 | 3 of the GNU General Public License.
560 |
561 | 14. Revised Versions of this License.
562 |
563 | The Free Software Foundation may publish revised and/or new versions of
564 | the GNU Affero General Public License from time to time. Such new versions
565 | will be similar in spirit to the present version, but may differ in detail to
566 | address new problems or concerns.
567 |
568 | Each version is given a distinguishing version number. If the
569 | Program specifies that a certain numbered version of the GNU Affero General
570 | Public License "or any later version" applies to it, you have the
571 | option of following the terms and conditions either of that numbered
572 | version or of any later version published by the Free Software
573 | Foundation. If the Program does not specify a version number of the
574 | GNU Affero General Public License, you may choose any version ever published
575 | by the Free Software Foundation.
576 |
577 | If the Program specifies that a proxy can decide which future
578 | versions of the GNU Affero General Public License can be used, that proxy's
579 | public statement of acceptance of a version permanently authorizes you
580 | to choose that version for the Program.
581 |
582 | Later license versions may give you additional or different
583 | permissions. However, no additional obligations are imposed on any
584 | author or copyright holder as a result of your choosing to follow a
585 | later version.
586 |
587 | 15. Disclaimer of Warranty.
588 |
589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
597 |
598 | 16. Limitation of Liability.
599 |
600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
608 | SUCH DAMAGES.
609 |
610 | 17. Interpretation of Sections 15 and 16.
611 |
612 | If the disclaimer of warranty and limitation of liability provided
613 | above cannot be given local legal effect according to their terms,
614 | reviewing courts shall apply local law that most closely approximates
615 | an absolute waiver of all civil liability in connection with the
616 | Program, unless a warranty or assumption of liability accompanies a
617 | copy of the Program in return for a fee.
618 |
619 | END OF TERMS AND CONDITIONS
620 |
621 | How to Apply These Terms to Your New Programs
622 |
623 | If you develop a new program, and you want it to be of the greatest
624 | possible use to the public, the best way to achieve this is to make it
625 | free software which everyone can redistribute and change under these terms.
626 |
627 | To do so, attach the following notices to the program. It is safest
628 | to attach them to the start of each source file to most effectively
629 | state the exclusion of warranty; and each file should have at least
630 | the "copyright" line and a pointer to where the full notice is found.
631 |
632 |
633 | Copyright (C)
634 |
635 | This program is free software: you can redistribute it and/or modify
636 | it under the terms of the GNU Affero General Public License as published
637 | by the Free Software Foundation, either version 3 of the License, or
638 | (at your option) any later version.
639 |
640 | This program is distributed in the hope that it will be useful,
641 | but WITHOUT ANY WARRANTY; without even the implied warranty of
642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
643 | GNU Affero General Public License for more details.
644 |
645 | You should have received a copy of the GNU Affero General Public License
646 | along with this program. If not, see .
647 |
648 | Also add information on how to contact you by electronic and paper mail.
649 |
650 | If your software can interact with users remotely through a computer
651 | network, you should also make sure that it provides a way for users to
652 | get its source. For example, if your program is a web application, its
653 | interface could display a "Source" link that leads users to an archive
654 | of the code. There are many ways you could offer source, and different
655 | solutions will be better for different programs; see section 13 for the
656 | specific requirements.
657 |
658 | You should also get your employer (if you work as a programmer) or school,
659 | if any, to sign a "copyright disclaimer" for the program, if necessary.
660 | For more information on this, and how to apply and follow the GNU AGPL, see
661 | .
662 |
--------------------------------------------------------------------------------
/LICENSE-MIT:
--------------------------------------------------------------------------------
1 | MIT License
2 |
3 | Copyright (c) 2025 The Hyperaudio Project
4 |
5 | Permission is hereby granted, free of charge, to any person obtaining a copy
6 | of this software and associated documentation files (the "Software"), to deal
7 | in the Software without restriction, including without limitation the rights
8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 | copies of the Software, and to permit persons to whom the Software is
10 | furnished to do so, subject to the following conditions:
11 |
12 | The above copyright notice and this permission notice shall be included in all
13 | copies or substantial portions of the Software.
14 |
15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 | SOFTWARE.
22 |
--------------------------------------------------------------------------------
/LICENSES:
--------------------------------------------------------------------------------
1 | An Important Note About Licensing
2 | ---------------------------------
3 |
4 | Our default License is the AGPL3.0 License.
5 |
6 | For commerical use please refer to our main AGPL3.0 License (https://github.com/hyperaudio/hyperaudio-lite-editor/blob/main/LICENSE) or contact us for enquiries about commercial licensing.
7 |
8 | The MIT license applies to non-commercial entities.
9 |
10 | For any enquiries please contact mark@hyperaud.io
11 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 |
2 | # Hyperaudio Lite Editor
3 | A lightweight transcript editor for editing and correcting machine generated transcripts.
4 |
5 | Super Lightweight :snowflake:
6 | Lightning Fast :zap:
7 | Accessible :couple_with_heart:
8 | Installable :computer:
9 | Portable :iphone:
10 |
11 | ### Formats
12 |
13 | Export your transcript as text, interactive transcript, captions and subtitles.
14 |
15 | ### Try it out!
16 |
17 | [Demo (now with localStorage and installable as a Progressive Web App)](https://hyperaudio.github.io/hyperaudio-lite-editor/index.html)
18 |
19 | [](https://hyperaudio.github.io/hyperaudio-lite-editor/index.html)
20 |
21 |
22 | ### How to Use
23 |
24 | Edit in the usual way – add punctuation, create and merge paragraphs etc. Place speaker names in square brackets ie [Maria]. It's recommended that in order to maintain word timings you don't paste large blocks of text. Double-click on words to set the playhead at that point.
25 |
26 | ### Lightweight, Performant and Installable
27 |
28 | We score very highly on Google Chrome's Lighthouse audit tool
29 |
30 |
31 |
32 | Created as a Progressive Web App, you can install on your desktop or mobile home screen.
33 |
34 |
35 | ### Licensing
36 |
37 | `Hyperaudio Lite Editor`'s source code is provided under a **triple license model**.
38 |
39 | #### Open source license
40 |
41 | If you are creating an open source application under a license compatible with the GNU Affero GPL license v3, you may use `Hyperaudio Lite Editor` for free under the terms of the [AGPL-3.0](./LICENSE). This is the deafult license for `Hyperaudio Lite Editor`.
42 |
43 | #### Non-commercial use
44 |
45 | If you are a non-commerical / not-for-profit entity or organisation and wish to to use this software for non-commercial please contact [mark@hyperaud.io](mailto:mark@hyperaud.io) to use `Hyperaudio Lite Editor` for free under the terms of the [MIT License](/.LICENSE-MIT)
46 |
47 | #### Commercial license
48 |
49 | If you'd like to use `Hyperaudio Lite Editor` to develop commercial sites, tools, and applications, the Commercial License is the appropriate license. With this option, your source code is kept proprietary. To enquire about a `Hyperaudio Lite Editor` Commercial License please contact [mark@hyperaud.io](mailto:mark@hyperaud.io).
50 |
51 | ### Support
52 |
53 | Please support The Hyperaudio Project by donating to our [Patreon account](https://patreon.com/hyperaudio).
54 |
--------------------------------------------------------------------------------
/alternative.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
The alternative version is now the default version, which can be found here.
381 |
382 | or use local media file
383 |
384 | select local VTT file
385 |
386 |
387 |
388 |
389 |
390 |
391 |
392 |
`;
393 |
394 | document.querySelector('#vtt').addEventListener('change',this.clearVttMediaUrl);
395 | document.querySelector('#vtt-media').addEventListener('change',this.clearVttFilePicker);
396 | document.querySelector('#file-import-vtt').addEventListener('click',this.confirmVtt);
397 |
398 | document.addEventListener('DOMContentLoaded', () => {
399 | const vttMediaInput = document.getElementById('vtt-media');
400 | const vttFileInput = document.getElementById('vtt-file');
401 |
402 | // Function to toggle the disabled state of inputs
403 | function toggleInputDisabled() {
404 | if (vttMediaInput.value.trim() !== '') {
405 | vttFileInput.disabled = true;
406 | } else {
407 | vttFileInput.disabled = false;
408 | }
409 |
410 | if (vttFileInput.files.length > 0) {
411 | vttMediaInput.disabled = true;
412 | } else {
413 | vttMediaInput.disabled = false;
414 | }
415 | }
416 |
417 | // Add event listener to srt-media to monitor changes
418 | vttMediaInput.addEventListener('input', toggleInputDisabled);
419 |
420 | // Add event listener to srt-file to monitor changes
421 | vttFileInput.addEventListener('change', toggleInputDisabled);
422 |
423 | // Initial check to set the correct state on page load
424 | toggleInputDisabled();
425 | });
426 | }
427 | }
428 |
429 | customElements.define('import-vtt', ImportVtt);
430 |
431 | function downloadJson(jsonData) {
432 | // download json file
433 | let dataStr = 'data:text/json;charset=utf-8,' + encodeURIComponent(JSON.stringify(jsonData));
434 | //start download
435 | let downloadAnchorNode = document.createElement('a');
436 | downloadAnchorNode.setAttribute('href', dataStr);
437 | downloadAnchorNode.setAttribute('download', 'hyperaudio-lite.json');
438 | document.body.appendChild(downloadAnchorNode); // required for firefox
439 | downloadAnchorNode.click();
440 | downloadAnchorNode.remove();
441 | }
442 |
443 | /**
444 | * Converts SRT subtitle format to WebVTT format
445 | * @param {string} srtContent - The SRT content as a string
446 | * @returns {string} - The converted WebVTT content
447 | */
448 | function convertSrtToWebVtt(srtContent) {
449 | // First, normalize line endings to ensure consistent processing across platforms
450 | const normalizedContent = srtContent.replace(/\r\n|\r/g, '\n');
451 |
452 | // WebVTT files must start with "WEBVTT" followed by a blank line
453 | let webVttContent = "WEBVTT\n\n";
454 |
455 | // Split the content into subtitle blocks (separated by blank lines)
456 | const subtitleBlocks = normalizedContent.split(/\n\s*\n/);
457 |
458 | for (const block of subtitleBlocks) {
459 | if (!block.trim()) continue;
460 |
461 | // Split each block into lines
462 | const lines = block.split('\n');
463 |
464 | // Skip the subtitle number (first line in SRT)
465 | // If the block doesn't have at least 2 lines, skip it
466 | if (lines.length < 2) continue;
467 |
468 | // Get the timestamp line (second line in SRT)
469 | const timestampLine = lines[1];
470 |
471 | // Convert SRT timestamp format (00:00:00,000) to WebVTT format (00:00:00.000)
472 | const webVttTimestamp = timestampLine.replace(/,/g, '.');
473 |
474 | // Add the timestamp line
475 | webVttContent += webVttTimestamp + '\n';
476 |
477 | // Add the subtitle text (all lines after the timestamp)
478 | const subtitleText = lines.slice(2).join('\n');
479 | webVttContent += subtitleText + '\n\n';
480 | }
481 |
482 | return webVttContent;
483 | }
484 |
485 | // Convert Hypertranscript to JSON
486 | function htmlToJson(html) {
487 | const article = html.querySelector('article');
488 |
489 | // Create an empty object to store the JSON data
490 | const jsonData = {};
491 |
492 | // Add the element data to the JSON object
493 | jsonData.article = {};
494 |
495 | // Get the element
496 | const section = article.querySelector('section');
497 |
498 | // Add the element data to the JSON object
499 | jsonData.article.section = {};
500 |
501 | // Get the
element
502 | const paragraphs = section.querySelectorAll('p');
503 |
504 | // Add the
element data to the JSON object
505 | jsonData.article.section.paragraphs = [];
506 |
507 | // Iterate through each
element
508 | for (const paragraph of paragraphs) {
509 | // Create an object to store the
element data
510 | const paragraphData = {};
511 | // Get all the elements within the
element
512 | const spans = paragraph.querySelectorAll('span');
513 |
514 | // Add the elements data to the JSON object
515 | paragraphData.spans = [];
516 |
517 | // Iterate through each element
518 | for (const span of spans) {
519 | // Create an object to store the element data
520 | const spanData = {};
521 |
522 | // Get the "data-m" attribute value
523 | spanData.m = span.getAttribute('data-m');
524 |
525 | // Get the "data-d" attribute value
526 | spanData.d = span.getAttribute('data-d');
527 |
528 | // Get the class attribute value
529 | spanData.class = span.getAttribute('class');
530 |
531 | // Get the text content of the element
532 | spanData.text = span.textContent;
533 |
534 | // Add the element data to the JSON object
535 | paragraphData.spans.push(spanData);
536 | }
537 | jsonData.article.section.paragraphs.push(paragraphData);
538 | }
539 | // Return the JSON object
540 | return jsonData;
541 | }
542 |
543 |
544 | // Convert JSON to Hypertranscript HTML
545 | function jsonToHtml(jsonData) {
546 | // Create an empty element
547 | const div = document.createElement('div');
548 |
549 | const article = document.createElement('article');
550 |
551 | // Create an empty element
552 | const section = document.createElement('section');
553 |
554 | // Add the element to the element
555 | article.appendChild(section);
556 |
557 | // Get the
elements data from the JSON object
558 | const paragraphs = jsonData.article.section.paragraphs;
559 |
560 | // Iterate through each
element
561 | for (const paragraph of paragraphs) {
562 | // Create an empty
element
563 | const p = document.createElement('p');
564 |
565 | // Add the
element to the element
566 | section.appendChild(p);
567 |
568 | // Get the elements data from the JSON object
569 | const spans = paragraph.spans;
570 |
571 | // Iterate through each element
572 | for (const span of spans) {
573 | // Create an empty element
574 | const spanElement = document.createElement('span');
575 |
576 | // Set the "data-m" attribute value
577 | spanElement.setAttribute('data-m', span.m);
578 |
579 | // Set the "data-d" attribute value
580 | spanElement.setAttribute('data-d', span.d);
581 |
582 | // Set the class attribute value
583 | spanElement.setAttribute('class', span.class);
584 |
585 | // Set the text content of the element
586 | spanElement.textContent = span.text;
587 |
588 | // Add the element to the
element
589 | p.appendChild(spanElement);
590 | }
591 | }
592 |
593 | div.appendChild(article);
594 | // Return the element
595 |
596 | return div.innerHTML;
597 | }
598 |
599 | function srtToHtml(data) {
600 | let i = 0,
601 | len = 0,
602 | idx = 0,
603 | lines,
604 | time,
605 | text,
606 | sub;
607 |
608 | // Simple function to convert HH:MM:SS,MMM or HH:MM:SS.MMM to SS.MMM
609 | // Assume valid, returns 0 on error
610 |
611 | let toSeconds = function(t_in) {
612 | let t = t_in.split(':');
613 |
614 | try {
615 | let s = t[2].split(',');
616 |
617 | // Just in case a . is decimal seperator
618 | if (s.length === 1) {
619 | s = t[2].split('.');
620 | }
621 |
622 | return (
623 | parseFloat(t[0], 10) * 3600 +
624 | parseFloat(t[1], 10) * 60 +
625 | parseFloat(s[0], 10) +
626 | parseFloat(s[1], 10) / 1000
627 | );
628 | } catch (e) {
629 | return 0;
630 | }
631 | };
632 |
633 | let paraSplitTime = 1.5;
634 | let paraPunct = true;
635 | let outputString = '
';
636 | let lineBreaks = false;
637 | let ltime = 0;
638 | let ltext;
639 |
640 | // Here is where the magic happens
641 | // Split on line breaks
642 | lines = data.split(/(?:\r\n|\r|\n)/gm);
643 | len = lines.length;
644 |
645 | for (i = 0; i < len; i++) {
646 | sub = {};
647 | text = [];
648 |
649 | sub.id = parseInt(lines[i++], 10);
650 |
651 | // Split on '-->' delimiter, trimming spaces as well
652 |
653 | try {
654 | time = lines[i++].split(/[\t ]*-->[\t ]*/);
655 | } catch (e) {
656 | console.log('Warning. Possible issue on line ' + i + ": '" + lines[i] + "'.");
657 | break;
658 | }
659 |
660 | sub.start = toSeconds(time[0]);
661 |
662 | // So as to trim positioning information from end
663 | if (!time[1]) {
664 | alert('Warning. Issue on line ' + i + ": '" + lines[i] + "'.");
665 | return;
666 | }
667 |
668 | idx = time[1].indexOf(' ');
669 | if (idx !== -1) {
670 | time[1] = time[1].substr(0, idx);
671 | }
672 | sub.end = toSeconds(time[1]);
673 |
674 | // Build single line of text from multi-line subtitle in file
675 | while (i < len && lines[i]) {
676 | text.push(lines[i++]);
677 | }
678 |
679 | // Join into 1 line, SSA-style linebreaks
680 | // Strip out other SSA-style tags
681 | sub.text = text.join('\\N').replace(/\{(\[\w]+\(?([\w\d]+,?)+\)?)+\}/gi, '');
682 |
683 | // Escape HTML entities
684 | sub.text = sub.text.replace(//g, '>');
685 |
686 | // Unescape great than and less than when it makes a valid html tag of a supported style (font, b, u, s, i)
687 | // Modified version of regex from Phil Haack's blog: http://haacked.com/archive/2004/10/25/usingregularexpressionstomatchhtml.aspx
688 | // Later modified by kev: http://kevin.deldycke.com/2007/03/ultimate-regular-expression-for-html-tag-parsing-with-php/
689 | sub.text = sub.text.replace(
690 | /<(\/?(font|b|u|i|s))((\s+(\w|\w[\w\-]*\w)(\s*=\s*(?:\".*?\"|'.*?'|[^'\">\s]+))?)+\s*|\s*)(\/?)>/gi,
691 | '<$1$3$7>'
692 | );
693 | //sub.text = sub.text.replace( /\\N/gi, " " );
694 | sub.text = sub.text.replace(/\\N/gi, ' ');
695 |
696 | let splitMode = 0;
697 |
698 | let wordLengthSplit = true; //$('#word-length').prop('checked');
699 |
700 | // enhancements to take account of word length
701 |
702 | let swords = sub.text.split(' ');
703 | let sduration = sub.end - sub.start;
704 | let stimeStep = sduration / swords.length;
705 |
706 | // determine length of words
707 |
708 | let swordLengths = [];
709 |
710 | let totalLetters = 0;
711 | for (let si = 0, sl = swords.length; si < sl; ++si) {
712 | totalLetters = totalLetters + swords[si].length;
713 | swordLengths[si] = swords[si].length;
714 | }
715 |
716 | let letterTime = sduration / totalLetters;
717 | let wordStart = 0;
718 |
719 | for (let si = 0, sl = swords.length; si < sl; ++si) {
720 | let wordTime = swordLengths[si] * letterTime;
721 | let stime;
722 | if (wordLengthSplit) {
723 | stime = Math.round((sub.start + si * stimeStep) * 1000);
724 | } else {
725 | stime = Math.round((wordStart + sub.start) * 1000);
726 | }
727 |
728 | wordStart = wordStart + wordTime;
729 | let stext = swords[si];
730 |
731 | if (stime - ltime > paraSplitTime * 1000 && paraSplitTime > 0) {
732 |
733 | let punctPresent =
734 | ltext && (ltext.indexOf('.') > 0 || ltext.indexOf('?') > 0 || ltext.indexOf('!') > 0);
735 | if (!paraPunct || (paraPunct && punctPresent)) {
736 | outputString += '
';
150 | }
151 |
152 | async function readAudioFrom(file) {
153 | const sampling_rate = 16e3;
154 | const audioCTX = new AudioContext({ sampleRate: sampling_rate });
155 | const response = await file.arrayBuffer();
156 | const decoded = await audioCTX.decodeAudioData(response);
157 | const audio = decoded.getChannelData(0);
158 | return audio;
159 | }
160 | }
--------------------------------------------------------------------------------
/js/hyperaudio-lite-extension.js:
--------------------------------------------------------------------------------
1 | /*! (C) The Hyperaudio Project. MIT @license: en.wikipedia.org/wiki/MIT_License. */
2 |
3 | 'use strict';
4 | // Example wrapper for hyperaudio-lite with search and playbackRate included
5 |
6 | let searchForm = document.getElementById('searchForm');
7 |
8 | if (searchForm) {
9 | searchForm.addEventListener('submit', function(event){
10 | searchPhrase(document.getElementById('search').value);
11 | event.preventDefault();
12 | }, false);
13 | }
14 |
15 | document.querySelector('#search-box').addEventListener("keyup", (event) => {
16 | if (event.isComposing || event.keyCode === 229) {
17 | return;
18 | }
19 |
20 | searchPhrase(document.querySelector('#search-box').value);
21 | });
22 |
23 |
24 | let searchPhrase = function (phrase) {
25 |
26 | let htmlWords = document.querySelectorAll('[data-m]');
27 | let htmlWordsLen = htmlWords.length;
28 |
29 | let phraseWords = phrase.split(" ");
30 | let phraseWordsLen = phraseWords.length;
31 | let matchedTimes = [];
32 |
33 | // clear matched times
34 | let searchMatched = document.querySelectorAll('.search-match');
35 |
36 | searchMatched.forEach((match) => {
37 | match.classList.remove('search-match');
38 | });
39 |
40 | for (let i = 0; i < htmlWordsLen; i++) {
41 | let numWordsMatched = 0;
42 | let potentiallyMatched = [];
43 |
44 | for (let j = 0; j < phraseWordsLen; j++) {
45 | let wordIndex = i + numWordsMatched;
46 |
47 | if (wordIndex >= htmlWordsLen) {
48 | break;
49 | }
50 |
51 | // regex removes punctuation - NB for htmlWords case we also remove the space
52 |
53 | if (phraseWords[j].toLowerCase() == htmlWords[wordIndex].innerHTML.toLowerCase().replace(/[\.,-\/#!$%\^&\*;:{}=\-_`~()\? ]/g,"")) {
54 | potentiallyMatched.push(htmlWords[wordIndex].getAttribute('data-m'));
55 | numWordsMatched++;
56 | } else {
57 | break;
58 | }
59 |
60 | // if the num of words matched equal the search phrase we have a winner!
61 | if (numWordsMatched >= phraseWordsLen) {
62 | matchedTimes = matchedTimes.concat(potentiallyMatched);
63 | }
64 | }
65 | }
66 |
67 | // display
68 | matchedTimes.forEach(matchedTime => {
69 | document.querySelectorAll("[data-m='"+matchedTime+"']")[0].classList.add("search-match");
70 | });
71 | }
72 |
73 | const playbackRateCtrl = document.getElementById('pbr');
74 | const currentPlaybackRate = document.getElementById('currentPbr');
75 |
76 | if (playbackRateCtrl !== null) {
77 | playbackRateCtrl.addEventListener('input', function(){
78 | currentPlaybackRate.value = playbackRateCtrl.value;
79 | hyperplayer.playbackRate = playbackRateCtrl.value;
80 | },false);
81 | }
82 |
83 | if (currentPlaybackRate !== null) {
84 | currentPlaybackRate.addEventListener('change', function(){
85 | playbackRateCtrl.value = currentPlaybackRate.value;
86 | hyperplayer.playbackRate = playbackRateCtrl.value;
87 | },false);
88 | }
--------------------------------------------------------------------------------
/js/hyperaudio-lite.js:
--------------------------------------------------------------------------------
1 | /*! (C) The Hyperaudio Project. MIT @license: en.wikipedia.org/wiki/MIT_License. */
2 | /*! Version 2.3.2 */
3 |
4 | 'use strict';
5 |
6 | // Base player class to handle common player functionality
7 | class BasePlayer {
8 | constructor(instance) {
9 | this.player = this.initPlayer(instance); // Initialize the player
10 | this.paused = true; // Set initial paused state
11 | if (this.player) {
12 | this.attachEventListeners(instance); // Attach event listeners for play and pause
13 | }
14 | }
15 |
16 | // Method to initialize the player - to be implemented by subclasses
17 | initPlayer(instance) {
18 | throw new Error('initPlayer method should be implemented by subclasses');
19 | }
20 |
21 | // Method to attach common event listeners
22 | attachEventListeners(instance) {
23 | this.player.addEventListener('pause', instance.pausePlayHead.bind(instance), false);
24 | this.player.addEventListener('play', instance.preparePlayHead.bind(instance), false);
25 | }
26 |
27 | // Method to get the current time of the player
28 | getTime() {
29 | return Promise.resolve(this.player.currentTime);
30 | }
31 |
32 | // Method to set the current time of the player
33 | setTime(seconds) {
34 | this.player.currentTime = seconds;
35 | }
36 |
37 | // Method to play the media
38 | play() {
39 | this.player.play();
40 | this.paused = false;
41 | }
42 |
43 | // Method to pause the media
44 | pause() {
45 | this.player.pause();
46 | this.paused = true;
47 | }
48 | }
49 |
50 | // Class for native HTML5 player
51 | class NativePlayer extends BasePlayer {
52 | // Initialize the native HTML5 player
53 | initPlayer(instance) {
54 | return instance.player;
55 | }
56 | }
57 |
58 | // Class for SoundCloud player
59 | class SoundCloudPlayer extends BasePlayer {
60 | // Initialize the SoundCloud player
61 | initPlayer(instance) {
62 | return SC.Widget(instance.player.id);
63 | }
64 |
65 | // Attach event listeners specific to SoundCloud player
66 | attachEventListeners(instance) {
67 | this.player.bind(SC.Widget.Events.PAUSE, instance.pausePlayHead.bind(instance));
68 | this.player.bind(SC.Widget.Events.PLAY, instance.preparePlayHead.bind(instance));
69 | }
70 |
71 | // Get the current time of the SoundCloud player
72 | getTime() {
73 | return new Promise(resolve => {
74 | this.player.getPosition(ms => resolve(ms / 1000));
75 | });
76 | }
77 |
78 | // Set the current time of the SoundCloud player
79 | setTime(seconds) {
80 | this.player.seekTo(seconds * 1000);
81 | }
82 | }
83 |
84 | // Class for VideoJS player
85 | class VideoJSPlayer extends BasePlayer {
86 | // Initialize the VideoJS player
87 | initPlayer(instance) {
88 | return videojs.getPlayer(instance.player.id);
89 | }
90 |
91 | // Get the current time of the VideoJS player
92 | getTime() {
93 | return Promise.resolve(this.player.currentTime());
94 | }
95 |
96 | // Set the current time of the VideoJS player
97 | setTime(seconds) {
98 | this.player.currentTime(seconds);
99 | }
100 | }
101 |
102 | // Class for Vimeo player
103 | class VimeoPlayer extends BasePlayer {
104 | // Initialize the Vimeo player
105 | initPlayer(instance) {
106 | const iframe = document.querySelector('iframe');
107 | return new Vimeo.Player(iframe);
108 | }
109 |
110 | // Attach event listeners specific to Vimeo player
111 | attachEventListeners(instance) {
112 | this.player.ready().then(instance.checkPlayHead.bind(instance));
113 | this.player.on('play', instance.preparePlayHead.bind(instance));
114 | this.player.on('pause', instance.pausePlayHead.bind(instance));
115 | }
116 |
117 | // Get the current time of the Vimeo player
118 | getTime() {
119 | return this.player.getCurrentTime();
120 | }
121 |
122 | // Set the current time of the Vimeo player
123 | setTime(seconds) {
124 | this.player.setCurrentTime(seconds);
125 | }
126 | }
127 |
128 | // Class for YouTube player
129 | class YouTubePlayer extends BasePlayer {
130 | // Initialize the YouTube player by loading YouTube IFrame API
131 | initPlayer(instance) {
132 | // Defer attaching event listeners until the player is ready
133 | this.isReady = false;
134 |
135 | // Load the YouTube IFrame API script
136 | if (!document.getElementById('iframe-demo')) {
137 | const tag = document.createElement('script');
138 | tag.id = 'iframe-demo';
139 | tag.src = 'https://www.youtube.com/iframe_api';
140 | const firstScriptTag = document.getElementsByTagName('script')[0];
141 | firstScriptTag.parentNode.insertBefore(tag, firstScriptTag);
142 | }
143 |
144 | // Set the global callback for the YouTube IFrame API
145 | window.onYouTubeIframeAPIReady = this.onYouTubeIframeAPIReady.bind(this, instance);
146 | }
147 |
148 | // Callback when YouTube IFrame API is ready
149 | onYouTubeIframeAPIReady(instance) {
150 | this.player = new YT.Player(instance.player.id, {
151 | events: {
152 | onStateChange: this.onPlayerStateChange.bind(this, instance),
153 | onReady: this.onPlayerReady.bind(this)
154 | }
155 | });
156 | }
157 |
158 | // Event handler when the YouTube player is ready
159 | onPlayerReady() {
160 | this.isReady = true;
161 | }
162 |
163 | // Handle YouTube player state changes (play, pause)
164 | onPlayerStateChange(instance, event) {
165 | if (event.data === YT.PlayerState.PLAYING) { // Playing
166 | instance.preparePlayHead();
167 | this.paused = false;
168 | } else if (event.data === YT.PlayerState.PAUSED) { // Paused
169 | instance.pausePlayHead();
170 | this.paused = true;
171 | }
172 | }
173 |
174 | // Get the current time of the YouTube player
175 | getTime() {
176 | if (this.isReady) {
177 | return Promise.resolve(this.player.getCurrentTime());
178 | } else {
179 | return Promise.resolve(0); // Return 0 if the player is not ready
180 | }
181 | }
182 |
183 | // Set the current time of the YouTube player
184 | setTime(seconds) {
185 | if (this.isReady) {
186 | this.player.seekTo(seconds, true);
187 | }
188 | }
189 |
190 | // Play the YouTube video
191 | play() {
192 | if (this.isReady) {
193 | this.player.playVideo();
194 | }
195 | }
196 |
197 | // Pause the YouTube video
198 | pause() {
199 | if (this.isReady) {
200 | this.player.pauseVideo();
201 | }
202 | }
203 | }
204 |
205 | // Class for Spotify player
206 | class SpotifyPlayer extends BasePlayer {
207 | // Initialize the Spotify player by setting up the Spotify IFrame API
208 | initPlayer(instance) {
209 | window.onSpotifyIframeApiReady = IFrameAPI => {
210 | const element = document.getElementById(instance.player.id);
211 | const srcValue = element.getAttribute('src');
212 | const episodeID = this.extractEpisodeID(srcValue);
213 |
214 | const options = { uri: `spotify:episode:${episodeID}` };
215 | const callback = player => {
216 | this.player = player;
217 | player.addListener('playback_update', e => {
218 | if (e.data.isPaused !== true) {
219 | this.currentTime = e.data.position / 1000;
220 | instance.preparePlayHead();
221 | this.paused = false;
222 | } else {
223 | instance.pausePlayHead();
224 | this.paused = true;
225 | }
226 | });
227 |
228 | player.addListener('ready', () => {
229 | player.togglePlay(); // Priming the playhead
230 | instance.checkPlayHead();
231 | });
232 | };
233 |
234 | IFrameAPI.createController(element, options, callback);
235 | };
236 | }
237 |
238 | // Extract episode ID from the Spotify URL
239 | extractEpisodeID(url) {
240 | const match = url.match(/episode\/(.+)$/);
241 | return match ? match[1] : null;
242 | }
243 |
244 | // Get the current time of the Spotify player
245 | getTime() {
246 | return Promise.resolve(this.currentTime);
247 | }
248 |
249 | // Set the current time of the Spotify player
250 | setTime(seconds) {
251 | this.player.seek(seconds);
252 | }
253 |
254 | // Play the Spotify track
255 | play() {
256 | this.player.play();
257 | this.paused = false;
258 | }
259 |
260 | // Pause the Spotify track
261 | pause() {
262 | this.player.togglePlay();
263 | this.paused = true;
264 | }
265 | }
266 |
267 | // Mapping player types to their respective classes
268 | const hyperaudioPlayerOptions = {
269 | "native": NativePlayer,
270 | "soundcloud": SoundCloudPlayer,
271 | "youtube": YouTubePlayer,
272 | "videojs": VideoJSPlayer,
273 | "vimeo": VimeoPlayer,
274 | "spotify": SpotifyPlayer
275 | };
276 |
277 | // Factory function to create player instances
278 | function hyperaudioPlayer(playerType, instance) {
279 | if (playerType) {
280 | return new hyperaudioPlayerOptions[playerType](instance);
281 | } else {
282 | console.warn("HYPERAUDIO LITE WARNING: data-player-type attribute should be set on player if not native, e.g., SoundCloud, YouTube, Vimeo, VideoJS");
283 | }
284 | }
285 |
286 | // Main class for HyperaudioLite functionality
287 | class HyperaudioLite {
288 | constructor(transcriptId, mediaElementId, minimizedMode, autoscroll, doubleClick, webMonetization, playOnClick) {
289 | this.transcript = document.getElementById(transcriptId);
290 | this.init(mediaElementId, minimizedMode, autoscroll, doubleClick, webMonetization, playOnClick);
291 |
292 | // Ensure correct binding for class methods
293 | this.preparePlayHead = this.preparePlayHead.bind(this);
294 | this.pausePlayHead = this.pausePlayHead.bind(this);
295 | this.setPlayHead = this.setPlayHead.bind(this);
296 | this.checkPlayHead = this.checkPlayHead.bind(this);
297 | this.clearTimer = this.clearTimer.bind(this);
298 | }
299 |
300 | // Initialize the HyperaudioLite instance
301 | init(mediaElementId, minimizedMode, autoscroll, doubleClick, webMonetization, playOnClick) {
302 | this.setupTranscriptHash();
303 | this.setupPopover();
304 | this.setupPlayer(mediaElementId);
305 | this.setupTranscriptWords();
306 | this.setupEventListeners(doubleClick, playOnClick);
307 | this.setupInitialPlayHead();
308 | this.setupAutoScroll(autoscroll);
309 | this.minimizedMode = minimizedMode;
310 | this.autoscroll = autoscroll;
311 | this.webMonetization = webMonetization;
312 | this.scrollerContainer = this.transcript;
313 | }
314 |
315 | // Setup hash for transcript selection
316 | setupTranscriptHash() {
317 | const windowHash = window.location.hash;
318 | const hashVar = windowHash.substring(1, windowHash.indexOf('='));
319 |
320 | if (hashVar === this.transcript.id) {
321 | this.hashArray = windowHash.substring(this.transcript.id.length + 2).split(',');
322 | } else {
323 | this.hashArray = [];
324 | }
325 | }
326 |
327 | // Setup the popover for text selection
328 | setupPopover() {
329 | if (typeof popover !== 'undefined') {
330 | this.transcript.addEventListener('mouseup', () => {
331 | const selection = window.getSelection();
332 | const popover = document.getElementById('popover');
333 | let selectionText;
334 |
335 | if (selection.toString().length > 0) {
336 | selectionText = selection.toString().replaceAll("'", "`");
337 | const range = selection.getRangeAt(0);
338 | const rect = range.getBoundingClientRect();
339 |
340 | popover.style.left = `${rect.left + window.scrollX}px`;
341 | popover.style.top = `${rect.bottom + window.scrollY}px`;
342 | popover.style.display = 'block';
343 |
344 | const mediaFragment = this.getSelectionMediaFragment();
345 |
346 | if (mediaFragment) {
347 | document.location.hash = mediaFragment;
348 | }
349 | } else {
350 | popover.style.display = 'none';
351 | }
352 |
353 | const popoverBtn = document.getElementById('popover-btn');
354 | popoverBtn.addEventListener('click', (e) => {
355 | popover.style.display = 'none';
356 | let cbText = `${selectionText} ${document.location}`;
357 | navigator.clipboard.writeText(cbText);
358 |
359 | const dialog = document.getElementById("clipboard-dialog");
360 | document.getElementById("clipboard-text").innerHTML = cbText;
361 | dialog.showModal();
362 |
363 | const confirmButton = document.getElementById("clipboard-confirm");
364 | confirmButton.addEventListener("click", () => dialog.close());
365 |
366 | e.preventDefault();
367 | return false;
368 | });
369 | });
370 | }
371 | }
372 |
373 | // Setup the media player
374 | setupPlayer(mediaElementId) {
375 | this.player = document.getElementById(mediaElementId);
376 | const mediaSrc = this.transcript.querySelector('[data-media-src]');
377 | if (mediaSrc) {
378 | this.player.src = mediaSrc.getAttribute('data-media-src');
379 | }
380 |
381 | if (this.player.tagName === 'VIDEO' || this.player.tagName === 'AUDIO') {
382 | this.playerType = 'native';
383 | } else {
384 | this.playerType = this.player.getAttribute('data-player-type');
385 | }
386 |
387 | this.myPlayer = hyperaudioPlayer(this.playerType, this);
388 | }
389 |
390 | // Setup the transcript words
391 | setupTranscriptWords() {
392 | const words = this.transcript.querySelectorAll('[data-m]');
393 | this.wordArr = this.createWordArray(words);
394 |
395 | // check for elements with data-m attributes that are not directly below
396 | // these will contain
or similar that we can scroll to
397 |
398 | for (const word of words) {
399 | let parentTagName = word.parentElement.tagName;
400 | if (parentTagName !== "SECTION") {
401 | this.parentTag = parentTagName;
402 | break;
403 | }
404 | }
405 |
406 | this.parentElements = this.transcript.getElementsByTagName(this.parentTag);
407 | }
408 |
409 | setupAutoScroll(autoscroll) {
410 | if (autoscroll) {
411 | if (window.Velocity) {
412 | this.scroller = window.Velocity;
413 | } else if (window.jQuery && window.jQuery.Velocity) {
414 | this.scroller = window.jQuery.Velocity;
415 | }
416 | }
417 | }
418 |
419 | // Setup event listeners for interactions
420 | setupEventListeners(doubleClick, playOnClick) {
421 | this.minimizedMode = false;
422 | this.autoscroll = false;
423 | this.doubleClick = doubleClick;
424 | this.webMonetization = false;
425 | this.playOnClick = playOnClick;
426 | this.highlightedText = false;
427 | this.start = null;
428 |
429 | const playHeadEvent = doubleClick ? 'dblclick' : 'click';
430 | this.transcript.addEventListener(playHeadEvent, this.setPlayHead.bind(this), false);
431 | this.transcript.addEventListener(playHeadEvent, this.checkPlayHead.bind(this), false);
432 | }
433 |
434 | // Setup initial playhead position based on URL hash
435 | setupInitialPlayHead() {
436 | this.start = this.hashArray[0];
437 | if (!isNaN(parseFloat(this.start))) {
438 | this.highlightedText = true;
439 | let indices = this.updateTranscriptVisualState(this.start);
440 | if (indices.currentWordIndex > 0 && this.autoscroll) {
441 | this.scrollToParagraph(indices.currentParentElementIndex, indices.currentWordIndex);
442 | }
443 | }
444 |
445 | this.end = this.hashArray[1];
446 | //TODO convert to binary search for below for quicker startup
447 | if (this.start && this.end) {
448 | const words = this.transcript.querySelectorAll('[data-m]');
449 | for (let i = 1; i < words.length; i++) {
450 | let startTime = parseInt(words[i].getAttribute('data-m')) / 1000;
451 | let wordStart = (Math.round(startTime * 100) / 100).toFixed(2);
452 | if (wordStart >= parseFloat(this.start) && parseFloat(this.end) > wordStart) {
453 | words[i].classList.add('share-match');
454 | }
455 | }
456 | }
457 | }
458 |
459 | // Create an array of words with metadata from the transcript
460 | createWordArray(words) {
461 | return Array.from(words).map(word => {
462 | const m = parseInt(word.getAttribute('data-m'));
463 | let p = word.parentNode;
464 | while (p !== document) {
465 | if (['p', 'figure', 'ul'].includes(p.tagName.toLowerCase())) {
466 | break;
467 | }
468 | p = p.parentNode;
469 | }
470 | word.classList.add('unread');
471 | return { n: word, m, p };
472 | });
473 | }
474 |
475 | getSelectionRange = () => {
476 | const selection = window.getSelection();
477 | if (selection.rangeCount === 0) return null;
478 |
479 | const range = selection.getRangeAt(0);
480 |
481 | // Helper function to get the closest span
482 | function getClosestSpan(node) {
483 | while (node && node.nodeType !== Node.ELEMENT_NODE) {
484 | node = node.parentNode;
485 | }
486 | return node.closest('[data-m]');
487 | }
488 |
489 | // Get all relevant spans
490 | const allSpans = Array.from(this.transcript.querySelectorAll('[data-m]'));
491 |
492 | // Find the first and last span that contain selected text
493 | let startSpan = null;
494 | let endSpan = null;
495 | let selectedText = range.toString();
496 | let trimmedSelectedText = selectedText.trim();
497 |
498 | for (let span of allSpans) {
499 | if (range.intersectsNode(span) && span.textContent.trim() !== '') {
500 | if (!startSpan) startSpan = span;
501 | endSpan = span;
502 | }
503 | }
504 |
505 | if (!startSpan || !endSpan) return null;
506 |
507 | // Adjust start span if selection starts with a space
508 | let startIndex = allSpans.indexOf(startSpan);
509 | while (selectedText.startsWith(' ') && startIndex < allSpans.length - 1) {
510 | startIndex++;
511 | startSpan = allSpans[startIndex];
512 | selectedText = selectedText.slice(1);
513 | }
514 |
515 | // Calculate start time
516 | let startTime = parseInt(startSpan.dataset.m) / 1000;
517 |
518 | // Calculate end time
519 |
520 | let duration = 0;
521 | if (endSpan.dataset.d) {
522 | duration = parseInt(endSpan.dataset.d);
523 | } else {
524 | // when no duration exists default to 1 second
525 | duration = 1000;
526 | }
527 |
528 | let endTime = (parseInt(endSpan.dataset.m) + duration) / 1000;
529 |
530 | // Format to seconds at 2 decimal place precision
531 | let startTimeFormatted = (Math.round(startTime * 100) / 100).toFixed(2);
532 | let endTimeFormatted = (Math.round(endTime * 100) / 100).toFixed(2);
533 |
534 | // Only return a range if there's actually selected text (excluding only spaces)
535 | return trimmedSelectedText ? `${startTimeFormatted},${endTimeFormatted}` : null;
536 | }
537 |
538 | getSelectionMediaFragment = () => {
539 | let range = this.getSelectionRange();
540 | if (range === null) {
541 | return null;
542 | }
543 | console.log(range);
544 | return (this.transcript.id + '=' +range);
545 | }
546 |
547 | // Set the playhead position in the media player based on the transcript
548 | setPlayHead(e) {
549 | const target = e.target || e.srcElement;
550 | this.highlightedText = false;
551 | this.clearActiveClasses();
552 |
553 | if (this.myPlayer.paused && target.dataset.m) {
554 | target.classList.add('active');
555 | target.parentNode.classList.add('active');
556 | }
557 |
558 | const timeSecs = parseInt(target.dataset.m) / 1000;
559 | this.updateTranscriptVisualState(timeSecs);
560 |
561 | if (!isNaN(timeSecs)) {
562 | this.end = null;
563 | this.myPlayer.setTime(timeSecs);
564 | if (this.playOnClick) {
565 | this.myPlayer.play();
566 | }
567 | }
568 | }
569 |
570 | // Clear the active classes from the transcript
571 | clearActiveClasses() {
572 | const activeElements = Array.from(this.transcript.getElementsByClassName('active'));
573 | activeElements.forEach(e => e.classList.remove('active'));
574 | }
575 |
576 | // Prepare the playhead for playback
577 | preparePlayHead() {
578 | this.myPlayer.paused = false;
579 | this.checkPlayHead();
580 | }
581 |
582 | // Pause the playhead
583 | pausePlayHead() {
584 | this.clearTimer();
585 | this.myPlayer.paused = true;
586 | }
587 |
588 | // Check the playhead position and update the transcript
589 | checkPlayHead() {
590 | this.clearTimer();
591 |
592 | (async () => {
593 | this.currentTime = await this.myPlayer.getTime();
594 | if (this.highlightedText) {
595 | this.currentTime = this.start;
596 | this.myPlayer.setTime(this.currentTime);
597 | this.highlightedText = false;
598 | }
599 | this.checkStatus();
600 | })();
601 | }
602 |
603 | // Clear the timer for the playhead
604 | clearTimer() {
605 | if (this.timer) {
606 | clearTimeout(this.timer);
607 | this.timer = null;
608 | }
609 | }
610 |
611 | // Scroll to the paragraph containing the current word
612 | scrollToParagraph(currentParentElementIndex, index) {
613 |
614 | const scrollNode = this.wordArr[index - 1].n.closest('p') || this.wordArr[index - 1].n;
615 |
616 | if (currentParentElementIndex !== this.parentElementIndex) {
617 | if (this.autoscroll && typeof this.scroller !== 'undefined') {
618 | if (scrollNode) {
619 | this.scroller(scrollNode, 'scroll', {
620 | container: this.scrollerContainer,
621 | duration: this.scrollerDuration,
622 | delay: this.scrollerDelay,
623 | offset: this.scrollerOffset,
624 | });
625 | } else {
626 | this.wordArr = this.createWordArray(this.transcript.querySelectorAll('[data-m]'));
627 | this.parentElements = this.transcript.getElementsByTagName(this.parentTag);
628 | }
629 | }
630 | this.parentElementIndex = currentParentElementIndex;
631 | }
632 | }
633 |
634 | // Check the status of the playhead and update the transcript
635 | checkStatus() {
636 | if (!this.myPlayer.paused) {
637 | if (this.end && parseInt(this.end) < parseInt(this.currentTime)) {
638 | this.myPlayer.pause();
639 | this.end = null;
640 | } else {
641 | const indices = this.updateTranscriptVisualState(this.currentTime);
642 | const index = indices.currentWordIndex;
643 |
644 | if (index > 0 && this.autoscroll) {
645 | this.scrollToParagraph(indices.currentParentElementIndex, index);
646 | }
647 |
648 | if (this.minimizedMode) {
649 | const elements = this.transcript.querySelectorAll('[data-m]');
650 | let currentWord = '';
651 | let lastWordIndex = this.wordIndex;
652 |
653 | for (let i = 0; i < elements.length; i++) {
654 | if (elements[i].classList.contains('active')) {
655 | currentWord = elements[i].innerHTML;
656 | this.wordIndex = i;
657 | }
658 | }
659 |
660 | if (this.wordIndex !== lastWordIndex) {
661 | document.title = currentWord;
662 | }
663 | }
664 |
665 | if (this.webMonetization === true) {
666 | //check for payment pointer
667 | let activeElements = this.transcript.getElementsByClassName('active');
668 | let paymentPointer = this.checkPaymentPointer(activeElements[activeElements.length - 1]);
669 |
670 | if (paymentPointer !== null) {
671 | let metaElements = document.getElementsByTagName('meta');
672 | let wmMeta = document.querySelector("meta[name='monetization']");
673 | if (wmMeta === null) {
674 | wmMeta = document.createElement('meta');
675 | wmMeta.name = 'monetization';
676 | wmMeta.content = paymentPointer;
677 | document.getElementsByTagName('head')[0].appendChild(wmMeta);
678 | } else {
679 | wmMeta.name = 'monetization';
680 | wmMeta.content = paymentPointer;
681 | }
682 | }
683 | }
684 |
685 | let interval = 0;
686 | if (this.wordArr[index]) {
687 | interval = this.wordArr[index].n.getAttribute('data-m') - this.currentTime * 1000;
688 | }
689 |
690 | this.timer = setTimeout(() => this.checkPlayHead(), interval + 1);
691 | }
692 | } else {
693 | this.clearTimer();
694 | }
695 | }
696 |
697 | checkPaymentPointer = element => {
698 | let paymentPointer = null;
699 |
700 | if (typeof(element) != "undefined") {
701 | paymentPointer = element.getAttribute('data-wm');
702 | }
703 |
704 | if (paymentPointer !== null) {
705 | return paymentPointer;
706 | } else {
707 | let parent = null;
708 |
709 | if (typeof element !== 'undefined') {
710 | parent = element.parentElement;
711 | }
712 |
713 | if (parent === null) {
714 | return null;
715 | } else {
716 | return this.checkPaymentPointer(parent);
717 | }
718 | }
719 | }
720 |
721 | // Update the visual state of the transcript based on the current time
722 | updateTranscriptVisualState(currentTime) {
723 | let index = 0;
724 | let words = this.wordArr.length - 1;
725 |
726 | while (index <= words) {
727 | const guessIndex = index + ((words - index) >> 1);
728 | const difference = this.wordArr[guessIndex].m / 1000 - currentTime;
729 |
730 | if (difference < 0) {
731 | index = guessIndex + 1;
732 | } else if (difference > 0) {
733 | words = guessIndex - 1;
734 | } else {
735 | index = guessIndex;
736 | break;
737 | }
738 | }
739 |
740 | this.wordArr.forEach((word, i) => {
741 | const classList = word.n.classList;
742 | const parentClassList = word.n.parentNode.classList;
743 |
744 | if (i < index) {
745 | classList.add('read');
746 | classList.remove('unread', 'active');
747 | parentClassList.remove('active');
748 | } else {
749 | classList.add('unread');
750 | classList.remove('read');
751 | }
752 | });
753 |
754 | this.parentElements = this.transcript.getElementsByTagName(this.parentTag);
755 | Array.from(this.parentElements).forEach(el => el.classList.remove('active'));
756 |
757 | if (index > 0) {
758 | if (!this.myPlayer.paused) {
759 | this.wordArr[index - 1].n.classList.add('active');
760 | }
761 | this.wordArr[index - 1].n.parentNode.classList.add('active');
762 | }
763 |
764 | const currentParentElementIndex = Array.from(this.parentElements).findIndex(el => el.classList.contains('active'));
765 |
766 | return {
767 | currentWordIndex: index,
768 | currentParentElementIndex
769 | };
770 | }
771 | }
772 |
773 | // Export for testing or module usage
774 | if (typeof module !== 'undefined' && module.exports) {
775 | module.exports = { HyperaudioLite };
776 | }
--------------------------------------------------------------------------------
/js/hyperaudio-push-notification.js:
--------------------------------------------------------------------------------
1 | /*! (C) The Hyperaudio Project. MIT @license: en.wikipedia.org/wiki/MIT_License. */
2 | /*! Last modified for Version 0.3.1 */
3 |
4 | Notification.requestPermission().then(perm => {
5 | console.log('permission: ', perm)
6 | })
7 |
8 | const notifyTranscriptionReady = () => {
9 | let notification = new Notification("Your Hyperaudio transcript is ready!", {
10 | body: "Click here to see your transcript."
11 | })
12 |
13 | notification.onclick = () => {
14 | window.parent.parent.focus();
15 | }
16 |
17 | }
18 |
19 | window.document.addEventListener('hyperaudioInit', notifyTranscriptionReady, false);
--------------------------------------------------------------------------------
/js/whisper.worker.js:
--------------------------------------------------------------------------------
1 | import { pipeline } from "https://cdn.jsdelivr.net/npm/@xenova/transformers@2.11.0";
2 |
3 | self.addEventListener("message", async (event) => {
4 | const { type, audio, model_name } = event.data;
5 |
6 | if (type === "INFERENCE_REQUEST") {
7 |
8 | const automaticSpeechRecognition = await pipeline(
9 | "automatic-speech-recognition",
10 | model_name,
11 | { revision: "output_attentions" }
12 | );
13 |
14 | let output = await automaticSpeechRecognition(audio, {
15 | return_timestamps: "word",
16 | chunk_length_s: 30,
17 | stride_length_s: 5,
18 | });
19 |
20 | console.log(output);
21 | self.postMessage({ output: output });
22 | }
23 | });
--------------------------------------------------------------------------------
/local.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
7 |
8 |
9 |
49 |
50 |
51 |
--------------------------------------------------------------------------------
/manifest.json:
--------------------------------------------------------------------------------
1 | {
2 | "name":"Hyperaudio Lite Editor",
3 | "short_name":"HLE",
4 | "start_url":"/hyperaudio-lite-editor/index.html",
5 | "scope":"/hyperaudio-lite-editor/",
6 | "display":"standalone",
7 | "background_color":"#6100DF",
8 | "theme_color":"#6100DF",
9 | "description":"A super-lightweight transcript editor",
10 | "icons":[
11 | {
12 | "src":"images/icon-192x192.png",
13 | "sizes":"192x192",
14 | "type":"image/png"
15 | },
16 | {
17 | "src":"images/icon-512x512.png",
18 | "sizes":"512x512",
19 | "type":"image/png"
20 | },
21 | {
22 | "src":"images/maskable-icon-192x192.png",
23 | "sizes":"192x192",
24 | "type":"image/png",
25 | "purpose": "any maskable"
26 | }
27 | ]
28 | }
29 |
--------------------------------------------------------------------------------
/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "devDependencies": {
3 | "autoprefixer": "^10.4.14",
4 | "cssnano": "^6.0.1",
5 | "daisyui": "^3.1.9",
6 | "postcss": "^8.4.24",
7 | "tailwindcss": "^3.3.2"
8 | }
9 | }
10 |
--------------------------------------------------------------------------------
/postcss.config.js:
--------------------------------------------------------------------------------
1 | module.exports = {
2 | plugins: {
3 | tailwindcss: {},
4 | autoprefixer: {},
5 | ...(process.env.NODE_ENV === 'production' ? { cssnano: {} } : {})
6 | }
7 | }
8 |
9 |
10 |
--------------------------------------------------------------------------------
/serviceworker.js:
--------------------------------------------------------------------------------
1 | var staticCacheName = "pwa";
2 |
3 | self.addEventListener("install", function (e) {
4 | e.waitUntil(
5 | caches.open(staticCacheName).then(function (cache) {
6 | return cache.addAll(["https://hyperaudio.github.io/hyperaudio-lite-editor/"]);
7 | })
8 | );
9 | });
10 |
11 | self.addEventListener("fetch", function (event) {
12 | console.log(event.request.url);
13 | event.respondWith(
14 | caches.match(event.request).then(function (response) {
15 | return response || fetch(event.request);
16 | })
17 | );
18 | });
--------------------------------------------------------------------------------
/tailwind.config.js:
--------------------------------------------------------------------------------
1 | /** @type {import('tailwindcss').Config} */
2 | module.exports = {
3 | content: [
4 | "*.{html,js}",
5 | "js/*.{html,js}",
6 | ],
7 | theme: {
8 | extend: {},
9 | },
10 | plugins: [
11 | //require("tailwindcss"),
12 | //require("autoprefixer"),
13 | require("daisyui"),
14 | ],
15 | };
16 |
--------------------------------------------------------------------------------
/tailwind.md:
--------------------------------------------------------------------------------
1 | # Tailwind CSS Guide
2 |
3 | This document outlines the steps to install and configure Tailwind CSS for your project. Tailwind CSS is a highly customizable, low-level CSS framework that gives you all of the building blocks you need to build bespoke designs without any annoying opinionated styles you have to fight to override.
4 |
5 | ## Installation
6 |
7 | Tailwind CSS relies on a few dependencies. To install these, run the following command in your project directory:
8 |
9 | ```bash
10 | npm install -D tailwindcss postcss autoprefixer cssnano daisyui@latest
11 | ```
12 |
13 | This will install Tailwind CSS, PostCSS, Autoprefixer, and CSSNano. These tools are used to process your CSS files.
14 |
15 | ## Development Build
16 |
17 | For development purposes, you can create a specific Tailwind CSS file that includes all styles. This is useful for live-reloading and previewing changes during development.
18 |
19 | Run this command to create the development build:
20 |
21 | ```bash
22 | npx tailwindcss -i ./config/tailwind.css -o ./css/tailwind-dev.css --watch
23 | ```
24 |
25 | The `-i` option specifies the input file, `-o` specifies the output file, and `--watch` makes the process keep running, automatically rebuilding when you make changes to your CSS.
26 |
27 | ## Production Build
28 |
29 | For a production build, you'll want to minify your CSS to reduce file size. This process removes all the spaces, line breaks, and comments that make CSS readable to humans but are unnecessary for machines.
30 |
31 | To create a minified version of your CSS, run:
32 |
33 | ```bash
34 | npx tailwindcss -o ./css/tailwind-min.css --minify
35 | ```
36 |
37 | The `--minify` option will output a minified version of your CSS suitable for production use.
38 |
39 | ## Custom Configuration
40 |
41 | Tailwind CSS can be customized to fit your project's needs. You can adjust your settings in the `tailwind.config.js` file, and you can add your own styles to the `config/tailwind.css` file.
42 |
43 | ## Minification Configuration
44 |
45 | If you need to configure the minification process or add more PostCSS plugins, you can modify the `postcss.config.js` file. This file defines how PostCSS should process your CSS.
46 |
47 | Remember to test your changes thoroughly before pushing to production to ensure that your styles are applied correctly.
48 |
--------------------------------------------------------------------------------
/test/test.mp3:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/hyperaudio/hyperaudio-lite-editor/f51106e7aed1fe47d1f43e0a897071c51221a5bb/test/test.mp3
--------------------------------------------------------------------------------
](https://hyperaudio.github.io/hyperaudio-lite-editor/index.html)
20 |
21 |
22 | ### How to Use
23 |
24 | Edit in the usual way – add punctuation, create and merge paragraphs etc. Place speaker names in square brackets ie [Maria]. It's recommended that in order to maintain word timings you don't paste large blocks of text. Double-click on words to set the playhead at that point.
25 |
26 | ### Lightweight, Performant and Installable
27 |
28 | We score very highly on Google Chrome's Lighthouse audit tool
29 |
30 | 
31 |
32 | Created as a Progressive Web App, you can install on your desktop or mobile home screen.
33 |
34 |
35 | ### Licensing
36 |
37 | `Hyperaudio Lite Editor`'s source code is provided under a **triple license model**.
38 |
39 | #### Open source license
40 |
41 | If you are creating an open source application under a license compatible with the GNU Affero GPL license v3, you may use `Hyperaudio Lite Editor` for free under the terms of the [AGPL-3.0](./LICENSE). This is the deafult license for `Hyperaudio Lite Editor`.
42 |
43 | #### Non-commercial use
44 |
45 | If you are a non-commerical / not-for-profit entity or organisation and wish to to use this software for non-commercial please contact [mark@hyperaud.io](mailto:mark@hyperaud.io) to use `Hyperaudio Lite Editor` for free under the terms of the [MIT License](/.LICENSE-MIT)
46 |
47 | #### Commercial license
48 |
49 | If you'd like to use `Hyperaudio Lite Editor` to develop commercial sites, tools, and applications, the Commercial License is the appropriate license. With this option, your source code is kept proprietary. To enquire about a `Hyperaudio Lite Editor` Commercial License please contact [mark@hyperaud.io](mailto:mark@hyperaud.io).
50 |
51 | ### Support
52 |
53 | Please support The Hyperaudio Project by donating to our [Patreon account](https://patreon.com/hyperaudio).
54 |
--------------------------------------------------------------------------------
/alternative.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
14 |
15 |
16 | 
19 |